This class wraps QuadTreeRectangleP with parallel tree construction.
More...
#include <QuadTreeRectangleP.h>
|
| QuadTreeRectangleP (float left, float top, float right, float bottom, size_t max_depth=12, size_t reserve_size=1000) |
|
| QuadTreeRectangleP (size_t max_depth=12, size_t reserve_size=1000) |
|
| QuadTreeRectangleP (const QuadTreeRectangleP &rhs) |
|
QuadTreeRectangleP & | operator= (const QuadTreeRectangleP &rhs) |
|
| ~QuadTreeRectangleP () |
|
bool | Insert (float left, float top, float right, float bottom, DimsType payload) |
|
bool | Insert (std::vector< class QuadTreeRectangle< float, pType >::rectangle_t > rectangles, std::vector< pType > payloads) |
|
bool | Insert (const Grid *grid, size_t ncells=0) |
|
void | GetPayloadContained (float x, float y, std::vector< DimsType > &payloads) const |
|
void | GetStats (std::vector< size_t > &payload_histo, std::vector< size_t > &level_histo) const |
|
This class wraps QuadTreeRectangleP with parallel tree construction.
Definition at line 23 of file QuadTreeRectangleP.h.
◆ QuadTreeRectangleP() [1/3]
VAPoR::QuadTreeRectangleP::QuadTreeRectangleP |
( |
float |
left, |
|
|
float |
top, |
|
|
float |
right, |
|
|
float |
bottom, |
|
|
size_t |
max_depth = 12 , |
|
|
size_t |
reserve_size = 1000 |
|
) |
| |
◆ QuadTreeRectangleP() [2/3]
VAPoR::QuadTreeRectangleP::QuadTreeRectangleP |
( |
size_t |
max_depth = 12 , |
|
|
size_t |
reserve_size = 1000 |
|
) |
| |
◆ QuadTreeRectangleP() [3/3]
◆ ~QuadTreeRectangleP()
VAPoR::QuadTreeRectangleP::~QuadTreeRectangleP |
( |
| ) |
|
◆ GetPayloadContained()
void VAPoR::QuadTreeRectangleP::GetPayloadContained |
( |
float |
x, |
|
|
float |
y, |
|
|
std::vector< DimsType > & |
payloads |
|
) |
| const |
◆ GetStats()
void VAPoR::QuadTreeRectangleP::GetStats |
( |
std::vector< size_t > & |
payload_histo, |
|
|
std::vector< size_t > & |
level_histo |
|
) |
| const |
◆ Insert() [1/3]
bool VAPoR::QuadTreeRectangleP::Insert |
( |
const Grid * |
grid, |
|
|
size_t |
ncells = 0 |
|
) |
| |
Constructs a quadtree from the cells contained in a Grid class
This method iterates over all of the cells found in grid
and constructs a Quadtree. The construction is performed in parallel. The topological dimesion of grid
must be two.
- Parameters
-
[in] | grid | The grid from which to construct the tree |
[in] | ncells | If non-zero specifies the number of cells to insert via iterating over the cells contained in the grid. If zero, all of the cells are inserted. |
◆ Insert() [2/3]
bool VAPoR::QuadTreeRectangleP::Insert |
( |
float |
left, |
|
|
float |
top, |
|
|
float |
right, |
|
|
float |
bottom, |
|
|
DimsType |
payload |
|
) |
| |
◆ Insert() [3/3]
bool VAPoR::QuadTreeRectangleP::Insert |
( |
std::vector< class QuadTreeRectangle< float, pType >::rectangle_t > |
rectangles, |
|
|
std::vector< pType > |
payloads |
|
) |
| |
Parallel tree creation
Inserts multiple rectangles into the quad tree in parallel
- See also
- QuadTreeRectangle::Insert()
◆ operator=()
◆ operator<<
The documentation for this class was generated from the following file: