Lines Matching full:uint16
114 bool SpellingTrie::if_valid_id_update(uint16 *splid) const {
137 bool SpellingTrie::is_half_id(uint16 splid) const {
144 bool SpellingTrie::is_full_id(uint16 splid) const {
150 bool SpellingTrie::half_full_compatible(uint16 half_id, uint16 full_id) const {
151 uint16 half_fr_full = full_to_half(full_id);
166 bool SpellingTrie::is_half_id_yunmu(uint16 splid) const {
238 uint16 SpellingTrie::half2full_num(uint16 half_id) const {
244 uint16 SpellingTrie::half_to_full(uint16 half_id, uint16 *spl_id_start) const {
252 uint16 SpellingTrie::full_to_half(uint16 full_id) const {
278 memset(h2f_start_, 0, sizeof(uint16) * kFullSplIdStart);
279 memset(h2f_num_, 0, sizeof(uint16) * kFullSplIdStart);
374 for (uint16 pos = 0; pos < spelling_num_; pos++) {
411 for (uint16 id = 1; id < spelling_num_ + kFullSplIdStart; id++) {
433 uint16 num_of_son = 0;
499 uint16 score_this = static_cast<unsigned char>(
516 static_cast<uint16>(char_for_node - 'A' + 1);
527 uint16 part_id = 0;
584 uint16 score_this = static_cast<unsigned char>(
602 node_current->spelling_idx = static_cast<uint16>(char_for_node - 'A' + 1);
613 uint16 part_id = 0;
696 f2h_ = new uint16[spelling_num_];
700 for (uint16 hid = 0; hid < kFullSplIdStart; hid++) {
701 for (uint16 fid = h2f_start_[hid];
724 const char* SpellingTrie::get_spelling_str(uint16 splid) {
750 const char16* SpellingTrie::get_spelling_str16(uint16 splid) {
784 size_t SpellingTrie::get_spelling_str16(uint16 splid, char16 *splstr16,
