Cache aware and mem efficient data structures for rust
-
Updated
Apr 28, 2026 - Rust
#
intrusive-containers
Here are 11 public repositories matching this topic...
Examples of intrusive container templates in C++.
list queue tarjan mergesort red-black-tree heap dijkstra heapsort hash-table misra disjoint-set kruskal tarjan-algorithm mergesort-algorithm heapsort-algorithm dijkstra-algorithm kruskal-algorithm list-sort tree-sort intrusive-containers
-
Updated
Jan 14, 2019 - C++
A modern, C++17 compatible intrusive doubly-linked list implementation. This is a single-header, header-only library that provides efficient intrusive containers with sentinel circular list optimization
-
Updated
Jul 19, 2025 - C++
Header-only, composition-based, allocation-free double-linked list for C++11
-
Updated
Oct 5, 2021 - C++
An easy-to-support intrusively reference-counting smart pointer.
-
Updated
Apr 29, 2026 - Rust
CacheX is a high-performance cache server written in C and C++
-
Updated
Feb 25, 2025 - C++
Intrusive linked list
-
Updated
Feb 27, 2026 - C
CacheX is a high-performance cache server written in C and C++
-
Updated
Mar 4, 2025 - C++
Improve this page
Add a description, image, and links to the intrusive-containers topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the intrusive-containers topic, visit your repo's landing page and select "manage topics."