-
sysinfo
get system information such as processes, CPUs, disks, components and networks
-
hashlink
HashMap-like containers that hold their key-value pairs in a user controllable order
-
intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
leaky-bucket
A token-based rate limiter based on the leaky bucket algorithm
-
linked_hash_set
HashSet with insertion ordering
-
cordyceps
Mycelium intrusive data structures
-
earcutr
port of MapBox's earcut triangulation code to Rust language
-
sdd
Scalable lock-free delayed memory reclaimer
-
embedded-alloc
A heap allocator for embedded systems
-
buddy_system_allocator
A bare metal allocator that uses buddy system
-
resolvo
Fast package resolver written in Rust (CDCL based SAT solving)
-
index_list
A doubly linked list implemented in safe Rust using vector indexes
-
arcshift
Replacement for std::sync::Arc<T> that supports updating the value, with some caveats
-
google-logging2-cli
A complete library to interact with Logging (protocol v2)
-
google-gan1_beta1
A complete library to interact with gan (protocol v1beta1)
-
uluru
fast, LRU cache implementation
-
blondie
Collect CPU callstack samples from a windows process
-
jrsonnet-gcmodule
Cyclic garbage collection inspired by CPython's gc implementation
-
linkedbytes
linked list of Bytes and BytesMut
-
nexus-collections
Slab-backed intrusive collections for low-latency systems
-
embed-collections
A collection of memory efficient and intrusive data structures
-
async-backtrace
Efficient, logical 'backtraces' of async tasks
-
orx-linked-list
A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations
-
evictor
generic caching with configurable eviction policies
-
collection_tools
General purpose tools to manipulate collections( containers like Vec/HashMap/HashSet )
-
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.
-
kurbu5-rs
Safe, idiomatic Rust API for writing MIT Kerberos non-KDB plugin modules
-
orx-selfref-col
SelfRefCol is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees
-
slabigator
A fixed-capacity linked list with stable element addressing and no dynamic allocations
-
dlv-list
Semi-doubly linked list implemented using a vector
-
ordered_hash_map
HashMap which preserves insertion order
-
ghost-cell
Compile-time zero-cost borrow-checking of aliased references
-
pie_core
A high-performance, index-based data structure toolkit. Provides an arena allocator (ElemPool) used to build a cache-friendly PieList (doubly-linked list) and FibHeap (priority queue).
-
nexy
Multi-network server for the Nex protocol
-
linkbreakers
Official Rust SDK for the Linkbreakers API
-
alloc_cat
allocator for small-to-tiny Wasm projects in rust
-
google-mybusinessplaceactions1-cli
A complete library to interact with My Business Place Actions (protocol v1)
-
racer
Code completion for Rust
-
deepmesa-collections
A collection of data structures and algorithms designed for performance
-
checksmix
A simplified MIX simulator - Donald Knuth's hypothetical computer for teaching and learning assembly language programming
-
ryft-pjrt
Ryft bindings for PJRT
-
classicube-sys
Rust C bindings for ClassiCube
-
tether-map
Order-preserving linked hash map with O(1) reordering
-
linked_list_r4l
Linked lists that supports arbitrary removal in constant time
-
scc2
High-performance containers and utilities for concurrent and asynchronous programming
-
im-lists
Persistent unrolled linked lists and vlists
-
hrn
Manage plans (lists) and notes
-
http-serde-ext
serde support for http crate types Request, Response, Uri, StatusCode, HeaderMap, Method, in Option or other collections
-
platform-trees
Trees methods for linksplatform
-
data_structure
implementing and managing common data structures
-
capped_collections
Collections with compile-time set capacities
-
xutex
an extremely fast async mutex with alternative sync API
-
cloudreve-api
interacting with Cloudreve API
-
fixed-cache
A minimalistic, lock-free, fixed-size cache
-
bllist
Persistent block lists (fixed & dynamic) with reclamation and checksums, built on top of bstack
-
cantrip
Practical extension methods for standard Rust collections
-
cfg-noodle
A nonvolatile configuration storage service
-
slabbin
An efficient slab allocator with stable addresses
-
components-arena
creating complex domain-specific self-referential data structures
-
wavltree
An intrusive Weak AVL Tree
-
cdf
decoding and encoding NASA CDF files
-
google-analytics3-cli
A complete library to interact with analytics (protocol v3)
-
grabapl
graph-based programming languages, with pluggable type systems and a focus on visible intermediate states
-
lazy-lru
A least-recently-used (LRU) cache implementation with lazy eviction
-
linkly-ai-cli
CLI for Linkly AI - search your local documents from the terminal
-
rose_bloom
A concurrent growing element size linked list with stable pointers
-
uefi-async
A lightweight asynchronous executor for UEFI environments
-
key-node-list
Doubly-linked list that stores key-node pairs
-
procmachines
State machines in the procedural style
-
pf-rs
FreeBSD lib to access OpenBSD's implementation of the PF (Packet Filter) directly via /dev/pf
-
permanager
Scan and list GitHub permanent links (blob/<sha40>) in your source code
-
rustycache
caching library for Rust
-
array-linked-list
A data structure, which combines the advantages of dynamic arrays and linked lists
-
hashlru
LRU cache
-
late
API reference for Zernio. Authenticate with a Bearer API key. Base URL: https://zernio.com/api
-
doubly
Doubly-linked lists in Rust
-
array_list
A dynamic container that combines the characteristics of a Vec and a LinkedList
-
code-typing
A terminal-based typing game for Rust programmers. Practice typing real Rust code snippets to improve your coding speed and accuracy.
-
buddy-alloc
memory allocator for no-std Rust, used for embedded environments
-
skippy
Highly flexible worst-case O(log n) intrusive skip list
-
suggest
A minimal library to provide similar name suggestions like "Did you mean?"
-
bump-stack
A stack implementation using bump allocation
-
plain-ds
Plain data structures
-
circular_doubly_linked_list
A high-performance Circular Doubly Linked List implementation in Rust
-
wakerset
no_std, no_alloc storage of Wakers embedded in the Future type
-
clustered-fast-trie
Ordered integer set (u32/u64/u128) for data with locality. O(1) range counting. Stable O(log log U) latency.
-
lrumap
A safe Least Recently Used (LRU) cache implementation with ordered and unordered support
-
once-list2
A single linked list which is backed by
OnceCell. You can append the value to the non-mutableOnceList. -
ax-linked-list-r4l
Linked lists that supports arbitrary removal in constant time
-
exact-covers
Knuth's algorithm for solving the exact cover problem with colors
-
veilid-hashlink
Fork of hashlink modified to meet the needs of the Veilid project. HashMap-like containers that hold their key-value pairs in a user controllable order
-
zernio
API reference for Zernio. Authenticate with a Bearer API key. Base URL: https://zernio.com/api
-
linked-list
An alternative implementation of std::collections::LinkedList
-
intrex
Intrusive doubly-linked lists with items addressed by indices
-
ax_slab_allocator
Slab allocator for
no_stdsystems. Uses multiple slabs with blocks of different sizes and a linked list for blocks larger than 4096 bytes -
better_comprehension
collection and iterator comprehensions for Rust
-
counting_sort
Counting sort implementation for Iterators
-
creature_feature
Composable n-gram combinators that are ergonomic and bare-metal fast
-
ottavino-gc-arena
safe, incrementally garbage collected arenas (updated fork of gc-arena)
-
wiki-tui
easy to use Wikipedia Text User Interface
-
vellaveto-audit
Tamper-evident audit logging with hash chains and Ed25519 checkpoints
-
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
-
listfree
lockfree prepend-only list
-
cpp_map
C++ std::map emulator
-
pin-list
A safe
Pin-based intrusive doubly linked list -
dndtree
DND-Tree dynamic connectivity data structure
-
hattrie
A high-performance, cache-conscious, ordered map for string keys, based on the HAT-trie paper
-
intrusive-lru-cache
An LRU cache implementation using intrusive data structures
-
deferred-cell
A single-assignment, weak reference wrapper for cyclic node graphs with late initialization
-
slosh3d
Cross-platform GPU 3D Material Point Method implementation
-
unsafe_list
基于 linux 的 list 实现
-
potential
PubSub lib with sync and async API
-
mutual
useful atomic objects for concurrent operations
-
good_memory_allocator
A blazingly fast and memory efficient memory allocator to be used in
no_stdenvironments -
synoema-codegen
Synoema — programming language optimized for LLM code generation
-
pi_slotmap_tree
A tree structure implemented by dense memory linked list
-
byodb-rust
Build Your Own Database in Rust!
-
algs4_rs
Rust implementations for the algorithms and clients in the text book "Algorithms, 4th Edition" by Robert Sedgewick and Kevin Wayne
-
static-rc
Compile-time reference counting
-
readmd
A TUI markdown viewer with file browser, table of contents, and syntax highlighting
-
embed-struct
embedding data structures
-
slosh2d
Cross-platform GPU 2D Material Point Method implementation
-
rarena-allocator
Lock-free ARENA allocator which can be used in both memory and on-disk
-
allocvec
A vector type that preserves the index of every inserted element
-
fast-bpe-rs
Fast Byte Pair Encoding (BPE) tokenizer with Python bindings powered by PyO3
-
macron-collections
Creates a new instance of std collections: HashMap, HashSet, BTreeMap, BTreeSet, VecDeque, LinkedList and BinaryHeap
-
triple_arena
Regular, Chain, Surjection, and Ordered Arenas supporting non-Clone types, deletion, and more
-
sync-arena
thread-safe arena allocator
-
rusty_list
A no_std compatible, intrusive doubly linked list implementation
-
eldek-tad
A project for learning Abstract Data Types (ADTs) in Rust. Heavily inspired by Java's implementation.
-
chrome-cache-parser
Chrome cache parser
-
linked-vector
A hybrid linked list and vector data structure
-
char-list
A persistent string type with the same API as a linked-list of characters
-
fwdlist
A simply linked (forward) list
-
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
-
convenient-skiplist
Convenient and Performant SkipList with serde support
-
light-indexed-array
indexed (and concurrent) Merkle tree in Rust
-
nt-list
Compatible, type-safe, and idiomatic Rust implementations of Windows NT Linked Lists
-
lru-st
A package providing a Vec based doubly linked list implementation and related data structures
-
dsa_abc
basic data structure and algorithms. Usability and performance is priority
-
urcu2
Safe API to liburcu
-
manylists
Many lists
-
louvre
A Robust Triangulation Algorigthm
-
rc-dlist-deque
Doubly-linked list based on std::Rc
-
cdll
A circular doubly linked list
-
linked-hash-table
A linked hash table implementation for insert-order iteration and efficient lookups
-
leetcode-trees-rs
Tree Node LeetCode problems
-
ministd
Rewriting Rust's standard library for fun (no_std)
-
median
efficient O(n) median filter
-
bwd
Backwards linked-lists
-
iterlist
Linked list with a cursor based api
-
cyclic_list
a doubly-linked list with owned nodes, implemented as a cyclic list
-
fplist
An immutable, persistent, singly-linked list
-
suiron-rust
A fast Prolog-like inference engine
-
generational_token_list
A doubly-linked list backed by generational-arena
-
unique-pointer
UniquePointerdata structure that makes extensive use ofunsaferust to provide a shared pointer across other data structures -
graphix-package-list
A dataflow language for UIs and network programming, singly linked list package
-
obj-pool
object arena
-
rulloc
General purpose memory allocator
-
chainbuf
Fast chained buffers
-
foyer-intrusive-collections
Intrusive collections for Rust (linked list and red-black tree)
-
recursive_reference
way to walk on recursive structures easily and safely
-
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…
-
sorted-linked-list
Sorted linked list crate
-
rcu_list
a lockless concurrent list implementation
-
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
-
tlist
Type-level linked lists (of types) and type-level 'functions' to manipulate them. Because TList is implemented using GATs, usage is very ergonomic.
-
ensf594-project-mmap
Final project for the ENSF 594 course of the University of Calgary, summer 2022
-
circ
Efficient referenced counted pointers for non-blocking concurrency
-
nerdondon-hopscotch
A skip list
-
indexlist1
A doubly linked list, backed by a vector
-
tagged_ufs
A union-find-set implementation, in which sets can be associated with tags. When two sets are united, their tags are merged
-
pb-atomic-linked-list
An atomic insert-only linked list
-
yaambo
concurrent skip lists
-
listpack
Rust wrapper for the "listpack" data structure created and maintained for Redis
-
treiber_stack
A lockless, thread-safe, atomic linked-list
-
rust-algo
rust algorithms
-
leetcode_prelude
Some useful macros and definition for exercising in leetcode
-
tsil_cev
LinkedList on Vec
-
taskchain
A block-based, non-circular double-linked list implementation for Rust
-
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
-
llist
Lisp-style singly-linked list
-
secured_linked_list
A cryptographically secured and provable linked list
-
dyn_list
A linked list that can hold dynamically sized values in its nodes
-
compactmap
Compact Vec-based map that choses assigns IDs for your values on it's own. Very similar to Slab.
-
structures
collection data structures
-
pinlist
a safe and easy version of intrusive linked lists
-
uell
A bumpalo-based Unrolled Exponential Linked List
-
vecless
A minimal, Vec-free, singly linked list with Display support and ergonomic APIs
-
llq
Wait-free SPSC linked-list queue with individually reusable nodes
-
unrolled-linked-list
unrolled linked list in rust
-
ztimer
A block-based, non-circular double-linked list implementation for Rust
-
rust_list
Singly linked list in Rust, with macros for easy instantiation
-
cdl-list-rs
A circular doubly linked list implementation using Rc<T> and RefCell<T>
-
sfn-machine
state machine for tasks orchestration and chaining using a linked list to guarantee coherence and flexibility when a different procedure is desired
-
mini-linked-list
A package containing a minimal i32 LinkedList implementation
-
varstack
A call-stack based singly-linked list
-
cons-rs
containing a Cons data structure
-
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
-
sento
A lock-free, append-only atomic pool
-
c_linked_list
handling NULL-terminated C linked lists
-
linked_lists_rs
various data structures using linked lists in rust
-
rust-ds
Custom data structures crate for Rust
-
stackstack
A singly linked list intended to be chained along stack frames
-
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
-
generic-cursors
A generic way to mutably traverse acyclic recursive data structures
-
linked_list_c
Safely work with c compatible linked lists
-
palloc
portable linked-list allocator for baremetal systems
-
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
-
cons-list
An immutable singly-linked list, as seen in basically every functional language
-
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
-
rust_linked_list
various data structures using linked lists in rust
-
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
Try searching with DuckDuckGo or on crates.io.