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.

mmtrie.c
mmtrie.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．