Home
last modified time | relevance | path

Searched refs:LemmaEntry (Results 1 – 11 of 11) sorted by relevance

/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/share/
H A Ddictbuilder.cpp92 size_t size1 = utf16_strlen(((const LemmaEntry*)p1)->hanzi_str); in cmp_lemma_entry_hzs()
93 size_t size2 = utf16_strlen(((const LemmaEntry*)p2)->hanzi_str); in cmp_lemma_entry_hzs()
99 return utf16_strcmp(((const LemmaEntry*)p1)->hanzi_str, in cmp_lemma_entry_hzs()
100 ((const LemmaEntry*)p2)->hanzi_str); in cmp_lemma_entry_hzs()
112 int ret = utf16_strcmp(((const LemmaEntry*)p1)->spl_idx_arr, in compare_py()
113 ((const LemmaEntry*)p2)->spl_idx_arr); in compare_py()
118 return static_cast<int>(((const LemmaEntry*)p2)->freq) - in compare_py()
119 static_cast<int>(((const LemmaEntry*)p1)->freq); in compare_py()
124 size_t size1 = utf16_strlen(((const LemmaEntry*)p1)->hanzi_str); in cmp_lemma_entry_hzspys()
125 size_t size2 = utf16_strlen(((const LemmaEntry*)p2)->hanzi_str); in cmp_lemma_entry_hzspys()
[all …]
H A Ddictlist.cpp87 const LemmaEntry *lemma_arr, size_t lemma_num) { in init_list()
113 size_t DictList::calculate_size(const LemmaEntry* lemma_arr, size_t lemma_num) { in calculate_size()
178 void DictList::fill_list(const LemmaEntry* lemma_arr, size_t lemma_num) { in fill_list()
H A Dngram.cpp244 bool NGram::build_unigram(LemmaEntry *lemma_arr, size_t lemma_num, in build_unigram()
/OK3568_Linux_fs/app/forlinx/flapp/src/keyboard/pinyin/include/
H A Ddictlist.h57 size_t calculate_size(const LemmaEntry *lemma_arr, size_t lemma_num);
63 void fill_list(const LemmaEntry *lemma_arr, size_t lemma_num);
90 const LemmaEntry *lemma_arr, size_t lemma_num);
H A Ddictbuilder.h39 LemmaEntry *lemma_arr_;
66 LemmaEntry *top_lmas_;
135 bool construct_subset(void* parent, LemmaEntry* lemma_arr,
H A Dngram.h90 bool build_unigram(LemmaEntry *lemma_arr, size_t num,
H A Ddictdef.h140 struct LemmaEntry { struct
/OK3568_Linux_fs/app/forlinx/DWKeyboard/include/pinyin/include/
H A Ddictlist.h57 size_t calculate_size(const LemmaEntry *lemma_arr, size_t lemma_num);
63 void fill_list(const LemmaEntry *lemma_arr, size_t lemma_num);
90 const LemmaEntry *lemma_arr, size_t lemma_num);
H A Ddictbuilder.h39 LemmaEntry *lemma_arr_;
66 LemmaEntry *top_lmas_;
135 bool construct_subset(void* parent, LemmaEntry* lemma_arr,
H A Dngram.h90 bool build_unigram(LemmaEntry *lemma_arr, size_t num,
H A Ddictdef.h140 struct LemmaEntry { struct