I have made a full implementation of a balanced tree and would like to
know what the process is to have it considered for inclusion in Python
3.
To summarize, the implementation closely parallels dict() features and
resides in _collectionsmodule.c under the name collections.sortedtree.
It uses solely the "<" operator to compare keys. I have chosen the AVL
tree as an implementation technique.
The views support a number of optional arguments:
sorteddict.keys(reversed=False, start=unspecified, inclusive=True)
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) and prefix
patterns (routing).
Marko
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