Create a proxy with an initial AABB. Pairs are not reported until UpdatePairs is called.
Proxy Fat AABB.
User defined data.
Proxy created from aabb and userData.
Destroy a proxy. It is up to the client to remove any pairs.
Proxy to destroy.
Get the Fat AABB for a proxy.
Proxy to retrieve the Fat AABB.
Get the number of proxies.
Number of proxies.
Get user data from a proxy. Returns null if the proxy is invalid.
Proxy to retrieve user data from.
Gets the user data from proxy, or null if the proxy is invalid.
Call MoveProxy as many times as you like, then when you are done call UpdatePairs to finalized the proxy pairs (for your time step).
Proxy to move.
Swept AABB.
Extra AABB displacement.
Query an AABB for overlapping proxies. The callback is called for each proxy that overlaps the supplied AABB. The callback should match function signature fuction callback(proxy:b2DynamicTreeNode):Boolean and should return false to trigger premature termination.
Called for each proxy that overlaps the supplied AABB. param proxy Proxy overlapping the supplied AABB.
Proxies are query for overlap on this AABB.
Ray-cast against the proxies in the tree. This relies on the callback to perform a exact ray-cast in the case were the proxy contains a shape. The callback also performs the any collision filtering. This has performance roughly equal to k log(n), where k is the number of collisions and n is the number of proxies in the tree.
Called for each proxy that is hit by the ray. param input Ray cast input data. param proxy The proxy hit by the ray cast. param return Return value is the new value for maxFraction.
Ray cast input data. Query all proxies along this ray cast.
Perform some iterations to re-balance the tree.
Number of rebalance iterations to perform.
Generated using TypeDoc
Interface for objects tracking overlap of many AABBs.