naperian VS hamtmap

Compare naperian vs hamtmap and see what are their differences.

naperian

Efficient representable functors (by aaronvargo)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details

hamtmap

By exclipy
Data structures

DISCONTINUED

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
naperian hamtmap
- -
5 45
- -
0.0 0.0
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.

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.

hamtmap

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

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

What are some alternatives?

When comparing naperian and hamtmap you can also consider the following projects:

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

monadic-arrays - MArray instances for monad transformers

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

distributive - Dual Traversable

rawr - Anonymous extensible records and variant types

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

DrIFT - A mirror of DrIFT.

void - Provides Data.Void, which is in base since ghc 7.8 or so

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

functor-friends - Friendly helpers for your recursion schemes.

EdisonAPI - Edison: A Library of Efficient Data Structures

subwordgraph - An implementation of a classic Subword Graph (also known as Directed Acyclic Word Graph).

naperian vs justified-containers hamtmap vs monadic-arrays naperian vs repa-array hamtmap vs distributive naperian vs rawr hamtmap vs igraph naperian vs DrIFT hamtmap vs void naperian vs type-level-sets hamtmap vs functor-friends naperian vs EdisonAPI hamtmap vs subwordgraph