Child

System\Text\RegularExpressions\RegexNode.cs (59)

215RegexNode child = node.Child(i); 369RegexNode node = rootNode.Child(0); // skip implicit root capture node 376node = node.Child(0); 381node = node.Child(0); 441node = node.Child(0); 452RegexNode existingChild = node.Child(node.ChildCount() - 1); 473node.Child(i).EliminateEndingBacktracking(); 478node = node.Child(0); 501node = node.Child(0); 5641 => Child(0), 583u = u.Child(0); 609RegexNode child = Child(0); 613child = atomic.Child(0); 746child = atomic.Child(0); 777RegexNode child = u.Child(0); 846RegexNode child = u.Child(0); 933return Child(0); 1104RegexNode required = children[startingIndex].Child(0); 1120RegexNode other = children[endingIndex].Child(0); 1313ProcessOneOrMulti(branch.Kind == RegexNodeKind.Concatenate ? branch.Child(0) : branch, startingSpan); 1365return alternation.ChildCount() == 1 ? alternation.Child(0) : alternation; 1378RegexNode branch = Kind == RegexNodeKind.Concatenate ? Child(0) : this; 1415node = node.Child(0); 1508return Child(0); 1515RegexNode child = Child(i); 1815Child(i).FindAndMakeLoopsAtomic(); 1847node = node.Child(node.ChildCount() - 1); 1914ProcessNode(node.Child(b), subsequent); 1935node = node.Child(0); 1940node = node.Child(0); 1952RegexNode lastConcatChild = node.Child(concatCount - 1); 1953if (CanBeMadeAtomic(lastConcatChild, node.Child(0), iterateNullableSubsequent: false, allowLazy: false)) 1982if (Child(0).Kind == RegexNodeKind.Empty) 2029RegexNode condition = Child(0); 2032ReplaceChild(0, condition.Child(0)); 2037condition = Child(0); 2074subsequent = subsequent.Child(0); 2100if (!CanBeMadeAtomic(node, subsequent.Child(i), iterateNullableSubsequent, allowLazy: false)) 2284return (int)Math.Min(int.MaxValue - 1, (long)M * Child(0).ComputeMinLength()); 2291int min = Child(0).ComputeMinLength(); 2294min = Math.Min(min, Child(i).ComputeMinLength()); 2301return Math.Min(Child(0).ComputeMinLength(), Child(1).ComputeMinLength()); 2305return Math.Min(Child(1).ComputeMinLength(), Child(2).ComputeMinLength()); 2314sum += Child(i).ComputeMinLength(); 2324return Child(0).ComputeMinLength(); 2392if (Child(0).ComputeMaxLength() is int childMaxLength) 2408if (Child(0).ComputeMaxLength() is not int maxLength) 2415if (Child(i).ComputeMaxLength() is not int next) 2431return Child(i).ComputeMaxLength() is int yes && Child(i + 1).ComputeMaxLength() is int no ? 2443if (Child(i).ComputeMaxLength() is not int length) 2462return Child(0).ComputeMaxLength(); 2524RegexNode child = Child(i); 2642RegexNode child = Child(childIndex); 2650child = Child(exclusiveEnd); 2818if (ExceedsMaxDepthAllowedDepth(node.Child(i), allowedDepth - 1)) 2851curNode = curNode.Child(curChild);

System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (33)

86node = node.Child(0); 217if (!FindPrefixesCore(node.Child(i), results, ignoreCase)) 231if (!FindPrefixesCore(node.Child(0), results, ignoreCase)) 258_ = FindPrefixesCore(node.Child(i), alternateBranchResults, ignoreCase); 368if (!Process(node.Child(i), ref vsb)) 385Process(node.Child(0), ref vsb); 401Process(node.Child(i), ref alternateSb); 445if (!Process(node.Child(0), ref vsb)) 456return Process(node.Child(0), ref vsb); 494node = node.Child(0); 684return TryFindRawFixedSets(node.Child(0), results, ref distance, thorough); 693TryFindRawFixedSets(node.Child(0), results, ref distance, thorough); 701if (!TryFindRawFixedSets(node.Child(i), results, ref distance, thorough)) 721allSameSize &= TryFindRawFixedSets(node.Child(i), localResults, ref localDistance, thorough); 1022return TryFindFirstCharClass(node.Child(0), ref cc); 1029return TryFindFirstCharClass(node.Child(0), ref cc) switch 1045bool? childResult = TryFindFirstCharClass(node.Child(i), ref cc); 1063bool? childResult = TryFindFirstCharClass(node.Child(i), ref cc); 1081return (TryFindFirstCharClass(node.Child(branchStart), ref cc), TryFindFirstCharClass(node.Child(branchStart + 1), ref cc)) switch 1116node = node.Child(0); 1130RegexNode firstChild = node.Child(0); 1133firstChild = firstChild.Child(0); 1142RegexNode nextChild = node.Child(1); 1150nextChild = node.Child(2); 1203nextChild = nextChild.Child(0); 1267node = node.Child(0); 1281if (node.Child(i).Kind is not (RegexNodeKind.Empty or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround)) 1283child = node.Child(i); 1292if (node.Child(i).Kind is not (RegexNodeKind.Empty or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround)) 1294child = node.Child(i); 1313RegexNodeKind anchor = FindLeadingOrTrailingAnchor(node.Child(0), leading); 1324if (FindLeadingOrTrailingAnchor(node.Child(i), leading) != anchor)

System\Text\RegularExpressions\RegexReplacement.cs (1)

49RegexNode child = concat.Child(i);

System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)

85RegexNode child = node.Child(i);

System\Text\RegularExpressions\RegexWriter.cs (1)

91curNode = curNode.Child(curChild);

System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (2)

99stack.Push((node.Child(i), childResults[i], CreateChildResultArray(node.Child(i).ChildCount())));