File: root - diary - 2007 - 2007-06 - 2007-06-19_01.19AM.html
Tags: 学习笔记, Learning Notes, | English | Home Page | Category: Computing | 20854 Views, 50295 Search Bots | 114 Words
| Browse | Archive
Tags: 学习笔记, Learning Notes, | English | Home Page | Category: Computing | 20854 Views, 50295 Search Bots | 114 Words
| 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 | 20854 Views, 50295 Search Bots | 114 Words 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.
Related Articles
- Algorithm Interview Question: Max and Min with Limited Comparisons
- Patterns for breaking down questions you haven
- First and Last Indices of an Element in a Sorted Array
- Algorithm Interview Question: H-Index
- Daily Interview Problem: Group Words that are Anagrams
- Floor and Ceiling of a Binary Search Tree
- Daily Interview Problem: Count Number of Unival Subtrees
- New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
- Plus One
- Daily Interview Problem: Trapping Rainwater
©2006~2024 SteakOverCooked - 0.0168 Seconds(s) - 1034.643 KB/s - 19 Online Memory: 494.27 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !