Algorithms and Data structures

Jump consistent hash implementation in Elixir

A fast consistent hash ring implementation in Elixir.

Raft library

Computational parallel flows for Elixir

Use `:atomics` as a bit array or as an array of N-bit counters.

Generic Zipper Implementation for Erlang

General purpose circular buffer.

Bootstrapped algebraic data types for Elixir

A SQL92 predicate evaluator in Erlang

A high-performance graph datastructure library for Elixir projects

Erlang Trie Implementation

Erlang/Elixir library for partitioned or sharded ETS tables.

A dynamic data structure for efficiently indexing arbitrary boolean expressions

A fast consistent hash ring implementation in Elixir

Parallel stream operations for Elixir

A bitwise radix tree for prefix based matching on bitstring keys of any length.

Unified access to tabular data

Library for boolean satisfiability solving and expression manipulation.

A faster Map, augmented with a MerkleTree

Implementations of δ-CRDTs

Murmur is a pure Elixir implementation of the non-cryptographic hash Murmur3. It aims to implement the x86_32bit, x86_128bit and x64_128bit variants.

Create an alphabetical hash. Taking an existing alphabetic hash (of any length), will return the next hash in sequence. If all characters in hash are rolled over, will append a new char (increase the length by 1.) eg. 'ZZZZ' -> 'AAAAA' eg. 'AAAZ' -> 'AABA'

Fast bounded deque using two rotating lists.

A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.

A graph library. Including path finding.

Simple Elixir queue, with a constant-time `size/1` and a maximum capacity.

Accomplice is a library for grouping members of a list with a respect to a number of constraints.

A light ADT module for Elixir.

Elixir lib for Aho-Corasick string searching. Uses a Rust-based NIF for greatly improved performance.

Elixir implementation of bidirectional map and multimap

Implementation of the Ramer–Douglas–Peucker algorithm for reducing the number of points used to represent a curve.

Abacus is a module for transforming other modules into metric systems. These modules (metric systems) make it possible to use functions to create values enclosed in a metric system and functions to manipulate these values.

Calculates the set of unambiguous abbreviations for a given set of strings.

AA Tree in Pure Elixir

A simple, dependency free boolean satisfiability solver.

A `:queue` wrapper with improvements in API and addition of Protocol implementations

Consistent Hash Ring

Jump Consistent Hash NIF library for Erlang/Elixir.

Elixir lib for Aho-Corasick string searching. Uses a Rust-based NIF for greatly improved performance.

A very efficient way to share mutable data with :atomics and :ets

An Erlang CRDT library

Algebra utilities for Elixir

Non-empty lists in Gleam

A splay-tree implementation

Small composable Heap implementation. Heaps sort elements at insert time.

NaryTree implements the data structure for n-ary tree (also called rose tree), where each node in the tree can have zero or more children. NaryTree provides methods for traversal and manipulation of the tree structure and node contents.

Aho-Corasick algorithm, implemented in Elixir using Erlang's :digraph for the graph structure

Affine Transform Library

Implementation of Walker's Alias method by Elixir

Alltid offers a simplified approach to editing deeply nested immutable data structures in Elixir.

Annealing is a library for building and running simulated annealing algorithms in Elixir.

Immutable arrays for Gleam

A pure Gleam package to compute the edit distance of two strings

An OTP application

Ordered map for Elixir lang

Priority Search Queue

A library for cosine similarity & simhash calculation

Merkle Trees for data replication purposes

Elixir library computing simple combination and permutation on Enumerables.

Permutation is a package and protocol for calculating the possible permutations or combinations of an Enumerable.

Well-structured Arrays with fast random-element-access for Elixir, offering a common interface with multiple implementations (MapArray, Erlang :array, etc.) with varying performance guarantees that can be switched in your configuration.

A high-performance graph datastructure library for Elixir projects with multigraph support

Utilities for hierarchical data structures with parent/child relationships

Bags (or multisets) in Gleam

Tries in Gleam

sets-like wrapper based on maps

Constraint Programming Solver

Double-ended queue with limited length

A circular buffer backed by a queue, map, or ETS

Convert between plain text and inverted index format

Real-valued intervals with support for the `Enumerable` protocol.

Erlang lazy list library

RingBuffer - size limited queue, like a ring or cyclic buffer. With non blocking and non locking writers.

Trie based router.

A high-performance, concurrent, and mutable Cuckoo Filter for Erlang and Elixir

Library for dealing with data structures

riak CTDT datatypes

Dependency graphs for optimal function call ordering

A fast, safe, batteries-included array for Gleam!

Conflict-free Replicated Data Types

GenStagA data type and related functions to support an unrooted (multiple starting nodes) polytree (a tree-like graph with edges).

Erlang Priority Queue Implementation

Elixir/Erlang interface to MiniZinc (https://www.minizinc.org/).

Traverse is a toolset to walk arbitrary Elixir Datastructures in a functional way.

Probabilistic data structures powered by atomics. Bloom filter, Counting bloom filter, Linear counter (cardinality)

A double-ended queue data structure

A Rose Tree and Zipper in Elixir with a slew of navigation primitives.

Lowest Random Weight hashing

SortedSet is a fast and efficient Rust backed sorted set.

An Elixir implementation of the Google diff_match_patch library.

A Jump Consistent Hash library

A Practical Combinator Library