linker list 的資料結構 |
尚未結案
|
bhead811
一般會員 發表:13 回覆:18 積分:6 註冊:2003-05-29 發送簡訊給我 |
|
timhuang
尊榮會員 發表:78 回覆:1815 積分:1608 註冊:2002-07-15 發送簡訊給我 |
|
bhead811
一般會員 發表:13 回覆:18 積分:6 註冊:2003-05-29 發送簡訊給我 |
|
pgdennis
資深會員 發表:41 回覆:526 積分:443 註冊:2002-05-23 發送簡訊給我 |
http://www.google.com.tw/search?q=cache:CHohQxBk-0EJ:delphi.about.com/library/weekly/aa011601a.htm+delphi++structure++linked++list&hl=zh-TW&ie=UTF-8&inlang=zh-TW
有講一點
Pointers to records When we define a record or other data type, it's a common practice also to define a pointer to that type. This makes it easy to manipulate instances of the type without copying large blocks of memory. In fact, any data type that requires large, dynamically allocated blocks of memory uses pointers. The ability to have pointers to records (and arrays) makes it much more easier to set up complicated data structures as linked lists and trees. What follows is an example of the type declaration for a simple linked list: type pNextItem = ^LinkedListItem LinkedListItem = record sName : String; iValue : Integer; NextItem : pNextItem; end; The idea behind linked lists is to give us the possibility to store the address to the next linked item in a list inside a NextItem record field. For more on data structures consider the book: "The Tomes of Delphi: Algorithms and Data Structures".永遠追不上技術更新的速度~~
------
星期一,二...無窮迴圈@@ |
bhead811
一般會員 發表:13 回覆:18 積分:6 註冊:2003-05-29 發送簡訊給我 |
本站聲明 |
1. 本論壇為無營利行為之開放平台,所有文章都是由網友自行張貼,如牽涉到法律糾紛一切與本站無關。 2. 假如網友發表之內容涉及侵權,而損及您的利益,請立即通知版主刪除。 3. 請勿批評中華民國元首及政府或批評各政黨,是藍是綠本站無權干涉,但這裡不是政治性論壇! |