|
class | InternalNode |
|
class | IteratorBase |
| Base class for iterators over internal and leaf nodes. More...
|
|
struct | SparseIteratorBase |
| Base class for sparse iterators over internal and leaf nodes. More...
|
|
struct | DenseIteratorBase |
| Base class for dense iterators over internal and leaf nodes. More...
|
|
struct | LeafManagerImpl |
|
class | LeafManager |
| This class manages a linear array of pointers to a given tree's leaf nodes, as well as optional auxiliary buffers (one or more per leaf) that can be swapped with the leaf nodes' voxel data buffers. More...
|
|
struct | LeafManagerImpl< LeafManager< const TreeT > > |
|
class | LeafNode |
| Templated block class to hold specific data types and a fixed number of values determined by Log2Dim. The actual coordinate dimension of the block is 2^Log2Dim, i.e. Log2Dim=3 corresponds to a LeafNode that spans a 8^3 block. More...
|
|
class | LeafNode< bool, Log2Dim > |
| LeafNode specialization for values of type bool that stores both the active states and the values of (2^Log2Dim)^3 voxels as bit masks. More...
|
|
class | NodeUnionImpl |
|
class | NodeUnionImpl< false, ValueT, ChildT > |
|
class | NodeUnionImpl< true, ValueT, ChildT > |
|
struct | NodeUnion |
|
struct | NodeChain |
| NodeChain<RootNodeType, RootNodeType::LEVEL>::Type is a boost::mpl::vector that lists the types of the nodes of the tree rooted at RootNodeType in reverse order, from LeafNode to RootNode. More...
|
|
class | RootNode |
|
struct | NodeChain< HeadT, 1 > |
| Specialization to terminate NodeChain. More...
|
|
class | TreeBase |
| Base class for typed trees. More...
|
|
class | Tree |
|
struct | Tree3 |
| Tree3<T, N1, N2>::Type is the type of a three-level tree (Root, Internal, Leaf) with value type T and internal and leaf node log dimensions N1 and N2, respectively. More...
|
|
struct | Tree4 |
| Tree4<T, N1, N2, N3>::Type is the type of a four-level tree (Root, Internal, Internal, Leaf) with value type T and internal and leaf node log dimensions N1, N2 and N3, respectively. More...
|
|
struct | Tree5 |
| Tree5<T, N1, N2, N3, N4>::Type is the type of a five-level tree (Root, Internal, Internal, Internal, Leaf) with value type T and internal and leaf node log dimensions N1, N2, N3 and N4, respectively. More...
|
|
struct | TreeIterTraits |
| TreeIterTraits provides, for all tree iterators, a begin(tree) function that returns an iterator over a tree of arbitrary type. More...
|
|
struct | TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::NodeIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::NodeCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::LeafIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::LeafCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::ValueOnIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::ValueOnCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::ValueOffIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::ValueOffCIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::ValueAllIter > |
|
struct | TreeIterTraits< TreeT, typename TreeT::ValueAllCIter > |
|
struct | CombineOpAdapter |
| Helper class to adapt a three-argument (a, b, result) CombineOp functor into a single-argument functor that accepts a CombineArgs struct. More...
|
|
struct | CopyConstness |
|
struct | CopyConstness< const FromType, ToType > |
|
struct | IterTraits |
|
struct | IterTraits< NodeT, typename NodeT::ChildOnIter > |
|
struct | IterTraits< NodeT, typename NodeT::ChildOnCIter > |
|
struct | IterTraits< NodeT, typename NodeT::ChildOffIter > |
|
struct | IterTraits< NodeT, typename NodeT::ChildOffCIter > |
|
struct | IterTraits< NodeT, typename NodeT::ChildAllIter > |
|
struct | IterTraits< NodeT, typename NodeT::ChildAllCIter > |
|
struct | IterTraits< NodeT, typename NodeT::ValueOnIter > |
|
struct | IterTraits< NodeT, typename NodeT::ValueOnCIter > |
|
struct | IterTraits< NodeT, typename NodeT::ValueOffIter > |
|
struct | IterTraits< NodeT, typename NodeT::ValueOffCIter > |
|
struct | IterTraits< NodeT, typename NodeT::ValueAllIter > |
|
struct | IterTraits< NodeT, typename NodeT::ValueAllCIter > |
|
class | IterListItem |
| An IterListItem is an element of a compile-time linked list of iterators to nodes of different types. More...
|
|
class | IterListItem< PrevItemT, NodeVecT, VecSize, 0U > |
| The initial element of a compile-time linked list of iterators to nodes of different types. More...
|
|
class | IterListItem< PrevItemT, NodeVecT, 1, _Level > |
| The final element of a compile-time linked list of iterators to nodes of different types. More...
|
|
class | TreeValueIteratorBase |
| Base class for tree-traversal iterators over tile and voxel values. More...
|
|
class | NodeIteratorBase |
| Base class for tree-traversal iterators over all nodes. More...
|
|
class | LeafIteratorBase |
| Base class for tree-traversal iterators over all leaf nodes (but not leaf voxels) More...
|
|
class | IteratorRange |
|
struct | TolerancePrune |
| Helper class for use with Tree::pruneOp() to replace constant branches (to within the provided tolerance) with more memory-efficient tiles. More...
|
|
struct | InactivePrune |
| Helper class for use with Tree::pruneOp() to replace inactive branches with more memory-efficient inactive tiles with the provided value. More...
|
|
struct | LevelSetPrune |
| Helper class for use with Tree::pruneOp() to prune any branches whose values are all inactive and replace each with an inactive tile whose value is equal in magnitude to the background value and whose sign is equal to that of the first value encountered in the (inactive) child. More...
|
|
class | ValueAccessor0 |
| ValueAccessor with no mutex and no node caching. More...
|
|
class | ValueAccessor1 |
| Value accessor with one level of node caching. More...
|
|
class | ValueAccessor2 |
| Value accessor with two levels of node caching. More...
|
|
class | ValueAccessor3 |
| Value accessor with three levels of node caching. More...
|
|
class | CacheItem |
|
class | ValueAccessorBase |
| This base class for ValueAccessors manages registration of an accessor with a tree so that the tree can automatically clear the accessor whenever one of its nodes is deleted. More...
|
|
class | ValueAccessor |
|
struct | ValueAccessor< TreeType, 0, tbb::null_mutex > |
| Template specialization of the ValueAccessor with no mutex and no cache levels. More...
|
|
struct | ValueAccessor< TreeType, 1, tbb::null_mutex > |
| Template specialization of the ValueAccessor with no mutex and one cache level. More...
|
|
struct | ValueAccessor< TreeType, 2, tbb::null_mutex > |
| Template specialization of the ValueAccessor with no mutex and two cache levels. More...
|
|
struct | ValueAccessor< TreeType, 3, tbb::null_mutex > |
| Template specialization of the ValueAccessor with no mutex and three cache levels. More...
|
|
struct | ValueAccessorRW |
| This accessor is thread-safe (at the cost of speed) for both reading and writing to a tree. That is, multiple threads may safely access a single, shared ValueAccessorRW. More...
|
|
class | CacheItem< TreeCacheT, NodeVecT, true > |
| The tail of a compile-time list of cached node pointers, ordered from LeafNode to RootNode. More...
|
|