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

* Other */

* operator= */

* insert */

* insert */

Give the position in trie_node::m_children corresponding to the character c

* Bucket interface */

* Bucket interface */

* Return the bucket [0, bucket_count()) to which the hash belongs. * If bucket_count() is 0, it must always return 0. */

* Burst policy */

* Modifiers */

* Reset the growth policy as if it was created with a bucket count of 0. * After a clear, the policy must always return 0 when bucket_for_hash is

* Modifiers */

* Modifiers */

* Clear all the empty nodes from the tree starting from empty_node (empty for * a hash_node means that the array hash is empty, for a trie_node it

* Lookup */

* No difference compared to the insert method. Mainly here for coherence with * array_map. */

* Capacity */

* Capacity */

* Capacity */

* Return the size of the current entry in buffer. */

* Return a range containing all the elements which have 'prefix' as prefix. * The range is defined by a pair of iterator, the first being the begin

* Return a range containing all the elements which have 'prefix' as prefix. * The range is defined by a pair of iterator, the first being the begin