Lines Matching refs:kFullSplIdStart
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 ||
254 full_id > spelling_num_ + kFullSplIdStart)
257 return f2h_[full_id - kFullSplIdStart];
278 memset(h2f_start_, 0, sizeof(uint16) * kFullSplIdStart);
279 memset(h2f_num_, 0, sizeof(uint16) * kFullSplIdStart);
405 spl_ym_ids_ = new uint8[spelling_num_ + kFullSplIdStart];
409 memset(spl_ym_ids_, 0, sizeof(uint8) * (spelling_num_ + kFullSplIdStart));
411 for (uint16 id = 1; id < spelling_num_ + kFullSplIdStart; id++) {
486 node_current->spelling_idx = kFullSplIdStart + item_start_next;
544 item_start_next + kFullSplIdStart;
570 node_current->spelling_idx = kFullSplIdStart + item_start_next;
629 item_start_next + kFullSplIdStart;
700 for (uint16 hid = 0; hid < kFullSplIdStart; hid++) {
703 f2h_[fid - kFullSplIdStart] = hid;
727 if (splid >= kFullSplIdStart) {
728 splid -= kFullSplIdStart;
753 if (splid >= kFullSplIdStart) {
754 splid -= kFullSplIdStart;
788 if (splid >= kFullSplIdStart) {
789 splid -= kFullSplIdStart;
