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

  /packages/inputmethods/PinyinIME/jni/include/
dictdef.h 115 uint16 num_of_son; member in struct:ime_pinyin::LmaNodeLE0
127 unsigned char num_of_son; // number of son nodes member in struct:ime_pinyin::LmaNodeGE1
spellingtrie.h 34 uint16 num_of_son:5; member in struct:ime_pinyin::SpellingNode
129 // parent is used to update its num_of_son and score.
  /packages/inputmethods/PinyinIME/jni/share/
spellingtrie.cpp 264 for (size_t pos = 0; pos < node->num_of_son; pos++) {
433 uint16 num_of_son = 0; local
446 num_of_son++;
450 num_of_son++;
454 node_num_ += num_of_son;
456 first_son = new SpellingNode[num_of_son];
457 memset(first_son, 0, sizeof(SpellingNode)*num_of_son);
598 assert(son_pos + 1 == num_of_son);
634 parent->num_of_son = num_of_son;
    [all...]
dicttrie.cpp 469 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; son_pos++) {
488 (size_t)node->num_of_son - 1) {
547 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; son_pos++) {
566 (size_t)node->num_of_son - 1) {
610 for (son_pos = 0; son_pos < static_cast<uint16>(node_le0->num_of_son);
618 if (son_pos < node_le0->num_of_son)
626 for (son_pos = 0; son_pos < static_cast<uint16>(node_ge1->num_of_son);
633 if (son_pos < node_ge1->num_of_son)
731 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son;
762 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son;
    [all...]
splparser.cpp 93 for (int i = 0; i < node_this->num_of_son; i++) {
222 for (int i = 0; i < node_this->num_of_son; i++) {
dictbuilder.cpp 779 // parent.num_of_son = 0;
824 (static_cast<LmaNodeLE0*>(parent))->num_of_son =
833 (static_cast<LmaNodeLE0*>(parent))->num_of_son =
842 (static_cast<LmaNodeGE1*>(parent))->num_of_son =

Completed in 230 milliseconds