Paul Rubin <no.email@nospam.invalid>: > Marko Rauhamaa <ma...@pacujo.net> writes: >> So in my Python software (both at work and at home) needs, I use a >> Python AVL tree implementation of my own. My use case is timers. (GvR >> uses heapq for the purpose.) > > Have you benchmarked your version against heapq or even the builtin > sorting functions?
Yes, I did (as I mentioned in an earlier posting). For the use case I was interested in (timers in a busy server), heapq beefed with the "garbage collection" trick came out about the same as my AVL tree (native module). Marko -- https://mail.python.org/mailman/listinfo/python-list
