HomeSort by relevance Sort by last modified time
    Searched refs:kMaxLemmaSize (Results 1 - 10 of 10) sorted by null

  /packages/inputmethods/PinyinIME/jni/include/
dictbuilder.h 73 size_t max_sonbuf_len_[kMaxLemmaSize];
74 size_t max_homobuf_len_[kMaxLemmaSize];
76 size_t total_son_num_[kMaxLemmaSize];
77 size_t total_node_hasson_[kMaxLemmaSize];
78 size_t total_sonbuf_num_[kMaxLemmaSize];
79 size_t total_sonbuf_allnoson_[kMaxLemmaSize];
80 size_t total_node_in_sonbuf_allnoson_[kMaxLemmaSize];
81 size_t total_homo_num_[kMaxLemmaSize];
dictdef.h 43 const size_t kMaxLemmaSize = 8;
62 const size_t kMaxPredictSize = (kMaxLemmaSize - 1);
143 char16 hanzi_str[kMaxLemmaSize + 1];
146 uint16 hanzi_scis_ids[kMaxLemmaSize];
148 uint16 spl_idx_arr[kMaxLemmaSize + 1];
149 char pinyin_str[kMaxLemmaSize][kMaxPinyinSize + 1];
dictlist.h 45 size_t start_pos_[kMaxLemmaSize + 1];
47 size_t start_id_[kMaxLemmaSize + 1];
49 int (*cmp_func_[kMaxLemmaSize])(const void *, const void *);
userdict.h 240 uint16 splid_start[kMaxLemmaSize];
241 uint16 splid_count[kMaxLemmaSize];
243 uint32 signature[kMaxLemmaSize / 4];
253 static const int kUserDictMissCacheSize = kMaxLemmaSize - 1;
256 uint32 signatures[kUserDictMissCacheSize][kMaxLemmaSize / 4];
258 } miss_caches_[kMaxLemmaSize];
261 uint32 signatures[kUserDictCacheSize][kMaxLemmaSize / 4];
266 } caches_[kMaxLemmaSize];
searchutility.h 44 char16 str[kMaxLemmaSize + 1];
77 // For a normal lemma, there can only be kMaxLemmaSize spelling ids in max,
  /packages/inputmethods/PinyinIME/jni/share/
dictlist.cpp 35 assert(kMaxLemmaSize == 8);
156 for (size_t i = last_hz_len; i <= kMaxLemmaSize; i++) {
166 return start_pos_[kMaxLemmaSize];
196 assert(current_pos == start_pos_[kMaxLemmaSize]);
197 assert(id_num == start_id_[kMaxLemmaSize]);
288 if (!initialized_ || id_lemma >= start_id_[kMaxLemmaSize] || NULL == str_buf
293 for (uint16 i = 0; i < kMaxLemmaSize; i++) {
349 if (NULL == str || str_len > kMaxLemmaSize)
383 if (NULL == buf_ || 0 == start_pos_[kMaxLemmaSize] ||
390 if (fwrite(start_pos_, sizeof(size_t), kMaxLemmaSize + 1, fp) !
    [all...]
dictbuilder.cpp 188 scis_num_ = lemma_num_ * kMaxLemmaSize;
414 if (lemma_size > kMaxLemmaSize) {
700 if (NULL == scis_ || lemma_num_ * kMaxLemmaSize > scis_num_)
773 if (level >= kMaxLemmaSize || item_end <= item_start)
799 assert(level < kMaxLemmaSize);
1005 memset(max_sonbuf_len_, 0, sizeof(size_t) * kMaxLemmaSize);
1006 memset(max_homobuf_len_, 0, sizeof(size_t) * kMaxLemmaSize);
1007 memset(total_son_num_, 0, sizeof(size_t) * kMaxLemmaSize);
1008 memset(total_node_hasson_, 0, sizeof(size_t) * kMaxLemmaSize);
1009 memset(total_sonbuf_num_, 0, sizeof(size_t) * kMaxLemmaSize);
    [all...]
matrixsearch.cpp 623 char16 s[kMaxLemmaSize + 1];
627 s_len = get_lemma_str(id, s, kMaxLemmaSize + 1);
657 char16 word_str[kMaxLemmaSize + 1];
658 uint16 spl_ids[kMaxLemmaSize];
671 kMaxLemmaSize + 1 - spl_id_fr);
682 assert(spl_id_fr <= kMaxLemmaSize);
718 static_cast<uint16>(kMaxLemmaSize)) {
1058 if ((!dmi_c_phrase_ && prev_ids_num >= kMaxLemmaSize) ||
    [all...]
dicttrie.cpp 665 if (splid_str_len > kMaxLemmaSize)
855 char16 lma_str[kMaxLemmaSize + 1];
856 uint16 lma_len = get_lemma_str(id_lemma, lma_str, kMaxLemmaSize + 1);
859 uint16 spl_mtrx[kMaxLemmaSize * 5];
860 uint16 spl_start[kMaxLemmaSize + 1];
872 kMaxLemmaSize * 5 - spl_start[pos]);
908 if (NULL == lemma_str || lemma_len > kMaxLemmaSize)
927 kMaxLemmaSize - 1) == 0) {
userdict.cpp     [all...]

Completed in 25 milliseconds