[fpc-pascal] How To write an enumerator for trees
Michael Schnell
mschnell at lumino.de
Thu Mar 21 09:48:38 CET 2013
> I have read this. My question is not about how to write enumerator,
> but how to do this for TREEs
Xiangrong Fang: Please anser to a message instead of creating a new thread !
There might be no necessary sort order of a tree.
So you first need to invent a usable sort order and set up the enumerator accordingly. An Enumerator can work on any sort order it only needs to be strict.
Regarding performance it is essential to use a sort order that allows for quickly finding the elements one after the other.
-Michael
More information about the fpc-pascal
mailing list