alchemist-maps/it.unibo.alchemist.model.maps/MapEnvironment

MapEnvironment

interface MapEnvironment<T, O : RoutingServiceOptions<O>?, S : RoutingService<GeoPosition, O>?> : BenchmarkableEnvironment<T, P> (source)

Parameters

<T>

Concentration type

<O>
<S>

Inheritors

Functions

Link copied to clipboard
abstract fun addGlobalReaction(p: GlobalReaction<T>)
Link copied to clipboard
abstract fun addLayer(p: Molecule, p1: Layer<T, P>)
Link copied to clipboard
abstract fun addNode(p: Node<T>, p1: P): Boolean
Link copied to clipboard
abstract fun addTerminator(p: Predicate<Environment<T, P>>)
Link copied to clipboard
abstract fun computeRoute(p1: GeoPosition, p2: GeoPosition): Route<GeoPosition>
abstract fun computeRoute(node: Node<T>, coord: GeoPosition): Route<GeoPosition>
abstract fun computeRoute(node: Node<T>, node2: Node<T>): Route<GeoPosition>
abstract fun computeRoute(from: GeoPosition, to: GeoPosition, options: O): Route<GeoPosition>
abstract fun computeRoute(node: Node<T>, coord: GeoPosition, options: O): Route<GeoPosition>
This method relies on the map data, and computes a route towards some absolute coordinate solving a TSP problem.
Link copied to clipboard
abstract fun enableBenchmark()
Link copied to clipboard
open fun forEach(action: Consumer<in T>)
Link copied to clipboard
abstract fun getBenchmarkResult(): Double
Link copied to clipboard
abstract fun getDimensions(): Int
Link copied to clipboard
abstract fun getDistanceBetweenNodes(p: Node<T>, p1: Node<T>): Double
Link copied to clipboard
abstract fun getGlobalReactions(): ListSet<GlobalReaction<T>>
Link copied to clipboard
abstract fun getIncarnation(): Incarnation<T, P>
Link copied to clipboard
abstract fun getLayer(p: Molecule): Optional<Layer<T, P>>
Link copied to clipboard
abstract fun getLayers(): ListSet<Layer<T, P>>
Link copied to clipboard
abstract fun getLinkingRule(): LinkingRule<T, P>
Link copied to clipboard
abstract fun getNeighborhood(p: Node<T>): Neighborhood<T>
Link copied to clipboard
abstract fun getNodeByID(p: Int): Node<T>
Link copied to clipboard
abstract fun getNodeCount(): Int
Link copied to clipboard
abstract fun getNodes(): ListSet<Node<T>>
Link copied to clipboard
abstract fun getNodesWithinRange(p: Node<T>, p1: Double): ListSet<Node<T>>
Link copied to clipboard
abstract fun getOffset(): Array<Double>
Link copied to clipboard
abstract fun getPosition(p: Node<T>): P
Link copied to clipboard
abstract fun getRoutingService(): S
Link copied to clipboard
abstract fun getSimulation(): Simulation<T, P>
Link copied to clipboard
abstract fun getSize(): Array<Double>
Link copied to clipboard
Link copied to clipboard
abstract fun isTerminated(): Boolean
Link copied to clipboard
abstract fun iterator(): Iterator<T>
Link copied to clipboard
abstract fun makePosition(p: Array<Number>): P
Link copied to clipboard
abstract fun moveNodeToPosition(p: Node<T>, p1: P)
Link copied to clipboard
Link copied to clipboard
abstract fun removeNode(p: Node<T>)
Link copied to clipboard
abstract fun setLinkingRule(p: LinkingRule<T, P>)
Link copied to clipboard
abstract fun setSimulation(p: Simulation<T, P>)
Link copied to clipboard
open fun spliterator(): Spliterator<T>