llrbtree
refined
Our great sponsors
- Onboard AI - Learn any GitHub repo in 59 seconds
- InfluxDB - Collect and Analyze Billions of Data Points in Real Time
- SaaSHub - Software Alternatives and Reviews
| llrbtree | refined | |
|---|---|---|
| 0 | 1 | |
| 48 | 179 | |
| - | - | |
| 0.0 | 0.0 | |
| over 11 years ago | 6 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | MIT 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.
llrbtree
We haven't tracked posts mentioning llrbtree yet.
Tracking mentions began in Dec 2020.
refined
-
Can types replace validation?
In one respect, nothing. You’re right. Even given refinement types as in Haskell or Scala, there is indeed a necessarily-partial function (refineV in Scala) to refine a value to its refinement type.
What are some alternatives?
cassava - A CSV parsing and encoding library optimized for ease of use and high performance
massiv - Efficient Haskell Arrays featuring Parallel computation
elf - Parser for ELF object format.
b-tree - Haskell on-disk B* tree implementation
semantic-source - Parsing, analyzing, and comparing source code across many languages
primitive - This package provides various primitive memory-related operations.
audiovisual - Extensible records, variants, structs, effects, tangles
aig - Provides an interface for AIGs and word-level operations on them
fmlist - FoldMap lists
diskhash - Diskbased (persistent) hashtable
critbit - A Haskell implementation of crit-bit trees.
compact - Compact regions library for Haskell