Package

io.kagera.dsl

simple

Permalink

package simple

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

Type Members

  1. implicit class ADJ[In] extends AnyRef

    Permalink

  2. type Arc = WLDiEdge[Node]

    Permalink

    Type alias for the edge type of the scalax.collection.Graph backing the petri net.

  3. type MarkingLike[T] = (T) ⇒ SimpleMarking

    Permalink

  4. type Node = Either[Place[_], Transition[_, _]]

    Permalink

    Type alias for the node type of the scalax.collection.Graph backing the petri net.

  5. type Place[C] = Int

    Permalink

  6. type SimpleMarking = Map[Int, Int]

    Permalink

  7. type Transition[I, O] = Int

    Permalink

  8. case class TransitionAdjacency(in: SimpleMarking, out: SimpleMarking) extends Product with Serializable

    Permalink

Value Members

  1. def branch(branchFactor: Int, start: Int = 1): TransitionAdjacency

    Permalink

  2. def createPetriNet(adjacencies: TransitionAdjacency*): PetriNet[Place[_], Transition[_, _]]

    Permalink

  3. implicit def placeIdentifier(p: Place[_]): Id

    Permalink

  4. val runtime: PetriNetRuntime[Place, Transition, Unit, Unit]

    Permalink

  5. def seq(n: Int, start: Int = 1): Seq[TransitionAdjacency]

    Permalink

  6. implicit def toSimpleMarking1(p: Int): SimpleMarking

    Permalink

  7. implicit def toSimpleMarking2(p: (Int, Int)): SimpleMarking

    Permalink

  8. implicit def toSimpleMarking3(p: (Int, Int, Int)): SimpleMarking

    Permalink

  9. implicit def toSimpleMarkingSeq(p: Seq[Int]): SimpleMarking

    Permalink

  10. implicit def transitionIdentifier(t: Transition[_, _]): Id

    Permalink

  11. def tree(branchFactor: Int, depth: Int, start: Int = 1): Seq[TransitionAdjacency]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped