Demonstration of a branded graph structure with safe and fast self-references.
-
Updated
Aug 23, 2023 - 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.
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
leetcode solutions in rust, based on @aylei's https://github.com/aylei/leetcode-rust
Splay tree implementation in rust
Radix heap library written 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.
A simple and flexible data-structure for configuration and state manipulation of plugins.
Study notes of 'Data structures and Algorithms in Rust'
Rust library for programming contest
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.
A tiny vector-like container allocated on the stack
Rust library that introduces macros to represent and use types that can be converted either From or TryInto the given types
Deterministic Finite-State Automata Library for Rust, written in L1