nonemptymap
data-r-tree
nonemptymap | data-r-tree | |
---|---|---|
- | - | |
2 | 12 | |
- | - | |
0.0 | 4.7 | |
almost 2 years ago | 29 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | MIT 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.
nonemptymap
We haven't tracked posts mentioning nonemptymap yet.
Tracking mentions began in Dec 2020.
data-r-tree
We haven't tracked posts mentioning data-r-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
repa-array - High performance, regular, shape polymorphic parallel arrays.
data-forest - A simple multi-way tree data structure
claferIG - Support for reasoning on Clafer models by instantiation and counter example generation.
data-stringmap - Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet
miso - :ramen: A tasty Haskell front-end framework
data-clist - A purely functional ring data structure for Haskell.
vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
permutation - git import of patrick perry permutations lib from darcs
map-syntax - Syntax sugar and explicit semantics for statically defined maps
containers - Assorted concrete container types
singletons - Fake dependent types in Haskell using singletons
tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.