1 write to Node
System.Text.RegularExpressions (1)
System\Text\RegularExpressions\Symbolic\MatchingState.cs (1)
15Node = node;
19 references to Node
System.Text.RegularExpressions (19)
System\Text\RegularExpressions\Symbolic\MatchingState.cs (15)
49internal bool IsDeadend(ISolver<TSet> solver) => Node.IsNothing(solver); 61return Node.ResolveFixedLength(context); 65internal bool StartsWithLineAnchor => Node._info.StartsWithLineAnchor; 71/// <param name="builder">the builder that owns <see cref="Node"/></param> 80return Node.CreateDerivativeWithoutEffects(builder, minterm, context); 86/// <param name="builder">the builder that owns <see cref="Node"/></param> 96return Node.CreateNfaDerivativeWithEffects(builder, minterm, context); 138if (Node.CanBeNullable) 141if (Node.IsNullable) 147if (Node.Kind != SymbolicRegexNodeKind.DisableBacktrackingSimulation) 160if (Node.CanBeNullable) 164nullabilityInfo |= (byte)(Node.IsNullableFor(CharKind.Context(PrevCharKind, charKind)) ? 1 << (int)charKind : 0); 172obj is MatchingState<TSet> s && PrevCharKind == s.PrevCharKind && Node.Equals(s.Node); 174public override int GetHashCode() => HashCode.Combine(PrevCharKind, Node);
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Automata.cs (1)
405GetState(coreTargetId).Node : coreState.Next(_builder, minterm, nextCharKind);
System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (3)
1026ForEachNfaState(initialState.Node, initialState.PrevCharKind, (current, initialRegisters), 1089endState.Node.ApplyEffects((effect, args) => args.Registers.ApplyEffect(effect, args.Pos), 1224matcher.ForEachNfaState(dfaMatchingState.Node, dfaMatchingState.PrevCharKind, NfaStateSet,