Flexible python implementation of red black trees
Project description
A pair of python modules implementing red black trees is provided.
Red-black trees are a little slower than treaps (some question this), but they give a nice low standard deviation in operation times, and this code is rather flexible.
A module is provided for red black trees that enforce uniqueness. They allow for set-like use and dictionary-like use.
This code is known to work on CPython 2.x, CPython 3.x, Pypy and Jython.
Much of the work here was done by Duncan G. Smith. Dan just put some finishing touches on it.
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
red-black-tree-mod-1.22.tar.gz
(34.2 kB
view details)
File details
Details for the file red-black-tree-mod-1.22.tar.gz.
File metadata
- Download URL: red-black-tree-mod-1.22.tar.gz
- Upload date:
- Size: 34.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.11.2
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 38e3652903a2bf96379c27c2082ca0b7b905158662dd7ef0c97f4fd93a9aa908 |
|
| MD5 | 8aed204b43d6369e3d27537d44a55bdf |
|
| BLAKE2b-256 | 4875bfa342a2ebfc9623b701f1c6995b9906fd6dd2cedf6bce777d09e23303ac |
