26 references to Loop
System.Text.RegularExpressions (26)
System\Text\RegularExpressions\Symbolic\SymbolicRegexBuilder.cs (2)
233if (node.Kind == SymbolicRegexNodeKind.Loop && node._lower == 0 && node._upper == 1 && lower == 0 && upper == 1) 318case SymbolicRegexNodeKind.Loop:
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Automata.cs (1)
216else if (left._kind is SymbolicRegexNodeKind.Loop)
System\Text\RegularExpressions\Symbolic\SymbolicRegexNode.cs (23)
123case SymbolicRegexNodeKind.Loop: 257case SymbolicRegexNodeKind.Loop: 414if (lower == 0 && upper == 1 && body._kind == SymbolicRegexNodeKind.Loop && body._lower == 0 && body._upper == 1) 419return Create(builder, SymbolicRegexNodeKind.Loop, body, null, lower, upper, default, SymbolicRegexInfo.Loop(body._info, lower, isLazy)); 671if (left._left.IsNullable && rl._kind == SymbolicRegexNodeKind.Loop && rl._lower == 0 && rl._upper == 1 && rl.IsLazy) 685if (ll._kind == SymbolicRegexNodeKind.Loop && ll._lower == 0 && ll._upper == 1 && ll.IsLazy) 909case SymbolicRegexNodeKind.Loop: 1131SymbolicRegexNodeKind.Loop => PruneLoop(builder, context, _left, _right), 1138case SymbolicRegexNodeKind.Loop: 1160Debug.Assert(loop.Kind == SymbolicRegexNodeKind.Loop && loop._left is not null); 1214Debug.Assert(_kind == SymbolicRegexNodeKind.Loop && _left is not null); 1315case SymbolicRegexNodeKind.Loop: 1419case SymbolicRegexNodeKind.Loop: 1505case SymbolicRegexNodeKind.Loop when _lower == 0 && _upper == 1: 1570case SymbolicRegexNodeKind.Loop: 1695case SymbolicRegexNodeKind.Loop: 1880case SymbolicRegexNodeKind.Loop: 1935case SymbolicRegexNodeKind.Loop: 2009case SymbolicRegexNodeKind.Loop: 2053case SymbolicRegexNodeKind.Loop: 2138case SymbolicRegexNodeKind.Loop: 2313case SymbolicRegexNodeKind.Loop: 2386case SymbolicRegexNodeKind.Loop: