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/gDKdcyE January 25, 2024 at 05:58AM
Show HN: Integer Map Data Structure https://ift.tt/ISJtCYq
Reviewed by Manish Pethev
on
January 25, 2024
Rating:
No comments:
If you have any suggestions please send me a comment.