Range Minimum Query (RMQ) is used on arrays to find the position of an element with the minimum value between two specified indices.
A collection of succinct data structures supported by fast implementations of rank and select queries.
High-performance generic segment tree and lazy segment tree implementations in Rust for efficient range queries, range updates, and interval operations. Supports custom monoid operations with zero-cost abstractions.
Collection of basic algorithms for everyday development
Rmq using extensive tabulation
Bindings to libminimap2
Bindings to libminimap2
Inverted repeats finder
A highly parallel Perl 5 interpreter written in Rust
Rust bindings for the Listen Notes Podcast API
AI/Human task management system with file-based storage
Parted storage for large files to S3