98 references to ChildCount
System.Text.RegularExpressions (98)
System\Text\RegularExpressions\RegexCompiler.cs (27)
1453Debug.Assert(node.ChildCount() == 1, "Capture nodes should have one child"); 1669Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 1671int childCount = node.ChildCount(); 2291Debug.Assert(node.ChildCount() == 2, $"Expected 2 children, found {node.ChildCount()}"); 2450Debug.Assert(node.ChildCount() == 3, $"Expected 3 children, found {node.ChildCount()}"); 2643Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2769Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2813Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 3072Debug.Assert(node.Kind is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}"); 3136Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 3139int childCount = node.ChildCount(); 3189int childCount = node.ChildCount(); 4097Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 4944Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 4982Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}");
System\Text\RegularExpressions\RegexNode.cs (43)
139ChildCount() > 1) 252int childCount = node.ChildCount(); 374Debug.Assert(rootNode.ChildCount() == 1); 497RegexNode existingChild = node.Child(node.ChildCount() - 1); 503node.ReplaceChild(node.ChildCount() - 1, atomic); 515int branches = node.ChildCount(); 613return ChildCount() switch 634Debug.Assert(u.ChildCount() == 1); 658Debug.Assert(ChildCount() == 1); 795child.ChildCount() == 2 && 834while (u.ChildCount() > 0) 902if (u.ChildCount() == 1) 1020switch (ChildCount()) 1045if (node.Kind is RegexNodeKind.Alternate && node.ChildCount() == 2) 1287Debug.Assert(node.ChildCount() >= 2); 1479return alternation.ChildCount() == 1 ? alternation.Child(0) : alternation; 1524int childCount = ChildCount(); 1687switch (ChildCount()) 1696int childCount = ChildCount(); 2001int childCount = ChildCount(); 2037node = node.Child(node.ChildCount() - 1); 2089loopChild = loopChild.Child(loopChild.ChildCount() - 1); 2148int alternateBranches = node.ChildCount(); 2164Debug.Assert(ChildCount() == 1); 2196int childCount = node.ChildCount(); 2268int childCount = node.ChildCount(); 2284Debug.Assert(ChildCount() is 1 or 2); 2290if (ChildCount() == 1) 2302Debug.Assert(ChildCount() is 2 or 3); 2308if (ChildCount() == 2) 2348node = node.Child(node.ChildCount() - 1); 2399int childCount = subsequent.ChildCount(); 2629int childCount = node.ChildCount(); 2736int childCount = ChildCount(); 2758int childCount = ChildCount(); 2770Debug.Assert(ChildCount() == 1); 2853int childCount = ChildCount(); 2887int childCount = ChildCount(); 2908Debug.Assert(ChildCount() == 1); 3079int childCount = ChildCount(); 3179Debug.Assert(index < ChildCount()); 3247int childCount = node.ChildCount(); 3280if (curChild < curNode!.ChildCount())
System\Text\RegularExpressions\RegexParser.cs (3)
2081if (_group.Kind == RegexNodeKind.ExpressionConditional && _group.ChildCount() == 0) 2125if (_group.Kind == RegexNodeKind.BackreferenceConditional && _group.ChildCount() > 2 || _group.ChildCount() > 3)
System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (14)
214int childCount = node.ChildCount(); 246int childCount = node.ChildCount(); 365int childCount = node.ChildCount(); 379int childCount = node.ChildCount(); 498node.TryGetOrdinalCaseInsensitiveString(0, node.ChildCount(), out _, out string? caseInsensitiveString, consumeZeroWidthNodes: true); 698int childCount = node.ChildCount(); 711int childCount = node.ChildCount(); 1052int childCount = node.ChildCount(); 1083int childCount = node.ChildCount(); 1153Debug.Assert(node.ChildCount() >= 2); 1169if (node.ChildCount() == 2) 1311int childCount = node.ChildCount(); 1378int childCount = node.ChildCount(); 1489int childCount = node.ChildCount();
System\Text\RegularExpressions\RegexReplacement.cs (1)
43int childCount = concat.ChildCount();
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)
78int childCount = node.ChildCount();
System\Text\RegularExpressions\RegexWriter.cs (3)
82int curNodeChildCount = curNode.ChildCount(); 221if (curIndex < node.ChildCount() - 1) 230if (curIndex < node.ChildCount() - 1)
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (6)
38stack.Push((root, rootResult, CreateChildResultArray(root.ChildCount()))); 90Debug.Assert(childResults is not null && childResults.Length == node.ChildCount()); 96for (int i = 0; i < node.ChildCount(); ++i) 99stack.Push((node.Child(i), childResults[i], CreateChildResultArray(node.Child(i).ChildCount()))); 204Debug.Assert(node.ChildCount() > 0); 206Debug.Assert(childResults.Length == node.ChildCount());