Node

1 write to Node

System.Text.RegularExpressions (1)

System\Text\RegularExpressions\Symbolic\MatchingState.cs (1)

23 references to Node

System.Text.RegularExpressions (23)

System\Text\RegularExpressions\Symbolic\MatchingState.cs (16)

48internal bool IsDeadend(ISolver<TSet> solver) => Node.IsNothing(solver); 60return Node.ResolveFixedLength(context); 64internal bool StartsWithLineAnchor => Node._info.StartsWithLineAnchor; 70/// <param name="builder">the builder that owns <see cref="Node"/></param> 79return Node.CreateDerivativeWithoutEffects(builder, minterm, context); 85/// <param name="builder">the builder that owns <see cref="Node"/></param> 95return Node.CreateNfaDerivativeWithEffects(builder, minterm, context); 103return Node.IsNullableFor(context); 126if (Node.CanBeNullable) 129if (Node.IsNullable) 135if (Node.Kind != SymbolicRegexNodeKind.DisableBacktrackingSimulation) 144obj is MatchingState<TSet> s && PrevCharKind == s.PrevCharKind && Node.Equals(s.Node); 146public override int GetHashCode() => HashCode.Combine(PrevCharKind, Node); 150PrevCharKind == 0 ? Node.ToString() : 151$"({CharKind.DescribePrev(PrevCharKind)},{Node})";

System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Automata.cs (1)

316GetState(coreTargetId).Node : coreState.Next(_builder, minterm, nextCharKind);

System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.cs (3)

714ForEachNfaState(initialState.Node, initialState.PrevCharKind, (current, initialRegisters), 777endState.Node.ApplyEffects((effect, args) => args.Registers.ApplyEffect(effect, args.Pos), 905matcher.ForEachNfaState(dfaMatchingState.Node, dfaMatchingState.PrevCharKind, NfaStateSet,

System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Dgml.cs (2)

34string deriv = WebUtility.HtmlEncode(state.Node.ToString()); 42if (state.Node.CanBeNullable)

System\Text\RegularExpressions\Symbolic\SymbolicRegexMatcher.Explore.cs (1)

64ForEachNfaState(dfaState.Node, dfaState.PrevCharKind, (this, seen, toExplore),