Lines Matching defs:from
99 // Execute a regular expression on the subject, starting from index.
237 // Represents code units in the range from from_ to to_, both ends are
244 CharacterRange(uc16 from, uc16 to) : from_(from), to_(to) { }
251 static inline CharacterRange Range(uc16 from, uc16 to) {
252 DCHECK(from <= to);
253 return CharacterRange(from, to);
259 uc16 from() const { return from_; }
273 // Whether a range list is in canonical form: Ranges ordered by from value,
323 // A mapping from integers, specified as ranges, to a set of integers.
332 Entry(uc16 from, uc16 to, OutSet* out_set)
333 : from_(from), to_(to), out_set_(out_set) { }
334 uc16 from() { return from_; }
531 // Merge in the information from another branch of an alternation.
555 // How many characters do we have quick check information from. This is
700 Interval(int from, int to) : from_(from), to_(to) { }
713 int from() const { return from_; }
978 // Returning 0 from EatsAtLeast should ensure we never get here.
985 // Returning 0 from EatsAtLeast should ensure we never get here.
1217 // our example this is from index 1 to 2 (0 is not constrained). We can now
1307 if (interval.from() > max_char_) return;
1310 info->SetInterval(Interval(interval.from(), max_char_));
1339 bool FindWorthwhileInterval(int* from, int* to);
1341 int max_number_of_chars, int old_biggest_points, int* from, int* to);
1441 // from the backtrack stack rather than using a direct jump instruction. We
