Trie树分享
- 12. 搜索算法中的XTrie class Dict class DoubleArrayTrie class DADLTrie (Double Array Double Linkedlist) (充分利用空闲单元,而使用了双向链表) class DoubleTrie (双向Trie) class Xtrie m_pTrie = new b2bmlr::DoubleTrie(); m_pTrie->add((b2bmlr::DictKeyT*)pKey, nKeyLen, m_nDateSize + 1); intnOffset = m_pTrie->match((b2bmlr::DictKeyT*)pKey, nKeyLen);