bytestring-trie VS naperian

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

naperian

Efficient representable functors (by aaronvargo)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
bytestring-trie naperian
- -
19 5
- -
5.9 0.0
7 days ago over 5 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.

naperian

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

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

What are some alternatives?

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

graphite - Haskell graphs and networks library

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

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

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

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

hamtmap

map-exts

rawr - Anonymous extensible records and variant types

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

DrIFT - A mirror of DrIFT.

distributive - Dual Traversable

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

bytestring-trie vs graphite naperian vs justified-containers bytestring-trie vs heap naperian vs repa-array bytestring-trie vs map-syntax naperian vs hamtmap bytestring-trie vs map-exts naperian vs rawr bytestring-trie vs appendmap naperian vs DrIFT bytestring-trie vs distributive naperian vs type-level-sets