containers VS EdisonAPI

Compare containers vs EdisonAPI and see what are their differences.

EdisonAPI

Edison: A Library of Efficient Data Structures (by robdockins)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
containers EdisonAPI
11 -
313 53
-0.3% -
6.2 3.7
6 days ago 4 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT 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.

containers

Posts with mentions or reviews of containers. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-30.

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.

What are some alternatives?

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

singletons - Fake dependent types in Haskell using singletons

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

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

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

hevm - Dapp, Seth, Hevm, and more

multiset - multiset haskell package

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

indexed-containers

ethereum-client-haskell

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

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