Nori
|
Compact storage for primitive classifcation. More...
#include <gkdtree.h>
Public Member Functions | |
ClassificationStorage () | |
~ClassificationStorage () | |
void | setPrimitiveCount (size_t size) |
void | set (uint32_t index, int value) |
int | get (uint32_t index) const |
size_t | size () const |
Compact storage for primitive classifcation.
When classifying primitives with respect to a split plane, a data structure is needed to hold the tertiary result of this operation. This class implements a compact storage (2 bits per entry) in the spirit of the std::vector<bool> specialization.
ClassificationStorage::~ClassificationStorage | ( | ) | [inline] |
int ClassificationStorage::get | ( | uint32_t | index | ) | const [inline] |
void ClassificationStorage::set | ( | uint32_t | index, |
int | value | ||
) | [inline] |
void ClassificationStorage::setPrimitiveCount | ( | size_t | size | ) | [inline] |