This is based on Phil Bagwell's Array Mapped Tree from "Fast And Space Efficient Trie Searches"
It supports unsigned integer keys (32, 64 or 128 bits) and has been specially optimised for the case where keys are somewhat monotonic.
-
Header only: the file
amt.his all you need -
ordered container
-
very fast - performance similar to hash table
-
mostly same interface as
std::map. However the value_type has both thekeyand thevalueconst. -
low memory usage