Lines Matching defs:idx

574 re_string_reconstruct (re_string_t *pstr, Idx idx, int eflags)
578 if (BE (pstr->raw_mbs_idx <= idx, 0))
579 offset = idx - pstr->raw_mbs_idx;
597 offset = idx;
644 pstr->len = pstr->raw_len - idx + offset;
645 pstr->stop = pstr->raw_stop - idx + offset;
697 pstr->len = pstr->raw_len - idx + offset;
698 pstr->stop = pstr->raw_stop - idx + offset;
766 pstr->valid_len = re_string_skip_chars (pstr, idx, &wc) - idx;
802 pstr->raw_mbs_idx = idx;
837 re_string_peek_byte_case (const re_string_t *pstr, Idx idx)
844 return re_string_peek_byte (pstr, idx);
848 && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx))
849 return re_string_peek_byte (pstr, idx);
852 off = pstr->cur_idx + idx;
866 return re_string_peek_byte (pstr, idx);
926 re_string_context_at (const re_string_t *input, Idx idx, int eflags)
929 if (BE (! REG_VALID_INDEX (idx), 0))
933 if (BE (idx == input->len, 0))
940 Idx wc_idx = idx;
960 c = re_string_byte_at (input, idx);
1285 Idx idx;
1313 idx = 0;
1314 for (idx = set->nelem; idx > 0; idx--)
1315 set->elems[idx] = set->elems[idx - 1];
1319 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1320 set->elems[idx] = set->elems[idx - 1];
1324 set->elems[idx] = elem;
1369 /* Return (idx + 1) if SET contains the element ELEM, return 0 otherwise. */
1375 __re_size_t idx, right, mid;
1380 idx = 0;
1382 while (idx < right)
1384 mid = (idx + right) / 2;
1386 idx = mid + 1;
1390 return set->elems[idx] == elem ? idx + 1 : 0;
1395 re_node_set_remove_at (re_node_set *set, Idx idx)
1397 if (idx < 0 || idx >= set->nelem)
1400 for (; idx < set->nelem; idx++)
1401 set->elems[idx] = set->elems[idx + 1];