Intrusive Data Structures

Intrusive Data Structures

ID:39970952

大?。?29.80 KB

頁數(shù):31頁

時(shí)間:2019-07-16

Intrusive Data Structures_第1頁
Intrusive Data Structures_第2頁
Intrusive Data Structures_第3頁
Intrusive Data Structures_第4頁
Intrusive Data Structures_第5頁
資源描述:

《Intrusive Data Structures》由會員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫。

1、IntrusiveDataStructuresJiriSoukup,CodeFarmsInc.7214JockTrail,Richmond,Ont.,Canada,KOA2ZO613-838-4829,fax613-838-3316,jiri@codefarms.comABSTRACTThisarticlecomparestwostylesofbuildingdatastructuresanddatastructurelibrariesinC++:(a)Intrusivedatastructuresformedbypointer

2、sstoredinsidetheapplicationobjects,(b)Containerswhereauxiliaryobjectsformtherequireddatastructure,andonlypointtotheapplicationobjectswithoutaddinganypointersorotherdatatothem.Eachstyleworksbetterindifferentsituations,andthefirsthalfofthearticlediscussestheimpactofthi

3、schoiceonprogramperformance,codemaintainability,easeofuseanddataintegrity.Whenworkingwithtemplates,containersareeasiertoimplement,whichmaybethereasonwhymostclasslibrariesarebasedoncontainers.Theonlyexistinglibrarywhichisconsistentlyintrusive(CodeFarms)usesacodegenera

4、tor.Ifintrusivedatastructurescouldnotbeimplementedwithtemplates,theirapplicabilitywouldbeseverelylimited.Thesecondhalfofthearticledealswiththispivotalquestion,showsanelegantwayofbuildinganintrusivedatastructurelibrarywithtemplates,explainswhyitsinterfaceissimilarto-b

5、utcannotbeidenticalwithSTL,discussestheimpactofthenewarchitectureonclassdependency,andcomparesthenewapproachwithexistinglibraries.AprototypeofthenewlibraryisnowavailableunderthenamePatternTemplateLibrary-see[15].Chapter1:IntroductionOpenanybookondatastructures,andsom

6、ewherenearthebeginningyouwillfindalinkedlistsimilartoFig.1a.Thisisthetypeoflistyouwouldprobablyuseinyourprogramifyouwerenotusinganyclasslibrary.Fig.1a:Differentimplementationsoftheabstractlist:intrusivelinkedlist.Fig.1b:Differentimplementationsoftheabstractlist:non-i

7、ntrusivelinkedlist.Fig.1c:Differentimplementationsoftheabstractlist:array-basednon-intrusivelist.Forexample,ifeachDepartmenthasEmployees,andeachEmployeebelongstoexactlyoneDepartment,youwouldwriteitlikethis:classEmployee{Employee*next;...};classDepartment{Employee*lis

8、tHead;...};Thistypeoflistiscalledan"intrusivelist",becausethepointersthatconnectitareembeddedintheparticipatingobjects.[Accordingto

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動畫的文件,查看預(yù)覽時(shí)可能會顯示錯亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負(fù)責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時(shí)聯(lián)系客服。
3. 下載前請仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動等原因無法下載或下載錯誤,付費(fèi)完成后未能成功下載的用戶請聯(lián)系客服處理。