2057new RegexNode(RegexNodeKind.Empty, child.Options)); 2097new(RegexNodeKind.One, multi.Options, multi.Str[1]) : 2098new(RegexNodeKind.Multi, multi.Options, multi.Str.Substring(1));

95new RegexNode(Kind, Options, Str!) : 96new RegexNode(Kind, Options, Ch); 121return new RegexNode(RegexNodeKind.One, options & ~RegexOptions.IgnoreCase, ch); 127return new RegexNode(RegexNodeKind.Set, options & ~RegexOptions.IgnoreCase, stringSet); 131return new RegexNode(RegexNodeKind.One, options, ch); 207RegexNode loopAsChild = new(RegexNodeKind.Loop, Options, M, N); 442parent.InsertChild(1, new RegexNode(RegexNodeKind.UpdateBumpalong, node.Options)); 548var atomic = new RegexNode(RegexNodeKind.Atomic, existingChild.Options); 6620 => new RegexNode(Kind == RegexNodeKind.Alternate ? RegexNodeKind.Nothing : RegexNodeKind.Empty, Options), 761return new RegexNode(RegexNodeKind.Empty, child.Options); 951return new RegexNode(RegexNodeKind.Nothing, Options); 990u = u.M == 0 ? new RegexNode(RegexNodeKind.Empty, Options) : child; 1078return new RegexNode(RegexNodeKind.Nothing, Options); 1300var newAlternate = new RegexNode(RegexNodeKind.Alternate, alternation.Options); 1311newAlternate.AddChild(new RegexNode(RegexNodeKind.Empty, children[i].Options)); 1318var atomic = new RegexNode(RegexNodeKind.Atomic, alternation.Options); 1325var newConcat = new RegexNode(RegexNodeKind.Concatenate, alternation.Options); 1479new RegexNode(RegexNodeKind.One, startingNodeOptions, startingSpan[0]) : 1480new RegexNode(RegexNodeKind.Multi, startingNodeOptions, startingSpan.ToString()); 1481var newAlternate = new RegexNode(RegexNodeKind.Alternate, startingNodeOptions); 1525var atomic = new RegexNode(RegexNodeKind.Atomic, startingNodeOptions); 1530var newConcat = new RegexNode(RegexNodeKind.Concatenate, startingNodeOptions); 1748return new RegexNode(RegexNodeKind.Empty, Options); 2350AddChild(new RegexNode(RegexNodeKind.Empty, Options)); 2368AddChild(new RegexNode(RegexNodeKind.Empty, Options)); 3291return new RegexNode(RegexNodeKind.Empty, Options); 3319var result = new RegexNode(lazy ? RegexNodeKind.Lazyloop : RegexNodeKind.Loop, Options, min, max);

