IntervalMap
treap
| IntervalMap | treap | |
|---|---|---|
| - | - | |
| 17 | 63 | |
| - | - | |
| 2.3 | 1.8 | |
| over 1 year ago | about 3 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | Mozilla Public License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
IntervalMap
We haven't tracked posts mentioning IntervalMap yet.
Tracking mentions began in Dec 2020.
treap
We haven't tracked posts mentioning treap yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
hashable - A class for types that can be converted to a hash value
red-black-tree - Red Black Trees implemented in Haskell
bytestring-trie - An efficient finite map from (byte)strings to values.
fibonacci - 🔢 Fibonacci Utilities
flatbuffers - An implementation of the flatbuffers protocol in Haskell.
idx - maps, sets and vectors with on-demand secondary indexes.
C-structs - C-Struct Types for Haskell
IntGraph - Dynamically sized graphs
appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys
fibonacci - Fast computation of Fibonacci numbers in Haskell
typed-encoding - Type safe string restrictions and transformations
tree-traversals - Functions and newtype wrappers for traversing Trees