#include <quadtree.hpp>
|
| QuadTree (double *inp_data, int N) |
|
| QuadTree (double *inp_data, double inp_x, double inp_y, double inp_hw, double inp_hh) |
|
| QuadTree (double *inp_data, int N, double inp_x, double inp_y, double inp_hw, double inp_hh) |
|
| QuadTree (QuadTree *inp_parent, double *inp_data, int N, double inp_x, double inp_y, double inp_hw, double inp_hh) |
|
| QuadTree (QuadTree *inp_parent, double *inp_data, double inp_x, double inp_y, double inp_hw, double inp_hh) |
|
| ~QuadTree () |
|
void | setData (double *inp_data) |
|
QuadTree * | getParent () |
|
bool | insert (int new_index) |
|
void | subdivide () |
|
bool | isCorrect () |
|
void | rebuildTree () |
|
void | getAllIndices (int *indices) |
|
int | getDepth () |
|
void | computeNonEdgeForces (int point_index, double theta, double neg_f[], double *sum_Q) |
|
void | computeEdgeForces (int *row_P, int *col_P, double *val_P, int N, double *pos_f) |
|
void | print () |
|
Definition at line 65 of file quadtree.hpp.
◆ QuadTree() [1/6]
◆ QuadTree() [2/6]
QuadTree |
( |
double * |
inp_data, |
|
|
double |
inp_x, |
|
|
double |
inp_y, |
|
|
double |
inp_hw, |
|
|
double |
inp_hh |
|
) |
| |
◆ QuadTree() [3/6]
QuadTree |
( |
double * |
inp_data, |
|
|
int |
N, |
|
|
double |
inp_x, |
|
|
double |
inp_y, |
|
|
double |
inp_hw, |
|
|
double |
inp_hh |
|
) |
| |
◆ QuadTree() [4/6]
QuadTree |
( |
QuadTree * |
inp_parent, |
|
|
double * |
inp_data, |
|
|
int |
N, |
|
|
double |
inp_x, |
|
|
double |
inp_y, |
|
|
double |
inp_hw, |
|
|
double |
inp_hh |
|
) |
| |
◆ QuadTree() [5/6]
QuadTree |
( |
QuadTree * |
inp_parent, |
|
|
double * |
inp_data, |
|
|
double |
inp_x, |
|
|
double |
inp_y, |
|
|
double |
inp_hw, |
|
|
double |
inp_hh |
|
) |
| |
◆ ~QuadTree()
◆ QuadTree() [6/6]
◆ computeEdgeForces()
void computeEdgeForces |
( |
int * |
row_P, |
|
|
int * |
col_P, |
|
|
double * |
val_P, |
|
|
int |
N, |
|
|
double * |
pos_f |
|
) |
| |
◆ computeNonEdgeForces()
void computeNonEdgeForces |
( |
int |
point_index, |
|
|
double |
theta, |
|
|
double |
neg_f[], |
|
|
double * |
sum_Q |
|
) |
| |
◆ fill()
◆ getAllIndices() [1/2]
void getAllIndices |
( |
int * |
indices | ) |
|
◆ getAllIndices() [2/2]
int getAllIndices |
( |
int * |
indices, |
|
|
int |
loc |
|
) |
| |
|
private |
◆ getDepth()
◆ getParent()
◆ init()
void init |
( |
QuadTree * |
inp_parent, |
|
|
double * |
inp_data, |
|
|
double |
inp_x, |
|
|
double |
inp_y, |
|
|
double |
inp_hw, |
|
|
double |
inp_hh |
|
) |
| |
|
private |
◆ insert()
bool insert |
( |
int |
new_index | ) |
|
◆ isCorrect()
◆ operator=()
◆ print()
◆ rebuildTree()
◆ setData()
void setData |
( |
double * |
inp_data | ) |
|
◆ subdivide()
◆ boundary
◆ buff
◆ center_of_mass
◆ cum_size
◆ data
◆ index
◆ is_leaf
◆ northEast
◆ northWest
◆ parent
◆ QT_NO_DIMS
◆ QT_NODE_CAPACITY
const int QT_NODE_CAPACITY = 1 |
|
staticprivate |
◆ size
◆ southEast
◆ southWest
The documentation for this class was generated from the following file: