Results for circular_list

A high-performance Circular Doubly Linked List implementation in Rust

A circular doubly linked list implementation using Rc<T> and RefCell<T>

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.

Support for two-dimentional stacks for the Rust programming language

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.

A circular doubly linked list

Trees methods for linksplatform

rustgym solutions

A block-based, non-circular double-linked list implementation for Rust.

An intrusive list with lock-free insertion.

Lock-free circular ring of intrusive ref-counted nodes plus shared cursors.

Rust task runner and build tool.