Home
last modified time | relevance | path

Searched refs:kLemmaIdSize (Results 1 – 4 of 4) sorted by relevance

/packages/inputmethods/PinyinIME/jni/include/
Ddictdef.h66 const size_t kLemmaIdSize = 3; // Actually, a Id occupies 3 bytes in storage. variable
Dsearchutility.h33 size_t id:(kLemmaIdSize * 8);
/packages/inputmethods/PinyinIME/jni/share/
Ddicttrie.cpp97 for (uint16 pos = kLemmaIdSize - 1; pos > 0; pos--) in get_lemma_id()
98 id = (id << 8) + lma_idx_buf_[id_offset * kLemmaIdSize + pos]; in get_lemma_id()
99 id = (id << 8) + lma_idx_buf_[id_offset * kLemmaIdSize]; in get_lemma_id()
192 total_lma_num_ = lma_idx_buf_len_ / kLemmaIdSize; in load_dict()
919 size_t top_lmas_id_offset = lma_idx_buf_len_ / kLemmaIdSize - top_lmas_num_; in predict_top_lmas()
Ddictbuilder.cpp601 dict_trie->lma_idx_buf_ = new unsigned char[lma_idx_num * kLemmaIdSize]; in build_dict()
606 dict_trie->lma_idx_buf_len_ = lma_idx_num * kLemmaIdSize; in build_dict()
615 id_to_charbuf(dict_trie->lma_idx_buf_ + pos * kLemmaIdSize, in build_dict()
623 id_to_charbuf(dict_trie->lma_idx_buf_ + pos * kLemmaIdSize, idx); in build_dict()
642 for (size_t pos = 0; pos < kLemmaIdSize; pos++) { in id_to_charbuf()