Home
last modified time | relevance | path

Searched refs:splids (Results 1 – 16 of 16) sorted by relevance

/OK3568_Linux_fs/app/forlinx/DWKeyboard/include/pinyin/include/
H A Duserdict.h60 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
68 LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[],
74 LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
79 LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[],
101 LemmaIdType put_lemma_no_sync(char16 lemma_str[], uint16 splids[],
308 LemmaIdType _put_lemma(char16 lemma_str[], uint16 splids[],
314 int _get_lemma_score(char16 lemma_str[], uint16 splids[], uint16 lemma_len);
350 const uint16 * splids, uint16 len);
364 LemmaIdType append_a_lemma(char16 lemma_str[], uint16 splids[],
H A Datomdictbase.h165 virtual uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
194 virtual LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[],
217 virtual LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
236 virtual LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[],
H A Ddicttrie.h142 bool try_extend(const uint16 *splids, uint16 splid_num, LemmaIdType id_lemma);
196 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
H A Dsearchutility.h79 uint16 splids[kMaxSearchSteps]; member
H A Ddictlist.h114 uint16 *splids, uint16 max_splids);
H A Dmatrixsearch.h295 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/include/
H A Duserdict.h60 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
68 LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[],
74 LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
79 LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[],
101 LemmaIdType put_lemma_no_sync(char16 lemma_str[], uint16 splids[],
308 LemmaIdType _put_lemma(char16 lemma_str[], uint16 splids[],
314 int _get_lemma_score(char16 lemma_str[], uint16 splids[], uint16 lemma_len);
350 const uint16 * splids, uint16 len);
364 LemmaIdType append_a_lemma(char16 lemma_str[], uint16 splids[],
H A Datomdictbase.h165 virtual uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
194 virtual LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[],
217 virtual LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
236 virtual LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[],
H A Ddicttrie.h142 bool try_extend(const uint16 *splids, uint16 splid_num, LemmaIdType id_lemma);
196 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
H A Dsearchutility.h79 uint16 splids[kMaxSearchSteps]; member
H A Ddictlist.h114 uint16 *splids, uint16 max_splids);
H A Dmatrixsearch.h295 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/share/
H A Duserdict.cpp390 *lpi_num = _get_lpis(dep->splids, dep->splids_extended + 1, in extend_dict()
487 const uint16 * splids = get_lemma_spell_ids(offset); in locate_first_in_offsets() local
488 int cmp = fuzzy_compare_spell_id(splids, nchar, searchable); in locate_first_in_offsets()
489 int pre = is_fuzzy_prefix_spell_id(splids, nchar, searchable); in locate_first_in_offsets()
602 uint16 * splids = get_lemma_spell_ids(offset); in _get_lpis() local
604 if (!cached && 0 != fuzzy_compare_spell_id(splids, nchar, &searchable)) { in _get_lpis()
606 if (0 != fuzzy_compare_spell_id(splids, nchar, &searchable)) { in _get_lpis()
612 if (is_fuzzy_prefix_spell_id(splids, nchar, &searchable)) { in _get_lpis()
614 is_prefix_spell_id(splids, nchar, &searchable)) { in _get_lpis()
622 if (equal_spell_id(splids, nchar, &searchable) == true) { in _get_lpis()
[all …]
H A Ddicttrie.cpp393 uint16 splid = dep->splids[dep->splids_extended]; in extend_dict0()
597 bool DictTrie::try_extend(const uint16 *splids, uint16 splid_num, in try_extend() argument
599 if (0 == splid_num || NULL == splids) in try_extend()
602 void *node = root_ + splid_le0_index_[splids[0] - kFullSplIdStart]; in try_extend()
614 if (node_son->spl_idx == splids[pos]) in try_extend()
629 if (node_son->spl_idx == splids[pos]) in try_extend()
852 uint16 DictTrie::get_lemma_splids(LemmaIdType id_lemma, uint16 *splids, in get_lemma_splids() argument
865 if (arg_valid && spl_trie_->is_full_id(splids[pos])) { in get_lemma_splids()
866 spl_mtrx[spl_start[pos]] = splids[pos]; in get_lemma_splids()
870 arg_valid ? splids[pos] : 0, spl_mtrx + spl_start[pos], in get_lemma_splids()
[all …]
H A Dmatrixsearch.cpp1088 dep_->splids[--prev_ids_num] = d->spl_id; in add_char_qwerty()
1096 dep_->splids[dep_->splids_extended] = spl_idx; in add_char_qwerty()
1430 uint16 splid = dep->splids[dep->splids_extended]; in extend_dmi()
1532 uint16 splid = dep->splids[pos]; in extend_dmi_c()
1830 uint16 MatrixSearch::get_lemma_splids(LemmaIdType id_lemma, uint16 *splids, in get_lemma_splids() argument
1836 if (spl_trie_->is_half_id(splids[splid_num])) in get_lemma_splids()
1844 splid_num = dict_trie_->get_lemma_splids(id_lemma, splids, splids_max, in get_lemma_splids()
1848 splid_num = user_dict_->get_lemma_splids(id_lemma, splids, splids_max, in get_lemma_splids()
1858 splids[pos] = c_phrase_.spl_ids[pos]; in get_lemma_splids()
1859 if (spl_trie_->is_half_id(splids[pos])) { in get_lemma_splids()
H A Ddictlist.cpp311 uint16 *splids, uint16 max_splids) { in get_splids_for_hanzi() argument
339 splids[found_num] = scis_splid_[pos].full_splid; in get_splids_for_hanzi()