alchemist/it.unibo.alchemist.model.implementations.environments/OSMEnvironment

OSMEnvironment

class OSMEnvironment<T> : Abstract2DEnvironment<T, GeoPosition> , MapEnvironment<T, GraphHopperOptions, GraphHopperRoutingService>

This class serves as template for more specific implementations of environments using a map. It encloses the navigation logic, but leaves the subclasses to decide how to provide map data (e.g. loading from disk or rely on online services). The data is then stored in-memory for performance reasons.

Parameters

<T>

concentration type

Constructors

open fun OSMEnvironment(incarnation: Incarnation<T, GeoPosition>)

Builds a new OSMEnvironment without an actual backing map.

open fun OSMEnvironment(incarnation: Incarnation<T, GeoPosition>, file: String)

Builds a new OSMEnvironment, with nodes not forced on streets.

open fun OSMEnvironment(incarnation: Incarnation<T, GeoPosition>, file: String, onStreets: Boolean)

open fun OSMEnvironment(incarnation: Incarnation<T, GeoPosition>, file: String, onStreets: Boolean, onlyOnStreets: Boolean)

open fun OSMEnvironment(incarnation: Incarnation<T, GeoPosition>, file: String, approximation: Int)

open fun OSMEnvironment(incarnation: Incarnation<T, GeoPosition>, file: String, approximation: Int, onStreets: Boolean, onlyOnStreets: Boolean)

Functions

fun addLayer(m: Molecule, l: Layer<T, P>)

fun addNode(node: Node<T>, p: P)

fun addTerminator(terminator: Predicate<Environment<T, P>>)

open fun computeRoute(p1: GeoPosition, p2: GeoPosition): Route<GeoPosition>

open fun computeRoute(node: Node<T>, coord: GeoPosition): Route<GeoPosition>

open fun computeRoute(node: Node<T>, node2: Node<T>): Route<GeoPosition>

open fun computeRoute(from: GeoPosition, to: GeoPosition, options: GraphHopperOptions): Route<GeoPosition>

open fun computeRoute(node: Node<T>, coord: GeoPosition, options: GraphHopperOptions): Route<GeoPosition>

This method relies on the map data, and computes a route towards some absolute coordinate solving a TSP problem.

enableBenchmark

open fun enableBenchmark()

fun forEach(action: Consumer<out Any>)

getBenchmarkResult

open fun getBenchmarkResult(): Double

fun getDimensions(): Int

getDistanceBetweenNodes

fun getDistanceBetweenNodes(n1: Node<T>, n2: Node<T>): Double

fun getIncarnation(): Optional<Incarnation<T, P>>

fun getLayer(m: Molecule): Optional<Layer<T, P>>

fun getLayers(): ListSet<Layer<T, P>>

fun getLinkingRule(): LinkingRule<T, P>

getNeighborhood

fun getNeighborhood(center: Node<T>): Neighborhood<T>

fun getNodeByID(id: Int): Node<T>

fun getNodeCount(): Int

fun getNodes(): ListSet<Node<T>>

getNodesWithinRange

fun getNodesWithinRange(center: Node<T>, range: Double): ListSet<Node<T>>

fun getOffset(): Array<Double>

fun getPosition(node: Node<T>): P

getRoutingService

open fun getRoutingService(): GraphHopperRoutingService

fun getSimulation(): Simulation<T, P>

fun getSize(): Array<Double>

getSizeInDistanceUnits

open fun getSizeInDistanceUnits(): Array<Double>

fun isTerminated(): Boolean

fun iterator(): Iterator<Node<T>>

abstract fun iterator(): Iterator<T>

open fun makePosition(coordinates: Array<Number>): GeoPosition

moveNodeToPosition

open fun moveNodeToPosition(node: Node<T>, newpos: P)

fun removeNode(node: Node<T>)

fun setLinkingRule(r: LinkingRule<T, P>)

fun setSimulation(s: Simulation<T, P>)

fun spliterator(): Spliterator<Node<T>>

open fun spliterator(): Spliterator<T>

open fun toString(): String

Properties

DEFAULT_APPROXIMATION

val DEFAULT_APPROXIMATION: Int

The default value for approximating the positions comparison.

DEFAULT_FORCE_STREETS

val DEFAULT_FORCE_STREETS: Boolean

The default value for the discard of nodes too far from streets option.

DEFAULT_ON_STREETS

val DEFAULT_ON_STREETS: Boolean

The default value for the force nodes on streets option.