bytestring-trie
An efficient finite map from (byte)strings to values. (by wrengr)
appendmap
A Data.Map wrapper with a Monoid instance that delegates to the individual keys (by koterpillar)
Our great sponsors
bytestring-trie | appendmap | |
---|---|---|
- | - | |
19 | 2 | |
- | - | |
5.9 | 0.0 | |
6 days ago | about 3 years 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.
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.
appendmap
Posts with mentions or reviews of appendmap.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning appendmap yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing bytestring-trie and appendmap you can also consider the following projects:
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-classes
map-syntax - Syntax sugar and explicit semantics for statically defined maps
IntervalMap - Haskell interval collections
co-log - 📓 Flexible and configurable modern #Haskell logging framework
distributive - Dual Traversable
containers-verified - A package re-exporting the verified subset of containers
unpacked-containers - Unpacked containers using backpack
bytestring-trie vs graphite
appendmap vs map-exts
bytestring-trie vs heap
appendmap vs map-classes
bytestring-trie vs map-syntax
appendmap vs IntervalMap
bytestring-trie vs map-exts
appendmap vs co-log
bytestring-trie vs distributive
appendmap vs containers-verified
bytestring-trie vs IntervalMap
appendmap vs unpacked-containers