EdisonAPI
Edison: A Library of Efficient Data Structures (by robdockins)
naperian
Efficient representable functors (by aaronvargo)
| EdisonAPI | naperian | |
|---|---|---|
| - | - | |
| 55 | 6 | |
| - | - | |
| 4.8 | 0.0 | |
| about 2 months ago | over 6 years 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.
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.
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 EdisonAPI and naperian you can also consider the following projects:
multiset - multiset haskell package
justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
containers - Assorted concrete container types
repa-array - High performance, regular, shape polymorphic parallel arrays.