37.0.1

alchemist-euclidean-geometry/it.unibo.alchemist.model.environments/Environment2DWithObstacles

Environment2DWithObstacles

interface Environment2DWithObstacles<W : Obstacle2D<Euclidean2DPosition>, T> : EnvironmentWithObstacles<W, T, Euclidean2DPosition> , Euclidean2DEnvironment<T> (source)

A bidimensional EnvironmentWithObstacles.

Inheritors

Euclidean2DEnvironmentWithObstacles

Properties

abstract val dimensions: Int

globalReactions

abstract val globalReactions: ListSet<GlobalReaction<T>>

abstract val incarnation: Incarnation<T, Euclidean2DPosition>

abstract val isTerminated: Boolean

abstract val layers: ListSet<Layer<T, Euclidean2DPosition>>

abstract var linkingRule: LinkingRule<T, Euclidean2DPosition>

abstract val nodeCount: Int

abstract val nodes: ListSet<Node<T>>

abstract val obstacles: List<W>

abstract val offset: DoubleArray

open val origin: Euclidean2DPosition

abstract var simulation: Simulation<T, Euclidean2DPosition>

simulationOrNull

abstract val simulationOrNull: Simulation<T, Euclidean2DPosition>?

abstract val size: DoubleArray

sizeInDistanceUnits

abstract val sizeInDistanceUnits: DoubleArray

Functions

addGlobalReaction

abstract fun addGlobalReaction(reaction: GlobalReaction<T>)

abstract fun addLayer(molecule: Molecule, layer: Layer<T, Euclidean2DPosition>)

abstract fun addNode(node: Node<T>, position: Euclidean2DPosition): Boolean

abstract fun addObstacle(obstacle: W)

abstract fun addTerminator(terminator: TerminationPredicate<T, Euclidean2DPosition>)

open fun addTerminator(terminator: (Environment<T, Euclidean2DPosition>) -> Boolean)

getDistanceBetweenNodes

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

abstract fun getLayer(molecule: Molecule): Layer<T, Euclidean2DPosition>?

getNeighborhood

abstract fun getNeighborhood(node: Node<T>): Neighborhood<T>

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

getNodesWithinRange

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

abstract fun getNodesWithinRange(position: Euclidean2DPosition, range: Double): ListSet<Node<T>>

getObstaclesInRange

abstract fun getObstaclesInRange(center: Euclidean2DPosition, range: Double): List<W>

Given a point and a range, retrieves all the obstacles within.

abstract fun getObstaclesInRange(centerx: Double, centery: Double, range: Double): List<W>

Given a point and a range, retrieves all the obstacles within. This function is maintained for compatibility with the previous version of the API, and may be deprecated in the future.

abstract fun getPosition(node: Node<T>): Euclidean2DPosition

hasMobileObstacles

abstract fun hasMobileObstacles(): Boolean

intersectsObstacle

abstract fun intersectsObstacle(start: Euclidean2DPosition, end: Euclidean2DPosition): Boolean

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

abstract fun makePosition(vararg coordinates: Number): Euclidean2DPosition

open fun makePosition(coordinates: List<Number>): Euclidean2DPosition

open fun makePosition(x: Double, y: Double): Euclidean2DPosition

open fun makePosition(x: Number, y: Number): Euclidean2DPosition

Creates a new Euclidean2DPosition.

open fun moveNode(node: Node<T>, direction: Euclidean2DPosition)

moveNodeToPosition

abstract fun moveNodeToPosition(node: Node<T>, position: Euclidean2DPosition)

abstract fun next(current: Euclidean2DPosition, desired: Euclidean2DPosition): Euclidean2DPosition

removeGlobalReaction

abstract fun removeGlobalReaction(reaction: GlobalReaction<T>)

abstract fun removeNode(node: Node<T>)

abstract fun removeObstacle(obstacle: W): Boolean