need some fast balanced-tree datastructure

Pavel Velikho pvelikho at cs.ucsd.edu
Mon Jun 21 20:06:10 EDT 1999


Hi,
    I am looking for a fast implementation of incremental container that

maintains an ordering on the keys... (i.e. I want an AVL, Red-Black, or
anything similar). I have tried the b+tree in Python but its not fast
enough.
Is there anything like that available as a C extension module?

Thank you
Pavel Velikhov
pvelikho at cs.ucsd.edu





More information about the Python-list mailing list