Trie Maps

The trie_map class is an associative container that stores multiple key-value pairs similar to std::map, but the key-value pairs are stored in a trie structure to optimize for prefix searches.

Another data structure similar to trie_map is packed_trie_map, which provides search API nearly identical to that of trie_map but is immutable once created. Instead, packed_trie_map stores all of its content in a contiguous memory region to improve memory locality, and also supports serialization of its state to an external buffer.

• Populating trie_map
• Creating packed_trie_map from trie_map
• Using packed_trie_map directly
• Saving and loading packed_trie_map
• Saving packed_trie_map with custom value type
• API Reference