25 writes to Kind
System.Text.RegularExpressions.Generator (25)
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (25)
53
Kind
= kind;
59
Kind
= kind;
66
Kind
= kind;
73
Kind
= kind;
80
Kind
= kind;
152
Kind
+= kind - RegexNodeKind.One;
172
Kind
+= RegexNodeKind.Oneloopatomic - RegexNodeKind.Oneloop;
179
Kind
+= RegexNodeKind.Oneloopatomic - RegexNodeKind.Onelazy;
189
Kind
= RegexNodeKind.Empty;
197
Kind
= RegexNodeKind.Multi;
208
Kind
= RegexNodeKind.Atomic;
228
Kind
= RegexNodeKind.Empty;
963
Kind
= RegexNodeKind.Nothing;
970
Kind
=
980
Kind
=
1155
prev.
Kind
= RegexNodeKind.Set;
1439
node.
Kind
= RegexNodeKind.Empty;
1448
node.
Kind
= RegexNodeKind.Empty;
1453
node.
Kind
= RegexNodeKind.One;
1778
prev.
Kind
= RegexNodeKind.Multi;
1923
nextNode.
Kind
= RegexNodeKind.One;
1946
currentNode.
Kind
= nextNode.Kind;
2068
node.
Kind
-= RegexNodeKind.Onelazy - RegexNodeKind.Oneloop; // lazy to greedy
2232
Kind
= RegexNodeKind.Nothing;
3123
Kind
= RegexNodeKind.Multi;
300 references to Kind
System.Text.RegularExpressions.Generator (300)
RegexGenerator.cs (1)
373
if (node.
Kind
is RegexNodeKind.Backreference && (node.Options & RegexOptions.IgnoreCase) != 0)
RegexGenerator.Emitter.cs (80)
759
if (root.
Kind
is RegexNodeKind.Empty)
768
else if (root.
Kind
is RegexNodeKind.Nothing)
774
else if (root.
Kind
is RegexNodeKind.Multi or RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set)
783
writer.WriteLine($"int end = base.runtextpos = start {(!rtl ? "+" : "-")} {(root.
Kind
== RegexNodeKind.Multi ? root.Str!.Length : 1)};");
1502
Debug.Assert(target.LoopNode.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic);
1623
Debug.Assert(node.
Kind
== RegexNodeKind.Capture, "Every generated tree should begin with a capture node");
1805
Debug.Assert(node.
Kind
is RegexNodeKind.Alternate, $"Unexpected type: {node.
Kind
}");
1905
switch (child.
Kind
)
1920
case RegexNodeKind.Concatenate when child.Child(0) == startingLiteralNode && (startingLiteralNode.
Kind
is RegexNodeKind.One or RegexNodeKind.Set or RegexNodeKind.Multi):
1930
child.Child(0).
Kind
is RegexNodeKind.Multi ?
1976
Debug.Assert(multi.
Kind
is RegexNodeKind.Multi, $"Expected a Multi node, got {multi.
Kind
}");
2203
Debug.Assert(node.
Kind
is RegexNodeKind.Backreference, $"Unexpected type: {node.
Kind
}");
2272
Debug.Assert(node.
Kind
is RegexNodeKind.BackreferenceConditional, $"Unexpected type: {node.
Kind
}");
2285
RegexNode? noBranch = node.Child(1) is {
Kind
: not RegexNodeKind.Empty } childNo ? childNo : null;
2445
Debug.Assert(node.
Kind
is RegexNodeKind.ExpressionConditional, $"Unexpected type: {node.
Kind
}");
2461
RegexNode? noBranch = node.Child(2) is {
Kind
: not RegexNodeKind.Empty } childNo ? childNo : null;
2625
Debug.Assert(node.
Kind
is RegexNodeKind.Capture, $"Unexpected type: {node.
Kind
}");
2718
Debug.Assert(node.
Kind
is RegexNodeKind.PositiveLookaround, $"Unexpected type: {node.
Kind
}");
2759
Debug.Assert(node.
Kind
is RegexNodeKind.NegativeLookaround, $"Unexpected type: {node.
Kind
}");
2889
switch (node.
Kind
)
2917
switch (node.
Kind
)
2954
switch (node.
Kind
)
3022
Debug.Fail($"Unexpected node type: {node.
Kind
}");
3028
Debug.Assert(node.
Kind
is RegexNodeKind.Atomic or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround or RegexNodeKind.ExpressionConditional, $"Unexpected type: {node.
Kind
}");
3029
Debug.Assert(node.
Kind
is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}");
3031
Debug.Assert(node.
Kind
is RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround or RegexNodeKind.ExpressionConditional || rm.Analysis.MayBacktrack(node.Child(0)), "Expected lookaround/conditional or a child that may backtrack");
3058
Debug.Assert(node.
Kind
is RegexNodeKind.UpdateBumpalong, $"Unexpected type: {node.
Kind
}");
3070
Debug.Assert(node.
Kind
is RegexNodeKind.Concatenate, $"Unexpected type: {node.
Kind
}");
3118
else if (child.
Kind
is RegexNodeKind.Multi)
3129
int repeatCount = child.
Kind
is RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set ? 1 : child.M;
3187
if (next.
Kind
is not RegexNodeKind.UpdateBumpalong) // skip node types that don't have a semantic impact
3200
Debug.Assert(node.IsOneFamily || node.IsNotoneFamily || node.IsSetFamily, $"Unexpected type: {node.
Kind
}");
3244
Debug.Assert(node.
Kind
is RegexNodeKind.Boundary or RegexNodeKind.NonBoundary or RegexNodeKind.ECMABoundary or RegexNodeKind.NonECMABoundary, $"Unexpected kind: {node.
Kind
}");
3246
string negation = node.
Kind
is RegexNodeKind.Boundary or RegexNodeKind.ECMABoundary ? "!" : "";
3249
switch (node.
Kind
)
3284
Debug.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
}");
3288
switch (node.
Kind
)
3300
using (EmitBlock(writer, node.
Kind
== RegexNodeKind.Beginning ?
3350
Debug.Assert(node.
Kind
is RegexNodeKind.Multi, $"Unexpected type: {node.
Kind
}");
3399
Debug.Assert(node.
Kind
is RegexNodeKind.Oneloop or RegexNodeKind.Notoneloop or RegexNodeKind.Setloop, $"Unexpected type: {node.
Kind
}");
3537
Debug.Assert(node.
Kind
is RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy or RegexNodeKind.Setlazy, $"Unexpected type: {node.
Kind
}");
3638
node.
Kind
is RegexNodeKind.Notonelazy &&
3705
node.
Kind
is RegexNodeKind.Setlazy &&
3784
Debug.Assert(node.
Kind
is RegexNodeKind.Lazyloop, $"Unexpected type: {node.
Kind
}");
4084
Debug.Assert(node.IsOneFamily || node.IsNotoneFamily || node.IsSetFamily, $"Unexpected type: {node.
Kind
}");
4204
Debug.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
}");
4336
Debug.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
}");
4374
Debug.Assert(node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.
Kind
}");
4378
Debug.Assert(!rm.Analysis.MayBacktrack(node.Child(0)), $"Expected non-backtracking node {node.
Kind
}");
4394
Debug.Assert(node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.
Kind
}");
5016
if (node.
Kind
== RegexNodeKind.Multi)
5539
return node.
Kind
switch
5555
RegexNodeKind.Loop or RegexNodeKind.Lazyloop => node.M == 0 && node.N == 1 ? $"Optional ({(node.
Kind
is RegexNodeKind.Loop ? "greedy" : "lazy")})." : $"Loop {DescribeLoop(node, rm)}{direction}.",
5573
_ => $"Unknown node type {node.
Kind
}",
5719
bool skip = node.
Kind
switch
5723
RegexNodeKind.Concatenate when node.Parent is not {
Kind
: RegexNodeKind.Alternate or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional } => true,
5726
RegexNodeKind.Atomic when node.Child(0).
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop or RegexNodeKind.Alternate => true,
5737
string tag = node.Parent?.
Kind
switch
5781
string style = node.
Kind
switch
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (184)
89
Debug.Assert(
Kind
is RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or
95
new RegexNode(
Kind
, Options, Str!) :
96
new RegexNode(
Kind
, Options, Ch);
138
Kind
== RegexNodeKind.Concatenate &&
167
switch (
Kind
)
193
else if (
Kind
== RegexNodeKind.Oneloopatomic && N is >= 2 and <= MultiVsRepeaterLimit)
205
if (Parent is not {
Kind
: RegexNodeKind.Atomic })
233
Debug.Fail($"Unexpected type: {
Kind
}");
243
Debug.Assert(
Kind
== RegexNodeKind.Capture, "Every generated tree should begin with a capture node");
262
Debug.Assert(
Kind
!= RegexNodeKind.Group, "All Group nodes should have been removed.");
265
switch (node.
Kind
)
298
Debug.Assert(childCount == 0, $"Expected zero children for {node.
Kind
}, got {childCount}.");
307
Debug.Assert(childCount == 1, $"Expected one and only one child for {node.
Kind
}, got {childCount}.");
311
Debug.Assert(childCount == 2, $"Expected two children for {node.
Kind
}, got {childCount}");
315
Debug.Assert(childCount == 3, $"Expected three children for {node.
Kind
}, got {childCount}");
320
Debug.Assert(childCount >= 2, $"Expected at least two children for {node.
Kind
}, got {childCount}.");
324
Debug.Fail($"Unexpected node type: {node.
Kind
}");
329
switch (node.
Kind
)
340
Debug.Assert(!string.IsNullOrEmpty(node.Str), $"Expected non-null, non-empty string for {node.
Kind
}.");
344
Debug.Assert(node.Str is null, $"Expected null string for {node.
Kind
}, got \"{node.Str}\".");
349
switch (node.
Kind
)
355
Debug.Assert((node.Options & RegexOptions.IgnoreCase) == 0, $"{node.
Kind
} node should not have RegexOptions.IgnoreCase");
372
Debug.Assert(rootNode.
Kind
== RegexNodeKind.Capture);
413
switch (node.
Kind
)
426
if (node.Parent is {
Kind
: RegexNodeKind.Concatenate } parent)
471
switch (node.
Kind
)
498
if ((existingChild.
Kind
is RegexNodeKind.Alternate or RegexNodeKind.BackreferenceConditional or RegexNodeKind.ExpressionConditional or RegexNodeKind.Loop or RegexNodeKind.Lazyloop) &&
499
node.Parent is not {
Kind
: RegexNodeKind.Atomic }) // validate grandparent isn't atomic
521
if (node.
Kind
!= RegexNodeKind.ExpressionConditional) // ReduceExpressionConditional will have already applied ending backtracking removal
542
Debug.Assert(node.
Kind
is RegexNodeKind.Atomic or RegexNodeKind.Empty or RegexNodeKind.Loop or RegexNodeKind.Lazyloop);
544
if (node.
Kind
is RegexNodeKind.Atomic)
547
Debug.Assert(node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop);
550
if (node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop)
577
switch (
Kind
)
589
return
Kind
switch
612
Debug.Assert(
Kind
is RegexNodeKind.Alternate or RegexNodeKind.Concatenate);
615
0 => new RegexNode(
Kind
== RegexNodeKind.Alternate ? RegexNodeKind.Nothing : RegexNodeKind.Empty, Options),
629
Debug.Assert(
Kind
== RegexNodeKind.Group);
632
while (u.
Kind
== RegexNodeKind.Group)
657
Debug.Assert(
Kind
== RegexNodeKind.Atomic);
662
while (child.
Kind
== RegexNodeKind.Atomic)
668
switch (child.
Kind
)
704
if (branches[0].
Kind
== RegexNodeKind.Empty)
715
if (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 ??
811
return child.
Kind
== RegexNodeKind.Empty ?
826
Debug.Assert(
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop);
829
RegexNodeKind kind =
Kind
;
839
if (child.
Kind
!= kind)
844
switch (child.
Kind
)
858
switch (child.
Kind
)
905
switch (child.
Kind
)
910
child.MakeRep(u.
Kind
== RegexNodeKind.Lazyloop ? RegexNodeKind.Onelazy : RegexNodeKind.Oneloop, u.M, u.N);
958
Debug.Assert(
Kind
is RegexNodeKind.Set or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy);
971
Kind
== RegexNodeKind.Set ? RegexNodeKind.One :
972
Kind
== RegexNodeKind.Setloop ? RegexNodeKind.Oneloop :
973
Kind
== RegexNodeKind.Setloopatomic ? RegexNodeKind.Oneloopatomic :
981
Kind
== RegexNodeKind.Set ? RegexNodeKind.Notone :
982
Kind
== RegexNodeKind.Setloop ? RegexNodeKind.Notoneloop :
983
Kind
== RegexNodeKind.Setloopatomic ? RegexNodeKind.Notoneloopatomic :
1018
Debug.Assert(
Kind
== RegexNodeKind.Alternate);
1031
if (node.
Kind
== RegexNodeKind.Alternate)
1034
if (node.
Kind
== RegexNodeKind.Alternate)
1037
if (node.
Kind
== RegexNodeKind.Alternate)
1045
if (node.
Kind
is RegexNodeKind.Alternate && node.ChildCount() == 2)
1047
if (node.Child(1).
Kind
is RegexNodeKind.Empty)
1051
else if (node.Child(0).
Kind
is RegexNodeKind.Empty)
1088
if (at.
Kind
== RegexNodeKind.Alternate)
1106
else if (at.
Kind
is RegexNodeKind.Set or RegexNodeKind.One)
1111
if (at.
Kind
== RegexNodeKind.Set)
1135
if (prev.
Kind
== RegexNodeKind.One)
1145
if (at.
Kind
== RegexNodeKind.One)
1162
else if (at.
Kind
== RegexNodeKind.Nothing)
1186
Debug.Assert(alternation.
Kind
== RegexNodeKind.Alternate);
1205
RegexNode required = startingNode.
Kind
== RegexNodeKind.Concatenate ? startingNode.Child(0) : startingNode;
1206
switch (required.
Kind
)
1226
RegexNode other = endingNode.
Kind
== RegexNodeKind.Concatenate ? endingNode.Child(0) : endingNode;
1227
if (required.
Kind
!= other.
Kind
||
1248
if (children[i].
Kind
== RegexNodeKind.Concatenate)
1261
if (alternation.Parent is RegexNode {
Kind
: RegexNodeKind.Atomic })
1286
Debug.Assert(node.
Kind
== RegexNodeKind.Alternate);
1295
switch (child.
Kind
)
1329
Debug.Assert(alternation.
Kind
== RegexNodeKind.Alternate);
1356
if (startingNode.
Kind
== RegexNodeKind.One)
1376
if (startingNode.
Kind
== RegexNodeKind.One)
1390
Debug.Assert(startingNode.
Kind
== RegexNodeKind.Multi);
1427
ProcessOneOrMulti(branch.
Kind
== RegexNodeKind.Concatenate ? branch.Child(0) : branch, startingSpan);
1435
if (node.
Kind
== RegexNodeKind.One)
1444
Debug.Assert(node.
Kind
== RegexNodeKind.Multi);
1465
if (alternation.Parent is RegexNode parent && parent.
Kind
== RegexNodeKind.Atomic)
1492
RegexNode branch =
Kind
== RegexNodeKind.Concatenate ? Child(0) : this;
1493
return branch.
Kind
is RegexNodeKind.One or RegexNodeKind.Multi ? branch : null;
1499
Debug.Assert(
Kind
is RegexNodeKind.One or RegexNodeKind.Multi || (IsOneFamily && M > 0));
1514
Debug.Assert(
Kind
is RegexNodeKind.Alternate);
1538
if (startingLiteralNode.IsOneFamily || startingLiteralNode.
Kind
is RegexNodeKind.Multi)
1582
switch (node.
Kind
)
1617
switch (node.
Kind
)
1684
Debug.Assert(
Kind
== RegexNodeKind.Concatenate);
1700
if (child.
Kind
== RegexNodeKind.Nothing)
1726
Debug.Assert(
Kind
== RegexNodeKind.Concatenate);
1743
if (at.
Kind
== RegexNodeKind.Concatenate &&
1762
else if (at.
Kind
is RegexNodeKind.Multi or RegexNodeKind.One)
1776
if (prev.
Kind
== RegexNodeKind.One)
1783
((at.
Kind
== RegexNodeKind.One) ? $"{prev.Str}{at.Ch}" : prev.Str + at.Str) :
1784
((at.
Kind
== RegexNodeKind.One) ? $"{at.Ch}{prev.Str}" : at.Str + prev.Str);
1786
else if (at.
Kind
== RegexNodeKind.Empty)
1809
Debug.Assert(
Kind
== RegexNodeKind.Concatenate);
1844
switch (currentNode.
Kind
)
1847
case 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:
1848
case RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy when nextNode.
Kind
== currentNode.
Kind
&& currentNode.Str == nextNode.Str:
1850
currentNode.
Kind
is RegexNodeKind.Oneloopatomic or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Setloopatomic)
1873
case RegexNodeKind.Oneloop or RegexNodeKind.Onelazy when nextNode.
Kind
== RegexNodeKind.One && currentNode.Ch == nextNode.Ch:
1874
case RegexNodeKind.Notoneloop or RegexNodeKind.Notonelazy when nextNode.
Kind
== RegexNodeKind.Notone && currentNode.Ch == nextNode.Ch:
1875
case RegexNodeKind.Setloop or RegexNodeKind.Setlazy when nextNode.
Kind
== RegexNodeKind.Set && currentNode.Str == nextNode.Str:
1890
nextNode.
Kind
== RegexNodeKind.Multi &&
1941
case RegexNodeKind.One when (nextNode.
Kind
is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) && currentNode.Ch == nextNode.Ch:
1942
case RegexNodeKind.Notone when (nextNode.
Kind
is RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy) && currentNode.Ch == nextNode.Ch:
1943
case RegexNodeKind.Set when (nextNode.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy) && currentNode.Str == nextNode.Str:
1946
currentNode.Kind = nextNode.
Kind
;
1956
case RegexNodeKind.Notone when nextNode.
Kind
== currentNode.
Kind
&& currentNode.Ch == nextNode.Ch:
1957
case RegexNodeKind.Set when nextNode.
Kind
== RegexNodeKind.Set && currentNode.Str == nextNode.Str:
1968
when nextNode.
Kind
== currentNode.
Kind
:
2011
if (
Kind
is not RegexNodeKind.Concatenate)
2035
while (node.
Kind
is RegexNodeKind.Capture or RegexNodeKind.Concatenate)
2041
switch (node.
Kind
)
2087
while (loopChild.
Kind
is RegexNodeKind.Capture or RegexNodeKind.Concatenate)
2098
if (loopChild.
Kind
is
2106
else if (node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop)
2149
for (int b = node.
Kind
== RegexNodeKind.ExpressionConditional ? 1 : 0; b < alternateBranches; b++)
2163
Debug.Assert(
Kind
is RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround);
2171
if (
Kind
is RegexNodeKind.NegativeLookaround && ContainsKind(Child(0), [RegexNodeKind.Backreference, RegexNodeKind.BackreferenceConditional]) is false)
2186
if (node is {
Kind
: RegexNodeKind.Capture, N: -1 })
2217
if (
Kind
is RegexNodeKind.PositiveLookaround)
2219
if (((Options & RegexOptions.RightToLeft) == 0 && IsZeroWidthAssertion(child.
Kind
)) ||
2220
child.
Kind
is RegexNodeKind.Empty)
2225
else if (
Kind
is RegexNodeKind.NegativeLookaround)
2230
if (child.
Kind
is RegexNodeKind.Empty)
2255
if (node.
Kind
== kind)
2283
Debug.Assert(
Kind
== RegexNodeKind.BackreferenceConditional);
2301
Debug.Assert(
Kind
== RegexNodeKind.ExpressionConditional);
2319
if (condition.
Kind
== RegexNodeKind.PositiveLookaround && (condition.Options & RegexOptions.RightToLeft) == 0)
2346
while (node.
Kind
is RegexNodeKind.Capture or RegexNodeKind.Concatenate)
2360
switch (subsequent.
Kind
)
2400
switch (subsequent.
Kind
)
2416
switch (node.
Kind
)
2420
switch (subsequent.
Kind
)
2450
switch (subsequent.
Kind
)
2469
switch (subsequent.
Kind
)
2516
switch (subsequent.
Kind
)
2558
switch (parent?.
Kind
)
2601
public bool IsBacktrackingConstruct =>
Kind
switch
2651
Debug.Assert(node.
Kind
is not RegexNodeKind.Concatenate, "The existing logic assumes that the node itself isn't a concatenation.");
2662
switch (parent.
Kind
)
2704
switch (
Kind
)
2799
Debug.Fail($"Unknown node: {
Kind
}");
2817
switch (
Kind
)
2877
int i =
Kind
== RegexNodeKind.BackreferenceConditional ? 0 : 1;
2936
Debug.Fail($"Unknown node: {
Kind
}");
2960
Debug.Assert(
Kind
== RegexNodeKind.Concatenate, $"Expected Concatenate, got {
Kind
}");
2973
if (child.
Kind
is RegexNodeKind.One)
2986
else if (child.
Kind
is RegexNodeKind.Multi)
2998
else if (child.
Kind
is RegexNodeKind.Set ||
2999
(child.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic && child.M == child.N))
3008
vsb.Append((char)(twoChars[0] | 0x20), child.
Kind
is RegexNodeKind.Set ? 1 : child.M);
3010
else if (child.
Kind
is RegexNodeKind.Empty)
3015
else if (consumeZeroWidthNodes && IsZeroWidthAssertion(child.
Kind
))
3061
Debug.Assert(
Kind
== RegexNodeKind.Concatenate, $"Expected Concatenate, got {
Kind
}");
3063
static bool CanJoinLengthCheck(RegexNode node) => node.
Kind
switch
3117
case <= MultiVsRepeaterLimit when
Kind
== RegexNodeKind.One:
3130
switch (
Kind
)
3262
public bool IsSetFamily =>
Kind
is RegexNodeKind.Set or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy;
3265
public bool IsOneFamily =>
Kind
is RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy;
3268
public bool IsNotoneFamily =>
Kind
is RegexNodeKind.Notone or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy;
3307
var sb = new StringBuilder(
Kind
.ToString());
3317
switch (
Kind
)
3356
switch (
Kind
)
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexParser.cs (6)
1051
if (_group!.
Kind
!= RegexNodeKind.ExpressionConditional)
1189
if (result != null && result.
Kind
== RegexNodeKind.Backreference && (result.Options & RegexOptions.IgnoreCase) != 0)
2081
if (_group.
Kind
== RegexNodeKind.ExpressionConditional && _group.ChildCount() == 0)
2106
if (_group!.
Kind
is RegexNodeKind.ExpressionConditional or RegexNodeKind.BackreferenceConditional)
2121
if (_group!.
Kind
is RegexNodeKind.ExpressionConditional or RegexNodeKind.BackreferenceConditional)
2125
if (_group.
Kind
== RegexNodeKind.BackreferenceConditional && _group.ChildCount() > 2 || _group.ChildCount() > 3)
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (27)
80
switch (node.
Kind
)
114
int reps = node.
Kind
is RegexNodeKind.One ? 1 : Math.Min(node.M, MaxPrefixLength);
119
return node.
Kind
is RegexNodeKind.One || reps == node.N;
164
int reps = node.
Kind
is RegexNodeKind.Set ? 1 : Math.Min(node.M, MaxPrefixLength);
209
return node.
Kind
is RegexNodeKind.Set || reps == node.N;
360
switch (node.
Kind
)
489
switch (node.
Kind
)
598
switch (node.
Kind
)
950
switch (node.
Kind
)
959
return node.
Kind
is RegexNodeKind.One || node.M > 0 ? true : null;
977
return node.
Kind
is RegexNodeKind.Notone || node.M > 0 ? true : null;
996
node.
Kind
is RegexNodeKind.Set || node.M > 0 ? true :
1104
int branchStart = node.
Kind
is RegexNodeKind.BackreferenceConditional ? 0 : 1;
1118
Debug.Fail($"Unexpected node {node.
Kind
}");
1138
while (node.
Kind
is RegexNodeKind.Atomic or RegexNodeKind.Capture)
1142
if (node.
Kind
!= RegexNodeKind.Concatenate)
1155
while (firstChild.
Kind
is RegexNodeKind.Atomic or RegexNodeKind.Capture)
1159
if (firstChild.
Kind
is not (RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy) || firstChild.N != int.MaxValue)
1167
if (nextChild.
Kind
== RegexNodeKind.UpdateBumpalong)
1224
while ((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))
1277
switch (node.
Kind
)
1349
switch (node.
Kind
)
1358
return node.
Kind
;
1386
switch (tmpChild.
Kind
)
1416
if (node.Child(i).
Kind
is not (RegexNodeKind.Empty or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround))
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexTreeAnalyzer.cs (2)
55
switch (node.
Kind
)
86
bool treatChildAsAtomic = (isAtomicByAncestor | isAtomicBySelf) && node.
Kind
switch