Dynamic broad-phase tree used to find candidate pairs.
More...
#include <AABBTree.h>
Dynamic broad-phase tree used to find candidate pairs.
Definition at line 26 of file AABBTree.h.
◆ FxAABBTree()
| FxAABBTree::FxAABBTree |
( |
| ) |
|
|
default |
◆ empty()
| bool FxAABBTree::empty |
( |
| ) |
const |
|
inline |
◆ insert()
| int32_t FxAABBTree::insert |
( |
int32_t |
entity_id, |
|
|
const FxAABB & |
tight |
|
) |
| |
|
inline |
◆ node() [1/2]
◆ node() [2/2]
◆ query_pairs()
| void FxAABBTree::query_pairs |
( |
std::vector< std::pair< int32_t, int32_t > > & |
out | ) |
const |
|
inline |
◆ remove()
| void FxAABBTree::remove |
( |
int32_t |
node_idx | ) |
|
|
inline |
◆ update()
| bool FxAABBTree::update |
( |
int32_t |
node_idx, |
|
|
const FxAABB & |
new_tight |
|
) |
| |
|
inline |
The documentation for this class was generated from the following file: