lvish
token-bucket
lvish | token-bucket | |
---|---|---|
3 | - | |
82 | 8 | |
- | - | |
0.0 | 0.0 | |
over 1 year ago | over 1 year ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | GNU 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.
lvish
-
rec-def: Behind the scenes
Still reminds me of elvish. Sounds like propagator cells are IVars that take the greatest lower bound w.r.t. definedness.
-
Pure recursively defined sets without looping
The monotonicity requirement reminds me of LVars. Maybe the unsafe bits can defer to that library?
-
"monadic" reads "single item data-dependent"
The lvish library in haskell is relevant https://hackage.haskell.org/package/lvish .
token-bucket
We haven't tracked posts mentioning token-bucket yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
streamly - High performance, concurrent functional programming abstractions
concurrent-supply - A fast globally unique variable supply with a pure API
threads - Fork threads and wait for their result
cspmchecker - The library FDR3 uses for parsing, type checking and evaluating machine CSP.
thread-hierarchy - Simple Haskel thread management in hierarchical manner
timeout - Generalized sleep and timeout functions
restricted-workers - Interactive-diagrams
ctrie - Non-blocking concurrent hashmap for Haskell
om-actor - Actor pattern utilities for Haskell.
conceit - Concurrently + Either
theatre - Minimalistic actor library for Haskell
kickchan - Bounded channels with invalidating readers