[Python-Dev] collections.sortedtree (original) (raw)
Antoine Pitrou solipsis at pitrou.net
Wed Mar 26 22:26:28 CET 2014
- Previous message: [Python-Dev] collections.sortedtree
- Next message: [Python-Dev] collections.sortedtree
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Wed, 26 Mar 2014 22:31:56 +0200 Marko Rauhamaa <marko at 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.
- Previous message: [Python-Dev] collections.sortedtree
- Next message: [Python-Dev] collections.sortedtree
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]