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

  /packages/inputmethods/PinyinIME/jni/share/
dicttrie.cpp 128 if (fwrite(root_, sizeof(LmaNodeLE0), lma_node_num_le0_, fp)
187 root_ = static_cast<LmaNodeLE0*>
188 (malloc(lma_node_num_le0_ * sizeof(LmaNodeLE0)));
210 if (fread(root_, sizeof(LmaNodeLE0), lma_node_num_le0_, fp)
316 LmaNodeLE0 *node) {
372 // from LmaNodeLE0 (root) to LmaNodeLE0
378 // from LmaNodeLE0 to LmaNodeGE1
403 LmaNodeLE0 *node = root_;
408 LmaNodeLE0 *son = root_ + son_pos
    [all...]
dictbuilder.cpp 193 lma_nodes_le0_ = new LmaNodeLE0[kMaxSpellingNum + 1];
213 memset(lma_nodes_le0_, 0, sizeof(LmaNodeLE0) * (kMaxSpellingNum + 1));
598 dict_trie->root_ = new LmaNodeLE0[lma_nds_used_num_le0_];
610 sizeof(LmaNodeLE0) * lma_nds_used_num_le0_);
815 LmaNodeLE0 *son_1st_le0 = NULL; // only one of le0 or ge1 is used
818 (static_cast<LmaNodeLE0*>(parent))->son_1st_off =
824 (static_cast<LmaNodeLE0*>(parent))->num_of_son =
827 (static_cast<LmaNodeLE0*>(parent))->son_1st_off =
833 (static_cast<LmaNodeLE0*>(parent))->num_of_son =
867 LmaNodeLE0 *node_cur_le0 = NULL; // only one of them is vali
    [all...]
  /packages/inputmethods/PinyinIME/jni/include/
dictdef.h 111 struct LmaNodeLE0 {
dicttrie.h 62 LmaNodeLE0* root_; // Nodes for root and the first layer.
65 // An quick index from spelling id to the LmaNodeLE0 node buffer, or
110 // Given a LmaNodeLE0 node, extract the lemmas specified by it, and fill
114 LmaNodeLE0 *node);
dictbuilder.h 49 LmaNodeLE0 *lma_nodes_le0_;
134 // parent can be a member of LmaNodeLE0 or LmaNodeGE1

Completed in 19 milliseconds