Home
last modified time | relevance | path

Searched refs:son_pos (Results 1 – 3 of 3) sorted by relevance

/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/share/
H A Ddicttrie.cpp405 for (size_t son_pos = son_start; son_pos < son_end; son_pos++) { in extend_dict0() local
407 LmaNodeLE0 *son = root_ + son_pos; in extend_dict0()
412 if (spl_trie_->is_half_id_yunmu(splid) && son_pos != son_start) in extend_dict0()
424 parsing_marks_[parsing_marks_pos_].node_offset = son_pos; in extend_dict0()
468 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; son_pos++) { in extend_dict1() local
470 LmaNodeGE1 *son = nodes_ge1_ + node->son_1st_off + son_pos; in extend_dict1()
482 found_start = son_pos; in extend_dict1()
486 if (son->spl_idx >= id_start + id_num - 1 || son_pos == in extend_dict1()
546 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; son_pos++) { in extend_dict2() local
548 LmaNodeGE1 *son = nodes_ge1_ + get_son_offset(node) + son_pos; in extend_dict2()
[all …]
H A Dspellingtrie.cpp464 size_t son_pos = 0; in construct_spellings_subset() local
482 SpellingNode *node_current = first_son + son_pos; in construct_spellings_subset()
561 son_pos++; in construct_spellings_subset()
566 SpellingNode *node_current = first_son + son_pos; in construct_spellings_subset()
602 assert(son_pos + 1 == num_of_son); in construct_spellings_subset()
H A Ddictbuilder.cpp847 size_t son_pos = 0; in construct_subset() local
870 node_cur_le0 = son_1st_le0 + son_pos; in construct_subset()
876 node_cur_ge1 = son_1st_ge1 + son_pos; in construct_subset()
931 son_pos++; in construct_subset()
939 node_cur_le0 = son_1st_le0 + son_pos; in construct_subset()
945 node_cur_ge1 = son_1st_ge1 + son_pos; in construct_subset()
999 assert(son_pos + 1 == parent_son_num); in construct_subset()