用Delphi实现快速删除TList的批连续结点算法的探讨  

An Algorithm about Rapid-deleting of TLists Sequential Nodes in Batches

作　　者：艾冬生[1] 

机构地区：[1]西安机电信息研究所 陕西西安710065

出　　处：《信息与电子工程》2003年第3期14-18,共5页information and electronic engineering

摘　　要：在编制遥测数据处理软件的过程中,面对大量的测试数据,经常需要编写高效率的数据过滤器。本文讨论了一种通过采用跨单元、跨类访问Delphi类的私有域的方法实现快速删除TList批连续结点的新算法,并通过测试结果得到验证。In the programming of telemetry software, a data filter is necessary to deal with lots of test data. In this paper, a kind of algorithm about rapid-deleting TLists sequential nodes in batches is introduced. It is implemented by the means of multi-sorts and mult-units to access private field of Delphi sort. Comparing with both the traditional algorithm and the retrorse deleting algorithm, this new method is proved to be of high efficiency.

关 键 词：DELPHI Tust类 连续结点 私有域 OOP方法 算法 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]