dear all: 我有一個問題,我想了好久,但就是不知道如何下手,..... 就是當在記憶體內有一個linker list 的資料結構,其資料結構我也知道,我要 如何寫一個function去接受這個linker list 的資料結構,是要傳pointer 嗎? 在function內要如何去解析這個資料結構.

請問你是用 TList 嗎, 還是自己寫的 link list??

引言: 請問你是用 TList 嗎, 還是自己寫的 link list??

是自定的link list,因為我現在要用delphi寫一個dll的function,準備要給vc 來呼叫,vc 會傳一個link list 的pointer給我的function; 我現在就不知道要如何宣告一個可以接pointer 的function,及function內要如何處理這個收到的linker list 的資料結構.可不可以給我一個方向或架構呢?

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". 
 

永遠追不上技術更新的速度~~

------
星期一,二...無窮迴圈＠＠

謝謝您的回應,我想我應該找到方向了!