[fpc-devel]faster parser

Peter Vreman peter at freepascal.org
Thu Apr 29 20:53:58 CEST 2004

At 19:07 29-4-2004, you wrote:
>I wrote a Red-Black tree, which seems to be faster than TDictionary,
>even without spreading items into multible slots.
>The Algorithm for rearanging the nodes is faster as for an AVL tree.
>The disadvantage to a normal search tree is that every node
>requires an additional Color field, also inserting and deleting is slightly
>slower because nodes are then rearranged to ensure a N log N search
>Would the additional space for the Color field in the TNamedIndexItem be a 
>if the Red-Black Algorithm would be used in Tdictionary ?

No problem. Go ahead :-)


More information about the fpc-devel mailing list