Lines Matching refs:at
6 // backtracking engine is typically faster on small regexes/texts at the
10 // and execute Unicode word boundary assertions), but at a slower speed.
13 // at once where as the DFA is only ever in one state at a time.
69 /// Follow transitions at the given instruction pointer.
102 let at = input.at(start);
109 at,
121 mut at: InputAt,
142 || (!at.is_start() && self.prog.is_anchored_start)
151 at = match self.input.prefix_at(&self.prog.prefixes, at) {
153 Some(at) => at,
159 // a state starting at the current position in the input for the
164 self.add(&mut clist, slots, 0, at);
168 // we can to look at the current character, so we advance the
170 let at_next = self.input.at(at.next_pos());
179 at,
202 if at.pos() >= end {
205 at = at_next;
212 /// Step through the input, one token (byte or codepoint) at a time.
222 /// at and at_next are the current and next positions in the input. at or
231 at: InputAt,
246 if inst.c == at.char() {
252 if inst.matches(at.char()) {
258 if let Some(b) = at.byte() {
270 /// starting at and including ip.
276 at: InputAt,
282 self.add_step(nlist, thread_caps, ip, at);
297 at: InputAt,
312 if self.input.is_empty_match(at, inst) {
322 thread_caps[inst.slot] = Some(at.pos());