#include <linear_hashed_octree.h>
|
| LinearHashedOctree () |
|
template<class R , class C > |
void | build_st (R &should_refine, C &construct_node) |
|
template<class R , class C > |
void | build (R &should_refine, C &construct_node) |
|
template<class V > |
void | visit_leaves (V &visitor) const |
|
std::optional< N > | get (MIndex key) const |
|
◆ NodeMap
◆ LinearHashedOctree()
◆ build()
template<typename N >
template<class R , class C >
◆ build_st()
template<typename N >
template<class R , class C >
◆ get()
◆ visit_leaves()
template<typename N >
template<class V >
◆ leaves
◆ nodes
The documentation for this struct was generated from the following file: