`treap`

Efficient implementation of the implicit treap data structure. Use this data structure if you want dynamic arrays with fast operations on segments.

Ecosystem
hackage.haskell.org

Latest Release
0.0.0.0
almost 7 years ago

Versions
1

Downloads
560 total

Dependent Repos
1

Readme

Keywords
data-structures library mpl tree Propose Tags algorithms datastructure haskell homomorphism monoid treap

Stars	62 on GitHub
Forks	1 on GitHub

repos.ecosyste.ms

ecosyste.ms