IntervalMap
flatbuffers
| IntervalMap | flatbuffers | |
|---|---|---|
| - | - | |
| 16 | 32 | |
| - | - | |
| 2.3 | 6.6 | |
| 11 months ago | 3 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.
flatbuffers
We haven't tracked posts mentioning flatbuffers yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
hashable - A class for types that can be converted to a hash value
critbit - Critbit trees in C
treap - :leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure
critbit - A Haskell implementation of crit-bit trees.
bytestring-trie - An efficient finite map from (byte)strings to values.
hnix - A Haskell re-implementation of the Nix expression language
C-structs - C-Struct Types for Haskell
text - Haskell library for space- and time-efficient operations over Unicode text.
appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
json-autotype - Automatic Haskell type inference from JSON input
refined - Refinement types with static checking