-
rand
Random number generators and other randomness functionality
-
rand_core
Core random number generator traits and tools for implementation
-
fastrand
fast random number generator
-
strsim
Implementations of string similarity metrics. Includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, Jaro-Winkler, and Sørensen-Dice.
-
rand_chacha
ChaCha random number generator
-
ahash
A non-cryptographic hash function using AES-NI for high performance
-
fnv
Fowler–Noll–Vo hash function
-
adler
clean-room implementation of the Adler-32 checksum
-
deranged
Ranged integers
-
siphasher
SipHash-2-4, SipHash-1-3 and 128-bit variants in pure Rust
-
fallible-iterator
Fallible iterator traits
-
ff
building and interfacing with finite fields
-
twox-hash
XXHash and XXH3 algorithms
-
oorandom
A tiny, robust PRNG implementation
-
rand_xorshift
Xorshift random number generator
-
crc
support of various standards
-
seahash
A blazingly fast, portable hash function with proven statistical guarantees
-
rand_hc
HC128 random number generator
-
normalize-line-endings
Takes an iterator over chars and returns a new iterator with all line endings (\r, \n, or \r\n) as \n
-
stringprep
algorithm
-
md5
The package provides the MD5 hash function
-
rand_pcg
Selected PCG random number generators
-
utf-8
Incremental, zero-copy UTF-8 decoding with error handling
-
simd-adler32
A SIMD-accelerated Adler-32 hash algorithm implementation
-
bytecount
count occurrences of a given byte, or the number of UTF-8 code points, in a byte slice, fast
-
unarray
working with uninitialized arrays
-
rand_distr
Sampling from random number distributions
-
fxhash
A fast, non-secure, hashing algorithm derived from an internal hasher used in FireFox and Rustc
-
simdutf8
SIMD-accelerated UTF-8 validation
-
nanorand
A tiny, fast, zero-dep library for random number generation
-
crc32c
Safe implementation for hardware accelerated CRC32C instructions with software fallback
-
adler32
Minimal Adler32 implementation for Rust
-
rand_xoshiro
Xoshiro, xoroshiro and splitmix64 random number generators
-
smawk
Functions for finding row-minima in a totally monotone matrix
-
stacker
A stack growth library useful when implementing deeply recursive algorithms that may accidentally blow the stack
-
xxhash-rust
xxhash
-
uint
Large fixed-size integer arithmetic
-
treediff
Find the difference between arbitrary data structures
-
arrow-data
Array data abstractions for Apache Arrow
-
dissimilar
Diff library with semantic cleanup, based on Google's diff-match-patch
-
task-local-extensions
Task-local container for arbitrary data
-
ena
Union-find, congruence closure, and other unification code. Based on code from rustc.
-
futf
Handling fragments of UTF-8
-
sketches-ddsketch
A direct port of the Golang DDSketch implementation
-
rand_isaac
ISAAC random number generator
-
slice-group-by
Iterators over groups in slices and strs
-
rand_jitter
Random number generator based on timing jitter
-
arrow-ord
Ordering kernels for arrow arrays
-
nohash-hasher
std::hash::Hasher
which does not hash at all -
fuchsia-cprng
Fuchsia cryptographically secure pseudorandom number generator
-
gix-revwalk
providing utilities for walking the revision graph
-
blake2b_simd
a pure Rust BLAKE2b implementation with dynamic SIMD
-
crc16
A CRC16 implementation
-
hmac-drbg
Pure Rust implementation of Hmac DRBG
-
murmur3
hash
-
yada
double-array trie library aiming for fast search and compact data representation
-
gix-filter
gitoxide project implementing git filters
-
integer-sqrt
integer square root algorithm for primitive rust types
-
num-cmp
Comparison between differently typed numbers
-
gix-negotiate
gitoxide project implementing negotiation algorithms
-
hexf-parse
Parses hexadecimal floats (see also hexf)
-
topological-sort
Performs topological sorting
-
levenshtein
algorithm
-
rust-stemmers
some popular snowball stemming algorithms
-
ulid
a Universally Unique Lexicographically Sortable Identifier implementation
-
rstar
An R*-tree spatial index
-
strength_reduce
Faster integer division and modulus operations
-
cobs
Consistent Overhead Byte Stuffing (COBS) algorithm. COBS is an algorithm for transforming a message into an encoding where a specific value (the "sentinel" value) is not used…
-
robust
adaptive floating-point predicates for computational geometry
-
murmurhash32
murmurhash32_2
-
float_next_after
A trait for native rust f64/f32 nextafter
-
tantivy-fst
tantivy-specific fork from the fst crate from Burntsushi. (Please use the fst crate instead.)
-
wildmatch
string matching with single- and multi-character wildcard operator
-
halfbrown
Multi backend HashMap for higher performance on different key space sizes
-
hashers
A collection of non-cryptographic hashing algorithms for Rust
-
mur3
language implementation of MurmurHash3
-
partial_sort
version of std::partial_sort
-
buf_redux
Drop-in replacements for buffered I/O in
std::io
with extra features -
earcutr
port of MapBox's earcut triangulation code to Rust language
-
fst
Use finite state transducers to compactly represents sets or maps of many strings (> 1 billion is possible)
-
cap-rand
Capability-based random number generators
-
reed-solomon-novelpoly
reed solomon code / encoder / decoder with complexity
O(n lg(n))
-
muldiv
trait for numeric types to perform combined multiplication and division with overflow protection
-
str_stack
string allocator for allocating many write-once strings. This library is primarily useful for parsing where you need to repeatedly build many strings, use them, and then throw them away…
-
streaming-iterator
Streaming iterators
-
zwohash
A fast, deterministic, non-cryptographic hash for use in hash tables
-
varint-rs
A small, zero dependency varint implementation in Rust
-
transpose
transposing multi-dimensional data
-
rustfft
High-performance FFT library written in pure Rust
-
gcd
Calculate the greatest common divisor
-
fast-math
Fast, approximate versions of mathematical functions
-
g2poly
Primitive implementation of polynomials over the field GF(2)
-
natord
Natural ordering for Rust
-
cvt
Expose the cvt function from Rust libstd
-
fast-float
Fast floating-point number parser
-
special
The package provides special functions
-
memmem
Substring searching
-
xmlwriter
streaming XML writer
-
quad-rand
Pseudo random implementation with std atomics
-
const-fnv1a-hash
A #![no_std] crate for performing FNV1A-16/32/64/128 hashing on Rust stable at compile time
-
argminmax
(argmin & argmax in 1 function) with SIMD for floats and integers
-
polars-pipe
Lazy query engine for the Polars DataFrame library
-
crc-any
To compute CRC values by providing the length of bits, expression, reflection, an initial value and a final xor value. It has many built-in CRC functions.
-
to_method
micro-crate for using Into more ergonomically
-
shared-buffer
An abstraction over buffers backed by memory-mapped files or bytes in memory
-
rectangle-pack
A general purpose, deterministic bin packer designed to conform to any two or three dimensional use case
-
order-stat
Compute order statistics efficiently via the Floyd-Rivest algorithm and estimate a median via the median-of-medians algorithm
-
radsort
Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)
-
ndarray-rand
Constructors for randomized arrays.
rand
integration forndarray
. -
gemm-c64
Playground for matrix multiplication algorithms
-
realfft
Real-to-complex forward FFT and complex-to-real inverse FFT for Rust
-
gemm-f32
Playground for matrix multiplication algorithms
-
buffer-redux
Drop-in replacements for buffered I/O in
std::io
with extra features -
addchain
Generate addition chains
-
probability
The package provides a probability-theory toolbox
-
safe-mix
Collective Coin Flip algorithm
-
zipf
A fast generator of discrete, bounded Zipf-distributed random numbers
-
oci-spec
Open Container Initiative Specifictions in Rust
-
random
The package provides sources of randomness
-
float_eq
Compare IEEE floating point primitives, structs and collections for equality
-
hmac-sha1
wrapper around the RustCrypto hmac and sha1 crates for simple HMAC-SHA1 generation
-
crc24
CRC-24 implementation (IETF RFC2440-compatible)
-
rustfst
constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs)
-
edit-distance
Levenshtein edit distance between strings, a measure for similarity
-
chalk-recursive
Recursive solver for the Chalk project
-
sha3-asm
Raw bindings for SHA-3 algorithms written in assembly
-
triple_accel
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
-
wyhash
fast portable non-cryptographic hashing algorithm and random number generator
-
binary-merge
Minimum comparison merge of two sorted sequences with random access
-
kdtree
K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup
-
rand_regex
Generates random strings and byte strings matching a regex
-
pathfinding
flow, and graph algorithms
-
geoutils
A collection of geo computation utilities
-
highway
Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function
-
superslice
Extensions for slices
-
g2gen
A macro to create types that implement fast finite field arithmetic
-
checked_int_cast
Conversions between primitive integers with overflow and underflow checking
-
rand_seeder
A universal random number seeder based on SipHash
-
alphanumeric-sort
can help you sort order for files and folders whose names contain numerals
-
jubjub
elliptic curve group
-
lazy-bytes-cast
Lazy casts from & to byte arrays
-
re_arrow2
Unofficial implementation of Apache Arrow spec in safe Rust
-
atomic-traits
The traits for generic atomic operations
-
gcra
A basic implementation of GCRA algorithm for rate limiting
-
postcard-cobs
Consistent Overhead Byte Stuffing (COBS) algorithm. COBS is an algorithm for transforming a message into an encoding where a specific value (the "sentinel" value) is not used…
-
passwords
useful tools to generate multiple readable passwords, as well as analyze and score them
-
random-pick
Pick an element from a slice randomly by given weights
-
regalloc
Modular register allocation algorithms
-
rustdct
Compute Discrete Cosine Transforms (DCT) of any size in O(nlogn) time, in pure Rust
-
line_drawing
A collection of line-drawing algorithms for use in graphics and video games
-
ndarray-linalg
Linear algebra package for rust-ndarray using LAPACK
-
permutation
Small utility for creating, manipulating, and applying permutations
-
vecmath
type agnostic library for vector math designed for reexporting
-
line-col
Convert string slice indices into line/column numbers
-
linfa-linalg
Pure-Rust implementation of linear algebra routines for ndarray
-
quine-mc_cluskey
Quine-McCluskey algorithm and Petrick's method
-
is_sorted
Iterator sorted?
-
permutohedron
Generate permutations of sequences. Either lexicographical order permutations, or a minimal swaps permutation sequence implemented using Heap's algorithm.
-
varisat
A CDCL based SAT solver (library)
-
noise
Procedural noise generation library
-
dmp
A high-performance library in that manipulates plain text
-
longest-increasing-subsequence
Find a longest increasing subsequence of some input sequence
-
sm
💋 SM – a static State Machine library
-
statistical
statistics library
-
iter_tools
Collection of general purpose tools to iterate. Currently it simply reexports itertools.
-
dmsort
Fast adaptive sorting for when most of your data is already in order. dmsort can be 2-5 times faster than Rust's default sort when more than 80% of the elements are already in order
-
human-sort
Human sort (natural sort) implementation
-
vec_mut_scan
Forward scan over a vector with mutation and item removal
-
streaming-stats
Experimental crate for computing basic statistics on streams
-
vek
Generic 2D-3D math swiss army knife for game engines, with SIMD support and focus on convenience
-
async-convert
Async TryFrom/TryInto traits
-
pdqselect
Selects the kth smallest element of a slice, based on Orson Peters's Pattern Defeating Quickselect
-
cauchy
Trait for real and complex numbers
-
geos-sys
GEOS C API bindings
-
lax
LAPACK wrapper without ndarray
-
ocaml-interop
OCaml interoperability
-
metrohash
high quality, high performance hash algorithm
-
faer-sparse
Basic linear algebra routines
-
varisat-checker
Proof checker for proofs generate by the Varisat SAT solver
-
topo_sort
A 'cycle-safe' topological sort for a set of nodes with dependencies
-
luhn
validation library
-
buf-min
Minimal utf-8 safe buffer traits
-
cint
A lean, minimal, and stable set of types for color interoperation between crates in Rust
-
av-metrics
A collection of algorithms for measuring audio/video metrics
-
stream-more
Stream utilities for Rust
-
hamming
Count ones, fast (aka popcount, hamming weight). This provides a performant popcount and bitwise hamming distance for a slice of bytes.
-
accurate
(more or less) accurate floating point algorithms
-
boyer-moore-magiclen
fast string search algorithm implemented in Rust
-
primes
A package for calculating primes using the Sieve of Eratosthenes, and using that to check if a number is prime and calculating factors. Includes an iterator over all primes.
-
varisat-formula
Basic formula data types used by the Varisat SAT solver
-
varisat-internal-proof
Internal proof format for the Varisat SAT solver
-
varisat-dimacs
DIMCAS CNF parser and writer for the Varisat SAT solver
-
easer
Tiny library imlementing Robert Penner's easing functions
-
stringslice
A collection of methods to slice strings based on character indices rather than bytes
-
random_word
Efficient functions for generating random words in many languages
-
simsearch
lightweight fuzzy search engine that works in memory, searching for similar strings (a pun here)
-
mpchash
Multi-probe consistent hashing algorithm implementation
-
numa_maps
Parse the numa_maps file
-
quantiles
a collection of approximate quantile algorithms
-
partitions
A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a set
-
random-string
Allows to generate random strings based on a given charset and length
-
rust-lapper
A fast and easy interval overlap library
-
subslice
Fast subslice search
-
naive-cityhash
A naive native 64/128 bit cityhash implementation for databend
-
nucleo
plug and play high performance fuzzy matcher
-
resolvo
Fast package resolver written in Rust (CDCL based SAT solving)
-
rust-analyzer-salsa
A generic framework for on-demand, incrementalized computation (experimental)
-
genevo
building blocks to run simulations of optimization and search problems using genetic algorithms (GA). Execute genetic algorithm (GA) simulations in a customizable and extensible way
-
shapefile
Read & Write shapefiles in Rust
-
hostlist-parser
Parses hostlist expressions into a Vec of Strings
-
bindgen_cuda
Bindgen like interface to build cuda kernels to interact with within Rust
-
raft
language implementation of Raft algorithm
-
bisection
Python bisect module
-
verhoeff
algorithm, for number checksums
-
const-crc32
A
const fn
implementation of crc32 checksum algorithm -
clone_dyn
Derive to clone dyn structures
-
daachorse
Double-Array Aho-Corasick
-
fastcdc
(content defined chunking) in pure Rust
-
linreg
Calculates linear regresssions of two-dimensional data. Does not use stdlib, only depends on numeric traits.
-
permutation_iterator
iterating over random permutations using O(1) (i.e. constant) space.
-
numext-fixed-uint
Fixed-size uint types
-
chksum
hash functions with a straightforward interface for computing digests of bytes, files, directories, and more
-
hashring
A minimal implementation of consistent hashing
-
distance
A collection of approximate string matching algorithms
-
smbus-pec
Minimal portable implementation of SMBus Packet Error Code calculation algorithm
-
blurhash
A pure Rust implementation of blurhash
-
mt19937
A translation of the MT19937 Mersenne Twister rng algorithm to Rust
-
resiter
Helper crate for handling iterators over result
-
bisector
Flexible bisect implementatation which allows the use the bisection method on arbitrary data types
-
meta_tools_min
Collection of general purpose meta tools. Minimal Set.
-
jmt
Jellyfish Merkle Tree
-
morton-encoding
encoding and decoding Morton ("Z-order") keys
-
idalloc
different methods of allocating unique identifiers efficiently
-
rev_lines
Rust Iterator for reading files line by line with a buffer in reverse
-
sugar_path
Sugar functions for manipulating paths
-
murmurhash3
MurmurHash3 implementation
-
fasthash
A suite of non-cryptographic hash functions for Rust
-
aeruginous-io
A set of input / output utilities for the Aeruginous Open Source Development Toolbox
-
simplerand
fast random number generator
-
arroy
Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage
-
bit-iter
Iterate forward or backwards over the positions of set bits in a word
-
lazysort
Lazy sorting for iterators
-
kiddo
A high-performance, flexible, ergonomic k-d tree library. Ideal for geo- and astro- nearest-neighbour and k-nearest-neighbor queries
-
openraft
Advanced Raft consensus
-
timsort
modified MergeSort used in Python and Java
-
from_bytes_or_zeroed
Reads integers from an arbitrary slice of bytes
-
extprim
Extra primitive types (u128, i128)
-
math_adapter
Collection of math adapters to decouple your application from math libraries' implementations and to provide both inter-libraries compatibility and affordable exchangeability
-
z3
High-level rust bindings for the Z3 SMT solver from Microsoft Research
-
raft-proto
Protocol definitions for the rust language implementation of the Raft algorithm
-
maglev
Google's consistent hashing algorithm
-
reblessive
A small runtime for running deeply nested recursive functions
-
xorfilter-rs
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
-
delaunator
A very fast 2D Delaunay triangulation library
-
derive_tools
A collection of derive macros designed to enhance STD
-
xoroshiro128
Fast psuedo-random number generators
-
digits_iterator
Iterate over the digits of numbers in an arbitrary radix
-
rust-bigint
Common traits and methods for multiple BigInt implementations
-
geo-clipper
Boolean operations on polygons
-
ext-sort
rust external sort algorithm implementation
-
kanaria
functions such as hiragana, katakana, half-width and full-width mutual conversion and discrimination
-
poseidon-permutation
An instantiation of the Poseidon permutation for decaf377
-
hexdump
Easy hexdump to stdout or as an iterator
-
kodama
Agglomerative hierarchical clustering
-
t1ha
T1AH (Fast Positive Hash) hash function
-
former
A flexible and extensible implementation of the builder pattern
-
impls_index
Several of macros to put each function under a named macro to index every function in a class
-
sample-std
Sampler definitions and implementations for st
-
z3-sys
Low-level bindings for the Z3 SMT solver from Microsoft Research
-
meta_tools
Collection of general purpose meta tools
-
for_each
Apply macro for each element of a list
-
snarkvm-console-algorithms
Console algorithms for a decentralized virtual machine
-
mod_interface
Protocol of modularity unifying interface of a module and introducing layers
-
lindel
Hilbert and Morton encoding and decoding; in a word, linearising and delinearising
-
vsort
GNU Version Sort Rust implementation
-
gxhash
non-cryptographic algorithm
-
bevy_crevice
Create GLSL-compatible versions of structs with explicitly-initialized padding (Bevy version)
-
type_constructor
Fundamental data types and type constructors, like Single, Pair, Many
-
modulo
operation
-
editdistancek
Fast algorithm for computing edit distance
-
mem_tools
Collection of tools to manipulate memory
-
fasthash-sys
A suite of non-cryptographic hash functions for Rust
-
re_analytics
Rerun's analytics SDK
-
globiter
Replace with description
-
tailcall
Safe, zero-cost tail recursion
-
voronator
Implements the Voronoi diagram construction as a dual of the Delaunay triangulation for a set of points and the construction of a centroidal tesselation of a Delaunay triangulation
-
crevice
Create GLSL-compatible versions of structs with explicitly-initialized padding
-
crc_all
A Pure Rust Implementation of Generic CRC Algorithm
-
httlib-huffman
Canonical Huffman algorithm for handling HPACK format in HTTP/2
-
proc_macro_tools
Tools for writing procedural macroses
-
cros-libva
Safe bindings over libva
-
ncollide3d
2 and 3-dimensional collision detection library in Rust. Will be superseded by the parry3d crate.
-
woptions
Mechanism to define map of options for a fuction and its defaults laconically
-
RustQuant
quantitative finance
-
uniset
A hierarchical, growable bit set with support for in-place atomic operations
-
hyperloglogplus
HyperLogLog implementations
-
ranges
generic alternative to core/std ranges, set-operations to work with them and a range set that can efficiently store them with the least amount of memory possible
-
pubgrub
version solving algorithm
-
demes-forward
rust API for iterating demes models forwards in time
-
numext-constructor
Fixed-size uint and hash constructor
-
fletcher
A dependency free implementation of the Fletcher's checksum algorithm
-
qr2term
Stupidly simple Rust crate to render a QR code in the terminal
-
rev_buf_reader
that provides a buffered reader capable of reading chunks of bytes of a data stream in reverse order. Its implementation is an adapted copy of BufReader from the nightly std::io.
-
former_runtime
Former - variation of builder pattern. Its runtime.
-
GSL
binding for the GSL (the GNU scientific library)
-
numext-fixed-uint-core
A internal crate used by numext-fixed-uint
-
clone_dyn_meta
Derive to clone dyn structures
-
levenberg-marquardt
algorithm built on top of nalgebra
-
rendezvous_hash
Rendezvous hashing algorithm
-
geometry-predicates
port of robust geometric predicates
-
rand_mt
Reference Mersenne Twister random number generators
-
iroh-bytes
blob and collection transfer support for iroh
-
usize_conversions
Conversion traits for conversions between
usize
and fixed sized integers -
winterval
Interval adapter for both open/closed implementations of intervals ( ranges )
-
combination
A lib to do math jobs like permutate and combinate data from vec
-
censor
text profanity filter
-
petal-neighbors
Nearest neighbor search algorithms including a ball tree and a vantage point tree
-
ff-zeroize
building and interfacing with finite fields
-
memx
memory functions like libc memcmp(), memchr(), memmem(), memcpy(), memset()
-
chksum-hash
hash algorithms for batch and stream computation
-
wmath
Math library aggregating several math modules
-
medians
Median, Statistical Measures, Mathematics, Statistics
-
poisson_reconstruction
Screened Poisson Reconstruction algorithm in Rust
-
eddie
Fast and well-tested implementations of edit distance/string similarity metrics: Levenshtein, Damerau-Levenshtein, Hamming, Jaro, and Jaro-Winkler
-
dogear
merging bookmark trees
-
clipper-sys
Boolean operations on polygons (Clipper wrapper)
-
sorted-insert
traits to insert elements to a sorted collection and keep the order
-
cityhash-rs
Rust no_std implementation of Google Cityhash v1.0.2, v1.0.3, and v1.1.0
-
twofloat
Double-double arithmetic functionality
-
smallest-enclosing-circle
Iterative and recursive two-dimensional implementations of Welzl's algorithm for computing the smallest enclosing circle
-
jumphash
A Fast, Minimal Memory, Consistent Hash Algorithm
-
candle-gemm-c32
Playground for matrix multiplication algorithms
-
candle-gemm-c64
Playground for matrix multiplication algorithms
-
diffs
A number of diff algorithms, also called longest common subsequence
-
rulinalg
A linear algebra library
-
candle-gemm-f16
Playground for matrix multiplication algorithms
-
kmp
Various functions using the Knuth–Morris–Pratt algorithm to efficiently find patterns
-
rex-sm
Hierarchical state machine
-
lz-fear
A fast pure-rust no-unsafe implementation of LZ4 compression and decompression
-
stats-cli
A command line statistics binary and package
-
index-fixed
convert slices into arrays using indexes ([T] -> [T;N])
-
wu-diff
Compute differences between two slices using wu(the O(NP)) algorithm
-
pingora-ketama
Rust port of the nginx consistent hash function
-
nlopt
Wrapper for the nlopt library
-
luhn3
A Luhn validation library
-
bloom-filters
Rust port of https://github.com/tylertreat/BoomFilters
-
lerp
Generic linear interpolation and extrapolation, automatically implemented for a variety of numeric types
-
pennereq
Port of the Penner easing equations to rust
-
cam-geom
Geometric models of cameras for photogrammetry
-
lev_distance
A copy of Levenshtein distance implementation from Rust Compiler
-
weighted-rs
A libray for weighted balancing algorithm
-
ezing
Easing functions
-
turborand
Fast random number generators
-
ndrustfft
N-dimensional FFT, real-to-complex FFT and real-to-real DCT
-
candle-gemm-f32
Playground for matrix multiplication algorithms
-
stable-hash
A stable, structured hash with backward compatibility
-
candle-gemm-f64
Playground for matrix multiplication algorithms
-
sonyflake
A distributed unique ID generator inspired by Twitter's Snowflake
-
former_meta
Former - a variation of builder pattern. Implementation of its derive macro. Should not be used independently, instead use module::former which relies on the module.
-
epimetheus
prometheus-compatible metrics framework
-
adskalman
Kalman filter and Rauch-Tung-Striebel smoothing implementation using nalgebra, no_std
-
impls_index_meta
Several of macros to put each function under a named macro to index every function in a class
-
interval_adapter
Interval adapter for both open/closed implementations of intervals ( ranges )
-
tlsh-fixed
Rust port of Trend Micro Locality Sensitive Hashing
-
random-branch
macro to select a random branch like match
-
simple-easing
Set of simple easing functions
-
lz_fnv
Fowler-Noll-Vo hash functions for various integer types
-
fakeit
Fake data generator library with 130+ functions
-
tfhe-c-api-dynamic-buffer
helper crate for TFHE-rs (https://crates.io/crates/tfhe) to easily share buffers between C and Rust and make their destruction safe on both sides of the FFI
-
sgp4
A pure Rust implementation of the SGP4 algorithm for satellite propagation
-
modinverse
Small library for finding the modular multiplicative inverses
-
scip-sys
Bindings for the C SCIP solver
-
influxdb2-structmap
Procedural macro library for converting between Rust structs and associative containers
-
graph_builder
A building block for high-performant graph algorithms
-
bit-matrix
bit matrices and vectors
-
kd-tree
k-dimensional tree
-
iobuffer
memory-based buffer for IO reading and writing
-
guid-create
Rust helper for creating GUIDs
-
graph
high-performant graph algorithms
-
extendhash
Rust Hash Extender
-
ordered-map
A HashMap, with the capability of accessing the keys and values in order
-
merging-iterator
An iterator to return the elements of two independently ordered iterators in order
-
rust-fuzzy-search
Fuzzy Search with trigrams implemented in Rust
-
fast_polynomial
Faster polynomial evaluation using Estrin's Scheme to exploit instruction-level parallelism
-
whisper-rs
Rust bindings for whisper.cpp
-
instant-distance
Fast minimal implementation of HNSW maps for approximate nearest neighbors searches
-
boomphf
Scalable and Efficient Minimal Perfect Hash Functions
-
recursive
Easy recursion without stack overflows
-
russcip
Rust interface for SCIP
-
clippy-utilities
funtions for clippy fixing
-
pagefind_stem
Snowball stemming algorithms repackaged for Rust, with languages behind feature flags
-
minterpolate
Data set interpolation for mint primitives and raw arrays
-
int_traits
trait for extended functions on integers
-
timely
A low-latency data-parallel dataflow system in Rust
-
extsort
External sorting (i.e. on disk sorting) capability on arbitrarily sized iterator
-
sobol
sequence generator for Rust
-
crunch
A packer for cramming lots of rectangles into a larger one, designed primarily with sprite packing in mind
-
powierza-coefficient
Powierża coefficient is a statistic for gauging if one string is an abbreviation of another
-
partition
slices in-place by a predicate
-
co_sort
Sort arrays given a permutation
-
fft2d
Fourier transform for 2D data such as images
-
toml-query
work with toml::Value objects more conveniently
-
argmap
parse command-line arguments into a hashmap and vec of positional args
-
htb
Hierarchical token bucket implementation
-
ran
fast random numbers generation
-
microfft
Embedded-friendly Fast Fourier Transforms
-
fractional_index
fractional indexing
-
minimum_redundancy
encode and decode data with binary or non-binary Huffman coding
-
mockd
Fake data generator library with 130+ functions
-
bidir-map
Bidirectional map implementation for Rust
-
mod_interface_runtime
Protocol of modularity unifying interface of a module and introducing layers
-
quadtree_rs
Point/region Quadtree with support for overlapping regions
-
ordslice
Extensions for ordered slices
-
reductive
Optimized vector quantization for dense vectors
-
apodize
iterators that yield generalized cosine, hanning, hamming, blackman, nuttall and triangular windows
-
flo_curves
manipulating Bezier curves
-
ripgen_lib
High-performance domain-name permutation generator
-
watermill
Blazingly fast, generic, and serializable online statistics
-
html2pango
convert html to pango
-
queue-ext
The extended feature of the queue can convert the pop() function of the queue to Stream and the push() function to Sender
-
chalk-engine
Core trait engine from Chalk project
-
murmur2
hash functions - see docs.rs
-
rxqlite-tests-common
A distributed sqlite database built upon
openraft
,sqlx
andsqlite
-
hasty
interface to system BLAS libraries for fast linear algebra operations
-
yn
Natural language processing library for yes or no values
-
stringmetrics
approximate string matching
-
interp
Matlab's interp1 function
-
dagga
For scheduling directed acyclic graphs of nodes that create, read, write and consume resources
-
general_stable_vec
A Vec implementation with stable indices
-
mersenne_twister
Mersenne Twister pseudorandom number generator
-
idsp
DSP algorithms for embedded, mostly integer math
-
block-mesh
Fast algorithms for generating voxel block meshes from arrays
-
tokenizations
alignments library
-
sample-consensus
Abstractions for sample consensus algorithms such as RANSAC
-
sortby
adds convenient sort functions for Iterators
-
ilattice
2 and 3-dimensional integer lattice math
-
permutate
Generic permutator that permutates singular and multiple lists
-
merkle_hash
Finds the hashes of all files and directories in a directory tree
-
glidesort
sorting algorithm
-
lattices
Lattice data types for simplifying distributed state by providing associativity, commutativity, and idempotence
-
hydroflow_lang
Hydroflow's Surface Syntax implementation
-
gaoya
Locality Sensitive Hashing Data Structures
-
rrt
Path finding using dual-RRT connect
-
liveterm
live-updating output for CLI apps
-
color_space
converting between color spaces and comparing colors
-
fuzzyhash
Pure Rust fuzzy hash implementation
-
clock-steering
Functionality for manual clock steering
-
hierarchical_hash_wheel_timer
A low-level timer implementantion using a hierarchical four-level hash wheel with overflow
-
mod_interface_meta
Protocol of modularity unifying interface of a module and introducing layers
-
seqalign
Sequence alignment using edit operations
-
permutator
Get a lexicographic cartesian product and lexicographic permutation at any specific index from data. Generate complete lexicographic cartesian product from single or multiple set of data…
-
magikitten
Easy Fiat-Shamirization using Meow
-
differential-dataflow
An incremental data-parallel dataflow platform
-
blake
hash function for Rust via FFI
-
acorn_prng
A no_std, 0 dependency, pseudo-random number generator based on the ACORN algorithm
-
csvbinmatrix
Binary matrix Compressed Sparse Vector
-
sacabase
Base types and functions for suffix arrays and longest substring search
-
seqdiff
Diff between two sequences
-
crc8
A CRC8 implementation
-
clockpro-cache
CLOCK-Pro cache replacement policy
-
keyphrases
Rapid Automatic Keyword Extraction (RAKE) implementation in Rust
-
moyo
Crystal Symmetry in Rust
-
permute
Generate permutations of vectors and slices in a memory-efficient and deterministic manner, using Heap's algorithm
-
pyinrs
type library that is as easy to use as Python built-in types
-
arrsac
From the paper "A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus"
-
radix
Convert any {u8, u16, u32, u64, u128, usize} to another radix
-
quickbacktrack
back tracking with customizable search for moves
-
actionable
An enum-based async framework for building permission-driven APIs
-
data_type
Collection of primal data types
-
suffix_array
Suffix array construction and searching algorithms for in-memory binary data
-
perlin2d
Lightning fast 2D Perlin Noise generator
-
hash_map_diff
Comparing changes between two HashMaps
-
implements
Macro to answer the question: does it implement a trait?
-
tectonic_engine_spx2html
The Tectonic engine that converts SPX output to HTML
-
rten-imageproc
Image tensor processing and geometry functions
-
redfa
Regular expression derivatives for creating DFAs
-
rdst
A flexible parallel unstable radix sort that supports sorting by any arbitrarily defined sequence of bytes
-
slice-utils
A collection of slice utils, like itertools
-
quadprogpp-sys
Raw FFI bindings to QuadProg++
-
bezier-nd
Bezier curve implementations using N-dimensional vectors
-
typing_tools
Collection of general purpose tools for type checking
-
test_tools
Tools for writing and running tests
-
find-simdoc
Time- and memory-efficient all pairs similarity searches in documents
-
simple_accumulator
accumulator for incremental statistical computations
-
dft
The package provides an algorithm to compute the discrete Fourier transform
-
leaky-cow
Leak the contents of a Clone-On-Write pointer
-
random-manager
Rust random manager
-
inspect_type
Diagnostic-purpose tools to inspect type of a variable and its size
-
highhash
High-speed hashing algorithms for Rust
-
interleaved-ordered
Combine two ordered iterators into one
-
fixed-sqrt
Square root for fixed-point numbers
-
yafnv
Fowler-Noll-Vo (FNV-1, FNV-1a) hash implementation for
u32/u64/u128
size, allno_std
andno_alloc
-
consistent_hash_ring
A flexible and efficient consistent hash ring
-
eq-float
Float wrappers with a total order (by setting NAN == NAN)
-
union-find
Struct and methods for union-find operation
-
miraland-nohash-hasher
std::hash::Hasher
which does not hash at all -
eudex
A blazingly fast phonetic reduction/hashing algorithm
-
woptions_runtime
Mechanism to define map of options for a fuction and its defaults laconically. Its runtime.
-
petgraph-gen
Graph generators for petgraph
-
syntree_layout
visualize trees from the 'syntree' crate