Python implementation of treaps
Project description
A set of python modules implementing treaps is provided.
Treaps perform most operations in O(log2n) time, and are innately sorted. They’re very nice for keeping a collection of values that needs to always be sorted, or for optimization problems in which you need to find the p best values out of q, when p is much smaller than q.
Modules are provided for both treaps that enforce uniqueness, and treaps that allow duplicates.
Pure python versions are included, as are Cython-enhanced versions for performance.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
treap-1.00.tar.gz
(3.0 kB
view details)
File details
Details for the file treap-1.00.tar.gz.
File metadata
- Download URL: treap-1.00.tar.gz
- Upload date:
- Size: 3.0 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
838f828ba817f356bc2f0b446e1712cf41d0e18eef10296314e91164877dd243
|
|
| MD5 |
6e2b294b5706278adcda502d885bbc5c
|
|
| BLAKE2b-256 |
669f5dccaa70b7c258296d35629f8ea8a32badd240d85308b3826100085dc244
|