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

  /packages/inputmethods/PinyinIME/jni/share/
spellingtable.cpp 82 for (size_t pos = 0; pos < spelling_size_; pos++) {
117 spelling_size_ = pure_spl_size + 1;
119 spelling_size_ += 1;
124 spelling_buf_ = new char[spelling_max_num_ * (spelling_size_)];
131 memset(spelling_buf_, 0, spelling_max_num_ * (spelling_size_));
151 raw_spellings_[hash_pos].str[spelling_size_ - 1] = '\0';
154 spelling_size_ - 1) == 0) {
163 spelling_str, spelling_size_ - 1) == 0) {
170 strncpy(raw_spellings_[hash_pos].str, spelling_str, spelling_size_ - 1);
171 raw_spellings_[hash_pos].str[spelling_size_ - 1] = '\0'
    [all...]
spellingtrie.cpp 56 spelling_size_ = 0;
293 spelling_size_ = item_size;
301 splstr_queried_ = new char[spelling_size_];
307 splstr16_queried_ = new char16[spelling_size_];
312 qsort(spelling_buf_, spelling_num_, spelling_size_, compare_spl);
375 const char *spl_str = spelling_buf_ + spelling_size_ * pos;
429 if (level >= spelling_size_ || item_end <= item_start || NULL == parent)
436 const char *spelling_last_start = spelling_buf_ + spelling_size_ * item_start;
443 const char *spelling_current = spelling_buf_ + spelling_size_ * i;
462 spelling_last_start = spelling_buf_ + spelling_size_ * item_start
    [all...]
  /packages/inputmethods/PinyinIME/jni/include/
spellingtable.h 36 // spelling_size_ (set by init_table). If the input string is too long,
37 // we only keep its first spelling_size_ chars.
53 size_t spelling_size_; member in class:ime_pinyin::SpellingTable
spellingtrie.h 63 // so spelling_size_ is 8.
66 size_t spelling_size_; member in class:ime_pinyin::SpellingTrie
128 // Member spelliing_buf_ and spelling_size_ should be valid.

Completed in 74 milliseconds