95 references to ChildCount
System.Text.RegularExpressions.Generator (95)
RegexGenerator.cs (1)
378int childCount = node.ChildCount();
RegexGenerator.Emitter.cs (29)
1626Debug.Assert(node.ChildCount() == 1, "Capture nodes should have one child"); 1808Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 1810int childCount = node.ChildCount(); 2275Debug.Assert(node.ChildCount() == 2, $"Expected 2 children, found {node.ChildCount()}"); 2448Debug.Assert(node.ChildCount() == 3, $"Expected 3 children, found {node.ChildCount()}"); 2628Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2721Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 2762Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 3031Debug.Assert(node.Kind is RegexNodeKind.ExpressionConditional ? node.ChildCount() >= 1 : node.ChildCount() == 1, $"Unexpected number of children: {node.ChildCount()}"); 3073Debug.Assert(node.ChildCount() >= 2, $"Expected at least 2 children, found {node.ChildCount()}"); 3077int childCount = node.ChildCount(); 3185int childCount = node.ChildCount(); 3829Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 4419Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 4439Debug.Assert(node.ChildCount() == 1, $"Expected 1 child, found {node.ChildCount()}"); 5583RegexNodeKind.Alternate => $"Match with {node.ChildCount()} alternative expressions{(rm.Analysis.IsAtomicByAncestor(node) ? ", atomically" : "")}.", 5799int childCount = node.ChildCount();
src\libraries\System.Text.RegularExpressions\src\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())
src\libraries\System.Text.RegularExpressions\src\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)
src\libraries\System.Text.RegularExpressions\src\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();
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)
78int childCount = node.ChildCount();