bytestring-trie VS permutation

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

permutation

git import of patrick perry permutations lib from darcs (by spacekitteh)
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 permutation
- -
19 8
- -
5.9 0.0
6 days ago about 6 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.

permutation

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

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

What are some alternatives?

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

graphite - Haskell graphs and networks library

multiset - multiset haskell package

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

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

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

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

map-exts

singletons - Fake dependent types in Haskell using singletons

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

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

distributive - Dual Traversable

psqueues - Priority Search Queues in three different flavors for Haskell

bytestring-trie vs graphite permutation vs multiset bytestring-trie vs heap permutation vs Agda bytestring-trie vs map-syntax permutation vs type-level-sets bytestring-trie vs map-exts permutation vs singletons bytestring-trie vs appendmap permutation vs repa-array bytestring-trie vs distributive permutation vs psqueues