277StartGroup(new RegexNode(RegexNodeKind.Capture, (_options & ~RegexOptions.IgnoreCase), 0, -1)); 347_unit = new RegexNode(RegexNodeKind.Set, _options & ~RegexOptions.IgnoreCase, setString); 400_unit = new RegexNode((_options & RegexOptions.Multiline) != 0 ? RegexNodeKind.Bol : RegexNodeKind.Beginning, _options); 411_unit = new RegexNode((_options & RegexOptions.Multiline) != 0 ? RegexNodeKind.Eol : RegexNodeKind.EndZ, _options); 418_unit = new RegexNode(RegexNodeKind.Set, _options & ~RegexOptions.IgnoreCase, RegexCharClass.AnyClass); 422_unit = new RegexNode(RegexNodeKind.Set, _options & ~RegexOptions.IgnoreCase, RegexCharClass.NotAnyNewLineClass); 426_unit = new RegexNode(RegexNodeKind.Notone, _options & ~RegexOptions.IgnoreCase, '\n'); 544_concatenation = new RegexNode(RegexNodeKind.Concatenate, _options); 829return new RegexNode(RegexNodeKind.Group, _options); 833return new RegexNode(RegexNodeKind.Capture, _options, _autocap++, -1); 1007return new RegexNode(RegexNodeKind.Capture, _options, capnum, uncapnum); 1029return new RegexNode(RegexNodeKind.BackreferenceConditional, _options, capnum); 1043return new RegexNode(RegexNodeKind.BackreferenceConditional, _options, tmpCapnum); 1097return new RegexNode(nodeType, _options); 1161new RegexNode(TypeFromCode(ch), _options); 1166(_options & RegexOptions.AnyNewLine) != 0 ? AnyNewLineEndZNode() : new RegexNode(RegexNodeKind.EndZ, _options); 1171new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), (_options & RegexOptions.ECMAScript) != 0 ? RegexCharClass.ECMAWordClass : RegexCharClass.WordClass); 1176new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), (_options & RegexOptions.ECMAScript) != 0 ? RegexCharClass.NotECMAWordClass : RegexCharClass.NotWordClass); 1181new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), (_options & RegexOptions.ECMAScript) != 0 ? RegexCharClass.ECMASpaceClass : RegexCharClass.SpaceClass); 1186new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), (_options & RegexOptions.ECMAScript) != 0 ? RegexCharClass.NotECMASpaceClass : RegexCharClass.NotSpaceClass); 1191new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), (_options & RegexOptions.ECMAScript) != 0 ? RegexCharClass.ECMADigitClass : RegexCharClass.DigitClass); 1196new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), (_options & RegexOptions.ECMAScript) != 0 ? RegexCharClass.NotECMADigitClass : RegexCharClass.NotDigitClass); 1213return new RegexNode(RegexNodeKind.Set, (_options & ~RegexOptions.IgnoreCase), cc.ToStringClass()); 1278IsCaptureSlot(capnum) ? new RegexNode(RegexNodeKind.Backreference, _options, capnum) : 1310return scanOnly ? null : new RegexNode(RegexNodeKind.Backreference, _options, capnum); 1324return new RegexNode(RegexNodeKind.Backreference, _options, capnum); 1344_capnames?[capname] is int tmpCapnum ? new RegexNode(RegexNodeKind.Backreference, _options, tmpCapnum) : 1420return new RegexNode(RegexNodeKind.Backreference, _options, capnum); 1430return new RegexNode(RegexNodeKind.Backreference, _options, capnum); 1442return new RegexNode(RegexNodeKind.Backreference, _options, tmpCapnum); 1480return new RegexNode(RegexNodeKind.Backreference, _options, capnum); 1741var lookbehindCr = new RegexNode(RegexNodeKind.PositiveLookaround, lookbehindOpts); 1742lookbehindCr.AddChild(new RegexNode(RegexNodeKind.One, lookbehindOptsNoCase, '\r')); 1745var crThenLf = new RegexNode(RegexNodeKind.Concatenate, lookaheadOpts); 1747crThenLf.AddChild(new RegexNode(RegexNodeKind.One, lookaheadOptsNoCase, '\n')); 1750var guard = new RegexNode(RegexNodeKind.NegativeLookaround, lookaheadOpts); 1769var crlfEnd = new RegexNode(RegexNodeKind.Concatenate, lookaheadOpts); 1770crlfEnd.AddChild(new RegexNode(RegexNodeKind.One, lookaheadOptsNoCase, '\r')); 1771crlfEnd.AddChild(new RegexNode(RegexNodeKind.One, lookaheadOptsNoCase, '\n')); 1772crlfEnd.AddChild(new RegexNode(RegexNodeKind.End, lookaheadOpts)); 1775var anyNewLineOptEnd = new RegexNode(RegexNodeKind.Concatenate, lookaheadOpts); 1776anyNewLineOptEnd.AddChild(new RegexNode(RegexNodeKind.Set, lookaheadOptsNoCase, RegexCharClass.AnyNewLineClass).MakeQuantifier(false, 0, 1)); 1777anyNewLineOptEnd.AddChild(new RegexNode(RegexNodeKind.End, lookaheadOpts)); 1780var innerAlt = new RegexNode(RegexNodeKind.Alternate, lookaheadOpts); 1783var lookahead = new RegexNode(RegexNodeKind.PositiveLookaround, lookaheadOpts); 1787var result = new RegexNode(RegexNodeKind.Concatenate, opts); 1806var innerAlt = new RegexNode(RegexNodeKind.Alternate, lookaheadOpts); 1807innerAlt.AddChild(new RegexNode(RegexNodeKind.Set, lookaheadOptsNoCase, RegexCharClass.AnyNewLineClass)); 1808innerAlt.AddChild(new RegexNode(RegexNodeKind.End, lookaheadOpts)); 1809var lookahead = new RegexNode(RegexNodeKind.PositiveLookaround, lookaheadOpts); 1813var result = new RegexNode(RegexNodeKind.Concatenate, opts); 1832var innerAlt = new RegexNode(RegexNodeKind.Alternate, lookbehindOpts); 1833innerAlt.AddChild(new RegexNode(RegexNodeKind.Set, lookbehindOptsNoCase, RegexCharClass.AnyNewLineClass)); 1834innerAlt.AddChild(new RegexNode(RegexNodeKind.Beginning, lookbehindOpts)); 1835var lookbehind = new RegexNode(RegexNodeKind.PositiveLookaround, lookbehindOpts); 1839var result = new RegexNode(RegexNodeKind.Concatenate, opts); 2198_concatenation!.AddChild(new RegexNode(RegexNodeKind.Multi, _options & ~RegexOptions.IgnoreCase, _pattern.Substring(pos, cch))); 2244_alternation = new RegexNode(RegexNodeKind.Alternate, _options); 2245_concatenation = new RegexNode(RegexNodeKind.Concatenate, _options); 2262_concatenation = new RegexNode(RegexNodeKind.Concatenate, _options);

