Searched refs:num_of_son (Results 1 – 6 of 6) sorted by relevance
264 for (size_t pos = 0; pos < node->num_of_son; pos++) { in free_son_trie()433 uint16 num_of_son = 0; in construct_spellings_subset() local446 num_of_son++; in construct_spellings_subset()450 num_of_son++; in construct_spellings_subset()454 node_num_ += num_of_son; in construct_spellings_subset()456 first_son = new SpellingNode[num_of_son]; in construct_spellings_subset()457 memset(first_son, 0, sizeof(SpellingNode)*num_of_son); in construct_spellings_subset()598 assert(son_pos + 1 == num_of_son); in construct_spellings_subset()634 parent->num_of_son = num_of_son; in construct_spellings_subset()
469 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; son_pos++) { in extend_dict1()488 (size_t)node->num_of_son - 1) { in extend_dict1()547 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; son_pos++) { in extend_dict2()566 (size_t)node->num_of_son - 1) { in extend_dict2()610 for (son_pos = 0; son_pos < static_cast<uint16>(node_le0->num_of_son); in try_extend()618 if (son_pos < node_le0->num_of_son) in try_extend()626 for (son_pos = 0; son_pos < static_cast<uint16>(node_ge1->num_of_son); in try_extend()633 if (son_pos < node_ge1->num_of_son) in try_extend()731 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; in get_lpis()762 for (size_t son_pos = 0; son_pos < (size_t)node->num_of_son; in get_lpis()
93 for (int i = 0; i < node_this->num_of_son; i++) { in splstr_to_idxs()222 for (int i = 0; i < node_this->num_of_son; i++) { in splstr16_to_idxs()
824 (static_cast<LmaNodeLE0*>(parent))->num_of_son = in construct_subset()833 (static_cast<LmaNodeLE0*>(parent))->num_of_son = in construct_subset()842 (static_cast<LmaNodeGE1*>(parent))->num_of_son = in construct_subset()
115 uint16 num_of_son; member127 unsigned char num_of_son; // number of son nodes member
34 uint16 num_of_son:5; member