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

  /packages/inputmethods/PinyinIME/jni/share/
lpicache.cpp 49 bool LpiCache::is_cached(uint16 splid) {
50 if (splid >= kFullSplIdStart)
52 return lpi_cache_len_[splid] != 0;
55 size_t LpiCache::put_cache(uint16 splid, LmaPsbItem lpi_items[],
61 LmaPsbItem *lpi_cache_this = lpi_cache_ + splid * kMaxLpiCachePerId;
65 lpi_cache_len_[splid] = num;
69 size_t LpiCache::get_cache(uint16 splid, LmaPsbItem lpi_items[],
71 if (lpi_max > lpi_cache_len_[splid])
72 lpi_max = lpi_cache_len_[splid];
74 LmaPsbItem *lpi_cache_this = lpi_cache_ + splid * kMaxLpiCachePerId
    [all...]
spellingtrie.cpp 114 bool SpellingTrie::if_valid_id_update(uint16 *splid) const {
115 if (NULL == splid || 0 == *splid)
118 if (*splid >= kFullSplIdStart)
120 if (*splid < kFullSplIdStart) {
121 char ch = kHalfId2Sc_[*splid];
128 assert(h2f_num_[*splid] > 0);
129 *splid = h2f_start_[*splid];
137 bool SpellingTrie::is_half_id(uint16 splid) const
    [all...]
dictbuilder.cpp 51 if (s1->splid.half_splid < s2->splid.half_splid)
53 if (s1->splid.half_splid > s2->splid.half_splid)
56 if (s1->splid.full_splid < s2->splid.full_splid)
58 if (s1->splid.full_splid > s2->splid.full_splid)
78 if (s1->splid.half_splid < s2->splid.half_splid
    [all...]
dicttrie.cpp 226 for (uint16 splid = last_splid; splid < root_[i].spl_idx; splid++)
227 splid_le0_index_[splid - kFullSplIdStart] = last_pos;
235 for (uint16 splid = last_splid + 1;
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;
394 uint16 splid = dep->splids[dep->splids_extended] local
    [all...]
matrixsearch.cpp 1407 uint16 splid = dep->splids[dep->splids_extended]; local
    [all...]
dictlist.cpp 174 scis_splid_[pos] = scis[pos].splid;
userdict.cpp     [all...]
  /packages/inputmethods/PinyinIME/jni/include/
lpicache.h 41 // Test if the LPI list of the given splid has been cached.
42 // If splid is a full spelling id, it returns false, because we only cache
44 bool is_cached(uint16 splid);
49 // Note: splid must be a half id, and lpi_items must be not NULL. The
51 size_t put_cache(uint16 splid, LmaPsbItem lpi_items[], size_t lpi_num);
55 // Note: splid must be a half id, and lpi_items must be not NULL. The
57 size_t get_cache(uint16 splid, LmaPsbItem lpi_items[], size_t lpi_max);
spellingtrie.h 77 // so that spl_ym_ids_[splid] is the Yunmu id of the splid.
175 // If function returns true, the given splid may be updated like this:
179 bool if_valid_id_update(uint16 *splid) const;
182 bool is_half_id(uint16 splid) const;
184 bool is_full_id(uint16 splid) const;
188 bool is_half_id_yunmu(uint16 splid) const;
246 const char* get_spelling_str(uint16 splid);
249 const char16* get_spelling_str16(uint16 splid);
253 size_t get_spelling_str16(uint16 splid, char16 *splstr16
    [all...]
dicttrie.h 72 // So, given an id splid, the son is:
73 // root_[splid_le0_index_[splid - kFullSplIdStart]]
dictdef.h 137 SpellingId splid; member in struct:ime_pinyin::SingleCharItem
matrixsearch.h 300 // to extend, actually, it is the size of the spelling string of splid.
304 // 0 means either the dmi node can not be extended with splid, or the splid

Completed in 180 milliseconds