1272(RegexNode LoopNode, (char Char, string? String, StringComparison StringComparison, char[]? Chars) Literal) target = _regexTree.FindOptimizations.LiteralAfterLoop.Value; 1456RegexNode node = _regexTree.Root; 1671void EmitAlternation(RegexNode node) 1890bool TryEmitAlternationAsSwitch(RegexNode node, int childCount, bool isAtomic) 1930void EmitSwitchedBranches(RegexNode node, int childCount, bool useILSwitch, int minValue, int range) 1946RegexNode child = node.Child(i); 1947RegexNode? startingLiteralNode = child.FindStartingLiteralNode(allowZeroWidth: false); 2026RegexNode child = node.Child(i); 2027RegexNode? startingLiteralNode = child.FindStartingLiteralNode(allowZeroWidth: false); 2053RegexNode originalFirst = child.Child(0); 2093static RegexNode CreateSlicedMulti(RegexNode multi) 2103void EmitBackreference(RegexNode node) 2293void EmitBackreferenceConditional(RegexNode node) 2308RegexNode yesBranch = node.Child(0); 2309RegexNode? noBranch = node.Child(1) is { Kind: not RegexNodeKind.Empty } childNo ? childNo : null; 2452void EmitExpressionConditional(RegexNode node) 2465RegexNode condition = node.Child(0); 2469RegexNode yesBranch = node.Child(1); 2470RegexNode? noBranch = node.Child(2) is { Kind: not RegexNodeKind.Empty } childNo ? childNo : null; 2645void EmitCapture(RegexNode node, RegexNode? subsequent = null) 2664RegexNode child = node.Child(0); 2771void EmitPositiveLookaroundAssertion(RegexNode node) 2815void EmitNegativeLookaroundAssertion(RegexNode node) 2847RegexNode child = node.Child(0); 2932void EmitNode(RegexNode node, RegexNode? subsequent = null, bool emitLengthChecksIfRequired = true) 3074void EmitAtomic(RegexNode node, RegexNode? subsequent) 3079RegexNode child = node.Child(0); 3118void EmitUpdateBumpalong(RegexNode node) 3138void EmitConcatenation(RegexNode node, RegexNode? subsequent, bool emitLengthChecksIfRequired) 3192static RegexNode? GetSubsequent(int index, RegexNode node, RegexNode? subsequent) 3197RegexNode next = node.Child(i); 3209void EmitSingleChar(RegexNode node, bool emitLengthCheck = true, LocalBuilder? offset = null) 3284void EmitBoundary(RegexNode node) 3344void EmitAnchors(RegexNode node) 3482void EmitMultiChar(RegexNode node, bool emitLengthCheck) 3534void EmitSingleCharLoop(RegexNode node, RegexNode? subsequent = null, bool emitLengthChecksIfRequired = true) 3655subsequent?.FindStartingLiteralNode() is RegexNode literal && 3660if (subsequent is not null && RegexNode.CanReduceLoopBacktrackingToSinglePosition(node, subsequent)) 3809void EmitSingleCharLazy(RegexNode node, RegexNode? subsequent = null, bool emitLengthChecksIfRequired = true) 3913subsequent?.FindStartingLiteral() is RegexNode.StartingLiteralData literal && 4055subsequent?.FindStartingLiteralNode() is RegexNode literal2 && 4156void EmitLazy(RegexNode node) 4163RegexNode child = node.Child(0); 4518void EmitSingleCharRepeater(RegexNode node, bool emitLengthChecksIfRequired = true) 4536case <= RegexNode.MultiVsRepeaterLimit when node.IsOneFamily: 4668void EmitSingleCharAtomicLoop(RegexNode node) 4915void EmitAtomicSingleCharZeroOrOne(RegexNode node) 5004void EmitNonBacktrackingRepeater(RegexNode node) 5042void EmitLoop(RegexNode node) 5048RegexNode child = node.Child(0); 5440bool CanEmitIndexOf(RegexNode node, out int literalLength) 5473void EmitIndexOf(RegexNode node, bool useLast, bool negate) 5665RegexNode root = _regexTree!.Root.Child(0);

