Show HN: Integer Map Data Structure

1 points by billziss 3 years ago · 0 comments · 1 min read

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`).

No comments yet.