Searched defs:splids (Results 1 - 6 of 6) sorted by relevance

/packages/inputmethods/PinyinIME/jni/include/
H A Dsearchutility.h63 // 1. splids = {w, m}; splids_extended = 1; ext_len = 1; step_no = 1;
66 // 2. splids = {m}; splids_extended = 0; ext_len = 1; step_no = 1;
71 // splids = {wo, men}, splids_extended = 1, ext_len = 3 (length of "men"),
79 uint16 splids[kMaxSearchSteps]; member in struct:ime_pinyin::__anon50
81 // Number of ids that have been used before. splids[splids_extended] is the
90 // in the input Pinyin string for the substring of spelling ids in 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,
203 LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[], argument
209 LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[], argument
214 LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[], argument
/packages/inputmethods/PinyinIME/jni/share/
H A Ddictlist.cpp311 uint16 *splids, uint16 max_splids) {
339 splids[found_num] = scis_splid_[pos].full_splid;
310 get_splids_for_hanzi(char16 hanzi, uint16 half_splid, uint16 *splids, uint16 max_splids) argument
H A Duserdict.cpp358 *lpi_num = _get_lpis(dep->splids, dep->splids_extended + 1,
455 const uint16 * splids = get_lemma_spell_ids(offset); local
456 int cmp = fuzzy_compare_spell_id(splids, nchar, searchable);
457 int pre = is_fuzzy_prefix_spell_id(splids, nchar, searchable);
570 uint16 * splids = get_lemma_spell_ids(offset); local
572 if (!cached && 0 != fuzzy_compare_spell_id(splids, nchar, &searchable)) {
574 if (0 != fuzzy_compare_spell_id(splids, nchar, &searchable)) {
580 if (is_fuzzy_prefix_spell_id(splids, nchar, &searchable)) {
582 is_prefix_spell_id(splids, nchar, &searchable)) {
590 if (equal_spell_id(splids, ncha
[all...]
H A Ddicttrie.cpp394 uint16 splid = dep->splids[dep->splids_extended];
598 bool DictTrie::try_extend(const uint16 *splids, uint16 splid_num, argument
600 if (0 == splid_num || NULL == splids)
603 void *node = root_ + splid_le0_index_[splids[0] - kFullSplIdStart];
615 if (node_son->spl_idx == splids[pos])
630 if (node_son->spl_idx == splids[pos])
853 uint16 DictTrie::get_lemma_splids(LemmaIdType id_lemma, uint16 *splids, argument
866 if (arg_valid && spl_trie_->is_full_id(splids[pos])) {
867 spl_mtrx[spl_start[pos]] = splids[pos];
871 arg_valid ? splids[po
[all...]
H A Dmatrixsearch.cpp1065 dep_->splids[--prev_ids_num] = d->spl_id;
1073 dep_->splids[dep_->splids_extended] = spl_idx;
1407 uint16 splid = dep->splids[dep->splids_extended];
1509 uint16 splid = dep->splids[pos];
1807 uint16 MatrixSearch::get_lemma_splids(LemmaIdType id_lemma, uint16 *splids, argument
1813 if (spl_trie_->is_half_id(splids[splid_num]))
1821 splid_num = dict_trie_->get_lemma_splids(id_lemma, splids, splids_max,
1825 splid_num = user_dict_->get_lemma_splids(id_lemma, splids, splids_max,
1835 splids[pos] = c_phrase_.spl_ids[pos];
1836 if (spl_trie_->is_half_id(splids[po
[all...]

Completed in 1444 milliseconds