2 posts with tag data structure

• cache
• set-associative-cache
• data structure
• optimization

How set-associative caches trade global eviction freedom for bounded, cache-line-friendly lookups, and how TigerBeetle's CacheMap and a SIMD search optimization (PR #3200) put that trade-off to work.

• zig
• design-patterns
• data structure

Shows that data-structure choice must be driven by access pattern, not category: a custom bitset with SBO and virtual-mutation hashing is strongly justified for a hot-path DFS that repeatedly clones, hashes, and probes without committing, while the standard-library DynamicBitSet is the right tool for a simple one-shot debug assertion