Our great sponsors
| build | primes | |
|---|---|---|
| 1 | - | |
| 230 | 45 | |
| - | - | |
| 2.8 | 0.0 | |
| about 2 months ago | about 13 years ago | |
| TeX | Haskell | |
| MIT 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.
build
-
Build systems à la carte (2018)
Code is available at https://github.com/snowleopard/build
I skimmed the paper - this is interesting on many aspects but I liked the breadth of what they analyzed... they use Excel as one of the examples!
I know it is a valuable skill to be able to efficiently break down problems into abstractions but I suspect you would still end up with "porcelain"[0] that would hide so much of this it might not be worth it. Or maybe it is so generic it becomes a standard of sorts (or certainly a standard way of doing things) with flavors of implementations on top of it?
In the conclusion they say:
> ... a simple recombination leads to a design for a monadic suspending cloud build system ...
Totally over my head as I still don't grok monads despite my belief I use them or something very close to them all the time without realizing it. I could not implement one. Anyway, I digress... neat paper and I will keep working on digesting it.
[0] https://git-scm.com/book/en/v2/Git-Internals-Plumbing-and-Po...
primes
We haven't tracked posts mentioning primes yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
spacefill - Space-filling curves
incremental-sat-solver - Simple, Incremental SAT Solving as a Haskell Library
text-metrics - Calculate various string metrics efficiently in Haskell
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
funsat - An efficient, embeddable DPLL SAT solver in Haskell
graph-generators - A Haskell library for creating random Data.Graph instances using several pop
cmaes - CMA-ES wrapper in Haskell
lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
nonlinear-optimization-ad - Several Haskell packages for numerical optimizations.
edit-distance - Edit distance library for Haskell
GraphSCC - Tarjan's algorithm for computing strongly connected components
twentyseven - Rubik's cube solver in Haskell