Packages

class PlaceI extends Identifiable

The PlaceI class represents a discrete place (can hold tokens).

Linear Supertypes
Identifiable, Error, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PlaceI
  2. Identifiable
  3. Error
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PlaceI(x: Double, y: Double, tokens: VectorI, stays: Boolean = false)

    x

    the place's x-coordinate

    y

    the place's y-coordinate

    tokens

    the number of tokens per color

    stays

    whether the tokens stay (test arc)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def add(_tokens: VectorI): Unit

    Add tokens to 'this' discrete place.

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(that: Any): Boolean
    Definition Classes
    Identifiable → AnyRef → Any
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def flaw(method: String, message: String): Unit
    Definition Classes
    Error
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    Identifiable → AnyRef → Any
  13. def holds(_tokens: VectorI): Boolean

    Determine whether 'this' place holds at least the token vector (i.e., the requisite number of tokens of each color).

    Determine whether 'this' place holds at least the token vector (i.e., the requisite number of tokens of each color). Alternative: use threshold predicate in PetriNetRules.

  14. val id: Int
    Definition Classes
    Identifiable
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. def me: String
    Definition Classes
    Identifiable
  17. def name: String
    Definition Classes
    Identifiable
  18. def name_=(name: String): Unit
    Definition Classes
    Identifiable
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  22. def simType: String
    Definition Classes
    Identifiable
  23. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  24. def take(_tokens: VectorI): Unit

    Take tokens from 'this' discrete place.

  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. var tokens: VectorI
  27. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  30. val x: Double
  31. val y: Double

Inherited from Identifiable

Inherited from Error

Inherited from AnyRef

Inherited from Any

Ungrouped