Show HN: Integer Map Data Structure This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`). https://ift.tt/FYfCe0P January 25, 2024 at 05:58AM
Tags:
Hacker News