EdisonAPI VS heaps

Compare EdisonAPI vs heaps and see what are their differences.

EdisonAPI

Edison: A Library of Efficient Data Structures (by robdockins)

heaps

Asymptotically optimal Brodal/Okasaki heaps (by ekmett)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
EdisonAPI heaps
0 1
53 26
- -
3.7 0.0
4 months ago about 1 year ago
Haskell Haskell
MIT 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.

EdisonAPI

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

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

heaps

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

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

What are some alternatives?

When comparing EdisonAPI and heaps you can also consider the following projects:

containers - Assorted concrete container types

exposed-containers - A redistribution of 'containers', with all hidden modules exposed.

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

multiset - multiset haskell package

miso - :ramen: A tasty Haskell front-end framework

ethereum-client-haskell

fgl - A Functional Graph Library for Haskell

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

distributive - Dual Traversable

naperian - Efficient representable functors

helf - Haskell implementation of the Edinburgh Logical Framework

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell