44 references to Lazyloop
System.Text.RegularExpressions (44)
System\Text\RegularExpressions\RegexCompiler.cs (4)
3016case RegexNodeKind.Lazyloop: 4099Debug.Assert(node.Kind is RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}"); 4946Debug.Assert(node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}"); 4984Debug.Assert(node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}");
System\Text\RegularExpressions\RegexNode.cs (21)
215case RegexNodeKind.Lazyloop: 303case RegexNodeKind.Lazyloop: 498if ((existingChild.Kind is RegexNodeKind.Alternate or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional or RegexNodeKind.Loop or RegexNodeKind.Lazyloop) && 536case RegexNodeKind.Lazyloop: 542Debug.Assert(node.Kind is RegexNodeKind.Atomic or RegexNodeKind.Empty or RegexNodeKind.Loop or RegexNodeKind.Lazyloop); 547Debug.Assert(node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop); 550if (node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop) 595RegexNodeKind.Loop or RegexNodeKind.Lazyloop => ReduceLoops(), 826Debug.Assert(Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop); 910child.MakeRep(u.Kind == RegexNodeKind.Lazyloop ? RegexNodeKind.Onelazy : RegexNodeKind.Oneloop, u.M, u.N); 1597case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.M > 0: 2073case RegexNodeKind.Lazyloop when CanBeMadeAtomic(node, subsequent, iterateNullableSubsequent: false, allowLazy: true): 2106else if (node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop) 2128case RegexNodeKind.Lazyloop: 2370case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when subsequent.M > 0: 2495case RegexNodeKind.Lazyloop when allowLazy: 2604RegexNodeKind.Loop or RegexNodeKind.Lazyloop when M != N => true, 2728case RegexNodeKind.Lazyloop: 2835case RegexNodeKind.Loop or RegexNodeKind.Lazyloop: 3139var result = new RegexNode(lazy ? RegexNodeKind.Lazyloop : RegexNodeKind.Loop, Options, min, max); 3368case RegexNodeKind.Lazyloop:
System\Text\RegularExpressions\RegexNodeKind.cs (3)
46/// This is purely a representational optimization, equivalent to a <see cref="Lazyloop"/> wrapped around a <see cref="One"/>. 50/// This is purely a representational optimization, equivalent to a <see cref="Lazyloop"/> wrapped around a <see cref="Notone"/>. 54/// This is purely a representational optimization, equivalent to a <see cref="Lazyloop"/> wrapped around a <see cref="Set"/>.
System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (8)
226case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.M > 0: 439case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.M > 0: 493case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.M > 0: 686case RegexNodeKind.Lazyloop or RegexNodeKind.Loop when node.M > 0: 1038case RegexNodeKind.Lazyloop: 1225(nextChild.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop && nextChild.M >= 1)) 1303case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.M >= 1: 1362case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when leading && node.M >= 1:
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (2)
72case RegexNodeKind.Lazyloop: 107RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.N == 1 => true,
System\Text\RegularExpressions\RegexWriter.cs (2)
312case RegexNodeKind.Lazyloop | BeforeChild: 328case RegexNodeKind.Lazyloop | AfterChild:
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (3)
87case RegexNodeKind.Lazyloop: 251case RegexNodeKind.Lazyloop: 260result.AddLast(_builder.CreateLoop(body, node.Kind == RegexNodeKind.Lazyloop, node.M, node.N));
System\Text\RegularExpressions\Symbolic\SymbolicRegexKind.cs (1)
15/// <summary>A node that matches a loop (e.g. <see cref="RegexNodeKind.Loop"/>, <see cref="RegexNodeKind.Lazyloop"/>, <see cref="RegexNodeKind.Setloop"/>, etc.).</summary>