FFI bindings for the primesieve library.

primesieve alternatives and similar packages

Based on the "Algorithms" category

• build

  9.4 7.8 primesieve VS build

  Build systems a la carte

• arithmoi

  9.4 8.7 primesieve VS arithmoi

  Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

• toysolver

  9.1 7.8 primesieve VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.4 primesieve VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.8 3.3 primesieve VS iproute

  IP Routing Table

• primes

  8.3 0.0 primesieve VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 primesieve VS graphs

  A simple monadic graph library

• funsat

  8.1 0.0 primesieve VS funsat

  A modern DPLL-style SAT solver

• HMM

  7.9 0.0 primesieve VS HMM

  A hidden markov model library

• imj-animation

  7.8 0.4 primesieve VS imj-animation

  Animation Framework

• aeson-diff

  7.8 2.4 primesieve VS aeson-diff

  Extract and apply patches to JSON documents.

• union-find

  7.8 0.0 primesieve VS union-find

  Efficient union and equivalence testing of sets.

• presburger

  7.4 0.4 primesieve VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 primesieve VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 primesieve VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 primesieve VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 primesieve VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• dtw

  6.5 0.0 primesieve VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.3 0.0 primesieve VS treeviz

  Visualization of computation decomposition trees.

• qchas

  6.2 0.3 primesieve VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 primesieve VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 primesieve VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 primesieve VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• cmaes

  5.0 0.0 L1 primesieve VS cmaes

  CMA-ES wrapper in Haskell

• search-algorithms

  5.0 0.0 primesieve VS search-algorithms

  Common graph search algorithms

• sgd

  4.8 7.0 primesieve VS sgd

  Stochastic gradient descent

• integer-logarithms

  4.8 3.6 primesieve VS integer-logarithms

  Integer logarithms.

• edit-distance-vector

  4.8 0.0 primesieve VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• binary-search

  4.6 0.0 primesieve VS binary-search

  Binary and exponential searches

• union-find-array

  4.3 0.0 primesieve VS union-find-array

  union find data structure

• KMP

  4.3 0.7 primesieve VS KMP

  Knuth–Morris–Pratt string searching algorithm

• TrieMap

  4.3 0.0 primesieve VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• graph-generators

  4.1 0.0 primesieve VS graph-generators

  Functions for generating structured or random FGL graphs

• infinite-search

  4.1 0.0 primesieve VS infinite-search

  Exhaustively searchable infinite sets.

• DP

  4.1 0.0 primesieve VS DP

  Pragmatic framework for dynamic programming

• jps

  3.8 0.0 primesieve VS jps

  Jump point search for Haskell

• pathfinding

  3.8 0.0 primesieve VS pathfinding

  pathfinding in grid and graphs

• nonlinear-optimization-ad

  3.5 0.0 primesieve VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• spacefill

  3.5 0.0 primesieve VS spacefill

  Generators for space-filling curves.

• GraphSCC

  3.1 0.0 primesieve VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• edit-distance-linear

  3.1 7.1 primesieve VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• fibonacci

  2.9 0.0 primesieve VS fibonacci

  Fast computation of Fibonacci numbers.

• epanet-haskell

  2.9 0.0 L2 primesieve VS epanet-haskell

  Haskell binding for EPANET

• twentyseven

  2.9 0.0 primesieve VS twentyseven

  Rubik's cube solver

• pell

  2.5 0.0 primesieve VS pell

  Package to solve the Generalized Pell Equation.

• learning-hmm

  2.5 0.0 primesieve VS learning-hmm

  Yet another library for hidden Markov models

• dgim

  2.5 0.0 primesieve VS dgim

  Implementation of DGIM algorithm

• stable-marriage

  2.5 0.0 primesieve VS stable-marriage

  algorithms around stable marriage

• adp-multi

  2.1 0.0 primesieve VS adp-multi

  ADP for multiple context-free languages

• ADPfusionSet

  1.1 0.0 primesieve VS ADPfusionSet

  Dynamic programming for Set data structures.

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

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

Popular Comparisons

• primesieve
  vs
  adp-multi
• primesieve
  vs
  twentyseven
• primesieve
  vs
  lca
• primesieve
  vs
  arithmoi
• primesieve
  vs
  graph-generators

SaaSHub - Software Alternatives and Reviews View more from us