IntervalMap
bytestring-trie
Our great sponsors
| IntervalMap | bytestring-trie | |
|---|---|---|
| 0 | 0 | |
| 15 | 19 | |
| - | - | |
| 0.0 | 0.0 | |
| 4 months ago | 4 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
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.
bytestring-trie
We haven't tracked posts mentioning bytestring-trie yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
graphite - Haskell graphs and networks library
map-exts
hashable - A class for types that can be converted to a hash value
map-syntax - Syntax sugar and explicit semantics for statically defined maps
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
distributive - Dual Traversable
naperian - Efficient representable functors
treap - :leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure
flatbuffers - An implementation of the flatbuffers protocol in Haskell.
appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys
nonemptymap - NonEmpty Map Libary
flux-monoid - A monoid which counts changing values in a sequence