2 writes to NfaStateSet
System.Text.RegularExpressions (2)
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (2)
1350nfaState.NfaStateSet = nextStates; 1447nfaState.NfaStateSet = sourceStates;
13 references to NfaStateSet
System.Text.RegularExpressions (13)
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (10)
811while (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 1218NfaStateSet.Clear(); 1222matcher.ForEachNfaState(dfaMatchingState.Node, dfaMatchingState.PrevCharKind, NfaStateSet, 1314foreach (ref KeyValuePair<int, int> nfaState in CollectionsMarshal.AsSpan(state.NfaState!.NfaStateSet.Values)) 1328foreach (ref KeyValuePair<int, int> nfaState in CollectionsMarshal.AsSpan(state.NfaState!.NfaStateSet.Values)) 1349SparseIntMap<int> sourceStates = nfaState.NfaStateSet; 1427foreach (ref KeyValuePair<int, int> nfaState in CollectionsMarshal.AsSpan(state.NfaState!.NfaStateSet.Values)) 1445SparseIntMap<int> nextStates = nfaState.NfaStateSet;
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Sample.cs (3)
82Debug.Assert(states.NfaStateSet.Count > 0); 139if (states.NfaStateSet.Count > 0) 154if (states.NfaStateSet.Count == 0 || inputSoFar.Length > SampleMatchesMaxInputLength)