64 references to ChildCount
System.Text.RegularExpressions (64)
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) 1173Debug.Assert(node.ChildCount() >= 2); 1365return alternation.ChildCount() == 1 ? alternation.Child(0) : alternation; 1503switch (ChildCount()) 1512int childCount = ChildCount(); 1813int childCount = ChildCount(); 1850node = node.Child(node.ChildCount() - 1); 1914int alternateBranches = node.ChildCount(); 1954int concatCount = node.ChildCount(); 1970Debug.Assert(ChildCount() == 1); 1998Debug.Assert(ChildCount() is 1 or 2); 2004if (ChildCount() == 1) 2016Debug.Assert(ChildCount() is 2 or 3); 2022if (ChildCount() == 2) 2067while ((childCount = subsequent.ChildCount()) > 0) 2292int childCount = ChildCount(); 2314int childCount = ChildCount(); 2326Debug.Assert(ChildCount() == 1); 2409int childCount = ChildCount(); 2443int childCount = ChildCount(); 2464Debug.Assert(ChildCount() == 1); 2650int childCount = ChildCount(); 2750Debug.Assert(index < ChildCount()); 2818int childCount = node.ChildCount(); 2851if (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 (13)
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) 1275int childCount = node.ChildCount(); 1321int 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());