Author: Thomas Björk
Viewers: 46
Last month viewers: 1
Package: TTreeList
It is quite often you stumble upon large lists that you must process over and over again within the same request.
Sometimes you need to search the list and sometimes you just need the iterate the list.
TTreeList manages both these matters.
Sometimes you need to search the list and sometimes you just need the iterate the list.
TTreeList manages both these matters.
You populate a TTreeList and then build it. The only thing you need to do is to tell which "key" should be used to sort by.
When the TTreeList is built you have a sorted double linked list and a binary tree in one object.
Move up and down or left and right in any way you need. If you need to search for a key then just use the built-in search function to quickly find what you are looking for.
If a key is represented more than one time you can find the duplicates within the tree node thus making the tree smaller and quicker.
You need to be a registered user or login to post a comment
Login Immediately with your account on:
Comments:
No comments were submitted yet.