HomeSort by relevance Sort by last modified time
    Searched refs:DictTrie (Results 1 - 7 of 7) sorted by null

  /packages/inputmethods/PinyinIME/jni/command/
pinyinime_dictbuilder.cpp 22 #include "../include/dicttrie.h"
31 DictTrie* dict_trie = new DictTrie();
  /packages/inputmethods/PinyinIME/jni/share/
dicttrie.cpp 20 #include "../include/dicttrie.h"
28 DictTrie::DictTrie() {
47 DictTrie::~DictTrie() {
51 void DictTrie::free_resource(bool free_dict_list) {
86 inline size_t DictTrie::get_son_offset(const LmaNodeGE1 *node) {
90 inline size_t DictTrie::get_homo_idx_buf_offset(const LmaNodeGE1 *node) {
95 inline LemmaIdType DictTrie::get_lemma_id(size_t id_offset) {
104 bool DictTrie::build_dict(const char* fn_raw, const char* fn_validhzs)
    [all...]
dictbuilder.cpp 23 #include "../include/dicttrie.h"
506 DictTrie *dict_trie) {
597 // Move the node data and homo data to the DictTrie
matrixsearch.cpp 73 dict_trie_ = new DictTrie();
    [all...]
  /packages/inputmethods/PinyinIME/jni/include/
dictbuilder.h 34 class DictTrie;
101 DictTrie *dict_trie);
dicttrie.h 28 class DictTrie : AtomDictBase {
34 // in the first layer of DictTrie, it equals to
157 DictTrie();
158 ~DictTrie();
matrixsearch.h 22 #include "./dicttrie.h"
171 DictTrie* dict_trie_;
306 // in DictTrie has no son, it is not nccessary to keep the new DMI.
312 // If dmi == NULL, this function will extend the root node of DictTrie

Completed in 46 milliseconds