18public static RegexFindOptimizations Create(RegexNode root, RegexOptions options) 24RegexPrefixAnalyzer.FindLeadingPositiveLookahead(root) is RegexNode positiveLookahead) 46private RegexFindOptimizations(RegexNode root, RegexOptions options, bool isLeadingPartial) 202(RegexNode LoopNode, (char Char, string? String, StringComparison StringComparison, char[]? Chars) Literal)? literalAfterLoop = RegexPrefixAnalyzer.FindLiteralFollowingLeadingLoop(root); 336public (RegexNode LoopNode, (char Char, string? String, StringComparison StringComparison, char[]? Chars) Literal)? LiteralAfterLoop { get; } 820(RegexNode loopNode, (char Char, string? String, StringComparison StringComparison, char[]? Chars) literal) = LiteralAfterLoop.GetValueOrDefault();

19/// <remarks>null if no children, a <see cref="RegexNode"/> if one child, or a <see cref="List{RegexNode}"/> if multiple children.</remarks> 49public RegexNode? Parent; 87public RegexNode CloneCharLoopWithOneLessIteration() 94RegexNode newNode = IsSetFamily ? 110public static RegexNode CreateOneWithCaseConversion(char ch, RegexOptions options, CultureInfo? culture, ref RegexCaseBehavior caseBehavior) 135public RegexNode ReverseConcatenationIfRightToLeft() 141((List<RegexNode>)Children!).Reverse(); 207RegexNode loopAsChild = new(RegexNodeKind.Loop, Options, M, N); 245var toExamine = new Stack<RegexNode>(); 249RegexNode node = toExamine.Pop(); 255RegexNode child = node.Child(i); 369internal RegexNode FinalOptimize() 371RegexNode rootNode = this; 423RegexNode node = rootNode.Child(0); // skip implicit root capture node 480RegexNode child = Child(i); 483RegexNode reduced = child.Reduce(); 509RegexNode node = this; 544RegexNode existingChild = node.Child(node.ChildCount() - 1); 548var atomic = new RegexNode(RegexNodeKind.Atomic, existingChild.Options); 621internal RegexNode Reduce() 657private RegexNode ReplaceNodeIfUnnecessary() 674private RegexNode ReduceGroup() 678RegexNode u = this; 695private RegexNode ReduceAtomic() 707RegexNode atomic = this; 708RegexNode child = Child(0); 753List<RegexNode>? branches = child.Children as List<RegexNode>; 794RegexNode startNode = branches[start]; 830RegexNode nextChild = branches[next]; 879private RegexNode ReduceLoops() 883RegexNode u = this; 891RegexNode child = u.Child(0); 959RegexNode child = u.Child(0); 1010private RegexNode ReduceSet() 1071private RegexNode ReduceAlternation() 1085RegexNode node = ReplaceNodeIfUnnecessary(); 1130RegexNode at; 1131RegexNode prev; 1133List<RegexNode> children = (List<RegexNode>)Children!; 1145if (at.Children is List<RegexNode> atChildren) 1155RegexNode atChild = (RegexNode)at.Children!; 1239static RegexNode ExtractCommonPrefixNode(RegexNode alternation) 1242Debug.Assert(alternation.Children is List<RegexNode> { Count: >= 2 }); 1243var children = (List<RegexNode>)alternation.Children; 1259RegexNode startingNode = children[startingIndex]; 1260RegexNode required = startingNode.Kind == RegexNodeKind.Concatenate ? startingNode.Child(0) : startingNode; 1280RegexNode endingNode = children[endingIndex]; 1281RegexNode other = endingNode.Kind == RegexNodeKind.Concatenate ? endingNode.Child(0) : endingNode; 1300var newAlternate = new RegexNode(RegexNodeKind.Alternate, alternation.Options); 1305((List<RegexNode>)children[i].Children!).RemoveAt(0); 1316if (alternation.Parent is RegexNode { Kind: RegexNodeKind.Atomic }) 1318var atomic = new RegexNode(RegexNodeKind.Atomic, alternation.Options); 1325var newConcat = new RegexNode(RegexNodeKind.Concatenate, alternation.Options); 1339static RegexNode RemoveRedundantEmptiesAndNothings(RegexNode node) 1343var children = (List<RegexNode>)node.Children!; 1349RegexNode child = children[i]; 1382static RegexNode ExtractCommonPrefixText(RegexNode alternation) 1385Debug.Assert(alternation.Children is List<RegexNode> { Count: >= 2 }); 1386var children = (List<RegexNode>)alternation.Children; 1405RegexNode? startingNode = children[startingIndex].FindBranchOneOrMultiStart(); 1478var prefix = startingSpan.Length == 1 ? 1481var newAlternate = new RegexNode(RegexNodeKind.Alternate, startingNodeOptions); 1484RegexNode branch = children[i]; 1491static void ProcessOneOrMulti(RegexNode node, ReadOnlySpan<char> startingSpan) 1523if (alternation.Parent is RegexNode parent && parent.Kind == RegexNodeKind.Atomic) 1525var atomic = new RegexNode(RegexNodeKind.Atomic, startingNodeOptions); 1530var newConcat = new RegexNode(RegexNodeKind.Concatenate, startingNodeOptions); 1548public RegexNode? FindBranchOneOrMultiStart() 1550RegexNode branch = Kind == RegexNodeKind.Concatenate ? Child(0) : this; 1587if (Child(i).FindStartingLiteralNode(allowZeroWidth: false) is not RegexNode startingLiteralNode || 1633public RegexNode? FindStartingLiteralNode(bool allowZeroWidth = true) 1635RegexNode? node = this; 1673if (FindStartingLiteralNode() is RegexNode node) 1740private RegexNode ReduceConcatenation() 1757RegexNode child = Child(i); 1785Debug.Assert(Children is List<RegexNode>); 1791List<RegexNode> children = (List<RegexNode>)Children!; 1794RegexNode at = children[i]; 1804if (at.Children is List<RegexNode> atChildren) 1814RegexNode atChild = (RegexNode)at.Children!; 1832RegexNode prev = children[--j]; 1868Debug.Assert(Children is List<RegexNode>); 1870var children = (List<RegexNode>)Children!; 1875RegexNode currentNode = children[current]; 1876RegexNode nextNode = children[next]; 2076Debug.Assert(Children is List<RegexNode>); 2077var children = (List<RegexNode>)Children; 2082static void ProcessNode(RegexNode node, RegexNode subsequent) 2144RegexNode loopChild = node.Child(0); 2178RegexNode child = node.Child(0); 2188RegexNode child = node.Child(0); 2219private RegexNode ReduceLookaround() 2238static bool RemoveCaptures(RegexNode parent, int nodeIndex) 2240RegexNode node = parent.Child(nodeIndex); 2270RegexNode child = Child(0); 2309private static bool? ContainsKind(RegexNode node, ReadOnlySpan<RegexNodeKind> kinds) 2339private RegexNode ReduceBackreferenceConditional() 2357private RegexNode ReduceExpressionConditional() 2376RegexNode condition = Child(0); 2400internal static bool CanReduceLoopBacktrackingToSinglePosition(RegexNode loopNode, RegexNode subsequent) 2406if (subsequent.FindStartingLiteralNode() is RegexNode literal) 2423FindNextNodeInSequence(literal, out _) is RegexNode afterLiteral && 2436static bool CharInLoopSet(RegexNode loopNode, char ch) => loopNode.Kind switch 2453private static bool CanBeMadeAtomic(RegexNode node, RegexNode subsequent, bool iterateNullableSubsequent, bool allowLazy) 2618RegexNode loopChild = node.Child(0); 2669RegexNode? nextSubsequent = FindNextNodeInSequence(subsequent, out bool reachedEnd); 2691private static RegexNode? FindNextNodeInSequence(RegexNode node, out bool reachedEnd) 2700RegexNode? parent = node.Parent; 2710var peers = (List<RegexNode>)parent.Children!; 2751private static bool MayContainBacktracking(RegexNode node) 2787RegexNode node = this; 2794node.Parent is not RegexNode parent) 2808var peers = (List<RegexNode>)parent.Children!; 3116RegexNode child = Child(i); 3243static bool CanJoinLengthCheck(RegexNode node) => node.Kind switch 3254RegexNode child = Child(childIndex); 3282public RegexNode MakeQuantifier(bool lazy, int min, int max) 3319var result = new RegexNode(lazy ? RegexNodeKind.Lazyloop : RegexNodeKind.Loop, Options, min, max); 3325public void AddChild(RegexNode newChild) 3335else if (Children is RegexNode currentChild) 3337Children = new List<RegexNode>() { currentChild, newChild }; 3341((List<RegexNode>)Children).Add(newChild); 3345public void InsertChild(int index, RegexNode newChild) 3347Debug.Assert(Children is List<RegexNode>); 3353((List<RegexNode>)Children).Insert(index, newChild); 3356public void ReplaceChild(int index, RegexNode newChild) 3369private void UnsafeReplaceChild(int index, RegexNode newChild) 3373if (Children is RegexNode) 3379((List<RegexNode>)Children)[index] = newChild; 3383public RegexNode Child(int i) => Children is RegexNode child ? child : ((List<RegexNode>)Children!)[i]; 3392if (Children is List<RegexNode> children) 3397Debug.Assert(Children is RegexNode); 3428static bool ExceedsMaxDepthAllowedDepth(RegexNode node, int allowedDepth) 3462RegexNode? curNode = this;

