Bio
Implements a limited environment supporting cells with a defined shape, avoiding any overlapping among them.
Constructors
Properties
Return the Incarnation used to initialize the entities of this Environment, if it has been set.
Returns the current LinkingRule.
Returns all the Nodes that exist in current Environment.
A factory of shapes compatible with this environment.
Return the current Simulation, if present, or null otherwise.
Functions
Add a GlobalReaction to the Environment.
Adds to the simulation a predicate that determines whether a simulation should be terminated.
Calculates the shortest paths using the Floyd-Warshall algorithm calculating the Hop Distance between nodes.
Computes all the minimum distances with the provided metric using the Floyd–Warshall algorithm.
Computes the diameter of all subnetworks in the environment. The diameter is the longest shortest path between any two nodes. Returns a Set containing the SubNetworks.
Computes the diameter of all subnetworks in the environment. The diameter is the longest shortest path between any two nodes. Returns a Set containing the SubNetworks.
Computes the diameter of all subnetworks in the environment. The diameter is the longest shortest path between any two nodes, evaluated using the allShortestHopPaths method. Returns a Set containing the SubNetworks.
Computes the diameter of all subnetworks in the environment. The diameter is the longest shortest path between any two nodes, evaluated using the allShortestHopPaths method. Returns a Set containing the SubNetworks.
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.
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.
The number of dimensions of this environment.
Get the Environment's GlobalReactions.
Gets the heading of a node as a direction vector.
Return all the Layers in this Environment.
Given a node, this method returns its neighborhood.
Allows accessing a Node in this Environment known its id. Depending on the implementation, this method may or may not be optimized (namely, id could run in constant or linear time with the number of nodes).
Returns the number of Nodes currently in the Environment.
Gets all nodes whose shape.intersect is true for the given shape.
Given a node this method returns a list of all the surrounding nodes within the given range. Note that this method (depending on the implementation) might be not optimized, and it's consequently much better to use Environment.getNeighborhood and filter the neighborhood if you are sure that all the nodes within the range are connected to the center.
This method allows to know which are the smallest coordinates represented. Return an array of length dimensions containing the smallest coordinates for each dimension.
Create a position corresponding to the origin of this environment.
Calculates the position of a node.
A factory of shapes compatible with this environment.
Return the current Simulation, if present, or throws an IllegalStateException otherwise.
The size of the environment as an array of length getDimensions(). This method must return distance measured with the same unit used by the positions. No non-euclidean distance metrics are allowed.
Override this property if units measuring distance do not match with units used for coordinates. For instance, if your space is non-Euclidean, or if you are using polar coordinates. A notable example is using geographical latitude-longitude as y-x coordinates and meters as distance measure.
Returns true the network is segmented, false otherwise.
Return true if all the terminators are true.
Given the coordinates of the point, returns a Position compatible with this environment.
Creates a new Euclidean2DPosition.
Creates an euclidean position from the given coordinates.
This method moves a node in the environment toward some direction. If node move is unsupported, it does nothing. Subclasses may override this method if they want to change the way a node moves towards some direction. The current implementation internally calls {@link #moveNodeToPosition(Node, Position2D)}, as such, overriding that method may suffice.
Returns the diameter of the network in environment units if it is not segmented, and NaN otherwise.
Returns a random element of the Iterable using the provided randomGenerator.
Remove a GlobalReaction from the Environment.
Removes node. If node removal is unsupported, it does nothing.
Sets the heading of a node.
Return the current Simulation, if present, or throws an IllegalStateException otherwise.
Returns the EnvironmentSubscriptionMonitor of this Environment.
A function that maps an Environment to its surrogate class (EnvironmentSurrogate). Use the toSuitablePositionSurrogate strategy for PositionSurrogate mapping.
A function that maps an Environment to its surrogate class (EnvironmentSurrogate).
Converts an Environment to a EnvironmentSurrogate.