1 write to PrevCharKind
System.Text.RegularExpressions (1)
System\Text\RegularExpressions\Symbolic\MatchingState.cs (1)
16
PrevCharKind
= prevCharKind;
15 references to PrevCharKind
System.Text.RegularExpressions (15)
System\Text\RegularExpressions\Symbolic\MatchingState.cs (10)
54
/// by <see cref="
PrevCharKind
"/> of this state and the given nextCharKind. The node must be nullable here.
60
uint context = CharKind.Context(
PrevCharKind
, nextCharKind);
77
uint context = CharKind.Context(
PrevCharKind
, nextCharKind);
93
uint context = CharKind.Context(
PrevCharKind
, nextCharKind);
164
nullabilityInfo |= (byte)(Node.IsNullableFor(CharKind.Context(
PrevCharKind
, charKind)) ? 1 << (int)charKind : 0);
172
obj is MatchingState<TSet> s &&
PrevCharKind
== s.
PrevCharKind
&& Node.Equals(s.Node);
174
public override int GetHashCode() => HashCode.Combine(
PrevCharKind
, Node);
178
PrevCharKind
== 0 ? Node.ToString() :
179
$"({CharKind.DescribePrev(
PrevCharKind
)},{Node})";
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (3)
1024
ForEachNfaState(initialState.Node, initialState.
PrevCharKind
, (current, initialRegisters),
1088
CharKind.Context(endState.
PrevCharKind
, GetCharKind(input, iEnd)), (Registers: endRegisters, Pos: iEnd));
1222
matcher.ForEachNfaState(dfaMatchingState.Node, dfaMatchingState.
PrevCharKind
, NfaStateSet,
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Dgml.cs (1)
33
string info = CharKind.DescribePrev(state.
PrevCharKind
);
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Explore.cs (1)
70
ForEachNfaState(dfaState.Node, dfaState.
PrevCharKind
, (this, seen, toExplore),