6/// <summary>Specifies the kind of a <see cref="RegexNode"/>.</summary> 16/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>.</remarks> 19/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>.</remarks> 22/// <remarks>The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>.</remarks> 26/// <remarks>The characters are specified in <see cref="RegexNode.Str"/>. This is purely a representational optimization, equivalent to multiple <see cref="One"/> nodes concatenated together.</remarks> 31/// The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>. 36/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks> 40/// <remarks>The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks> 45/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks> 49/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks> 53/// <remarks>The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks> 59/// The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>. 65/// The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>. 71/// The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>, the minimum number of iterations in <see cref="RegexNode.M"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>. 77/// <remarks>The capture group number referenced is stored in <see cref="RegexNode.M"/>.</remarks> 126/// <summary>A loop around an arbitrary <see cref="RegexNode"/>, e.g. `(ab|cd)*`.</summary> 128/// One and only one child, the expression in the loop. The minimum number of iterations is in <see cref="RegexNode.M"/>, 129/// and the maximum number of iterations is in <see cref="RegexNode.N"/>. 132/// <summary>A lazy loop around an arbitrary <see cref="RegexNode"/>, e.g. `(ab|cd)*?`.</summary> 134/// One and only one child, the expression in the loop. The minimum number of iterations is in <see cref="RegexNode.M"/>, 135/// and the maximum number of iterations is in <see cref="RegexNode.N"/>. 141/// One and only one child, the expression in the capture. <see cref="RegexNode.M"/> is the number of the capture, and if a balancing 142/// group, <see cref="RegexNode.N"/> is the uncapture. 169/// The referenced capture group number is stored in <see cref="RegexNode.M"/>.

