Description: Write the starting point is to do the trie before it can write files and can very easily mmap to memory, can be used to enter France search engine sub-word vocabulary, shared storage prefix supports up to two billion nodes. A simple thing can be when a Use hash table to find the time complexity is N* Log (256) N for the characters in length, key data for binary, value must be int type, can not be 0, because mmtrie_get ()/find () does not result in the situation is 0, if set value to 0 if its+1, out of time-1 enough.
- [TrieTree] - What is the Trie tree? Trie tree of the
File list (Check if you may need any files):
mmtrie.c
mmtrie.h
Download