Python implementation of treaps
A set of python modules implementing treaps in pure python is provided.
See also my pyx_treap module, which implements treaps in Cython.
Treaps perform most operations in O(log2(n)) 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.
A module is provided for treaps that enforce uniqueness.
Release history Release notifications
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size treap-2.0.5.tar.gz (7.8 kB)||File type Source||Python version None||Upload date||Hashes View|