Options
All
  • Public
  • Public/Protected
  • All
Menu

Class Transition<T, P>

A transition of the automaton

Type parameters

  • T

  • P

Hierarchy

  • Transition

Index

Constructors

Properties

Accessors

Methods

Constructors

constructor

  • new Transition(_from: State<T>, _to: State<T>, _reverse: boolean, _negation: boolean, _predicates: Array<P>): Transition

Properties

Private _from

_from: State<T>

Private _negation

_negation: boolean

Private _predicates

_predicates: Array<P>

Private _reverse

_reverse: boolean

Private _to

_to: State<T>

Accessors

from

negation

  • get negation(): boolean

  • Get the flag which indicates whether the edge's label must or musn't be in the predicates array

    Returns boolean

    The flag which indicates whether the edge's label must or musn't be in the predicates array

predicates

  • get predicates(): Array<P>

reverse

  • get reverse(): boolean

  • Get the flag which indicates whether we have to look for an outgoing or an incoming edge in the RDF graph

    Returns boolean

    The flag which indicates whether we have to look for an outgoing or an incoming edge in the RDF graph

to

Methods

equals

  • Test if a Transition is equal to this Transition i.e. All the fields of the Transition are equal to those of this Transition

    Parameters

    Returns boolean

    True if the Transitions are equal, False otherwise

hasPredicate

  • hasPredicate(predicate: P): boolean

toString

  • toString(): string

Generated using TypeDoc