Class

io.kagera.api

PetriNetGraphNodeTAdditions

Related Doc: package api

Permalink

implicit class PetriNetGraphNodeTAdditions[A, B] extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PetriNetGraphNodeTAdditions
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PetriNetGraphNodeTAdditions(node: scalax.collection.Graph.NodeT)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def asPlace: A

    Permalink

  6. def asTransition: B

    Permalink

  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  13. def incomingEdgeA(a: A): Option[WLDiEdge[Either[A, B]]]

    Permalink

  14. def incomingEdgeB(b: B): Option[WLDiEdge[Either[A, B]]]

    Permalink

  15. def incomingPlaces: Set[A]

    Permalink

  16. def incomingTransitions: Set[B]

    Permalink

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  18. def isPlace: Boolean

    Permalink

  19. def isTransition: Boolean

    Permalink

  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  21. val node: scalax.collection.Graph.NodeT

    Permalink

  22. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  24. def outgoingEdgeA(a: A): Option[WLDiEdge[Either[A, B]]]

    Permalink

  25. def outgoingEdgeB(b: B): Option[WLDiEdge[Either[A, B]]]

    Permalink

  26. def outgoingPlaces: Set[A]

    Permalink

  27. def outgoingTransitions: Set[B]

    Permalink

  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  29. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped