1 write to FindOptimizations
System.Text.RegularExpressions (1)
System\Text\RegularExpressions\RegexTree.cs (1)
80
FindOptimizations
= RegexFindOptimizations.Create(root, options);
27 references to FindOptimizations
System.Text.RegularExpressions (27)
System\Text\RegularExpressions\RegexCompiler.cs (24)
411
int minRequiredLength = _regexTree.
FindOptimizations
.MinRequiredLength;
462
switch (_regexTree.
FindOptimizations
.FindMode)
490
Debug.Fail($"Unexpected mode: {_regexTree.
FindOptimizations
.FindMode}");
507
switch (_regexTree.
FindOptimizations
.FindMode)
513
_regexTree.Root.ComputeMaxLength() == _regexTree.
FindOptimizations
.MinRequiredLength)
522
Ldc(_regexTree.
FindOptimizations
.MinRequiredLength);
642
int extraNewlineBump = _regexTree.
FindOptimizations
.FindMode == FindNextStartingPositionMode.TrailingAnchor_FixedLength_LeftToRight_EndZ ? 1 : 0;
647
Ldc(_regexTree.
FindOptimizations
.MinRequiredLength + extraNewlineBump);
653
Ldc(_regexTree.
FindOptimizations
.MinRequiredLength + extraNewlineBump);
666
switch (_regexTree.
FindOptimizations
.LeadingAnchor)
745
switch (_regexTree.
FindOptimizations
.TrailingAnchor)
747
case RegexNodeKind.End or RegexNodeKind.EndZ when _regexTree.
FindOptimizations
.MaxPossibleLength is int maxLength:
750
int extraNewlineBump = _regexTree.
FindOptimizations
.FindMode == FindNextStartingPositionMode.TrailingAnchor_FixedLength_LeftToRight_EndZ ? 1 : 0;
775
RegexFindOptimizations opts = _regexTree.
FindOptimizations
;
830
string prefix = _regexTree.
FindOptimizations
.LeadingPrefix;
863
Debug.Assert(_regexTree.
FindOptimizations
.FixedDistanceSets is { Count: > 0 });
865
List<RegexFindOptimizations.FixedDistanceSet>? sets = _regexTree.
FindOptimizations
.FixedDistanceSets;
1194
Debug.Assert(_regexTree.
FindOptimizations
.FixedDistanceSets is { Count: > 0 });
1196
RegexFindOptimizations.FixedDistanceSet set = _regexTree.
FindOptimizations
.FixedDistanceSets![0];
1265
Debug.Assert(_regexTree.
FindOptimizations
.LiteralAfterLoop is not null);
1266
(RegexNode LoopNode, (char Char, string? String, StringComparison StringComparison, char[]? Chars) Literal) target = _regexTree.
FindOptimizations
.LiteralAfterLoop.Value;
2687
if (_regexTree!.
FindOptimizations
.FindMode == FindNextStartingPositionMode.LiteralAfterLoop_LeftToRight &&
2688
_regexTree!.
FindOptimizations
.LiteralAfterLoop?.LoopNode == node)
5392
else if (_regexTree.
FindOptimizations
.FindMode is
System\Text\RegularExpressions\RegexWriter.cs (1)
122
return new RegexInterpreterCode(_tree.
FindOptimizations
, _tree.Options, emitted, strings, _trackCount);
System\Text\RegularExpressions\Symbolic\SymbolicRegexRunnerFactory.cs (2)
43
SymbolicRegexMatcher<BitVector>.Create(regexTree.CaptureCount, regexTree.
FindOptimizations
, bddBuilder, rootNode, new BitVectorSolver(minterms), matchTimeout) :
44
SymbolicRegexMatcher<ulong>.Create(regexTree.CaptureCount, regexTree.
FindOptimizations
, bddBuilder, rootNode, new UInt64Solver(minterms), matchTimeout);