octomap 1.5.0
|
OcTreeKey is a container class for internal key addressing. More...
Data Structures | |
struct | KeyHash |
Provides a hash function on Keys. More... | |
Public Member Functions | |
OcTreeKey () | |
OcTreeKey (unsigned short int a, unsigned short int b, unsigned short int c) | |
OcTreeKey (const OcTreeKey &other) | |
bool | operator!= (const OcTreeKey &other) const |
OcTreeKey & | operator= (const OcTreeKey &other) |
bool | operator== (const OcTreeKey &other) const |
unsigned short int & | operator[] (unsigned int i) |
const unsigned short int & | operator[] (unsigned int i) const |
Data Fields | |
unsigned short int | k [3] |
OcTreeKey is a container class for internal key addressing.
The keys count the number of cells (voxels) from the origin as discrete address of a voxel.
octomap::OcTreeKey::OcTreeKey | ( | ) | [inline] |
octomap::OcTreeKey::OcTreeKey | ( | unsigned short int | a, |
unsigned short int | b, | ||
unsigned short int | c | ||
) | [inline] |
References k.
unsigned short int& octomap::OcTreeKey::operator[] | ( | unsigned int | i | ) | [inline] |
References k.
const unsigned short int& octomap::OcTreeKey::operator[] | ( | unsigned int | i | ) | const [inline] |
References k.
unsigned short int octomap::OcTreeKey::k[3] |