#algorithms

SIMD-accelerated operations

Fast fourier transform in Rust

Various header libraries mostly future std lib, replacements for(e.g. visit), or some misc

OxiFFT is a 99% Rust port of FFTW3, the world's most respected FFT library. It brings FFTW's sophisticated algorithms, planning system, and performance optimizations to the Rust ecosystem while leveraging Rust's safety guarantees and modern language features.

该仓库未发布描述。

📷 📐 Geometric models of cameras for photogrammetry

Geometric models of OpenCV/ROS cameras for photogrammetry

A port of the CRC-32 algorithm to Rust

Rust traits I write way too often

Succinct data structures using very efficient rank and select

算法竞赛模板库 by 灵茶山艾府 💭💡🎈

FM-index for Rust

Rust library for popular skill rating algorithms like Elo, Glicko-2, TrueSkill and many more.

The CDS HEALPix library in Rust (WebAssembly, Python, ...)

OxiBLAS is a production-grade, pure Rust implementation of BLAS (Basic Linear Algebra Subprograms) and LAPACK (Linear Algebra PACKage). Designed as the foundational linear algebra library for the SciRS2 scientific computing ecosystem.

Log Storage for Raft

Rust bindings for GEOS

Small, wasm-friendly, zero-dependencies Ed25519 and X25519 implementation for Rust.

SIEVE cache replacement policy for Rust.

Numeric traits for generic mathematics in Rust

A SIMD-accelerated Adler-32 hash algorithm implementation.

Rust implementation of the DDSketch quantile sketch with python bindings

A collection of utility C# extension methods.

Super-fast float parser in Rust. Fork of fast-float.

Fastest bloom filter in C++/Go/Rust/Java/C#

World's fastest generic CRC calculator for all known CRC-16, CRC-32, and CRC-64 variants, as well as bring-your-own custom parameters, using SIMD intrinsics, which can exceed 100GiB/s on modern systems. Supplies a C/C++ compatible library for use with languages other than Rust.

MOC library in Rust; used in MOCPy, a CLI, a WASM lib, ...

Low-latency hash map using minimal perfect hash functions and compact encoding.

An Elixir library for Graph Algorithms and Network Analysis

A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.