type-level-sets
selections
Our great sponsors
type-level-sets | selections | |
---|---|---|
0 | 0 | |
65 | 22 | |
- | - | |
0.0 | 0.0 | |
3 months ago | over 3 years ago | |
Haskell | Haskell | |
BSD 2-clause "Simplified" License | BSD 3-clause "New" or "Revised" License |
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.
type-level-sets
We haven't tracked posts mentioning type-level-sets yet.
Tracking mentions began in Dec 2020.
selections
We haven't tracked posts mentioning selections yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
EdisonAPI - Edison: A Library of Efficient Data Structures
type-level-bst - Type-Level Binary Search Tree in Haskell
type-indexed-queues - Queues with verified and unverified versions
permutation - git import of patrick perry permutations lib from darcs
distributive - Dual Traversable
miso - :ramen: A tasty Haskell front-end framework
perfect-hash-generator - Perfect minimal hashing implementation in native Haskell
fgl - A Functional Graph Library for Haskell
psqueues - Priority Search Queues in three different flavors for Haskell
naperian - Efficient representable functors
tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.