Searched refs:spelling_num_ (Results 1 - 4 of 4) sorted by relevance

/packages/inputmethods/PinyinIME/jni/share/
H A Dspellingtable.cpp71 spelling_num_ = 0;
121 spelling_num_ = 0;
172 spelling_num_++;
225 // After sorting, only the first spelling_num_ items are valid.
227 for (size_t pos = 0; pos < spelling_num_; pos++) {
239 // After sorting, only the first spelling_num_ items are valid.
240 for (size_t pos = 0; pos < spelling_num_; pos++) {
270 for (size_t pos = 0; pos < spelling_num_; pos++) {
289 average_score /= spelling_num_;
299 *spl_num = spelling_num_;
[all...]
H A Dspellingtrie.cpp57 spelling_num_ = 0;
145 if (splid < kFullSplIdStart || splid >= kFullSplIdStart + spelling_num_)
254 full_id > spelling_num_ + kFullSplIdStart)
294 spelling_num_ = item_num;
312 qsort(spelling_buf_, spelling_num_, spelling_size_, compare_spl);
331 root_->first_son = construct_spellings_subset(0, spelling_num_, 0, root_);
374 for (uint16 pos = 0; pos < spelling_num_; pos++) {
405 spl_ym_ids_ = new uint8[spelling_num_ + kFullSplIdStart];
409 memset(spl_ym_ids_, 0, sizeof(uint8) * (spelling_num_ + kFullSplIdStart));
411 for (uint16 id = 1; id < spelling_num_
[all...]
/packages/inputmethods/PinyinIME/jni/include/
H A Dspellingtable.h57 size_t spelling_num_; member in class:ime_pinyin::SpellingTable
H A Dspellingtrie.h69 size_t spelling_num_; member in class:ime_pinyin::SpellingTrie
76 // The length of the list is spelling_num_ + kFullSplIdStart,

Completed in 501 milliseconds