Rust library for programming contest
-
Updated
Nov 5, 2022 - Rust
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
Rust library for programming contest
Demonstration of a branded graph structure with safe and fast self-references.
A queue for unique indices with constant-time lookup and removal backed by Vec
Rust Solutions of All Leetcode Problems (Weeky update)
A Rust implementation of an inversion list (and map), a data structure that describes a set of non-overlapping ascending integer ranges.
data structures & algorithms
Deterministic Finite-State Automata Library for Rust, written in L1
Lock-free resizable concurrent hash table
leetcode solutions in rust, based on @aylei's https://github.com/aylei/leetcode-rust
Radix heap library written in Rust
Rust library that introduces macros to represent and use types that can be converted either From or TryInto the given types
Splay tree implementation in rust
Rust library that provides `Opt<T>` as an alternative to `Option<T>`. This is advantageous when: 1. the generic type, `T`, is expensive to allocate, and 2. mutation between `None` and `Some(...)` is frequent.