bytestring-trie VS graphite

Compare bytestring-trie vs graphite 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

graphite

Haskell graphs and networks library (by alx741)
Data structures Graphs Haskell Library
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 graphite
- -
19 31
- -
5.9 0.0
6 days ago about 2 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.

graphite

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

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

What are some alternatives?

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

heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

miso - :ramen: A tasty Haskell front-end framework

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

rawr - Anonymous extensible records and variant types

map-exts

bookkeeper

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

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

distributive - Dual Traversable

adjunctions - Simple adjunctions

IntervalMap - Haskell interval collections

psqueues - Priority Search Queues in three different flavors for Haskell

bytestring-trie vs heap graphite vs miso bytestring-trie vs map-syntax graphite vs rawr bytestring-trie vs map-exts graphite vs bookkeeper bytestring-trie vs appendmap graphite vs vinyl bytestring-trie vs distributive graphite vs adjunctions bytestring-trie vs IntervalMap graphite vs psqueues