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)

graphite

Haskell graphs and networks library (by alx741)
Our great sponsors
  • LearnThisRepo.com - Learn 300+ open source libraries for free using AI.
  • WorkOS - The modern API for authentication & user identity.
  • InfluxDB - Power Real-Time Data Analytics at Scale
bytestring-trie graphite
0 0
19 31
- -
6.2 0.0
10 days ago almost 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:

rawr - Anonymous extensible records and variant types

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

bookkeeper

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

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

map-exts

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

adjunctions - Simple adjunctions

psqueues - Priority Search Queues in three different flavors for Haskell

containers - Assorted concrete container types

repa-array - High performance, regular, shape polymorphic parallel arrays.

data-clist - A purely functional ring data structure for Haskell.