Algorithms and Data structures
Implementations of algorithms and data structures optimized for Elixir's functional programming paradigm. Packages among the 3,000 most downloaded in the past 90 days.
-
471.0m
-
121.0m
-
585983.0k
-
1.6k806.0k
-
29691.9k
-
963445.5k
-
37421.3k
-
132358.9k
-
crux 0.1.4
Library for boolean satisfiability solving and expression manipulation.
13304.1k last 90 days13304.1k -
A high-performance graph datastructure library for Elixir projects with multigraph support
2298.8k last 90 days2298.8k -
libgraph 0.16.0
A high-performance graph datastructure library for Elixir projects
570293.3k last 90 days570293.3k -
murmur 2.0.2
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.
6284.0k last 90 days6284.0k -
228265.5k
-
298235.5k
-
103222.2k
-
107197.1k
-
558195.2k
-
radix 0.5.0
A bitwise radix tree for prefix based matching on bitstring keys of any length.
12191.2k last 90 days12191.2k -
partitioned_buffer 0.4.3
ETS-based partitioned buffer for high-throughput data processing
12120.1k last 90 days12120.1k -
157110.6k
-
limited_queue 0.1.2
Simple Elixir queue, with a constant-time `size/1` and a maximum capacity.
2277.4k last 90 days2277.4k -
663.9k
-
4551.2k
-
3450.0k
-
qex 0.5.2
A `:queue` wrapper with improvements in API and addition of Protocol implementations
3548.1k last 90 days3548.1k -
1336.3k
-
1832.5k
-
nary_tree 0.1.1
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.
1826.5k last 90 days1826.5k -
2522.3k
-
heap 3.0.0
Small composable Heap implementation. Heaps sort elements at insert time.
21.8k last 90 days-21.8k -
-20.8k
-
1518.0k
-
edit_distance 3.0.1
A pure Gleam package to compute the edit distance of two strings
1016.3k last 90 days1016.3k -
1215.9k
-
simplify 2.0.1
Implementation of the Ramer–Douglas–Peucker algorithm for reducing the number of points used to represent a curve.
3114.2k last 90 days3114.2k -
combination 0.0.3
Elixir library computing simple combination and permutation on Enumerables.
3414.1k last 90 days3414.1k -
511.9k
-
911.4k
-
1711.2k
-
cuckoo_filter 1.0.1
A high-performance, concurrent, and mutable Cuckoo Filter for Erlang and Elixir
4810.5k last 90 days4810.5k -
910.3k
-
3649.0k
-
118.6k
-
357.8k
-
arrays 2.1.1
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.
917.6k last 90 days917.6k -
656.9k
-
106.7k
-
476.6k
-
16.5k
-
996.5k
-
traverse 1.0.1
Traverse is a toolset to walk arbitrary Elixir Datastructures in a functional way.
96.3k last 90 days96.3k -
776.2k
-
3576.1k
-
245.9k
-
talan 1.0.0
Probabilistic data structures powered by atomics. Bloom filter, Counting bloom filter, Linear counter (cardinality)
85.7k last 90 days85.7k -
1735.4k
-
135.2k
-
35.0k
-
unrooted_polytree 0.1.1
GenStagA data type and related functions to support an unrooted (multiple starting nodes) polytree (a tree-like graph with edges).
14.9k last 90 days14.9k -
diff_match_patch 0.3.0
An Elixir implementation of the Google diff_match_patch library.
54.9k last 90 days54.9k -
exterval 0.2.0
Real-valued intervals with support for the `Enumerable` protocol.
114.3k last 90 days114.3k -
24.1k
-
43.8k
-
73.8k
-
463.6k
-
sidereon 2.0.0
Satellite toolkit for Elixir with SGP4 propagation, coordinate transforms, GNSS positioning, orbit determination, conjunction assessment, pass prediction, live TLE/OMM data, real-time tracking, and a Rust NIF backend.
23.6k last 90 days23.6k -
13.6k
-
103.4k
-
523.4k
-
03.4k
-
-3.2k
-
-3.1k
-
-3.0k
-
bloomex 1.2.0
Bloomex is a pure Elixir implementation of Scalable Bloom Filters.
1113.0k last 90 days1113.0k -
112.8k