-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
earcutr
port of MapBox's earcut triangulation code to Rust language
-
dlv-list
Semi-doubly linked list implemented using a vector
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
uluru
fast, LRU cache implementation
-
slabigator
A fixed-capacity linked list with stable element addressing and no dynamic allocations
-
embed-collections
A collection of memory efficient and intrusive data structures
-
linked_list_r4l
Linked lists that supports arbitrary removal in constant time
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
im-lists
Persistent unrolled linked lists and vlists
-
tether-map
Order-preserving linked hash map with O(1) reordering
-
data_structure
implementing and managing common data structures
-
platform-trees
Trees methods for linksplatform
-
key-node-list
Doubly-linked list that stores key-node pairs
-
grabapl
graph-based programming languages, with pluggable type systems and a focus on visible intermediate states
-
rose_bloom
A concurrent growing element size linked list with stable pointers
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
doubly
Doubly-linked lists in Rust
-
array_list
A dynamic container that combines the characteristics of a Vec and a LinkedList
-
circular_doubly_linked_list
A high-performance Circular Doubly Linked List implementation in Rust
-
once-list2
A single linked list which is backed by
OnceCell. You can append the value to the non-mutableOnceList. -
linked-list
An alternative implementation of std::collections::LinkedList
-
ax-linked-list-r4l
Linked lists that supports arbitrary removal in constant time
-
ottavino-gc-arena
safe, incrementally garbage collected arenas (updated fork of gc-arena)
-
intrex
Intrusive doubly-linked lists with items addressed by indices
-
double_linked_list
High-performance doubly-linked list with smart pointer support and memory pool optimization
-
onnx_graph
ONNX graph parser and execution engine for deep neural networks
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
listfree
lockfree prepend-only list
-
pin-list
A safe
Pin-based intrusive doubly linked list -
eldek-tad
A project for learning Abstract Data Types (ADTs) in Rust. Heavily inspired by Java's implementation.
-
rusty_list
A no_std compatible, intrusive doubly linked list implementation
-
linked-vector
A hybrid linked list and vector data structure
-
monadic
macros to define Haskell style monadic action blocks for IntoIterators, Reader, Writer, State, and macros for the transformers ReaderT and WriterT over Vec, LinkedList and VecDeque
-
fwdlist
A simply linked (forward) list
-
light-indexed-array
indexed (and concurrent) Merkle tree in Rust
-
bwd
Backwards linked-lists
-
iterlist
Linked list with a cursor based api
-
fplist
An immutable, persistent, singly-linked list
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
graphix-package-list
A dataflow language for UIs and network programming, singly linked list package
-
sorted-linked-list
Sorted linked list crate
-
lunaris_engine
A collection of efficient algorithms implemented in Rust for real-world projects
-
fast-list
A doubly linked list using SlotMap for improved cache locality, and to solve the ABA problem
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
pb-atomic-linked-list
An atomic insert-only linked list
-
listpack
Rust wrapper for the "listpack" data structure created and maintained for Redis
-
rust-algo
rust algorithms
-
tsil_cev
LinkedList on Vec
-
containerof
Macros and traits facilitating the use of intrusive structures in Rust
-
hedel-rs
A Hierarchical Doubly Linked List
-
hkt-pin-list
Self managed HKT intrusive linked list
-
secured_linked_list
A cryptographically secured and provable linked list
-
llist
Lisp-style singly-linked list
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
structures
collection data structures
-
uell
A bumpalo-based Unrolled Exponential Linked List
-
pinlist
a safe and easy version of intrusive linked lists
-
llq
Wait-free SPSC linked-list queue with individually reusable nodes
-
vecless
A minimal, Vec-free, singly linked list with Display support and ergonomic APIs
-
unrolled-linked-list
unrolled linked list in rust
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
cons-rs
containing a Cons data structure
-
mini-linked-list
A package containing a minimal i32 LinkedList implementation
-
nexum
collection of commonly used data structures
-
smallobjectpool
A small object pool for Rust
-
substack
Stackbound iterable linked list for heap-free recursive algorithms
-
rs-bush
Bush data structure
-
c_linked_list
handling NULL-terminated C linked lists
-
sento
A lock-free, append-only atomic pool
-
linked_lists_rs
various data structures using linked lists in rust
-
rust-ds
Custom data structures crate for Rust
-
cutoff_list
A linked-list structure where each element tracks how many predefined "cutoff points" precede or coincide with its position in the list sequence
-
leaklist
concurrent, lock-free, singly-linked list
-
stackstack
A singly linked list intended to be chained along stack frames
-
generic-cursors
A generic way to mutably traverse acyclic recursive data structures
-
linked_list_c
Safely work with c compatible linked lists
-
rblist
A block-based, non-circular double-linked list implementation for Rust
-
verter
A file format for fast incremental modifications
-
dsa_sport
revision material for undergrads
-
dgunther2001-linked_list
A generic singly linked list
-
easy_linked_list
easy linked list is easy to work
-
ati
Introduces the
Attrait, which allows collections to be indexed byu|i{8,16,32,64,128}andisize. Supports Python-like negative index, where -1 is last element. -
linked-hash-map-rs
A linked hash map
-
linked_lists
Different types of linked lists
-
indexlist
A doubly linked list, backed by a vector
-
swap-n
an n argument extension to std::mem::swap
-
lineage
A cell to replace the contained value while it may still be borrowed
-
orml-utilities
Various utilities including
FixedU128andLinkedList -
dsll
Fast Thread Safe Doubly Sorted Linked List
-
strings
String utilities, including an unbalanced Rope
-
mutcrab
written in rust that contains various classic data structures
-
tdf_utils
such as tree
-
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…
-
moonlight_collections
Collections for Rust
-
just_linked
fast linked list;give you a different feeling!
-
filestructure-rs
sloppily create a filestructure in memory and write it to disk
-
ds-list
singly linked list and a doubly linked list (with sentinel node)
-
qmap
LinkedHashMap alternative using nested VecDeque as LinkedList replacement
-
static-linkedlist
A linked list implementation on a static array. Intended for use in environments without dynamic memory allocation.
-
const_list
A tiny linked list usable in const contexts
-
unlink
Lock free linked list
-
cycle_cursor
Cyclic cursor implementation over generic iterators
-
arena-graph
a questionable library for arena-allocated graphs
-
simple_linked_list
A singly linked list made using smart pointer
Try searching with DuckDuckGo.