Home | History | Annotate | Download | only in share

Lines Matching refs:uint16

362       for (uint16 re_pos = fixed_ch_pos; re_pos < ch_pos; re_pos++) {
366 for (uint16 subpos = 0; subpos < c_phrase_.sublma_num; subpos++) {
367 uint16 splpos_begin = c_phrase_.sublma_start[subpos];
368 uint16 splpos_end = c_phrase_.sublma_start[subpos + 1];
369 for (uint16 splpos = splpos_begin; splpos < splpos_end; splpos++) {
371 uint16 spl_start = c_phrase_.spl_start[splpos];
372 uint16 spl_end = c_phrase_.spl_start[splpos + 1];
390 uint16 c_py_pos = 0;
560 uint16 c_py_pos = 0;
625 uint16 s_len = lpi_items_[cand_id].lma_len;
652 bool MatrixSearch::add_lma_to_userdict(uint16 lma_fr, uint16 lma_to,
658 uint16 spl_ids[kMaxLemmaSize];
660 uint16 spl_id_fr = 0;
662 for (uint16 pos = lma_fr; pos < lma_to; pos++) {
667 uint16 lma_len = lma_start_[pos + 1] - lma_start_[pos];
670 uint16 tmp = get_lemma_str(lma_id, word_str + spl_id_fr,
688 void MatrixSearch::debug_print_dmi(PoolPosType dmi_pos, uint16 nest_level) {
713 uint16 lma_id_from = 0;
714 uint16 pos = 0;
718 static_cast<uint16>(kMaxLemmaSize)) {
945 bool MatrixSearch::is_split_at(uint16 pos) {
950 PoolPosType dmi_fr, uint16 spl_id,
951 uint16 node_num, unsigned char dict_level,
975 uint16 longest_ext = 0;
978 for (uint16 ext_len = kMaxPinyinSize + 1; ext_len > 0; ext_len--) {
994 uint16 oldrow = pys_decoded_len_ - ext_len;
1007 uint16 spl_idx;
1057 uint16 prev_ids_num = dmi->dict_level;
1085 uint16 new_dmi_num;
1102 uint16 fr_row;
1133 uint16 lma_size_max = kMaxLemmaSize;
1137 uint16 lma_size = lma_size_max;
1143 uint16 sent_len;
1204 uint16 del_py_len = spl_start_[del_spl_pos + 1] - spl_start_[del_spl_pos];
1213 uint16 phrase_len = 0;
1217 memcpy(c_phrase_.spl_ids, spl_id_, spl_id_num_ * sizeof(uint16));
1218 memcpy(c_phrase_.spl_start, spl_start_, (spl_id_num_ + 1) * sizeof(uint16));
1223 uint16 bp = 1; // Begin position of real fixed lemmas.
1230 uint16 sub_num = c_phrase_.sublma_num;
1231 for (uint16 pos = bp; pos <= fixed_lmas_; pos++) {
1240 uint16 lma_len;
1252 for (uint16 pos = 0; pos <= c_phrase_.sublma_num; pos++) {
1271 for (uint16 pos = 0;
1283 for (uint16 pos = 1; pos <= c_phrase_.sublma_num; pos++) {
1394 size_t MatrixSearch::get_spl_start(const uint16 *&spl_start) {
1407 uint16 splid = dep->splids[dep->splids_extended];
1504 uint16 pos = dep->splids_extended;
1509 uint16 splid = dep->splids[pos];
1582 uint16 spl_ids[],
1583 uint16 spl_id_num) {
1595 for (uint16 spl_pos = 0; spl_pos < spl_id_num; spl_pos++) {
1612 uint16 *retstr_len,
1655 uint16 str_len = get_lemma_str(idxs[id_num], str, kMaxLemmaSize + 1);
1681 size_t MatrixSearch::get_lpis(const uint16* splid_str, size_t splid_str_len,
1780 uint16 MatrixSearch::get_lemma_str(LemmaIdType id_lemma, char16 *str_buf,
1781 uint16 str_max) {
1782 uint16 str_len = 0;
1807 uint16 MatrixSearch::get_lemma_splids(LemmaIdType id_lemma, uint16 *splids,
1808 uint16 splids_max, bool arg_valid) {
1809 uint16 splid_num = 0;
1834 for (uint16 pos = 0; pos < c_phrase_.length; pos++) {
1844 size_t MatrixSearch::inner_predict(const char16 *fixed_buf, uint16 fixed_len,