* Iterators */

* Return nullptr if none. */

* @copydoc longest_prefix_ks(const CharT* key, size_type key_size) */

* @copydoc equal_prefix_range_ks(const CharT* prefix, size_type prefix_size) */

* @copydoc erase_prefix_ks(const CharT* prefix, size_type prefix_size) */

* Capacity */

* Iterators */

* @see m_child_of_char */

* Capacity */

* Return an iterator pointing to the key entry if presents or, if not there, * to the position past the last element of the bucket. Return end() if

* Iterators */

* Capacity */

* Burst policy */

* Modifiers */

* @copydoc emplace_ks(const CharT* key, size_type key_size) */

* Iterators */

* Return nullptr if none. */

* Get the next_child that come after current_child. Return nullptr if no * next child. */

* Modifiers */

* Iterators */

* Iterators */

* Burst policy */

* @copydoc equal_prefix_range_ks(const CharT* prefix, size_type prefix_size) */

* Erase has an amortized O(1) runtime complexity, but even if it removes the * key immediately, it doesn't do the same for the associated value T.

* @copydoc longest_prefix_ks(const CharT* key, size_type key_size) */

* Hash policy */

* Call shrink_to_fit() on each hash node of the hat-trie to reduce its size. */

* Bucket interface */

* Modifiers */