/// <summary>Initializes the factory.</summary>
public SymbolicRegexRunnerFactory(RegexTree regexTree, RegexOptions options, TimeSpan matchTimeout)
{
Debug.Assert((options & (RegexOptions.RightToLeft | RegexOptions.ECMAScript)) == 0);
var charSetSolver = new CharSetSolver();
var bddBuilder = new SymbolicRegexBuilder <BDD>(charSetSolver, charSetSolver);
var converter = new RegexNodeConverter(bddBuilder, regexTree.CaptureNumberSparseMapping);
SymbolicRegexNode <BDD> rootNode = converter.ConvertToSymbolicRegexNode(regexTree.Root);
// Determine if the root node is supported for safe handling
int threshold = SymbolicRegexThresholds.GetSymbolicRegexSafeSizeThreshold();
Debug.Assert(threshold > 0);
// Skip the threshold check if the threshold equals int.MaxValue
if (threshold != int.MaxValue)
{
int size = rootNode.EstimateNfaSize();
if (size > threshold)
{
throw new NotSupportedException(SR.Format(SR.NotSupported_NonBacktrackingUnsafeSize, size, threshold));
}
}
rootNode = rootNode.AddFixedLengthMarkers();
BDD[] minterms = rootNode.ComputeMinterms();
_matcher = minterms.Length > 64 ?
SymbolicRegexMatcher <BitVector> .Create(regexTree.CaptureCount, regexTree.FindOptimizations, bddBuilder, rootNode, new BitVectorSolver(minterms, charSetSolver), matchTimeout) :
SymbolicRegexMatcher <ulong> .Create(regexTree.CaptureCount, regexTree.FindOptimizations, bddBuilder, rootNode, new UInt64Solver(minterms, charSetSolver), matchTimeout);
}