64 references to ChildCount
System.Text.RegularExpressions (64)
System\Text\RegularExpressions\RegexNode.cs (37)
139
ChildCount
() > 1)
212
int childCount = node.
ChildCount
();
334
Debug.Assert(rootNode.
ChildCount
() == 1);
452
RegexNode existingChild = node.Child(node.
ChildCount
() - 1);
458
node.ReplaceChild(node.
ChildCount
() - 1, atomic);
470
int branches = node.
ChildCount
();
561
return
ChildCount
() switch
582
Debug.Assert(u.
ChildCount
() == 1);
606
Debug.Assert(
ChildCount
() == 1);
775
while (u.
ChildCount
() > 0)
844
if (u.
ChildCount
() == 1)
927
switch (
ChildCount
())
1090
if (child.Kind != RegexNodeKind.Concatenate || child.
ChildCount
() < 2)
1173
Debug.Assert(node.
ChildCount
() >= 2);
1365
return alternation.
ChildCount
() == 1 ? alternation.Child(0) : alternation;
1503
switch (
ChildCount
())
1512
int childCount =
ChildCount
();
1810
int childCount =
ChildCount
();
1847
node = node.Child(node.
ChildCount
() - 1);
1911
int alternateBranches = node.
ChildCount
();
1951
int concatCount = node.
ChildCount
();
1967
Debug.Assert(
ChildCount
() == 1);
1995
Debug.Assert(
ChildCount
() is 1 or 2);
2001
if (
ChildCount
() == 1)
2013
Debug.Assert(
ChildCount
() is 2 or 3);
2019
if (
ChildCount
() == 2)
2064
while ((childCount = subsequent.
ChildCount
()) > 0)
2289
int childCount =
ChildCount
();
2311
int childCount =
ChildCount
();
2323
Debug.Assert(
ChildCount
() == 1);
2406
int childCount =
ChildCount
();
2440
int childCount =
ChildCount
();
2461
Debug.Assert(
ChildCount
() == 1);
2647
int childCount =
ChildCount
();
2747
Debug.Assert(index <
ChildCount
());
2815
int childCount = node.
ChildCount
();
2848
if (curChild < curNode!.
ChildCount
())
System\Text\RegularExpressions\RegexParser.cs (3)
2052
if (_group.Kind == RegexNodeKind.ExpressionConditional && _group.
ChildCount
() == 0)
2096
if (_group.Kind == RegexNodeKind.BackreferenceConditional && _group.
ChildCount
() > 2 || _group.
ChildCount
() > 3)
System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (13)
214
int childCount = node.
ChildCount
();
246
int childCount = node.
ChildCount
();
365
int childCount = node.
ChildCount
();
379
int childCount = node.
ChildCount
();
498
node.TryGetOrdinalCaseInsensitiveString(0, node.
ChildCount
(), out _, out string? caseInsensitiveString, consumeZeroWidthNodes: true);
698
int childCount = node.
ChildCount
();
711
int childCount = node.
ChildCount
();
1042
int childCount = node.
ChildCount
();
1059
int childCount = node.
ChildCount
();
1129
Debug.Assert(node.
ChildCount
() >= 2);
1145
if (node.
ChildCount
() == 2)
1275
int childCount = node.
ChildCount
();
1321
int childCount = node.
ChildCount
();
System\Text\RegularExpressions\RegexReplacement.cs (1)
46
int childCount = concat.
ChildCount
();
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)
82
int childCount = node.
ChildCount
();
System\Text\RegularExpressions\RegexWriter.cs (3)
82
int curNodeChildCount = curNode.
ChildCount
();
221
if (curIndex < node.
ChildCount
() - 1)
230
if (curIndex < node.
ChildCount
() - 1)
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (6)
38
stack.Push((root, rootResult, CreateChildResultArray(root.
ChildCount
())));
90
Debug.Assert(childResults is not null && childResults.Length == node.
ChildCount
());
96
for (int i = 0; i < node.
ChildCount
(); ++i)
99
stack.Push((node.Child(i), childResults[i], CreateChildResultArray(node.Child(i).
ChildCount
())));
204
Debug.Assert(node.
ChildCount
() > 0);
206
Debug.Assert(childResults.Length == node.
ChildCount
());