-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
embedded-alloc
A heap allocator for embedded systems
-
dlv-list
Semi-doubly linked list implemented using a vector
-
linked_hash_set
HashSet with insertion ordering
-
linked_list_allocator
allocator usable for no_std systems. It builds a linked list from the freed blocks and thus needs no additional data structures.
-
ghost-cell
Compile-time zero-cost borrow-checking of aliased references
-
uluru
fast, LRU cache implementation
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
cordyceps
Mycelium intrusive data structures
-
linkedbytes
linked list of Bytes and BytesMut
-
arcshift
Replacement for std::sync::Arc<T> that supports updating the value, with some caveats
-
bytesbox
ByteBox is a high-performance hash map implementation optimized for byte slices. It efficiently maps keys and values of type Vec<u8>, providing full ownership of the data. ByteBox uses…
-
slabigator
A linked list that doesn't do dynamic memory allocations
-
orx-selfref-col
SelfRefCol
is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees -
im-lists
Persistent unrolled linked lists and vlists
-
triple_arena
Regular, Chain, Surjection, and Ordered Arenas supporting non-Clone types, deletion, and more
-
linked_list_r4l
Linked lists that supports arbitrary removal in constant time
-
cdll
A circular doubly linked list
-
indexlist1
A doubly linked list, backed by a vector
-
iterlist
Linked list with a cursor based api
-
lrumap
A safe Least Recently Used (LRU) cache implementation with ordered and unordered support
-
rose_bloom
A concurrent growing element size linked list with stable pointers
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
exact-covers
Knuth's algorithm for solving the exact cover problem with colors
-
lazy-lru
A least-recently-used (LRU) cache implementation with lazy eviction
-
circ
Efficient referenced counted pointers for non-blocking concurrency
-
pincol
PINned COLlections: data structures utilizing
Pin
pointer -
deepmesa
fast Data Structures and Algorithms in Rust. Every data structure is hand crafted for performance, well tested and has an extensive API.
-
linked-vector
A hybrid linked list and vector data structure
-
rblist
A block-based, non-circular double-linked list implementation for Rust
-
llist
Lisp-style singly-linked list
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
stackstack
A singly linked list intended to be chained along stack frames
-
fwdlist
A simply linked (forward) list
-
listfree
lockfree prepend-only list
-
smallobjectpool
A small object pool for Rust
-
substack
Stackbound iterable linked list for heap-free recursive algorithms
-
leaklist
concurrent, lock-free, singly-linked list
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
dgunther2001-linked_list
A generic singly linked list
-
key-node-list
Doubly-linked list that stores key-node pairs
-
xcov
Knuth's Algorithm X (featuring dancing links) for solving exact cover problems
-
easy_linked_list
easy linked list is easy to work
-
fplist
An immutable, persistent, singly-linked list
-
hedel-rs
A Hierarchical Doubly Linked List
-
obj-pool
object arena
-
rulloc
General purpose memory allocator
-
cycle_cursor
Cyclic cursor implementation over generic iterators
-
linked_lists
Different types of linked lists
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
tlist
Type-level linked lists (of types) and type-level 'functions' to manipulate them. Because TList is implemented using GATs, usage is very ergonomic.
-
containerof
Macros and traits facilitating the use of intrusive structures in Rust
-
pin-list
A safe
Pin
-based intrusive doubly linked list -
leetcode_prelude
Some useful macros and definition for exercising in leetcode
-
linked-syntax-tree
A doubly-linked syntax tree
-
tsil_cev
LinkedList on Vec
-
dynamic-list
A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
-
listpack
Rust wrapper for the "listpack" data structure created and maintained for Redis
-
secured_linked_list
A cryptographically secured and provable linked list
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
linked-list
An alternative implementation of std::collections::LinkedList
-
coding_pk
pk for coding solution
-
c_linked_list
handling NULL-terminated C linked lists
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
allocvec
A vector type that preserves the index of every inserted element
-
cons-rs
containing a Cons data structure
-
simple_linked_list
A singly linked list made using smart pointer
-
rustgym
solutions
-
unrolled-linked-list
unrolled linked list in rust
-
ds-list
singly linked list and a doubly linked list (with sentinel node)
-
mini-linked-list
A package containing a minimal i32 LinkedList implementation
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
doubly
linked lists in rust
-
nexum
collection of commonly used data structures
-
llq
Wait-free SPSC linked-list queue with individually reusable nodes
-
concache
A fast, concurrent, shared hash map
-
linked_lists_rs
various data structures using linked lists in rust
-
atlist-rs
LinkedList which is allowed to insert/remove element by immutable iterator.Adding, removing and moving the elements within the list or across several lists does not invalidate the iterators or references…
-
linked_list_c
Safely work with c compatible linked lists
-
tdf_utils
such as tree
-
open_linked_list
A linked list which allows unsafely mutating, removing, and adding elements in the middle of the list through a pointer
-
ati
Introduces the
At
trait, which allows collections to be indexed byu|i{8,16,32,64,128}
andisize
. Supports Python-like negative index, where -1 is last element. -
orml-utilities
Various utilities including
FixedU128
andLinkedList
-
concurrent-list
An append-only, single-writer multi-reader unrolled linked list
-
indexlist
A doubly linked list, backed by a vector
-
rust_linked_list
various data structures using linked lists in rust
-
dsll
Fast Thread Safe Doubly Sorted Linked List
-
gvc-sys
graphviz rust bindings
-
moonlight_collections
Collections for Rust
-
just_linked
fast linked list;give you a different feeling!
-
qmap
LinkedHashMap alternative using nested VecDeque as LinkedList replacement
-
blist
A deque implemented as a hybrid linked-list-of-arrays
-
uell
A bumpalo-based Unrolled Exponential Linked List
-
unlink
Lock free linked list
-
const_list
A tiny linked list usable in const contexts
-
double_linkedlist
double linked list
-
illist
An indexable linked list implementation backed by a Vec
-
ixlist
The “ixlist” is a linked list in a vector, or if you want a list in a pond or an arena-allocated linked index-chasing fest. Implements a queue interface and a cursor.
-
xor_list
An xor doubly-linked list
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
vec-arena
object arena
-
rustgym-gvc
generate svg for some data structure in rustgym
-
pi_tree
A tree structure implemented by dense memory linked list
-
linked_lista
LinkedList data structure
-
matecito-dll
Doubly Linked List backing Matecito
-
r-collections
Created some collection example LinkedList, Stack and Queue
-
rustgym-testcpp
rustgym cpp solutions
-
stack_list
A heapless linked-list with no-std compatibility
Try searching with DuckDuckGo.