alchemist/it.unibo.alchemist.model.interfaces.environments/Euclidean2DEnvironmentWithGraph

Euclidean2DEnvironmentWithGraph

interface Euclidean2DEnvironmentWithGraph<W : Obstacle2D<Euclidean2DPosition>, T, N : Euclidean2DConvexShape, E> : EnvironmentWithGraph<W, T, Euclidean2DPosition, Euclidean2DTransformation, N, E> , Euclidean2DEnvironmentWithObstacles<W, T>

An euclidean bidimensional EnvironmentWithGraph.

Functions

addLayer

abstract fun addLayer(p0: Molecule, p1: Layer<T, Euclidean2DPosition>)

addNode

abstract fun addNode(p0: Node<T>, p1: Euclidean2DPosition)

addObstacle

abstract fun addObstacle(obstacle: W)

addTerminator

abstract fun addTerminator(p0: Predicate<Environment<T, Euclidean2DPosition>>)

forEach

open fun forEach(p0: Consumer<in Node<T>>)

getDimensions

abstract fun getDimensions(): Int

getDistanceBetweenNodes

abstract fun getDistanceBetweenNodes(p0: Node<T>, p1: Node<T>): Double

getIncarnation

abstract fun getIncarnation(): Optional<Incarnation<T, Euclidean2DPosition>>

getLayer

abstract fun getLayer(p0: Molecule): Optional<Layer<T, Euclidean2DPosition>>

getLayers

abstract fun getLayers(): ListSet<Layer<T, Euclidean2DPosition>>

getLinkingRule

abstract fun getLinkingRule(): LinkingRule<T, Euclidean2DPosition>

getNeighborhood

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

getNodeByID

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

getNodeCount

abstract fun getNodeCount(): Int

getNodes

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

getNodesWithinRange

abstract fun getNodesWithinRange(p0: Euclidean2DPosition, p1: Double): ListSet<Node<T>>

abstract fun getNodesWithinRange(p0: Node<T>, p1: Double): ListSet<Node<T>>

getObstaclesInRange

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

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

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

getOffset

abstract fun getOffset(): DoubleArray

getPosition

@Nonnull

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

getSimulation

abstract fun getSimulation(): Simulation<T, Euclidean2DPosition>

getSize

abstract fun getSize(): DoubleArray

getSizeInDistanceUnits

abstract fun getSizeInDistanceUnits(): DoubleArray

hasMobileObstacles

abstract fun hasMobileObstacles(): Boolean

intersectsObstacle

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

isTerminated

abstract fun isTerminated(): Boolean

iterator

abstract operator override fun iterator(): MutableIterator<Node<T>>

makePosition

abstract fun makePosition(vararg p0: Number): Euclidean2DPosition

abstract fun makePosition(vararg coordinates: Double): Euclidean2DPosition

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

Creates a new Euclidean2DPosition.

moveNode

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

moveNodeToPosition

abstract fun moveNodeToPosition(p0: Node<T>, p1: Euclidean2DPosition)

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

removeNode

abstract fun removeNode(p0: Node<T>)

removeObstacle

abstract fun removeObstacle(obstacle: W): Boolean

setLinkingRule

abstract fun setLinkingRule(p0: LinkingRule<T, Euclidean2DPosition>)

setSimulation

abstract fun setSimulation(p0: Simulation<T, Euclidean2DPosition>)

spliterator

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

Properties

graph

abstract val graph: NavigationGraph<Euclidean2DPosition, Euclidean2DTransformation, N, E>

The navigation graph.

obstacles

abstract val obstacles: List<W>

origin

open val origin: Euclidean2DPosition

Inheritors

EuclideanPhysics2DEnvironmentWithGraph