文件: root - diary - 2007 - 2007-06 - 2007-06-19_01.19AM.html
标签: 学习笔记, Learning Notes, | 英文 | 主页 | 类别: 计算机科学 | 20865 次阅读, 50668 次搜索 | 114 个单词
| 浏览 | 博客存档
标签: 学习笔记, Learning Notes, | 英文 | 主页 | 类别: 计算机科学 | 20865 次阅读, 50668 次搜索 | 114 个单词
| 浏览 | 博客存档
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.
标签: 学习笔记, Learning Notes, | 英文 | 主页 | 类别: 计算机科学 | 20865 次阅读, 50668 次搜索 | 114 个单词 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.
猜您喜欢...
- Daily Interview Problem: Maximum Profit From Stocks
- Print a tree level-by-level, with line-breaks
- Daily Interview Problem: Find the Number of Islands
- 56 Bytes
- Longest Substring Without Repeating Characters
- Algorithm Interview: Longest Consecutive Sequence
- Spreadsheet Columns
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Windows Scripting
- Daily Interview Problem: Running Median
©2006~2024 牛排过熟 - 0.00995 秒 - 1837.854 KB/s - 34 在线 内存: 492.36 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。