A high-performance Circular Doubly Linked List implementation in Rust
A circular doubly linked list implementation using Rc<T> and RefCell<T>
A circular doubly linked list
A block-based, non-circular double-linked list implementation for Rust.
Trees methods for linksplatform
An efficient, zero-allocation circular intrusive doubly linked list in Rust. Features safe, lifetime-bounded iterators, unified ownership validation using a link_state flag to prevent node reuse bugs across multiple lists, and idiomatically optimized low-level pointer mechanics without any external heap allocation overhead.
A hairy circular linked list for no_std environments.
circular linked list
rustgym solutions
Low-level, LevelDB-compatible sharded LRU cache engine for bitcoin-rs, implementing intrusive LRU lists, a custom hash table, and precise refcount-based eviction with manual memory management.
Final project for the ENSF 594 course of the University of Calgary, summer 2022
port of MapBox's earcut triangulation code to Rust language