On Wed, 26 Mar 2014 22:31:56 +0200 Marko Rauhamaa <ma...@pacujo.net> wrote: > > The primary objective of having a balanced tree in the standard library > is to support ordered access in an efficient manner. The typical > applications would include timers (networking), aging (cache)
Wouldn't a heapq work as well for those two? Regards Antoine. _______________________________________________ Python-Dev mailing list Python-Dev@python.org https://mail.python.org/mailman/listinfo/python-dev Unsubscribe: https://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