151/// For quantified constructs with a minimum of zero (<see cref="RegexNode.M"/> == 0), this opcode pushes a counter

24private RegexNode? _stack; 25private RegexNode? _group; 26private RegexNode? _alternation; 27private RegexNode? _concatenation; 28private RegexNode? _unit; 109RegexNode root = parser.ScanRegex(); 144RegexNode root = parser.ScanReplacement(); 270private RegexNode ScanRegex() 332_unit = RegexNode.CreateOneWithCaseConversion(_pattern[endpos - 1], _options, _culture, ref _caseBehavior); 353if (ScanGroupOpen() is RegexNode grouper) 542private RegexNode ScanReplacement() 818private RegexNode? ScanGroupOpen() 1147private RegexNode? ScanBackslash(bool scanOnly) 1216RegexNode? result = ScanBasicBackslash(scanOnly); 1226private RegexNode? ScanBasicBackslash(bool scanOnly) 1355RegexNode.CreateOneWithCaseConversion(ch, _options, _culture, ref _caseBehavior) : 1360private RegexNode ScanDollar() 1364return RegexNode.CreateOneWithCaseConversion('$', _options, _culture, ref _caseBehavior); 1454return RegexNode.CreateOneWithCaseConversion('$', _options, _culture, ref _caseBehavior); 1487return RegexNode.CreateOneWithCaseConversion('$', _options, _culture, ref _caseBehavior); 1733private RegexNode AnyNewLineCrLfGuardNode() 1741var lookbehindCr = new RegexNode(RegexNodeKind.PositiveLookaround, lookbehindOpts); 1745var crThenLf = new RegexNode(RegexNodeKind.Concatenate, lookaheadOpts); 1750var guard = new RegexNode(RegexNodeKind.NegativeLookaround, lookaheadOpts); 1762private RegexNode AnyNewLineEndZNode() 1769var crlfEnd = new RegexNode(RegexNodeKind.Concatenate, lookaheadOpts); 1775var anyNewLineOptEnd = new RegexNode(RegexNodeKind.Concatenate, lookaheadOpts); 1780var innerAlt = new RegexNode(RegexNodeKind.Alternate, lookaheadOpts); 1783var lookahead = new RegexNode(RegexNodeKind.PositiveLookaround, lookaheadOpts); 1787var result = new RegexNode(RegexNodeKind.Concatenate, opts); 1799private RegexNode AnyNewLineEolNode() 1806var innerAlt = new RegexNode(RegexNodeKind.Alternate, lookaheadOpts); 1809var lookahead = new RegexNode(RegexNodeKind.PositiveLookaround, lookaheadOpts); 1813var result = new RegexNode(RegexNodeKind.Concatenate, opts); 1825private RegexNode AnyNewLineBolNode() 1832var innerAlt = new RegexNode(RegexNodeKind.Alternate, lookbehindOpts); 1835var lookbehind = new RegexNode(RegexNodeKind.PositiveLookaround, lookbehindOpts); 1839var result = new RegexNode(RegexNodeKind.Concatenate, opts); 2194_concatenation!.AddChild(RegexNode.CreateOneWithCaseConversion(_pattern[pos], isReplacement ? _options & ~RegexOptions.IgnoreCase : _options, _culture, ref _caseBehavior)); 2204_concatenation!.AddChild(RegexNode.CreateOneWithCaseConversion(c, _options, _culture, ref _caseBehavior)); 2241private void StartGroup(RegexNode openGroup)

