102 references to ChildCount
System.Text.RegularExpressions (102)
System\Text\RegularExpressions\RegexCompiler.cs (27)
1458Debug.Assert(node.ChildCount() == 1, "Capture nodes should have one child"); 1674Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 1676int childCount = node.ChildCount(); 2296Debug.Assert(node.ChildCount() == 2, $"Expected 2 children, found {node.ChildCount()}"); 2455Debug.Assert(node.ChildCount() == 3, $"Expected 3 children, found {node.ChildCount()}"); 2648Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2774Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2818Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 3077Debug.Assert(node.Kind is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}"); 3141Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 3144int childCount = node.ChildCount(); 3194int childCount = node.ChildCount(); 4161Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 5009Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 5047Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}");
System\Text\RegularExpressions\RegexNode.cs (46)
139ChildCount() > 1) 252int childCount = node.ChildCount(); 374Debug.Assert(rootNode.ChildCount() == 1); 467int childCount = ChildCount(); 544RegexNode existingChild = node.Child(node.ChildCount() - 1); 550node.ReplaceChild(node.ChildCount() - 1, atomic); 562int branches = node.ChildCount(); 660return ChildCount() switch 681Debug.Assert(u.ChildCount() == 1); 705Debug.Assert(ChildCount() == 1); 850child.ChildCount() == 2 && 889while (u.ChildCount() > 0) 957if (u.ChildCount() == 1) 1075switch (ChildCount()) 1100if (node.Kind is RegexNodeKind.Alternate && node.ChildCount() == 2) 1342Debug.Assert(node.ChildCount() >= 2); 1537return alternation.ChildCount() == 1 ? alternation.Child(0) : alternation; 1582int childCount = ChildCount(); 1745switch (ChildCount()) 1754int childCount = ChildCount(); 2059int childCount = ChildCount(); 2095node = node.Child(node.ChildCount() - 1); 2147loopChild = loopChild.Child(loopChild.ChildCount() - 1); 2206int alternateBranches = node.ChildCount(); 2222Debug.Assert(ChildCount() == 1); 2254int childCount = node.ChildCount(); 2326int childCount = node.ChildCount(); 2342Debug.Assert(ChildCount() is 1 or 2); 2348if (ChildCount() == 1) 2360Debug.Assert(ChildCount() is 2 or 3); 2366if (ChildCount() == 2) 2464node = node.Child(node.ChildCount() - 1); 2515int childCount = subsequent.ChildCount(); 2766int childCount = node.ChildCount(); 2873int childCount = ChildCount(); 2895int childCount = ChildCount(); 2907Debug.Assert(ChildCount() == 1); 2990int childCount = ChildCount(); 3024int childCount = ChildCount(); 3045Debug.Assert(ChildCount() == 1); 3175!child.TryGetOrdinalCaseInsensitiveString(0, child.ChildCount(), out int innerNodesConsumed, out string? innerStr, consumeZeroWidthNodes, forPrefixAnalysis)) 3184if (innerNodesConsumed < child.ChildCount()) 3259int childCount = ChildCount(); 3359Debug.Assert(index < ChildCount()); 3435int childCount = node.ChildCount(); 3468if (curChild < curNode!.ChildCount())
System\Text\RegularExpressions\RegexParser.cs (4)
1075if (_group!.Kind != RegexNodeKind.ExpressionConditional || _group.ChildCount() > 0) 2228if (_group.Kind == RegexNodeKind.ExpressionConditional && _group.ChildCount() == 0) 2272if (_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, forPrefixAnalysis: 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());