页面顶部 Top
文件:  root - diary - 2007 - 2007-06 - 2007-06-19_01.19AM.html
标签: 学习笔记, Learning Notes, | 英文 | 主页 | 类别: 计算机科学 | 20664 次阅读, 48935 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 20664 次阅读, 48935 次搜索 | 114 个单词 定阅此目录的博客

猜您喜欢...

  1. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  2. Algorithm Interview: Longest Consecutive Sequence
  3. Daily Interview Problem: Merge List Of Number Into Ranges
  4. Daily Interview Problem: Count Number of Unival Subtrees
  5. Staying on a Chess Board
  6. PHP Unit Tests on VPS Server
  7. [Daily Problem] Longest Increasing Subsequence
  8. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  9. Algorithm Interview Question: Max and Min with Limited Comparisons
  10. Daily Interview Problem: Largest BST in a Binary Tree

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />