[fpc-devel]faster parser

[Martin Waldenburg]

Hi,

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
behaviour.

Would the additional space for the Color field in the TNamedIndexItem be 
a problem,
if the Red-Black Algorithm would be used in Tdictionary ?

Martin
-------------- next part --------------
A non-text attachment was scrubbed...
Name: mwredblacktree.zip
Type: application/zip
Size: 2658 bytes
Desc: not available
URL: <http://lists.freepascal.org/pipermail/fpc-devel/attachments/20040429/cb705e6e/attachment.zip>