* Called on the hash table creation and on rehash. The number of buckets for * the table is passed in parameter. This number is a minimum, the poli

* Go back up in the tree to get the current_trie_node_child sibling. * If none, try to go back up more in the tree to check the siblings of the

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

* Return the number of CharT in m_buffer. As the size of the buffer is not * stored to gain some space, the method need to find the EOF marker and

* Return an always valid pointer to a static empty array_bucket. */

* TODO Avoid the virtual to economize 8 bytes. We could use a custom * deleter in the std::unique_ptr<anode> we use (as we know if an anode is a