Algorithms and Data structures

Jump consistent hash implementation in Elixir

A fast consistent hash ring implementation in Elixir.

Raft library

Generic Zipper Implementation for Erlang

Computational parallel flows for Elixir

General purpose circular buffer.

Erlang/Elixir library for partitioned or sharded ETS tables.

Parallel stream operations for Elixir

A high-performance graph datastructure library for Elixir projects

A fast consistent hash ring implementation in Elixir

Erlang Trie Implementation

Unified access to tabular data

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

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.

Implementations of δ-CRDTs

A faster Map, augmented with a MerkleTree

Fast bounded deque using two rotating lists.

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

Elixir implementation of bidirectional map and multimap

Consistent Hash Ring

Jump Consistent Hash NIF library for Erlang/Elixir.

Library for boolean satisfiability solving and expression manipulation.

SortedSet is a fast and efficient Rust backed sorted set.

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

Algebra utilities for Elixir

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

Priority Search Queue

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

A splay-tree implementation

A simple, dependency free boolean satisfiability solver.

Ordered map for Elixir lang

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

A library for cosine similarity & simhash calculation

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.

Erlang Priority Queue Implementation

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

An OTP application

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.

Non-empty lists in Gleam

A double-ended queue data structure

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

Immutable arrays for Gleam

Dependency graphs for optimal function call ordering

A Jump Consistent Hash library

Storing a set of closed intervals

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.

Merkle Trees for data replication purposes

Erlang lazy list library

Helper functions for working with weighted random values.

Bags (or multisets) in Gleam

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

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

sets-like wrapper based on maps

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

Tries in Gleam

Double-ended queue with limited length

Library for dealing with data structures

Fast-and-loose PRNG experiments

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

riak CTDT datatypes

Extensions to Elixir data structures

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

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

Constraint Programming Solver

Trie based router.

An Elixir implementation of the Google diff_match_patch library.

Bloomex is a pure Elixir implementation of Scalable Bloom Filters.

GlobalConst converts large Key-Value entities to a module to make fast accessing by thousands of processes.

A vectors library for the Gleam programming language

Pure Elixir AVL tree implementation

An efficient implementation of double ended fifo queues

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

Sorts a list of maps per a list of sort specs.

ExShards – Elixir Wrapper for cabol/shards

An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations and subtraction.

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

A fleet of Raft consensus groups

Elixir wrapper of `:digraph` with a pinch of protocols and sigils

Easily sort by multiple fields in a readable manner