21public static string[]? FindPrefixes(RegexNode node, bool ignoreCase) 57static bool FindPrefixesCore(RegexNode node, List<StringBuilder> results, bool ignoreCase) 340public static string FindPrefix(RegexNode node) 348static bool Process(RegexNode node, ref ValueStringBuilder vsb) 483public static string? FindPrefixOrdinalCaseInsensitive(RegexNode node) 511public static List<RegexFindOptimizations.FixedDistanceSet>? FindFixedDistanceSets(RegexNode root, bool thorough) 586static bool TryFindRawFixedSets(RegexNode node, List<RegexFindOptimizations.FixedDistanceSet> results, ref int distance, bool thorough) 906public static string? FindFirstCharClass(RegexNode root) => FindFirstOrLastCharClass(root, findFirst: true); 911public static string? FindLastCharClass(RegexNode root) => FindFirstOrLastCharClass(root, findFirst: false); 913public static string? FindFirstOrLastCharClass(RegexNode root, bool findFirst) 942static bool? TryFindFirstOrLastCharClass(RegexNode node, bool findFirst, ref RegexCharClass? cc) 1127public static (RegexNode LoopNode, (char Char, string? String, StringComparison StringComparison, char[]? Chars) Literal)? FindLiteralFollowingLeadingLoop(RegexNode node) 1154RegexNode firstChild = node.Child(0); 1166RegexNode nextChild = node.Child(1); 1256public static RegexNode? FindLeadingPositiveLookahead(RegexNode node) 1258RegexNode? positiveLookahead = null; 1263static bool FindLeadingPositiveLookahead(RegexNode node, ref RegexNode? positiveLookahead) 1330public static RegexNodeKind FindLeadingAnchor(RegexNode node) => 1334public static RegexNodeKind FindTrailingAnchor(RegexNode node) => 1338private static RegexNodeKind FindLeadingOrTrailingAnchor(RegexNode node, bool leading) 1379RegexNode? child = null; 1385RegexNode tmpChild = node.Child(i);

