Update the key for the value, it is public interface that works on &str

Build the double array trie from the given key value pairs

Delete the key from the trie, the public interface that works on &str

To return an iterator to iterate through the common prefix in the dictionary with the `key` passed in.

To check if `key` is in the dictionary.

To return the collection of the common prefix in the dictionary with the `key` passed in.

transfer the block at idx from the linked-list of `from` to the linked-list of `to`, specially handle the case where the destination linked-list is em

Reallocate more spaces so that we have more free blocks.

Require the dictionary to be sorted in lexicographical order

To return the list of words in the dictionary that has `key` as their prefix.

To return an iterator to iterate through the list of words in the dictionary that has `key` as their prefix.

For the case where only one free slot is needed

Mark an edge `e` as used in a trie node.

return the block at idx to the linked-list of `to`, specially handled if the linked-list is empty

Mark an edge `e` as free in a trie node.

push the `label` into the sibling chain

Collect the list of the children, and push the label as well if it is not terminal node.

Loop through the siblings to see which one reached the end first, which means it is the one with smaller in children size, and we should try to reloca

Delete the key from the trie, the internal interface that works on &[u8]

For the case where multiple free slots are needed.

pop a block at idx from the linked-list of type `from`, specially handled if it is the last one in the linked-list.

remove the `label` from the sibling chain.

resolve the conflict by moving one of the the nodes to a free block.

Update the key for the value, it is internal interface that works on &[u8] and cursor.