92 references to ChildCount
System.Text.RegularExpressions (92)
System\Text\RegularExpressions\RegexCompiler.cs (27)
1433Debug.Assert(node.ChildCount() == 1, "Capture nodes should have one child"); 1649Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 1651int childCount = node.ChildCount(); 2029Debug.Assert(node.ChildCount() == 2, $"Expected 2 children, found {node.ChildCount()}"); 2188Debug.Assert(node.ChildCount() == 3, $"Expected 3 children, found {node.ChildCount()}"); 2388Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2514Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2565Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2830Debug.Assert(node.Kind is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}"); 2892Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 2895int childCount = node.ChildCount(); 2945int childCount = node.ChildCount(); 3837Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 4695Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 4733Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}");
System\Text\RegularExpressions\RegexNode.cs (37)
139ChildCount() > 1) 212int childCount = node.ChildCount(); 334Debug.Assert(rootNode.ChildCount() == 1); 452RegexNode existingChild = node.Child(node.ChildCount() - 1); 458node.ReplaceChild(node.ChildCount() - 1, atomic); 470int branches = node.ChildCount(); 561return ChildCount() switch 582Debug.Assert(u.ChildCount() == 1); 606Debug.Assert(ChildCount() == 1); 775while (u.ChildCount() > 0) 844if (u.ChildCount() == 1) 927switch (ChildCount()) 1090if (child.Kind != RegexNodeKind.Concatenate || child.ChildCount() < 2) 1177Debug.Assert(node.ChildCount() >= 2); 1369return alternation.ChildCount() == 1 ? alternation.Child(0) : alternation; 1507switch (ChildCount()) 1516int childCount = ChildCount(); 1817int childCount = ChildCount(); 1854node = node.Child(node.ChildCount() - 1); 1918int alternateBranches = node.ChildCount(); 1958int concatCount = node.ChildCount(); 1974Debug.Assert(ChildCount() == 1); 2002Debug.Assert(ChildCount() is 1 or 2); 2008if (ChildCount() == 1) 2020Debug.Assert(ChildCount() is 2 or 3); 2026if (ChildCount() == 2) 2071while ((childCount = subsequent.ChildCount()) > 0) 2296int childCount = ChildCount(); 2318int childCount = ChildCount(); 2330Debug.Assert(ChildCount() == 1); 2413int childCount = ChildCount(); 2447int childCount = ChildCount(); 2468Debug.Assert(ChildCount() == 1); 2654int childCount = ChildCount(); 2754Debug.Assert(index < ChildCount()); 2822int childCount = node.ChildCount(); 2855if (curChild < curNode!.ChildCount())
System\Text\RegularExpressions\RegexParser.cs (3)
2052if (_group.Kind == RegexNodeKind.ExpressionConditional && _group.ChildCount() == 0) 2096if (_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(); 1042int childCount = node.ChildCount(); 1059int childCount = node.ChildCount(); 1129Debug.Assert(node.ChildCount() >= 2); 1145if (node.ChildCount() == 2) 1287int childCount = node.ChildCount(); 1356int childCount = node.ChildCount(); 1466int childCount = node.ChildCount();
System\Text\RegularExpressions\RegexReplacement.cs (1)
43int childCount = concat.ChildCount();
System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)
82int 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());