To the Top
File:  root - diary - 2007 - 2007-06 - 2007-06-19_01.19AM.html
Tags: 学习笔记, Learning Notes, | English | Home Page | Category: Computing | 20865 Views, 50544 Search Bots | 114 Words

Subscribe to Feed Burner | Browse | Archive

I was stuck the whole afternoon in debugging... finally i found something interesting...

Every time Delphi's Dynamic Array , (setLength fun) is extended, the original array cells' addresses may be changed...

Because I use TTreeView to link its Data (Pointer) to a particular cell of a dynamic array.

e.g.

TreeView.Data:=@dynamic_array[i];

and

unfortunately, the program adds one cell to dynamic_array somewhere...

setLength(dynamic_array,length(dynamic_array)+1);

the original cells' address are totally different, which is really confusing....

anyway, i solved this by taking the alternative...

TreeView.Data:=Pointer(i);

when i use it, i go for something like this..

dynamic_array[integer(TreeView.Data)];

Haha, everything works out finally.
Tags: 学习笔记, Learning Notes, | English | Home Page | Category: Computing | 20865 Views, 50544 Search Bots | 114 Words Subscribe to Feed Burner

Related Articles

  1. Plus One
  2. [Daily Problem] Longest Increasing Subsequence
  3. Skip the readings, focus on problems. And use all the hints!
  4. Daily Interview Problem: Reverse Integer
  5. Daily Interview Problem: Min Range Needed to Sort
  6. Algorithm Interview: Maximum Path Sum in Binary Tree
  7. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  8. Daily Interview Problem: Min Stack
  9. Algorithm Interview: Level Order Traversal of Binary Tree
  10. Longest Substring Without Repeating Characters

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />