bytestring-trie VS distributive

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

bytestring-trie

An efficient finite map from (byte)strings to values. (by wrengr)
Our great sponsors
  • WorkOS - The modern API for authentication & user identity.
  • LearnThisRepo.com - Learn 300+ open source libraries for free using AI.
  • InfluxDB - Power Real-Time Data Analytics at Scale
bytestring-trie distributive
0 6
19 41
- -
6.2 2.7
10 days ago 9 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v3.0 or later
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.

distributive

Posts with mentions or reviews of distributive. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-07-17.

What are some alternatives?

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

graphite - Haskell graphs and networks library

Agda - Agda is a dependently typed programming language / interactive theorem prover.

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-exts

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

parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.

fgl - A Functional Graph Library for Haskell

containers - Assorted concrete container types

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

slist - ♾️ Sized list

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)