At 19:07 29-4-2004, you wrote:
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
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
Hi,
I'll try to write a faster parser/compiler, which also supports UTF8.
Are you sure that you want to write a parser? Because that is the part
that does the semantics and handles all the statements and does not known
about UTF8.
What is wrong with the current scanner?
Peter
