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.
FAQs
Flexible python implementation of red black trees
We found that red-black-tree-mod demonstrated a healthy version release cadence and project activity because the last version was released less than a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Bun 1.2.19 introduces isolated installs for smoother monorepo workflows, along with performance boosts, new tooling, and key compatibility fixes.
Security News
Popular npm packages like eslint-config-prettier were compromised after a phishing attack stole a maintainer’s token, spreading malicious updates.
Security News
/Research
A phishing attack targeted developers using a typosquatted npm domain (npnjs.com) to steal credentials via fake login pages - watch out for similar scams.
