naperian VS DrIFT

Compare naperian vs DrIFT and see what are their differences.

naperian

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

DrIFT

A mirror of DrIFT. (by ajhc)
Data structures DrIFT
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
naperian DrIFT
- -
5 2
- -
0.0 0.0
over 5 years 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.

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.

DrIFT

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

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

What are some alternatives?

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

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

functor-friends - Friendly helpers for your recursion schemes.

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

graphite - Haskell graphs and networks library

hamtmap

containers - Assorted concrete container types

rawr - Anonymous extensible records and variant types

containers - Bitnami container images

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

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

EdisonAPI - Edison: A Library of Efficient Data Structures

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

naperian vs justified-containers DrIFT vs functor-friends naperian vs repa-array DrIFT vs graphite naperian vs hamtmap DrIFT vs containers naperian vs rawr DrIFT vs containers naperian vs type-level-sets DrIFT vs Agda naperian vs EdisonAPI naperian vs heap