Package-level declarations

Types

Link copied to clipboard
class ArrayIndexedPriorityEpsilonBatchQueue<T>(epsilon: Double, delegate: ArrayIndexedPriorityQueue<T> = ArrayIndexedPriorityQueue()) : Scheduler<T> , BatchedScheduler<T>

Batched extension for ArrayIndexedPriorityQueue. This implementation uses epsilon-sensitivity in order to build the next batch to process. Events will be added to the batch while | tau(e1) - tau(e2) | < epsilon.

Link copied to clipboard
class ArrayIndexedPriorityFixedBatchQueue<T>(batchSize: Int, delegate: ArrayIndexedPriorityQueue<T> = ArrayIndexedPriorityQueue()) : Scheduler<T> , BatchedScheduler<T>

Batched extension for ArrayIndexedPriorityQueue. This implementation presents fixed size batches.

Link copied to clipboard
This class implements the indexed priority queue through an Array.
Link copied to clipboard
interface BatchedScheduler<T> : Scheduler<T>
Extension to Scheduler to allow for batched retrieval from the queue.
Link copied to clipboard
class BatchEngine<T, P : Position<out P>> : Engine<T, P>

This class implements a simulation. It offers a wide number of static factories to ease the creation process.

Link copied to clipboard
open class Engine<T, P : Position<out P>>(environment: Environment<T, P>, scheduler: Scheduler<T>) : Simulation<T, P>

Represents a simulation engine that manages execution and scheduling. Provides multiple factory methods to simplify the creation process.

Link copied to clipboard

Contains the engine configuration parameters.

Link copied to clipboard
class JGraphTDependencyGraph<T>(environment: Environment<T, *>) : DependencyGraph<T>

This class offers an implementation of a dependency graph, namely a data structure which can address in an efficient way the problem of finding those reactions affected by the execution of another reaction. This class relies heavily on the ReactionHandler interface.