25 writes to Kind
System.Text.RegularExpressions (25)
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
=
1164
prev.
Kind
= RegexNodeKind.Set;
1447
node.
Kind
= RegexNodeKind.Empty;
1456
node.
Kind
= RegexNodeKind.Empty;
1461
node.
Kind
= RegexNodeKind.One;
1716
prev.
Kind
= RegexNodeKind.Multi;
1861
nextNode.
Kind
= RegexNodeKind.One;
1884
currentNode.
Kind
= nextNode.Kind;
2006
node.
Kind
-= RegexNodeKind.Onelazy - RegexNodeKind.Oneloop; // lazy to greedy
2160
Kind
= RegexNodeKind.Nothing;
3005
Kind
= RegexNodeKind.Multi;
308 references to Kind
System.Text.RegularExpressions (308)
System\Text\RegularExpressions\RegexCompiler.cs (64)
1249
Debug.Assert(target.LoopNode.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic);
1432
Debug.Assert(node.
Kind
== RegexNodeKind.Capture, "Every generated tree should begin with a capture node");
1440
switch (node.
Kind
)
1448
int length = node.
Kind
== RegexNodeKind.Multi ? node.Str!.Length : 1;
1648
Debug.Assert(node.
Kind
is RegexNodeKind.Alternate, $"Unexpected type: {node.
Kind
}");
1853
Debug.Assert(node.
Kind
is RegexNodeKind.Backreference, $"Unexpected type: {node.
Kind
}");
2028
Debug.Assert(node.
Kind
is RegexNodeKind.BackreferenceConditional, $"Unexpected type: {node.
Kind
}");
2042
RegexNode? noBranch = node.Child(1) is {
Kind
: not RegexNodeKind.Empty } childNo ? childNo : null;
2187
Debug.Assert(node.
Kind
is RegexNodeKind.ExpressionConditional, $"Unexpected type: {node.
Kind
}");
2203
RegexNode? noBranch = node.Child(2) is {
Kind
: not RegexNodeKind.Empty } childNo ? childNo : null;
2387
Debug.Assert(node.
Kind
is RegexNodeKind.Capture, $"Unexpected type: {node.
Kind
}");
2513
Debug.Assert(node.
Kind
is RegexNodeKind.PositiveLookaround, $"Unexpected type: {node.
Kind
}");
2564
Debug.Assert(node.
Kind
is RegexNodeKind.NegativeLookaround, $"Unexpected type: {node.
Kind
}");
2719
switch (node.
Kind
)
2823
Debug.Fail($"Unexpected node type: {node.
Kind
}");
2829
Debug.Assert(node.
Kind
is RegexNodeKind.Atomic or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround or RegexNodeKind.ExpressionConditional, $"Unexpected type: {node.
Kind
}");
2830
Debug.Assert(node.
Kind
is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}");
2871
Debug.Assert(node.
Kind
is RegexNodeKind.UpdateBumpalong, $"Unexpected type: {node.
Kind
}");
2891
Debug.Assert(node.
Kind
is RegexNodeKind.Concatenate, $"Unexpected type: {node.
Kind
}");
2949
if (next.
Kind
is not RegexNodeKind.UpdateBumpalong) // skip node types that don't have a semantic impact
2962
Debug.Assert(node.IsOneFamily || node.IsNotoneFamily || node.IsSetFamily, $"Unexpected type: {node.
Kind
}");
3037
Debug.Assert(node.
Kind
is RegexNodeKind.Boundary or RegexNodeKind.NonBoundary or RegexNodeKind.ECMABoundary or RegexNodeKind.NonECMABoundary, $"Unexpected type: {node.
Kind
}");
3053
switch (node.
Kind
)
3069
if (node.
Kind
is RegexNodeKind.Boundary)
3082
if (node.
Kind
is RegexNodeKind.ECMABoundary)
3097
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
}");
3102
switch (node.
Kind
)
3116
if (node.
Kind
== RegexNodeKind.Beginning)
3235
Debug.Assert(node.
Kind
is RegexNodeKind.Multi, $"Unexpected type: {node.
Kind
}");
3287
Debug.Assert(node.
Kind
is RegexNodeKind.Oneloop or RegexNodeKind.Notoneloop or RegexNodeKind.Setloop, $"Unexpected type: {node.
Kind
}");
3503
Debug.Assert(node.
Kind
is RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy or RegexNodeKind.Setlazy, $"Unexpected type: {node.
Kind
}");
3604
node.
Kind
is RegexNodeKind.Notonelazy &&
3745
node.
Kind
is RegexNodeKind.Setlazy &&
3850
Debug.Assert(node.
Kind
is RegexNodeKind.Lazyloop, $"Unexpected type: {node.
Kind
}");
4212
Debug.Assert(node.IsOneFamily || node.IsNotoneFamily || node.IsSetFamily, $"Unexpected type: {node.
Kind
}");
4361
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
}");
4608
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
}");
4697
Debug.Assert(node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.
Kind
}");
4701
Debug.Assert(!analysis.MayBacktrack(node.Child(0)), $"Expected non-backtracking node {node.
Kind
}");
4735
Debug.Assert(node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop, $"Unexpected type: {node.
Kind
}");
5133
if (node.
Kind
== RegexNodeKind.Multi)
5166
if (node.
Kind
== RegexNodeKind.Multi)
5359
if (root.
Kind
is RegexNodeKind.Multi or RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set)
5377
Ldc((root.
Kind
== RegexNodeKind.Multi ? root.Str!.Length : 1) * (!rtl ? 1 : -1));
System\Text\RegularExpressions\RegexFindOptimizations.cs (1)
822
Debug.Assert(loopNode.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic);
System\Text\RegularExpressions\RegexNode.cs (181)
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 or RegexNodeKind.Notone)
1111
if (at.
Kind
== RegexNodeKind.Set)
1135
if (prev.
Kind
== RegexNodeKind.One)
1140
else if (prev.
Kind
== RegexNodeKind.Notone)
1150
if (at.
Kind
== RegexNodeKind.One)
1154
else if (at.
Kind
== RegexNodeKind.Notone)
1171
else if (at.
Kind
== RegexNodeKind.Nothing)
1195
Debug.Assert(alternation.
Kind
== RegexNodeKind.Alternate);
1208
if (child.
Kind
!= RegexNodeKind.Concatenate || child.ChildCount() < 2)
1223
switch (required.
Kind
)
1243
if (required.
Kind
!= other.
Kind
||
1269
if (alternation.Parent is RegexNode {
Kind
: RegexNodeKind.Atomic })
1294
Debug.Assert(node.
Kind
== RegexNodeKind.Alternate);
1303
switch (child.
Kind
)
1337
Debug.Assert(alternation.
Kind
== RegexNodeKind.Alternate);
1364
if (startingNode.
Kind
== RegexNodeKind.One)
1384
if (startingNode.
Kind
== RegexNodeKind.One)
1398
Debug.Assert(startingNode.
Kind
== RegexNodeKind.Multi);
1435
ProcessOneOrMulti(branch.
Kind
== RegexNodeKind.Concatenate ? branch.Child(0) : branch, startingSpan);
1443
if (node.
Kind
== RegexNodeKind.One)
1452
Debug.Assert(node.
Kind
== RegexNodeKind.Multi);
1473
if (alternation.Parent is RegexNode parent && parent.
Kind
== RegexNodeKind.Atomic)
1500
RegexNode branch =
Kind
== RegexNodeKind.Concatenate ? Child(0) : this;
1501
return branch.
Kind
is RegexNodeKind.One or RegexNodeKind.Multi ? branch : null;
1507
Debug.Assert(
Kind
is RegexNodeKind.One or RegexNodeKind.Multi || (IsOneFamily && M > 0));
1520
switch (node.
Kind
)
1555
switch (node.
Kind
)
1622
Debug.Assert(
Kind
== RegexNodeKind.Concatenate);
1638
if (child.
Kind
== RegexNodeKind.Nothing)
1664
Debug.Assert(
Kind
== RegexNodeKind.Concatenate);
1681
if (at.
Kind
== RegexNodeKind.Concatenate &&
1700
else if (at.
Kind
is RegexNodeKind.Multi or RegexNodeKind.One)
1714
if (prev.
Kind
== RegexNodeKind.One)
1721
((at.
Kind
== RegexNodeKind.One) ? $"{prev.Str}{at.Ch}" : prev.Str + at.Str) :
1722
((at.
Kind
== RegexNodeKind.One) ? $"{at.Ch}{prev.Str}" : at.Str + prev.Str);
1724
else if (at.
Kind
== RegexNodeKind.Empty)
1747
Debug.Assert(
Kind
== RegexNodeKind.Concatenate);
1782
switch (currentNode.
Kind
)
1785
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:
1786
case RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy when nextNode.
Kind
== currentNode.
Kind
&& currentNode.Str == nextNode.Str:
1788
currentNode.
Kind
is RegexNodeKind.Oneloopatomic or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Setloopatomic)
1811
case RegexNodeKind.Oneloop or RegexNodeKind.Onelazy when nextNode.
Kind
== RegexNodeKind.One && currentNode.Ch == nextNode.Ch:
1812
case RegexNodeKind.Notoneloop or RegexNodeKind.Notonelazy when nextNode.
Kind
== RegexNodeKind.Notone && currentNode.Ch == nextNode.Ch:
1813
case RegexNodeKind.Setloop or RegexNodeKind.Setlazy when nextNode.
Kind
== RegexNodeKind.Set && currentNode.Str == nextNode.Str:
1828
nextNode.
Kind
== RegexNodeKind.Multi &&
1879
case RegexNodeKind.One when (nextNode.
Kind
is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) && currentNode.Ch == nextNode.Ch:
1880
case RegexNodeKind.Notone when (nextNode.
Kind
is RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy) && currentNode.Ch == nextNode.Ch:
1881
case RegexNodeKind.Set when (nextNode.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy) && currentNode.Str == nextNode.Str:
1884
currentNode.Kind = nextNode.
Kind
;
1894
case RegexNodeKind.Notone when nextNode.
Kind
== currentNode.
Kind
&& currentNode.Ch == nextNode.Ch:
1895
case RegexNodeKind.Set when nextNode.
Kind
== RegexNodeKind.Set && currentNode.Str == nextNode.Str:
1906
when nextNode.
Kind
== currentNode.
Kind
:
1949
if (
Kind
is not RegexNodeKind.Concatenate)
1973
while (node.
Kind
is RegexNodeKind.Capture or RegexNodeKind.Concatenate)
1979
switch (node.
Kind
)
2025
while (loopChild.
Kind
is RegexNodeKind.Capture or RegexNodeKind.Concatenate)
2030
if (loopChild.
Kind
is
2038
else if (node.
Kind
is RegexNodeKind.Loop or RegexNodeKind.Lazyloop)
2081
for (int b = node.
Kind
== RegexNodeKind.ExpressionConditional ? 1 : 0; b < alternateBranches; b++)
2095
Debug.Assert(
Kind
is RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround);
2101
if (
Kind
is RegexNodeKind.NegativeLookaround && ContainsKind(Child(0), [RegexNodeKind.Backreference, RegexNodeKind.BackreferenceConditional]) is false)
2114
if (node.
Kind
is RegexNodeKind.Capture)
2145
if (
Kind
is RegexNodeKind.PositiveLookaround)
2147
if (((Options & RegexOptions.RightToLeft) == 0 && IsZeroWidthAssertion(child.
Kind
)) ||
2148
child.
Kind
is RegexNodeKind.Empty)
2153
else if (
Kind
is RegexNodeKind.NegativeLookaround)
2158
if (child.
Kind
is RegexNodeKind.Empty)
2183
if (node.
Kind
== kind)
2211
Debug.Assert(
Kind
== RegexNodeKind.BackreferenceConditional);
2229
Debug.Assert(
Kind
== RegexNodeKind.ExpressionConditional);
2247
if (condition.
Kind
== RegexNodeKind.PositiveLookaround && (condition.Options & RegexOptions.RightToLeft) == 0)
2274
while (node.
Kind
is RegexNodeKind.Capture or RegexNodeKind.Concatenate)
2288
switch (subsequent.
Kind
)
2328
switch (subsequent.
Kind
)
2344
switch (node.
Kind
)
2348
switch (subsequent.
Kind
)
2378
switch (subsequent.
Kind
)
2397
switch (subsequent.
Kind
)
2444
switch (subsequent.
Kind
)
2486
switch (parent?.
Kind
)
2533
Debug.Assert(node.
Kind
is not RegexNodeKind.Concatenate, "The existing logic assumes that the node itself isn't a concatenation.");
2544
switch (parent.
Kind
)
2586
switch (
Kind
)
2681
Debug.Fail($"Unknown node: {
Kind
}");
2699
switch (
Kind
)
2759
int i =
Kind
== RegexNodeKind.BackreferenceConditional ? 0 : 1;
2818
Debug.Fail($"Unknown node: {
Kind
}");
2842
Debug.Assert(
Kind
== RegexNodeKind.Concatenate, $"Expected Concatenate, got {
Kind
}");
2855
if (child.
Kind
is RegexNodeKind.One)
2868
else if (child.
Kind
is RegexNodeKind.Multi)
2880
else if (child.
Kind
is RegexNodeKind.Set ||
2881
(child.
Kind
is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic && child.M == child.N))
2890
vsb.Append((char)(twoChars[0] | 0x20), child.
Kind
is RegexNodeKind.Set ? 1 : child.M);
2892
else if (child.
Kind
is RegexNodeKind.Empty)
2897
else if (consumeZeroWidthNodes && IsZeroWidthAssertion(child.
Kind
))
2943
Debug.Assert(
Kind
== RegexNodeKind.Concatenate, $"Expected Concatenate, got {
Kind
}");
2945
static bool CanJoinLengthCheck(RegexNode node) => node.
Kind
switch
2999
case <= MultiVsRepeaterLimit when
Kind
== RegexNodeKind.One:
3012
switch (
Kind
)
3144
public bool IsSetFamily =>
Kind
is RegexNodeKind.Set or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy;
3147
public bool IsOneFamily =>
Kind
is RegexNodeKind.One or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy;
3150
public bool IsNotoneFamily =>
Kind
is RegexNodeKind.Notone or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy;
3189
var sb = new StringBuilder(
Kind
.ToString());
3199
switch (
Kind
)
3238
switch (
Kind
)
System\Text\RegularExpressions\RegexParser.cs (6)
1004
if (_group!.
Kind
!= RegexNodeKind.ExpressionConditional)
1142
if (result != null && result.
Kind
== RegexNodeKind.Backreference && (result.Options & RegexOptions.IgnoreCase) != 0)
2052
if (_group.
Kind
== RegexNodeKind.ExpressionConditional && _group.ChildCount() == 0)
2077
if (_group!.
Kind
is RegexNodeKind.ExpressionConditional or RegexNodeKind.BackreferenceConditional)
2092
if (_group!.
Kind
is RegexNodeKind.ExpressionConditional or RegexNodeKind.BackreferenceConditional)
2096
if (_group.
Kind
== RegexNodeKind.BackreferenceConditional && _group.ChildCount() > 2 || _group.ChildCount() > 3)
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))
System\Text\RegularExpressions\RegexReplacement.cs (4)
36
Debug.Assert(concat.
Kind
== RegexNodeKind.Concatenate, $"Expected Concatenate, got {concat.
Kind
}");
48
switch (child.
Kind
)
77
Debug.Fail($"Unexpected child kind {child.
Kind
}");
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (3)
47
switch (node.
Kind
)
59
switch (node.
Kind
)
90
bool treatChildAsAtomic = (isAtomicByAncestor | isAtomicBySelf) && node.
Kind
switch
System\Text\RegularExpressions\RegexWriter.cs (11)
85
EmitFragment(curNode.
Kind
, curNode, 0);
89
EmitFragment(curNode.
Kind
| BeforeChild, curNode, curChild);
105
EmitFragment(curNode.
Kind
| AfterChild, curNode, curChild);
383
Emit((RegexOpcode)node.
Kind
| bits, node.Ch);
394
Emit(((node.
Kind
is RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy) ?
399
Emit((RegexOpcode)node.
Kind
| bits, node.Ch, node.N == int.MaxValue ? int.MaxValue : node.N - node.M);
414
Emit((RegexOpcode)node.
Kind
| bits, stringCode, (node.N == int.MaxValue) ? int.MaxValue : node.N - node.M);
420
Emit((RegexOpcode)node.
Kind
| bits, StringCode(node.Str!));
424
Emit((RegexOpcode)node.
Kind
| bits, StringCode(node.Str!));
428
Emit((RegexOpcode)node.
Kind
| bits, RegexParser.MapCaptureNumber(node.M, _tree.CaptureNumberSparseMapping));
443
Emit((RegexOpcode)node.
Kind
);
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (11)
53
switch (node.
Kind
)
117
result.AddLast(_builder.CreateLoop(_builder.CreateSingleton(bdd), node.
Kind
is RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy, node.M, node.N));
128
result.AddLast(_builder.CreateLoop(_builder.CreateSingleton(setBdd), node.
Kind
== RegexNodeKind.Setlazy, node.M, node.N));
178
throw new NotSupportedException(SR.Format(SR.NotSupported_NonBacktrackingConflictingExpression, node.
Kind
switch
195
string description = $"Unexpected ({nameof(RegexNodeKind)}: {node.
Kind
})";
209
switch (node.
Kind
)
260
result.AddLast(_builder.CreateLoop(body, node.
Kind
== RegexNodeKind.Lazyloop, node.M, node.N));
267
Debug.Assert(node.
Kind
== RegexNodeKind.Capture && node.N == -1);
285
Debug.Assert(rootResult.Count == 1 || root.
Kind
== RegexNodeKind.Concatenate || root.
Kind
== RegexNodeKind.Capture);
312
Debug.Assert(node.
Kind
== RegexNodeKind.Set);