#data-structures

MCP server for spreadsheet analysis and editing. Slim, token-efficient tool surface designed for LLM agents.

A general purpose sum type with three cases: the enum `Among` with variants `Left`, `Middle` and `Right`. A three-way counterpart to `Either`, with `no_std`, `serde`, `futures` and `tokio` integrations.

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

A node-semver compliant semver implementation in Rust.

Rust crate for bitfields and bit-enums

Sharded concurrent map for Go: lock-based, zero allocations on store, built for high-churn data

Dogma for Rust.

The compliance-first database for industries where data integrity is non-negotiable.

An efficient fixed capacity vector with pinned element guarantees.

Data structures.

Weak hash tables for Rust

Succinct data structures using very efficient rank and select

Canonical blockchain->app event contract for the DIG Network — EventKind subscription enum + WalletEvent event enum + Cursor/EmittedEvent + EventEmitter/CatchUp traits. Pure leaf; emitter=dig-wallet-backend engine, consumers=dig-app/dig-node.

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

The embedded graph database that builds itself. Declarative linking rules, explainable derived edges, microsecond traversal. Rust core, Cypher subset, Python bindings.

A data structure to efficiently intern, cache and restore strings.

Lock-free SPSC FIFO ring buffer with direct access to inner data

FM-index for Rust

Buffered peek for `Read` and async readers (tokio, futures): inspect incoming bytes without consuming them. Useful for protocol detection, length-prefixed framing, and header inspection.

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

Token-efficient data serialization for LLM/AI. 50% fewer tokens than JSON, 93% better value/token. Rust, schema validation, LSP.

Correct-by-construction non-empty collections.

Compact, immutable string↔id indexes for huge catalogs: FST prefix/range/fuzzy + minimal-perfect-hash, from 1.3 B/key, zero-copy mmap load. Rust core, Python bindings.

SIEVE cache replacement policy for Rust.

Map data structure whose keys are stored as ranges

Collection of succinct data structures in Rust

LoraDB is a Rust-native embedded graph DB for AI agents, robotics, and systems reasoning over connected data.

PinnedVec trait defines the interface for vectors which guarantee that elements added to the vector are pinned to their memory locations unless explicitly changed.

Rust implementation of the DDSketch quantile sketch with python bindings