Lines Matching defs:for
83 /// engine utilizing such an automaton is responsible for UTF-8 decoding.
105 /// When set, the machine returned is suitable for use in the DFA matching
117 /// When set, the machine returned is suitable for matching text in
185 for (i, expr) in exprs[0..exprs.len() - 1].iter().enumerate() {
261 /// and has hole2 for a hole. In fact, if you look at the c_concat
263 /// a list of expressions rather than just the two that we use for
287 for r in cls.iter() {
333 // class from non-ASCII bytes. Otherwise, it's possible for
351 // See comments above for why we set the ASCII range here.
407 // Don't ever compile Save instructions for regex sets because
490 for r in &ranges[0..ranges.len() - 1] {
531 for e in exprs {
556 for e in &exprs[0..exprs.len() - 1] {
727 for _ in min..max {
745 /// Can be used as a default value for the c_* functions when the call to
759 for hole in holes {
799 for hole in holes {
991 for (i, range) in self.ranges.iter().enumerate() {
1037 // The initial instruction for each UTF-8 sequence should be the same.
1040 for byte_range in seq {
1074 /// `SuffixCache` is a simple bounded hash map for caching suffix entries in
1090 /// Note that a HashMap could be trivially used for this, but we don't need its
1094 /// except it uses hashes as original indices and then compares full keys for
1205 impl fmt::Debug for ByteClassSet {
1259 for i in 0..256u16 {