2 writes to NfaStateSet
System.Text.RegularExpressions (2)
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (2)
1350
nfaState.
NfaStateSet
= nextStates;
1447
nfaState.
NfaStateSet
= sourceStates;
13 references to NfaStateSet
System.Text.RegularExpressions (13)
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (10)
811
while (state.NfaState!.
NfaStateSet
.Count != 0) // Dead end here means the set is empty
1205
/// <summary>Scratch set to swap with <see cref="
NfaStateSet
"/> on each transition.</summary>
1208
/// states computed from the current states in <see cref="
NfaStateSet
"/>, and then the sets
1218
NfaStateSet
.Clear();
1222
matcher.ForEachNfaState(dfaMatchingState.Node, dfaMatchingState.PrevCharKind,
NfaStateSet
,
1314
foreach (ref KeyValuePair<int, int> nfaState in CollectionsMarshal.AsSpan(state.NfaState!.
NfaStateSet
.Values))
1328
foreach (ref KeyValuePair<int, int> nfaState in CollectionsMarshal.AsSpan(state.NfaState!.
NfaStateSet
.Values))
1349
SparseIntMap<int> sourceStates = nfaState.
NfaStateSet
;
1427
foreach (ref KeyValuePair<int, int> nfaState in CollectionsMarshal.AsSpan(state.NfaState!.
NfaStateSet
.Values))
1445
SparseIntMap<int> nextStates = nfaState.
NfaStateSet
;
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Sample.cs (3)
82
Debug.Assert(states.
NfaStateSet
.Count > 0);
139
if (states.
NfaStateSet
.Count > 0)
154
if (states.
NfaStateSet
.Count == 0 || inputSoFar.Length > SampleMatchesMaxInputLength)