map-classes
By clintonmead
bytestring-trie
An efficient finite map from (byte)strings to values. (by wrengr)
| map-classes | bytestring-trie | |
|---|---|---|
| - | - | |
| 1 | 19 | |
| - | - | |
| 0.0 | 5.9 | |
| about 6 years ago | 2 days ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
map-classes
Posts with mentions or reviews of map-classes.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning map-classes yet.
Tracking mentions began in Dec 2020.
bytestring-trie
Posts with mentions or reviews of bytestring-trie.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning bytestring-trie yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing map-classes and bytestring-trie you can also consider the following projects:
appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys
graphite - Haskell graphs and networks library
map-exts
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
map-syntax - Syntax sugar and explicit semantics for statically defined maps
distributive - Dual Traversable
IntervalMap - Haskell interval collections
naperian - Efficient representable functors
flux-monoid - A monoid which counts changing values in a sequence
map-classes vs appendmap
bytestring-trie vs graphite
map-classes vs map-exts
bytestring-trie vs heap
map-classes vs map-syntax
bytestring-trie vs map-syntax
bytestring-trie vs map-exts
bytestring-trie vs appendmap
bytestring-trie vs distributive
bytestring-trie vs IntervalMap
bytestring-trie vs naperian
bytestring-trie vs flux-monoid