Go to the source code of this file.
|
typedef uint16_t | octomap::key_type |
|
typedef unordered_ns::unordered_map< OcTreeKey, bool, OcTreeKey::KeyHash > | octomap::KeyBoolMap |
| Data structrure to efficiently track changed nodes as a combination of OcTreeKeys and a bool flag (to denote newly created nodes) More...
|
|
typedef unordered_ns::unordered_set< OcTreeKey, OcTreeKey::KeyHash > | octomap::KeySet |
| Data structure to efficiently compute the nodes to update from a scan insertion using a hash set. More...
|
|
|
uint8_t | octomap::computeChildIdx (const OcTreeKey &key, int depth) |
| generate child index (between 0 and 7) from key at given tree depth More...
|
|
void | octomap::computeChildKey (unsigned int pos, key_type center_offset_key, const OcTreeKey &parent_key, OcTreeKey &child_key) |
| Computes the key of a child node while traversing the octree, given child index and current key. More...
|
|
OcTreeKey | octomap::computeIndexKey (key_type level, const OcTreeKey &key) |
| Generates a unique key for all keys on a certain level of the tree. More...
|
|