kubernetes/vendor/github.com/antlr4-go/antlr/v4/dfa_state.go

type PredPrediction …

func NewPredPrediction(pred SemanticContext, alt int) *PredPrediction { … }

func (p *PredPrediction) String() string { … }

type DFAState …

func NewDFAState(stateNumber int, configs *ATNConfigSet) *DFAState { … }

// GetAltSet gets the set of all alts mentioned by all ATN configurations in d.
func (d *DFAState) GetAltSet() []int { … }

func (d *DFAState) getEdges() []*DFAState { … }

func (d *DFAState) numEdges() int { … }

func (d *DFAState) getIthEdge(i int) *DFAState { … }

func (d *DFAState) setEdges(newEdges []*DFAState) { … }

func (d *DFAState) setIthEdge(i int, edge *DFAState) { … }

func (d *DFAState) setPrediction(v int) { … }

func (d *DFAState) String() string { … }

func (d *DFAState) Hash() int { … }

// Equals returns whether d equals other. Two DFAStates are equal if their ATN
// configuration sets are the same. This method is used to see if a state
// already exists.
//
// Because the number of alternatives and number of ATN configurations are
// finite, there is a finite number of DFA states that can be processed. This is
// necessary to show that the algorithm terminates.
//
// Cannot test the DFA state numbers here because in
// ParserATNSimulator.addDFAState we need to know if any other state exists that
// has d exact set of ATN configurations. The stateNumber is irrelevant.
func (d *DFAState) Equals(o Collectable[*DFAState]) bool { … }