Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://mail.python.org/pipermail/python-dev/2014-March/133540.html below:

[Python-Dev] collections.sortedtree

• 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 ]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4