34public RegexReplacement(string rep, RegexNode concat, Hashtable _caps) 46RegexNode child = concat.Child(i);

11/// Provides the core data describing a parsed <see cref="RegexNode"/> tree, along with necessary 18/// <summary>The root node of the parsed <see cref="RegexNode"/> tree.</summary> 19public readonly RegexNode Root; 43internal RegexTree(RegexNode root, int captureCount, string[]? captureNames, Hashtable? captureNameToNumberMapping, Hashtable? captureNumberSparseMapping, RegexOptions options, CultureInfo? culture)

9/// <summary>Analyzes a <see cref="RegexTree"/> of <see cref="RegexNode"/>s to produce data on the tree structure, in particular in support of code generation.</summary> 19static bool TryAnalyze(RegexNode node, AnalysisResults results, bool isAtomicByAncestor, bool isInLoop) 33(results._inLoops ??= new HashSet<RegexNode>()).Add(node); 49(results._mayBacktrack ??= new HashSet<RegexNode>()).Add(node); 81RegexNode child = node.Child(i); 131(results._mayBacktrack ??= new HashSet<RegexNode>()).Add(node); 154internal readonly HashSet<RegexNode> _isAtomicByAncestor = new(); // since the root is implicitly atomic, every tree will contain atomic-by-ancestor nodes 156internal readonly HashSet<RegexNode> _containsCapture = new(); // the root is a capture, so this will always contain at least the root node 158internal HashSet<RegexNode>? _mayBacktrack; 160internal HashSet<RegexNode>? _inLoops; 179public bool IsAtomicByAncestor(RegexNode node) => _isAtomicByAncestor.Contains(node); 187public bool MayContainCapture(RegexNode node) => !_complete || _containsCapture.Contains(node); 200public bool MayBacktrack(RegexNode node) => !_complete || (_mayBacktrack?.Contains(node) ?? false); 220public bool IsInLoop(RegexNode node) => !_complete || (_inLoops?.Contains(node) ?? false);

78RegexNode curNode = _tree.Root; 201private void EmitFragment(RegexNodeKind nodeType, RegexNode node, int curIndex)

14/// <see cref="AddLast(DoublyLinkedList{T})"/> operation is made use of in the <see cref="RegexNodeConverter.ConvertToSymbolicRegexNode(RegexNode)"/> method 15/// where it maintains linear construction time in terms of the overall number of AST nodes in a given <see cref="RegexNode"/> input.

13/// <summary>Provides functionality to convert <see cref="RegexNode"/>s to corresponding <see cref="SymbolicRegexNode{S}"/>s.</summary> 26/// <summary>Converts the root <see cref="RegexNode"/> into its corresponding <see cref="SymbolicRegexNode{S}"/>.</summary> 29internal SymbolicRegexNode<BDD> ConvertToSymbolicRegexNode(RegexNode root) 37Stack<(RegexNode Node, DoublyLinkedList<SymbolicRegexNode<BDD>> Result, DoublyLinkedList<SymbolicRegexNode<BDD>>[]? ChildResults)> stack = new(); 42while (stack.TryPop(out (RegexNode Node, DoublyLinkedList<SymbolicRegexNode<BDD>> Result, DoublyLinkedList<SymbolicRegexNode<BDD>>[]? ChildResults) popped)) 44RegexNode node = popped.Node; 191static string UnexpectedNodeType(RegexNode node) 310SymbolicRegexNode<BDD> ConvertSet(RegexNode node)