nonempty-containers
btree-concurrent
| nonempty-containers | btree-concurrent | |
|---|---|---|
| - | - | |
| 25 | 2 | |
| - | - | |
| 4.8 | 0.0 | |
| 3 months ago | almost 12 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | GNU Lesser General Public License v3.0 only |
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.
nonempty-containers
We haven't tracked posts mentioning nonempty-containers yet.
Tracking mentions began in Dec 2020.
btree-concurrent
We haven't tracked posts mentioning btree-concurrent yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
containers - Assorted concrete container types
bitset - A compact functional set data structure
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
hoq - A language based on homotopy type theory with an interval
repa-array - High performance, regular, shape polymorphic parallel arrays.
bookkeeper
psqueues - Priority Search Queues in three different flavors for Haskell
map-syntax - Syntax sugar and explicit semantics for statically defined maps
flux-monoid - A monoid which counts changing values in a sequence
algebra-checkers - checkers for algebra driven design