bytestring-trie VS heap

Compare bytestring-trie vs heap and see what are their differences.

bytestring-trie

An efficient finite map from (byte)strings to values. (by wrengr)
Data structures Map
Source Code
Docs
Suggest alternative
Edit details

heap

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps. (by pruvisto)
Data structures
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
bytestring-trie heap
- -
19 6
- -
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.

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.

heap

Posts with mentions or reviews of heap. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning heap yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing bytestring-trie and heap you can also consider the following projects:

graphite - Haskell graphs and networks library

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell

map-syntax - Syntax sugar and explicit semantics for statically defined maps

multiset - multiset haskell package

map-exts

psqueues - Priority Search Queues in three different flavors for Haskell

appendmap - A Data.Map wrapper with a Monoid instance that delegates to the individual keys

naperian - Efficient representable functors

distributive - Dual Traversable

safer-file-handles - Type-safe file handling

IntervalMap - Haskell interval collections

vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

bytestring-trie vs graphite heap vs btree-concurrent bytestring-trie vs map-syntax heap vs multiset bytestring-trie vs map-exts heap vs psqueues bytestring-trie vs appendmap heap vs naperian bytestring-trie vs distributive heap vs safer-file-handles bytestring-trie vs IntervalMap heap vs vinyl