36 references to Loop
System.Text.RegularExpressions.Generator (36)
RegexGenerator.Emitter.cs (7)
2911
case RegexNodeKind.
Loop
:
4297
Debug.Assert(node.Kind is RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}");
4317
Debug.Assert(node.Kind is RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}");
5478
RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop => node.M == 0 && node.N == 1 ? $"Optional ({(node.Kind is RegexNodeKind.
Loop
? "greedy" : "lazy")})." : $"Loop {DescribeLoop(node, rm)}{direction}.",
5568
RegexNodeKind.Atomic when node.Child(0).Kind is RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop or RegexNodeKind.Alternate => true,
5629
RegexNodeKind.
Loop
=> rm.Analysis.IsAtomicByAncestor(node) ? "greedily and atomically" : "greedily",
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (15)
264
case RegexNodeKind.
Loop
:
453
if ((existingChild.Kind is RegexNodeKind.Alternate or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional or RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop) &&
493
goto case RegexNodeKind.
Loop
;
494
case RegexNodeKind.
Loop
:
543
RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop => ReduceLoops(),
767
Debug.Assert(Kind is RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop);
783
if (kind == RegexNodeKind.
Loop
)
1417
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.M > 0:
1862
if (node.Kind == RegexNodeKind.
Loop
)
1939
Debug.Assert(node.Kind is RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop);
2080
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when subsequent.M > 0:
2289
case RegexNodeKind.
Loop
:
2395
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop:
2714
var result = new RegexNode(lazy ? RegexNodeKind.Lazyloop : RegexNodeKind.
Loop
, Options, min, max);
2942
case RegexNodeKind.
Loop
:
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNodeKind.cs (3)
32
/// This is purely a representational optimization, equivalent to a <see cref="
Loop
"/> wrapped around a <see cref="One"/>.
37
/// This is purely a representational optimization, equivalent to a <see cref="
Loop
"/> wrapped around a <see cref="Notone"/>.
41
/// This is purely a representational optimization, equivalent to a <see cref="
Loop
"/> wrapped around a <see cref="Set"/>.
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (8)
226
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.M > 0:
439
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.M > 0:
493
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.M > 0:
686
case RegexNodeKind.Lazyloop or RegexNodeKind.
Loop
when node.M > 0:
1027
case RegexNodeKind.
Loop
:
1201
(nextChild.Kind is RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop && nextChild.M >= 1))
1279
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.M >= 1:
1340
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when leading && node.M >= 1:
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexTreeAnalyzer.cs (3)
50
case RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.M != node.N:
75
case RegexNodeKind.
Loop
:
111
RegexNodeKind.
Loop
or RegexNodeKind.Lazyloop when node.N == 1 => true,