| /packages/inputmethods/PinyinIME/jni/include/ |
| atomdictbase.h | 157 * @param splids Used to return the spelling ids.
158 * @param splids_max The maximum buffer length of splids.
160 * initialized are valid. If it is true, the splids and splids_max are valid
161 * and there may be half ids in splids to be updated to full ids. In this
162 * case, splids_max is the number of valid ids in splids.
165 virtual uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
190 * @param splids The spelling ids of the lemma.
194 virtual LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[],
213 * @param splids The spelling ids of the lemma.
217 virtual LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
[all...] |
| searchutility.h | 63 // 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::__anon35247
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[].
|
| userdict.h | 56 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
64 LemmaIdType put_lemma(char16 lemma_str[], uint16 splids[],
70 LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
75 LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[],
97 LemmaIdType put_lemma_no_sync(char16 lemma_str[], uint16 splids[],
304 LemmaIdType _put_lemma(char16 lemma_str[], uint16 splids[],
310 int _get_lemma_score(char16 lemma_str[], uint16 splids[], uint16 lemma_len);
346 const uint16 * splids, uint16 len);
360 LemmaIdType append_a_lemma(char16 lemma_str[], uint16 splids[],
403 // | Spare (1) | Nchar (1) | Splids (2 x Nchar) | Lemma (2 x Nchar)
[all...] |
| dicttrie.h | 142 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[],
209 LemmaIdType get_lemma_id(char16 lemma_str[], uint16 splids[],
214 LmaScoreType get_lemma_score(char16 lemma_str[], uint16 splids[],
|
| dictlist.h | 114 uint16 *splids, uint16 max_splids);
|
| matrixsearch.h | 295 uint16 get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
|
| /packages/inputmethods/PinyinIME/jni/share/ |
| userdict.cpp | 358 *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, nchar, &searchable) == true)
[all...] |
| dicttrie.cpp | 394 uint16 splid = dep->splids[dep->splids_extended];
598 bool DictTrie::try_extend(const uint16 *splids, uint16 splid_num,
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,
866 if (arg_valid && spl_trie_->is_full_id(splids[pos])) {
867 spl_mtrx[spl_start[pos]] = splids[pos];
871 arg_valid ? splids[pos] : 0, spl_mtrx + spl_start[pos]
[all...] |
| dictlist.cpp | 311 uint16 *splids, uint16 max_splids) {
339 splids[found_num] = scis_splid_[pos].full_splid;
|
| matrixsearch.cpp | 1065 dep_->splids[--prev_ids_num] = d->spl_id;
[all...] |
