清单4展示了具有列的基本树的完整实现，其中，列排序功能添加在第27和33行。
Listing 4 shows the full implementation of the Basic tree with columns, in which the column-sorting capability is added in lines 27 and 33.
swt树的一个较困难的方面是实现树项目的排序，对于这个主题，公共支持论坛中提供的信息难以满足广大用户的需求。
One difficult aspect of SWT trees is to implement sorting of the tree's items, a topic on which information is much sought after in public support forums.
在计算机应用中，要实现树排序编程较难。
On computer's application the programming of tree sort is difficult .
它通过判断树支的边缘性质，逐个确定树支的排序，从而实现线形树。
The pendant property of tree branches is checked and the order of tree branches is determined step by step, then the linear tree is realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
应用推荐