Algorithms

bcmp offers fast binary data comparison algorithms to enumerate common substrings, unique substrings or determine a patch set

A Rust implementation of Plumtree algorithm

A library to compute md5 hashes from Read objects

A portable parser combinator library that does not require a runtime

SIMD-accelerated vector similarity primitives with binary, ternary, and scalar quantization

Vector quantization

Aviary bird combinators for Rust.

Generic worst-case-linear-time sorting and partitioning algorithms based on discriminators

microfacet for rust

A fast byte slice comparison library

A Rust Redlock implementation for distributed, highly-available redis locks

Pattern-defeating quicksort

Collection of classic AI algorithms with convenient interfaces

Hash functions used by the rust-bitcoin eccosystem

Lock-free concurrent hash map: elements never move after insertion, enabling lock-free reads

A fast mpmc broadcast queue

Primitive stress and pressure-like helpers

Optimize blackbox functions, suitable for hyperparameter optimization

A persistent history tree for undo/redo

The Inane crypto library

Portable high-level bitwise manipulation algorithms.

Add scale-dependent selection values to GeoPackage point layers.

Memory order consume for when it's known that the compiler can't elide the dependency

Digits iteration for unsigned integer types.

Comparison between differently typed numbers

Simple bounded binary heap

The package provides an algorithm to compute the discrete wavelet transform.

Tensor library with OpenCL acceleration

Tarjan's zip tree implemented in Rust

Control systems toolbox

In memory array de-duplication, useful for efficient storing of a history of data versions.

Finite State Machines with a procedural builder-style API and compile time transition checks.

A PageRank implementation

This package implements a basic version of the PQ-Grams tree-edit-distance approximation algorithm, as generically as possible. It defines traits that you can define for your label-types and tree-types, to use custom types with the algorithm. It also defines a basic generic Tree type for string or integer leaf types that is easy to build with, and compatible with the algorithm.

RNG crate with lan features but using external RNG source

A trait for types that keep track of the counts of things.

A counter for observations of things, backed by a BTreeMap.

A counter for observations of things, backed by a HashMap.

A counter for observations of things, backed by an OrderMap.

Implementations of Suffix Array, Burrows-Wheeler Transform and FM-index

Procedural macro for the blackbox crate

A neural network library.

Redis job queue

Tiny rust bloom filter implementation

General string search in constant space, linear time, for nonorderable alphabets.

A collection of triangulation algorithms

Bindings to AVX-2-optimized SIP-like hash functions

Entropy-based image border detection

Data Assimilation in Rust

Comprehensive, correctly rounding interval arithmetic library.