25 writes to Kind
System.Text.RegularExpressions (25)
System\Text\RegularExpressions\RegexNode.cs (25)
53Kind = kind; 59Kind = kind; 66Kind = kind; 73Kind = kind; 80Kind = kind; 152Kind += kind - RegexNodeKind.One; 172Kind += RegexNodeKind.Oneloopatomic - RegexNodeKind.Oneloop; 179Kind += RegexNodeKind.Oneloopatomic - RegexNodeKind.Onelazy; 189Kind = RegexNodeKind.Empty; 197Kind = RegexNodeKind.Multi; 208Kind = RegexNodeKind.Atomic; 228Kind = RegexNodeKind.Empty; 963Kind = RegexNodeKind.Nothing; 970Kind = 980Kind = 1155prev.Kind = RegexNodeKind.Set; 1438node.Kind = RegexNodeKind.Empty; 1447node.Kind = RegexNodeKind.Empty; 1452node.Kind = RegexNodeKind.One; 1777prev.Kind = RegexNodeKind.Multi; 1922nextNode.Kind = RegexNodeKind.One; 1945currentNode.Kind = nextNode.Kind; 2067node.Kind -= RegexNodeKind.Onelazy - RegexNodeKind.Oneloop; // lazy to greedy 2225Kind = RegexNodeKind.Nothing; 3070Kind = RegexNodeKind.Multi;
314 references to Kind
System.Text.RegularExpressions (314)
System\Text\RegularExpressions\RegexCompiler.cs (70)
1268Debug.Assert(target.LoopNode.Kind is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic); 1451Debug.Assert(node.Kind == RegexNodeKind.Capture, "Every generated tree should begin with a capture node"); 1459switch (node.Kind) 1467int length = node.Kind == RegexNodeKind.Multi ? node.Str!.Length : 1; 1667Debug.Assert(node.Kind is RegexNodeKind.Alternate, $"Unexpected type: {node.Kind}"); 2025switch (child.Kind) 2039case RegexNodeKind.Concatenate when child.Child(0) == startingLiteralNode && (startingLiteralNode.Kind is RegexNodeKind.One or RegexNodeKind.Set or RegexNodeKind.Multi): 2049child.Child(0).Kind is RegexNodeKind.Multi ? 2089Debug.Assert(multi.Kind is RegexNodeKind.Multi, $"Expected a Multi node, got {multi.Kind}"); 2099Debug.Assert(node.Kind is RegexNodeKind.Backreference, $"Unexpected type: {node.Kind}"); 2274Debug.Assert(node.Kind is RegexNodeKind.BackreferenceConditional, $"Unexpected type: {node.Kind}"); 2288RegexNode? noBranch = node.Child(1) is { Kind: not RegexNodeKind.Empty } childNo ? childNo : null; 2433Debug.Assert(node.Kind is RegexNodeKind.ExpressionConditional, $"Unexpected type: {node.Kind}"); 2449RegexNode? noBranch = node.Child(2) is { Kind: not RegexNodeKind.Empty } childNo ? childNo : null; 2626Debug.Assert(node.Kind is RegexNodeKind.Capture, $"Unexpected type: {node.Kind}"); 2752Debug.Assert(node.Kind is RegexNodeKind.PositiveLookaround, $"Unexpected type: {node.Kind}"); 2796Debug.Assert(node.Kind is RegexNodeKind.NegativeLookaround, $"Unexpected type: {node.Kind}"); 2945switch (node.Kind) 3049Debug.Fail($"Unexpected node type: {node.Kind}"); 3055Debug.Assert(node.Kind is RegexNodeKind.Atomic or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround or RegexNodeKind.ExpressionConditional, $"Unexpected type: {node.Kind}"); 3056Debug.Assert(node.Kind is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}"); 3062if (node.Kind is RegexNodeKind.Atomic && !analysis.MayBacktrack(child)) 3099Debug.Assert(node.Kind is RegexNodeKind.UpdateBumpalong, $"Unexpected type: {node.Kind}"); 3119Debug.Assert(node.Kind is RegexNodeKind.Concatenate, $"Unexpected type: {node.Kind}"); 3177if (next.Kind is not RegexNodeKind.UpdateBumpalong) // skip node types that don't have a semantic impact 3190Debug.Assert(node.IsOneFamily || node.IsNotoneFamily || node.IsSetFamily, $"Unexpected type: {node.Kind}"); 3265Debug.Assert(node.Kind is RegexNodeKind.Boundary or RegexNodeKind.NonBoundary or RegexNodeKind.ECMABoundary or RegexNodeKind.NonECMABoundary, $"Unexpected type: {node.Kind}"); 3281switch (node.Kind) 3297if (node.Kind is RegexNodeKind.Boundary) 3310if (node.Kind is RegexNodeKind.ECMABoundary) 3325Debug.Assert(node.Kind is RegexNodeKind.Beginning or RegexNodeKind.Start or RegexNodeKind.Bol or RegexNodeKind.End or RegexNodeKind.EndZ or RegexNodeKind.Eol, $"Unexpected type: {node.Kind}"); 3330switch (node.Kind) 3344if (node.Kind == RegexNodeKind.Beginning) 3463Debug.Assert(node.Kind is RegexNodeKind.Multi, $"Unexpected type: {node.Kind}"); 3515Debug.Assert(node.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Notoneloop or RegexNodeKind.Setloop, $"Unexpected type: {node.Kind}"); 3731Debug.Assert(node.Kind is RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy or RegexNodeKind.Setlazy, $"Unexpected type: {node.Kind}"); 3832node.Kind is RegexNodeKind.Notonelazy && 3973node.Kind is RegexNodeKind.Setlazy && 4078Debug.Assert(node.Kind is RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}"); 4440Debug.Assert(node.IsOneFamily || node.IsNotoneFamily || node.IsSetFamily, $"Unexpected type: {node.Kind}"); 4589Debug.Assert(node.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic, $"Unexpected type: {node.Kind}"); 4836Debug.Assert(node.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic, $"Unexpected type: {node.Kind}"); 4925Debug.Assert(node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}"); 4929Debug.Assert(!analysis.MayBacktrack(node.Child(0)), $"Expected non-backtracking node {node.Kind}"); 4963Debug.Assert(node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.Kind}"); 5361if (node.Kind == RegexNodeKind.Multi) 5394if (node.Kind == RegexNodeKind.Multi) 5587if (root.Kind is RegexNodeKind.Multi or RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set) 5605Ldc((root.Kind == RegexNodeKind.Multi ? root.Str!.Length : 1) * (!rtl ? 1 : -1));
System\Text\RegularExpressions\RegexFindOptimizations.cs (1)
822Debug.Assert(loopNode.Kind is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic);
System\Text\RegularExpressions\RegexNode.cs (181)
89Debug.Assert(Kind is RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or 95new RegexNode(Kind, Options, Str!) : 96new RegexNode(Kind, Options, Ch); 138Kind == RegexNodeKind.Concatenate && 167switch (Kind) 193else if (Kind == RegexNodeKind.Oneloopatomic && N is >= 2 and <= MultiVsRepeaterLimit) 205if (Parent is not { Kind: RegexNodeKind.Atomic }) 233Debug.Fail($"Unexpected type: {Kind}"); 243Debug.Assert(Kind == RegexNodeKind.Capture, "Every generated tree should begin with a capture node"); 262Debug.Assert(Kind != RegexNodeKind.Group, "All Group nodes should have been removed."); 265switch (node.Kind) 298Debug.Assert(childCount == 0, $"Expected zero children for {node.Kind}, got {childCount}."); 307Debug.Assert(childCount == 1, $"Expected one and only one child for {node.Kind}, got {childCount}."); 311Debug.Assert(childCount == 2, $"Expected two children for {node.Kind}, got {childCount}"); 315Debug.Assert(childCount == 3, $"Expected three children for {node.Kind}, got {childCount}"); 320Debug.Assert(childCount >= 2, $"Expected at least two children for {node.Kind}, got {childCount}."); 324Debug.Fail($"Unexpected node type: {node.Kind}"); 329switch (node.Kind) 340Debug.Assert(!string.IsNullOrEmpty(node.Str), $"Expected non-null, non-empty string for {node.Kind}."); 344Debug.Assert(node.Str is null, $"Expected null string for {node.Kind}, got \"{node.Str}\"."); 349switch (node.Kind) 355Debug.Assert((node.Options & RegexOptions.IgnoreCase) == 0, $"{node.Kind} node should not have RegexOptions.IgnoreCase"); 372Debug.Assert(rootNode.Kind == RegexNodeKind.Capture); 413switch (node.Kind) 426if (node.Parent is { Kind: RegexNodeKind.Concatenate } parent) 471switch (node.Kind) 498if ((existingChild.Kind is RegexNodeKind.Alternate or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional or RegexNodeKind.Loop or RegexNodeKind.Lazyloop) && 499node.Parent is not { Kind: RegexNodeKind.Atomic }) // validate grandparent isn't atomic 521if (node.Kind != RegexNodeKind.ExpressionConditional) // ReduceExpressionConditional will have already applied ending backtracking removal 542Debug.Assert(node.Kind is RegexNodeKind.Atomic or RegexNodeKind.Empty or RegexNodeKind.Loop or RegexNodeKind.Lazyloop); 544if (node.Kind is RegexNodeKind.Atomic) 547Debug.Assert(node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop); 550if (node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop) 577switch (Kind) 589return Kind switch 612Debug.Assert(Kind is RegexNodeKind.Alternate or RegexNodeKind.Concatenate); 6150 => new RegexNode(Kind == RegexNodeKind.Alternate ? RegexNodeKind.Nothing : RegexNodeKind.Empty, Options), 629Debug.Assert(Kind == RegexNodeKind.Group); 632while (u.Kind == RegexNodeKind.Group) 657Debug.Assert(Kind == RegexNodeKind.Atomic); 662while (child.Kind == RegexNodeKind.Atomic) 668switch (child.Kind) 704if (branches[0].Kind == RegexNodeKind.Empty) 715if (branches[i].Kind == RegexNodeKind.Empty) 796(child.Child(0).Kind is RegexNodeKind.Empty || child.Child(1).Kind is RegexNodeKind.Empty); // can be transformed into a ? or ?? 811return child.Kind == RegexNodeKind.Empty ? 826Debug.Assert(Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop); 829RegexNodeKind kind = Kind; 839if (child.Kind != kind) 844switch (child.Kind) 858switch (child.Kind) 905switch (child.Kind) 910child.MakeRep(u.Kind == RegexNodeKind.Lazyloop ? RegexNodeKind.Onelazy : RegexNodeKind.Oneloop, u.M, u.N); 958Debug.Assert(Kind is RegexNodeKind.Set or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy); 971Kind == RegexNodeKind.Set ? RegexNodeKind.One : 972Kind == RegexNodeKind.Setloop ? RegexNodeKind.Oneloop : 973Kind == RegexNodeKind.Setloopatomic ? RegexNodeKind.Oneloopatomic : 981Kind == RegexNodeKind.Set ? RegexNodeKind.Notone : 982Kind == RegexNodeKind.Setloop ? RegexNodeKind.Notoneloop : 983Kind == RegexNodeKind.Setloopatomic ? RegexNodeKind.Notoneloopatomic : 1018Debug.Assert(Kind == RegexNodeKind.Alternate); 1031if (node.Kind == RegexNodeKind.Alternate) 1034if (node.Kind == RegexNodeKind.Alternate) 1037if (node.Kind == RegexNodeKind.Alternate) 1045if (node.Kind is RegexNodeKind.Alternate && node.ChildCount() == 2) 1047if (node.Child(1).Kind is RegexNodeKind.Empty) 1051else if (node.Child(0).Kind is RegexNodeKind.Empty) 1088if (at.Kind == RegexNodeKind.Alternate) 1106else if (at.Kind is RegexNodeKind.Set or RegexNodeKind.One) 1111if (at.Kind == RegexNodeKind.Set) 1135if (prev.Kind == RegexNodeKind.One) 1145if (at.Kind == RegexNodeKind.One) 1162else if (at.Kind == RegexNodeKind.Nothing) 1186Debug.Assert(alternation.Kind == RegexNodeKind.Alternate); 1199if (child.Kind != RegexNodeKind.Concatenate || child.ChildCount() < 2) 1214switch (required.Kind) 1234if (required.Kind != other.Kind || 1260if (alternation.Parent is RegexNode { Kind: RegexNodeKind.Atomic }) 1285Debug.Assert(node.Kind == RegexNodeKind.Alternate); 1294switch (child.Kind) 1328Debug.Assert(alternation.Kind == RegexNodeKind.Alternate); 1355if (startingNode.Kind == RegexNodeKind.One) 1375if (startingNode.Kind == RegexNodeKind.One) 1389Debug.Assert(startingNode.Kind == RegexNodeKind.Multi); 1426ProcessOneOrMulti(branch.Kind == RegexNodeKind.Concatenate ? branch.Child(0) : branch, startingSpan); 1434if (node.Kind == RegexNodeKind.One) 1443Debug.Assert(node.Kind == RegexNodeKind.Multi); 1464if (alternation.Parent is RegexNode parent && parent.Kind == RegexNodeKind.Atomic) 1491RegexNode branch = Kind == RegexNodeKind.Concatenate ? Child(0) : this; 1492return branch.Kind is RegexNodeKind.One or RegexNodeKind.Multi ? branch : null; 1498Debug.Assert(Kind is RegexNodeKind.One or RegexNodeKind.Multi || (IsOneFamily && M > 0)); 1513Debug.Assert(Kind is RegexNodeKind.Alternate); 1537if (startingLiteralNode.IsOneFamily || startingLiteralNode.Kind is RegexNodeKind.Multi) 1581switch (node.Kind) 1616switch (node.Kind) 1683Debug.Assert(Kind == RegexNodeKind.Concatenate); 1699if (child.Kind == RegexNodeKind.Nothing) 1725Debug.Assert(Kind == RegexNodeKind.Concatenate); 1742if (at.Kind == RegexNodeKind.Concatenate && 1761else if (at.Kind is RegexNodeKind.Multi or RegexNodeKind.One) 1775if (prev.Kind == RegexNodeKind.One) 1782((at.Kind == RegexNodeKind.One) ? $"{prev.Str}{at.Ch}" : prev.Str + at.Str) : 1783((at.Kind == RegexNodeKind.One) ? $"{at.Ch}{prev.Str}" : at.Str + prev.Str); 1785else if (at.Kind == RegexNodeKind.Empty) 1808Debug.Assert(Kind == RegexNodeKind.Concatenate); 1843switch (currentNode.Kind) 1846case RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy when nextNode.Kind == currentNode.Kind && currentNode.Ch == nextNode.Ch: 1847case RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy when nextNode.Kind == currentNode.Kind && currentNode.Str == nextNode.Str: 1849currentNode.Kind is RegexNodeKind.Oneloopatomic or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Setloopatomic) 1872case RegexNodeKind.Oneloop or RegexNodeKind.Onelazy when nextNode.Kind == RegexNodeKind.One && currentNode.Ch == nextNode.Ch: 1873case RegexNodeKind.Notoneloop or RegexNodeKind.Notonelazy when nextNode.Kind == RegexNodeKind.Notone && currentNode.Ch == nextNode.Ch: 1874case RegexNodeKind.Setloop or RegexNodeKind.Setlazy when nextNode.Kind == RegexNodeKind.Set && currentNode.Str == nextNode.Str: 1889nextNode.Kind == RegexNodeKind.Multi && 1940case RegexNodeKind.One when (nextNode.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) && currentNode.Ch == nextNode.Ch: 1941case RegexNodeKind.Notone when (nextNode.Kind is RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy) && currentNode.Ch == nextNode.Ch: 1942case RegexNodeKind.Set when (nextNode.Kind is RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy) && currentNode.Str == nextNode.Str: 1945currentNode.Kind = nextNode.Kind; 1955case RegexNodeKind.Notone when nextNode.Kind == currentNode.Kind && currentNode.Ch == nextNode.Ch: 1956case RegexNodeKind.Set when nextNode.Kind == RegexNodeKind.Set && currentNode.Str == nextNode.Str: 1967when nextNode.Kind == currentNode.Kind: 2010if (Kind is not RegexNodeKind.Concatenate) 2034while (node.Kind is RegexNodeKind.Capture or RegexNodeKind.Concatenate) 2040switch (node.Kind) 2086while (loopChild.Kind is RegexNodeKind.Capture or RegexNodeKind.Concatenate) 2091if (loopChild.Kind is 2099else if (node.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop) 2142for (int b = node.Kind == RegexNodeKind.ExpressionConditional ? 1 : 0; b < alternateBranches; b++) 2156Debug.Assert(Kind is RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround); 2164if (Kind is RegexNodeKind.NegativeLookaround && ContainsKind(Child(0), [RegexNodeKind.Backreference, RegexNodeKind.BackreferenceConditional]) is false) 2179if (node is { Kind: RegexNodeKind.Capture, N: -1 }) 2210if (Kind is RegexNodeKind.PositiveLookaround) 2212if (((Options & RegexOptions.RightToLeft) == 0 && IsZeroWidthAssertion(child.Kind)) || 2213child.Kind is RegexNodeKind.Empty) 2218else if (Kind is RegexNodeKind.NegativeLookaround) 2223if (child.Kind is RegexNodeKind.Empty) 2248if (node.Kind == kind) 2276Debug.Assert(Kind == RegexNodeKind.BackreferenceConditional); 2294Debug.Assert(Kind == RegexNodeKind.ExpressionConditional); 2312if (condition.Kind == RegexNodeKind.PositiveLookaround && (condition.Options & RegexOptions.RightToLeft) == 0) 2339while (node.Kind is RegexNodeKind.Capture or RegexNodeKind.Concatenate) 2353switch (subsequent.Kind) 2393switch (subsequent.Kind) 2409switch (node.Kind) 2413switch (subsequent.Kind) 2443switch (subsequent.Kind) 2462switch (subsequent.Kind) 2509switch (subsequent.Kind) 2551switch (parent?.Kind) 2598Debug.Assert(node.Kind is not RegexNodeKind.Concatenate, "The existing logic assumes that the node itself isn't a concatenation."); 2609switch (parent.Kind) 2651switch (Kind) 2746Debug.Fail($"Unknown node: {Kind}"); 2764switch (Kind) 2824int i = Kind == RegexNodeKind.BackreferenceConditional ? 0 : 1; 2883Debug.Fail($"Unknown node: {Kind}"); 2907Debug.Assert(Kind == RegexNodeKind.Concatenate, $"Expected Concatenate, got {Kind}"); 2920if (child.Kind is RegexNodeKind.One) 2933else if (child.Kind is RegexNodeKind.Multi) 2945else if (child.Kind is RegexNodeKind.Set || 2946(child.Kind is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic && child.M == child.N)) 2955vsb.Append((char)(twoChars[0] | 0x20), child.Kind is RegexNodeKind.Set ? 1 : child.M); 2957else if (child.Kind is RegexNodeKind.Empty) 2962else if (consumeZeroWidthNodes && IsZeroWidthAssertion(child.Kind)) 3008Debug.Assert(Kind == RegexNodeKind.Concatenate, $"Expected Concatenate, got {Kind}"); 3010static bool CanJoinLengthCheck(RegexNode node) => node.Kind switch 3064case <= MultiVsRepeaterLimit when Kind == RegexNodeKind.One: 3077switch (Kind) 3209public bool IsSetFamily => Kind is RegexNodeKind.Set or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy; 3212public bool IsOneFamily => Kind is RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy; 3215public bool IsNotoneFamily => Kind is RegexNodeKind.Notone or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy; 3254var sb = new StringBuilder(Kind.ToString()); 3264switch (Kind) 3303switch (Kind)
System\Text\RegularExpressions\RegexParser.cs (6)
1004if (_group!.Kind != RegexNodeKind.ExpressionConditional) 1142if (result != null && result.Kind == RegexNodeKind.Backreference && (result.Options & RegexOptions.IgnoreCase) != 0) 2034if (_group.Kind == RegexNodeKind.ExpressionConditional && _group.ChildCount() == 0) 2059if (_group!.Kind is RegexNodeKind.ExpressionConditional or RegexNodeKind.BackreferenceConditional) 2074if (_group!.Kind is RegexNodeKind.ExpressionConditional or RegexNodeKind.BackreferenceConditional) 2078if (_group.Kind == RegexNodeKind.BackreferenceConditional && _group.ChildCount() > 2 || _group.ChildCount() > 3)
System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (27)
80switch (node.Kind) 114int reps = node.Kind is RegexNodeKind.One ? 1 : Math.Min(node.M, MaxPrefixLength); 119return node.Kind is RegexNodeKind.One || reps == node.N; 164int reps = node.Kind is RegexNodeKind.Set ? 1 : Math.Min(node.M, MaxPrefixLength); 209return node.Kind is RegexNodeKind.Set || reps == node.N; 360switch (node.Kind) 489switch (node.Kind) 598switch (node.Kind) 950switch (node.Kind) 959return node.Kind is RegexNodeKind.One || node.M > 0 ? true : null; 977return node.Kind is RegexNodeKind.Notone || node.M > 0 ? true : null; 996node.Kind is RegexNodeKind.Set || node.M > 0 ? true : 1104int branchStart = node.Kind is RegexNodeKind.BackreferenceConditional ? 0 : 1; 1118Debug.Fail($"Unexpected node {node.Kind}"); 1138while (node.Kind is RegexNodeKind.Atomic or RegexNodeKind.Capture) 1142if (node.Kind != RegexNodeKind.Concatenate) 1155while (firstChild.Kind is RegexNodeKind.Atomic or RegexNodeKind.Capture) 1159if (firstChild.Kind is not (RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy) || firstChild.N != int.MaxValue) 1167if (nextChild.Kind == RegexNodeKind.UpdateBumpalong) 1224while ((nextChild.Kind is RegexNodeKind.Atomic or RegexNodeKind.Capture or RegexNodeKind.Concatenate) || 1225(nextChild.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop && nextChild.M >= 1)) 1233(nextChild.Kind is RegexNodeKind.Set || nextChild.M >= 1)) 1277switch (node.Kind) 1349switch (node.Kind) 1358return node.Kind; 1386switch (tmpChild.Kind) 1416if (node.Child(i).Kind is not (RegexNodeKind.Empty or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround))
System\Text\RegularExpressions\RegexReplacement.cs (4)
36Debug.Assert(concat.Kind == RegexNodeKind.Concatenate, $"Expected Concatenate, got {concat.Kind}"); 48switch (child.Kind) 77Debug.Fail($"Unexpected child kind {child.Kind}");
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (3)
47switch (node.Kind) 59switch (node.Kind) 90bool treatChildAsAtomic = (isAtomicByAncestor | isAtomicBySelf) && node.Kind switch
System\Text\RegularExpressions\RegexWriter.cs (11)
85EmitFragment(curNode.Kind, curNode, 0); 89EmitFragment(curNode.Kind | BeforeChild, curNode, curChild); 105EmitFragment(curNode.Kind | AfterChild, curNode, curChild); 383Emit((RegexOpcode)node.Kind | bits, node.Ch); 394Emit(((node.Kind is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) ? 399Emit((RegexOpcode)node.Kind | bits, node.Ch, node.N == int.MaxValue ? int.MaxValue : node.N - node.M); 414Emit((RegexOpcode)node.Kind | bits, stringCode, (node.N == int.MaxValue) ? int.MaxValue : node.N - node.M); 420Emit((RegexOpcode)node.Kind | bits, StringCode(node.Str!)); 424Emit((RegexOpcode)node.Kind | bits, StringCode(node.Str!)); 428Emit((RegexOpcode)node.Kind | bits, RegexParser.MapCaptureNumber(node.M, _tree.CaptureNumberSparseMapping)); 443Emit((RegexOpcode)node.Kind);
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (11)
53switch (node.Kind) 117result.AddLast(_builder.CreateLoop(_builder.CreateSingleton(bdd), node.Kind is RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy, node.M, node.N)); 128result.AddLast(_builder.CreateLoop(_builder.CreateSingleton(setBdd), node.Kind == RegexNodeKind.Setlazy, node.M, node.N)); 178throw new NotSupportedException(SR.Format(SR.NotSupported_NonBacktrackingConflictingExpression, node.Kind switch 195string description = $"Unexpected ({nameof(RegexNodeKind)}: {node.Kind})"; 209switch (node.Kind) 260result.AddLast(_builder.CreateLoop(body, node.Kind == RegexNodeKind.Lazyloop, node.M, node.N)); 267Debug.Assert(node.Kind == RegexNodeKind.Capture && node.N == -1); 285Debug.Assert(rootResult.Count == 1 || root.Kind == RegexNodeKind.Concatenate || root.Kind == RegexNodeKind.Capture); 312Debug.Assert(node.Kind == RegexNodeKind.Set);