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

  /packages/inputmethods/PinyinIME/jni/include/
spellingtrie.h 29 struct SpellingNode {
30 SpellingNode *first_son;
93 SpellingNode* root_;
97 SpellingNode* dumb_node_;
101 SpellingNode* splitter_node_;
104 SpellingNode* level1_sons_[kValidSplCharNum];
124 void free_son_trie(SpellingNode* node);
130 SpellingNode* construct_spellings_subset(size_t item_start, size_t item_end,
131 size_t level, SpellingNode *parent);
  /packages/inputmethods/PinyinIME/jni/share/
splparser.cpp 41 const SpellingNode *node_this = spl_trie_->root_;
82 SpellingNode *found_son = NULL;
90 SpellingNode *first_son = node_this->first_son;
94 SpellingNode *this_son = first_son + i;
170 const SpellingNode *node_this = spl_trie_->root_;
211 SpellingNode *found_son = NULL;
219 SpellingNode *first_son = node_this->first_son;
223 SpellingNode *this_son = first_son + i;
spellingtrie.cpp 260 void SpellingTrie::free_son_trie(SpellingNode* node) {
318 root_ = new SpellingNode();
319 memset(root_, 0, sizeof(SpellingNode));
321 dumb_node_ = new SpellingNode();
322 memset(dumb_node_, 0, sizeof(SpellingNode));
325 splitter_node_ = new SpellingNode();
326 memset(splitter_node_, 0, sizeof(SpellingNode));
329 memset(level1_sons_, 0, sizeof(SpellingNode*) * kValidSplCharNum);
427 SpellingNode* SpellingTrie::construct_spellings_subset(
428 size_t item_start, size_t item_end, size_t level, SpellingNode* parent)
    [all...]

Completed in 411 milliseconds