need some fast balanced-tree datastructure

[Klaus Schilling]

Pavel Velikho <pvelikho at cs.ucsd.edu> writes:

> 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?

There is an avltree implementation in C by Ben Pfaff on the gnu
ftp site ftp.gnu.org/pub/gnu . Maybe this can be swigged to python.

Klaus Schilling