treap: Efficient implementation of the implicit treap data structure
Efficient implementation of the implicit treap data structure. Use this data structure if you want dynamic arrays with fast operations on segments.
[Skip to Readme]
Downloads
- treap-0.0.0.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Versions [RSS] | 0.0.0.0 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.11 && <4.13), deepseq (>=1.4 && <1.5), mersenne-random-pure64 (>=0.2.2 && <0.3) [details] |
License | MPL-2.0 |
Copyright | 2019-2021 Dmitrii Kovanikov |
Author | Dmitrii Kovanikov |
Maintainer | kovanikov@gmail.com |
Revised | Revision 1 made by vrom911 at 2021-08-02T13:16:20Z |
Category | Data Structures, Tree |
Home page | https://github.com/chshersh/treap |
Bug tracker | https://github.com/chshersh/treap/issues |
Source repo | head: git clone https://github.com/chshersh/treap.git |
Uploaded | by shersh at 2019-04-29T09:48:01Z |
Distributions | NixOS:0.0.0.0 |
Downloads | 437 total (1 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2019-04-29 [all 1 reports] |