libGDX 1.14.2 · com.badlogic.gdx.utils.QuadTreeFloat

Field Summary

Modifier and Type	Field and Description
public int	count The number of elements stored in `values` (3 values per quad tree entry).
public int	depth
public static final int	DISTSQR
public float	height
public final int	maxDepth
public final int	maxValues
public QuadTreeFloat	ne
public QuadTreeFloat	nw
private static final Pool<QuadTreeFloat>	pool
public QuadTreeFloat	se
public QuadTreeFloat	sw
public static final int	VALUE
public float[]	values For each entry, stores the value, x, and y.
public float	width
public static final int	X
public float	x
public static final int	Y
public float	y

Constructor Summary

Access	Constructor and Description
public	QuadTreeFloat() Creates a quad tree with 16 for maxValues and 8 for maxDepth.
public	QuadTreeFloat(int The maximum number of values stored in each quad tree node. When exceeded, the node is split into 4 child nodes. If the maxDepth has been reached, more than maxValues may be stored. maxValues, int The maximum depth of the tree nodes. Nodes at the maxDepth will not be split and may store more than maxValues number of entries. maxDepth)

Method Summary

Modifier and Type	Method and Description
public void	add(float value, float valueX, float valueY)
private void	addToChild(float value, float valueX, float valueY)
private void	findNearestInternal(float x, float y, FloatArray result)
protected int	growValues() Returns a new length for `values` when it is not enough to hold all the entries after `maxDepth` has been reached.
public boolean	nearest(float x, float y, FloatArray For the entry nearest to the specified point, the value, x, y, and square of the distance to the value are added to this array after it is cleared. See `VALUE`, `X`, `Y`, and `DISTSQR`. result) Returns: false if no entry was found because the quad tree was empty or the specified point is farther than the larger of the quad tree's width or height from an entry.
private QuadTreeFloat	obtainChild(float x, float y, float width, float height, int depth)
public void	query(float centerX, float centerY, float radius, FloatArray For each entry found within the radius, if any, the value, x, y, and square of the distance to the entry are added to this array. See `VALUE`, `X`, `Y`, and `DISTSQR`. results)
private void	query(float centerX, float centerY, float radiusSqr, float rectX, float rectY, float rectSize, FloatArray results)
public void	query(Rectangle rect, FloatArray For each entry found within the rectangle, if any, the value, x, and y of the entry are added to this array. See `VALUE`, `X`, and `Y`. results)
public void	reset() Implements com.badlogic.gdx.utils.Pool.Poolable.reset. Resets the object for reuse.
public void	setBounds(float x, float y, float width, float height)
private void	split(float value, float valueX, float valueY)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

count	back to summary
public int count The number of elements stored in `values` (3 values per quad tree entry).

depth	back to summary
public int depth

DISTSQR	back to summary
public static final int DISTSQR

height	back to summary
public float height

maxDepth	back to summary
public final int maxDepth

maxValues	back to summary
public final int maxValues

ne	back to summary
public QuadTreeFloat ne Annotations @Null

nw	back to summary
public QuadTreeFloat nw Annotations @Null

pool	back to summary
private static final Pool<QuadTreeFloat> pool

se	back to summary
public QuadTreeFloat se Annotations @Null

sw	back to summary
public QuadTreeFloat sw Annotations @Null

VALUE	back to summary
public static final int VALUE

values	back to summary
public float[] values For each entry, stores the value, x, and y.

width	back to summary
public float width

X	back to summary
public static final int X

x	back to summary
public float x

Y	back to summary
public static final int Y

y	back to summary
public float y

Constructor Detail

QuadTreeFloat	back to summary
public QuadTreeFloat() Creates a quad tree with 16 for maxValues and 8 for maxDepth.

QuadTreeFloat	back to summary
public QuadTreeFloat(int maxValues, int maxDepth) Parameters maxValues:int The maximum number of values stored in each quad tree node. When exceeded, the node is split into 4 child nodes. If the maxDepth has been reached, more than maxValues may be stored. maxDepth:int The maximum depth of the tree nodes. Nodes at the maxDepth will not be split and may store more than maxValues number of entries.

QuadTreeFloat

back to summary

public QuadTreeFloat(int maxValues, int maxDepth)

Parameters

maxValues:int: The maximum number of values stored in each quad tree node. When exceeded, the node is split into 4 child nodes. If the maxDepth has been reached, more than maxValues may be stored.
maxDepth:int: The maximum depth of the tree nodes. Nodes at the maxDepth will not be split and may store more than maxValues number of entries.

Method Detail

add	back to summary
public void add(float value, float valueX, float valueY)

addToChild	back to summary
private void addToChild(float value, float valueX, float valueY)

findNearestInternal	back to summary
private void findNearestInternal(float x, float y, FloatArray result)

growValues	back to summary
protected int growValues() Returns a new length for `values` when it is not enough to hold all the entries after `maxDepth` has been reached.

nearest back to summary

nearest	back to summary
public boolean nearest(float x, float y, FloatArray result) Parameters result:FloatArray For the entry nearest to the specified point, the value, x, y, and square of the distance to the value are added to this array after it is cleared. See `VALUE`, `X`, `Y`, and `DISTSQR`. Returns:boolean false if no entry was found because the quad tree was empty or the specified point is farther than the larger of the quad tree's width or height from an entry. If false is returned the result array is empty.

public boolean nearest(float x, float y, FloatArray result)

Parameters

result:FloatArray: For the entry nearest to the specified point, the value, x, y, and square of the distance to the value are added to this array after it is cleared. See VALUE, X, Y, and DISTSQR.

Returns:boolean

false if no entry was found because the quad tree was empty or the specified point is farther than the larger of the quad tree's width or height from an entry. If false is returned the result array is empty.

obtainChild	back to summary
private QuadTreeFloat obtainChild(float x, float y, float width, float height, int depth)

query	back to summary
public void query(float centerX, float centerY, float radius, FloatArray results) Parameters results:FloatArray For each entry found within the radius, if any, the value, x, y, and square of the distance to the entry are added to this array. See `VALUE`, `X`, `Y`, and `DISTSQR`.

query	back to summary
private void query(float centerX, float centerY, float radiusSqr, float rectX, float rectY, float rectSize, FloatArray results)

query	back to summary
public void query(Rectangle rect, FloatArray results) Parameters results:FloatArray For each entry found within the rectangle, if any, the value, x, and y of the entry are added to this array. See `VALUE`, `X`, and `Y`.

reset	back to summary
public void reset() Implements com.badlogic.gdx.utils.Pool.Poolable.reset. Doc from com.badlogic.gdx.utils.Pool.Poolable.reset. Resets the object for reuse. Object references should be nulled and fields may be set to default values.

reset

back to summary

public void reset()

Implements com.badlogic.gdx.utils.Pool.Poolable.reset.

Doc from com.badlogic.gdx.utils.Pool.Poolable.reset.

Resets the object for reuse. Object references should be nulled and fields may be set to default values.

setBounds	back to summary
public void setBounds(float x, float y, float width, float height)