alchemist-physics/it.unibo.alchemist.model.physics/PhysicsEnvironment

PhysicsEnvironment

interface PhysicsEnvironment<T, P : Position<P>, Vector<P>, A : Transformation<P>, F : GeometricShapeFactory<P, A>> : EuclideanEnvironment<T, P> (source)

An environment supporting physics and nodes shapes. Note: due to the high number of parameters it's highly recommended not to use this interface directly, but to create an apposite interface extending this one instead.

Parameters

factory of shapes compatible with this environment

Inheritors

Physics2DEnvironment

PhysicsEnvironmentWithObstacles

Properties

dimensions

abstract val dimensions: Int

globalReactions

abstract val globalReactions: ListSet<GlobalReaction<T>>

incarnation

abstract val incarnation: Incarnation<T, P>

isTerminated

abstract val isTerminated: Boolean

layers

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

linkingRule

abstract var linkingRule: LinkingRule<T, P>

nodeCount

abstract val nodeCount: Int

nodes

abstract val nodes: ListSet<Node<T>>

offset

abstract val offset: DoubleArray

origin

open val origin: P

shapeFactory

abstract val shapeFactory: F

A factory of shapes compatible with this environment.

simulation

abstract var simulation: Simulation<T, P>

simulationOrNull

abstract val simulationOrNull: Simulation<T, P>?

size

abstract val size: DoubleArray

sizeInDistanceUnits

abstract val sizeInDistanceUnits: DoubleArray

Functions

addGlobalReaction

abstract fun addGlobalReaction(reaction: GlobalReaction<T>)

addLayer

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

addNode

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

addTerminator

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

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

farthestPositionReachable

abstract fun farthestPositionReachable(node: Node<T>, desiredPosition: P, hitboxRadius: Double = getShape(node).radius): P

Computes the farthest position reachable by a node towards a desiredPosition, avoiding node overlapping. If no node is located in between, desiredPosition is returned. Otherwise, the first position where the node collides with someone else is returned. For collision purposes, hitboxes are used: each node is given a circular hitbox of radius equal to its shape's radius (shapeless nodes can't cause overlapping). The client can specify a different radius for the hitbox of the moving node.