Fast Containers
High-performance header-only container library for C++23 on x86-64.
What's Included
B+Tree ( kressler::fast_containers::btree ) - Cache-friendly B+tree with SIMD search and hugepage support
( ) - Cache-friendly B+tree with SIMD search and hugepage support Dense Map ( kressler::fast_containers::dense_map ) - Fixed-size sorted array used internally by btree nodes
( ) - Fixed-size sorted array used internally by btree nodes Hugepage Allocators - Pooling allocators that reduce TLB misses and allocation overhead HugePageAllocator - Single-size allocator for uniform allocations MultiSizeHugePageAllocator - Multi-size pooling for variable-sized allocations (e.g., Abseil btree) PolicyBasedHugePageAllocator - Advanced control with shared pools
- Pooling allocators that reduce TLB misses and allocation overhead
Why This Library?
The B+tree implementation provides significant performance improvements over industry standards for large trees. For some workloads with large trees, we've observed:
vs Abseil B+tree: 2-5× faster across insert/find/erase operations
... continue reading