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

  /packages/inputmethods/PinyinIME/jni/share/
lpicache.cpp 25 lpi_cache_ = new LmaPsbItem[kFullSplIdStart * kMaxLpiCachePerId];
26 lpi_cache_len_ = new uint16[kFullSplIdStart];
29 for (uint16 id = 0; id < kFullSplIdStart; id++)
50 if (splid >= kFullSplIdStart)
spellingtrie.cpp 33 const char SpellingTrie::kHalfId2Sc_[kFullSplIdStart + 1] =
118 if (*splid >= kFullSplIdStart)
120 if (*splid < kFullSplIdStart) {
138 if (0 == splid || splid >= kFullSplIdStart)
145 if (splid < kFullSplIdStart || splid >= kFullSplIdStart + spelling_num_)
167 if (0 == splid || splid >= kFullSplIdStart)
239 if (NULL == root_ || half_id >= kFullSplIdStart)
245 if (NULL == spl_id_start || NULL == root_ || half_id >= kFullSplIdStart)
253 if (NULL == root_ || full_id < kFullSplIdStart ||
    [all...]
dicttrie.cpp 223 uint16 last_splid = kFullSplIdStart;
227 splid_le0_index_[splid - kFullSplIdStart] = last_pos;
229 splid_le0_index_[root_[i].spl_idx - kFullSplIdStart] =
236 splid < buf_size + kFullSplIdStart; splid++) {
237 assert(static_cast<size_t>(splid - kFullSplIdStart) < buf_size);
238 splid_le0_index_[splid - kFullSplIdStart] = last_pos + 1;
404 size_t son_start = splid_le0_index_[id_start - kFullSplIdStart];
405 size_t son_end = splid_le0_index_[id_start + id_num - kFullSplIdStart];
603 void *node = root_ + splid_le0_index_[splids[0] - kFullSplIdStart];
700 size_t son_start = splid_le0_index_[id_start - kFullSplIdStart];
    [all...]
splparser.cpp 334 if (splidx[0] >= kFullSplIdStart)
  /packages/inputmethods/PinyinIME/jni/include/
spellingtrie.h 26 static const unsigned short kFullSplIdStart = kHalfSpellingIdNum + 1;
53 static const char kHalfId2Sc_[kFullSplIdStart + 1];
76 // The length of the list is spelling_num_ + kFullSplIdStart,
110 // [1..kFullSplIdStart-1] is the arrange of half id.
111 uint16 h2f_start_[kFullSplIdStart];
112 uint16 h2f_num_[kFullSplIdStart];

Completed in 290 milliseconds