2 writes to _dfaDelta
System.Text.RegularExpressions (2)
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Automata.cs (1)
267
ArrayResizeAndVolatilePublish(ref
_dfaDelta
, newsize << _mintermsLog);
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (1)
193
_dfaDelta
= new int[InitialDfaStateCapacity << _mintermsLog];
8 references to _dfaDelta
System.Text.RegularExpressions (8)
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Automata.cs (7)
105
/// reads/writes), as when, e.g., <see cref="
_dfaDelta
"/> is found to not have an entry the array is checked again
126
/// <summary>Returns the span from <see cref="
_dfaDelta
"/> that may contain transitions for the given state</summary>
137
return
_dfaDelta
.AsSpan(state.Id << _mintermsLog, numMinterms);
360
Debug.Assert(offset <
_dfaDelta
.Length);
364
MatchingState<TSet>? targetState = _stateArray[
_dfaDelta
[offset]];
377
Volatile.Write(ref
_dfaDelta
[offset], targetState.Id);
400
int coreTargetId =
_dfaDelta
[coreOffset];
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (1)
123
/// The smallest k s.t. 2^k >= minterms.Length + 1. The "delta arrays", e.g., <see cref="
_dfaDelta
"/> allocate 2^k