build alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view build alternatives based on common mentions on social networks and blogs.

arithmoi

9.5 5.7 build VS arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences
toysolver

9.3 8.2 build VS toysolver

My sandbox for experimenting with solver algorithms.

Run Linux Software Faster and Safer than Linux with Unikernels

Promo github.com/nanovms

ersatz

9.0 3.7 build VS ersatz

A monad for interfacing with external SAT solvers
iproute

8.9 0.0 build VS iproute

IP Routing Table in Haskell
graphs

8.4 0.0 build VS graphs

a monadic graph library
funsat

8.3 0.0 build VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
aeson-diff

8.3 1.1 build VS aeson-diff

Generate and apply diffs between JSON documents.
primes

8.2 0.0 build VS primes

Prime Numbers for Haskell
presburger

8.1 0.0 build VS presburger

Decision procedures for Presburger arithmetic in Haskell
HMM

8.1 0.0 build VS HMM

hidden markov models in haskell
union-find

8.0 0.0 build VS union-find

Efficient union and equivalence testing of sets.
imj-animation

7.7 0.8 build VS imj-animation

Monorepo for a multi-player game engine, and game examples
text-metrics

7.7 3.0 build VS text-metrics

Calculate various string metrics efficiently in Haskell
lca

7.6 0.0 build VS lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
ADPfusion

7.1 5.8 build VS ADPfusion

Efficient, high-level dynamic programming
search-algorithms

7.1 0.0 build VS search-algorithms

Haskell library containing common graph search algorithms
Adaptive

7.0 0.0 build VS Adaptive

Library for incremental computing.
dtw

6.9 0.0 build VS dtw

Implementation of Dynamic Time Warping in Haskell
edit-distance

6.6 1.4 build VS edit-distance

Edit distance library for Haskell
treeviz

6.3 0.0 build VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
binary-search

6.2 0.0 build VS binary-search

Binary and exponential searches
qchas

6.1 0.0 build VS qchas

A library for implementing Quantum Algorithms
incremental-sat-solver

6.1 0.0 build VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
integer-logarithms

5.9 0.4 build VS integer-logarithms

Integer logarithms, originally split from arithmoi package
ListTree

5.9 3.9 build VS ListTree

A List monad transformer and related tools
cmaes

5.7 0.0 L1 build VS cmaes

CMA-ES wrapper in Haskell
twentyseven

5.5 0.0 build VS twentyseven

Rubik's cube solver in Haskell
sgd

5.2 0.0 build VS sgd

Stochastic gradient descent Haskell library
DP

5.2 0.0 build VS DP

Holder for a bunch of semirings used in ChartParsing
GraphSCC

5.0 0.0 build VS GraphSCC

Tarjan's algorithm for computing strongly connected components
KMP

4.8 0.0 build VS KMP

Knuth–Morris–Pratt string searching algorithm
union-find-array

4.8 2.0 build VS union-find-array

ST based union find data structure
TrieMap

4.8 0.0 build VS TrieMap

Generalized tries for Haskell
infinite-search

4.8 0.0 build VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
nonlinear-optimization-ad

4.6 0.0 build VS nonlinear-optimization-ad

Wrapper of nonlinear-optimization package for using with ad and backprop packages
jps

4.4 0.0 build VS jps

:point_right: jump point search for Haskell
primesieve

4.3 0.1 build VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
spacefill

4.2 0.0 build VS spacefill

Space-filling curves
adp-multi

4.1 0.0 build VS adp-multi

Prototype of ADP for MCFL (multiple context-free languages)
edit-distance-vector

3.9 0.0 build VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
primal

3.9 3.8 build VS primal

Primitive World of Haskell
graph-generators

3.8 0.0 build VS graph-generators

A Haskell library for creating random Data.Graph instances using several pop
pathfinding

3.7 0.0 build VS pathfinding

Haskell pathfinding library
edit-distance-linear

3.6 0.0 build VS edit-distance-linear

Levenshtein edit distance in linear memory (also turns out to be faster than C++)
stable-marriage

3.3 0.0 build VS stable-marriage

library around stable marriage algorithms
bordacount

3.0 0.0 build VS bordacount

Haskell implementation of the Borda count election method
epanet-haskell

2.6 0.0 L2 build VS epanet-haskell

Call the EPANET toolkit via Haskell's Foreign Function Interface
primes-type

2.3 0.0 build VS primes-type

Type-safe prime numbers.
dgim

2.3 0.0 build VS dgim

:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.
fibonacci

2.3 0.0 build VS fibonacci

Fast computation of Fibonacci numbers in Haskell

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

Do you think we are missing an alternative of build or a related project?

Add another 'Algorithms' Package

Popular Comparisons

README

Build Systems à la Carte

This project provides an executable framework for developing and comparing build systems, viewing them as related points in landscape rather than as isolated phenomena. The code derives from the ICFP 2018 paper "Build Systems à la Carte" (PDF).

Getting Started

Related Material

Blog post on the motivation behind the project.
Blog post on the task abstraction.
Blog post reviewing how the paper was written.
Talk by Neil on this paper and Shake.
A talk on build systems by Andrey.