HomeSort by relevance Sort by last modified time
    Searched full:lemma_num (Results 1 - 4 of 4) sorted by null

  /packages/inputmethods/PinyinIME/jni/include/
dictlist.h 57 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);
  /packages/inputmethods/PinyinIME/jni/share/
dictlist.cpp 87 const LemmaEntry *lemma_arr, size_t lemma_num) {
88 if (NULL == scis || 0 == scis_num || NULL == lemma_arr || 0 == lemma_num)
97 size_t buf_size = calculate_size(lemma_arr, lemma_num);
107 fill_list(lemma_arr, lemma_num);
113 size_t DictList::calculate_size(const LemmaEntry* lemma_arr, size_t lemma_num) {
118 for (size_t i = 0; i < lemma_num; i++) {
178 void DictList::fill_list(const LemmaEntry* lemma_arr, size_t lemma_num) {
188 for (size_t i = 1; i < lemma_num; i++) {
ngram.cpp 244 bool NGram::build_unigram(LemmaEntry *lemma_arr, size_t lemma_num,
246 if (NULL == lemma_arr || 0 == lemma_num || next_idx_unused <= 1)
257 for (size_t pos = 0; pos < lemma_num; pos++) {
dictbuilder.cpp 195 // Other nodes is less than lemma_num
380 size_t lemma_num = 240000; local
383 if (!alloc_resource(lemma_num)) {
396 lemma_num = i;
499 printf("read succesfully, lemma num: %d\n", lemma_num);
501 return lemma_num;

Completed in 118 milliseconds