Attached is my latest attempt at a fast TreeView. It opens the 42K person tree
in under 1sec :-)
You can try it out by unpacking the tar ball into the src/ directory of a
Now for the bad news... This approach has a number of draw backs.
1. You can only sort on secondary cursors. This is because the records
themselves are never read into memory until they are displayed. So it is not
possible to sort them in memory.
2. Because of  the sorting has to be done on insert into the database. This
complicates the name sorting because it must be hooked into the data writes
and will be difficult to change from one ordering to another. (the secondary
index would need to be rebuilt).
3. The columns in the tree must be a fixed size. I don't know why you can
resize them after creation but there you go.
The is lots not implemented in this version: no insert/delete, no switching
index to reorder etc. but it does show how it can be done.
There is currently a very strange display glitch that I can't track down, see
if you can spot it :-)
You can normally find me on Jabber as RichardTaylor@...