Implementation of a depth-first node visitor. More...

#include <openvdb/version.h>
#include <openvdb/Types.h>

Include dependency graph for NodeVisitor.h:

This graph shows which files directly or indirectly include this file:

Classes
struct	openvdb::OPENVDB_VERSION_NAME::tools::DepthFirstNodeVisitor< NodeT, LEVEL >
	Visit all nodes that are downstream of a specific node in depth-first order and apply a user-supplied functor to each node. More...

struct	openvdb::OPENVDB_VERSION_NAME::tools::DepthFirstNodeVisitor< NodeT, LEVEL >
	Visit all nodes that are downstream of a specific node in depth-first order and apply a user-supplied functor to each node. More...

struct	openvdb::OPENVDB_VERSION_NAME::tools::DepthFirstNodeVisitor< NodeT, 0 >

Namespaces
	openvdb

	openvdb::OPENVDB_VERSION_NAME

	openvdb::OPENVDB_VERSION_NAME::tools

Functions
template<typename TreeT , typename OpT >
size_t	openvdb::OPENVDB_VERSION_NAME::tools::visitNodesDepthFirst (TreeT &tree, OpT &op, size_t idx=0)
	Visit all nodes in the tree depth-first and apply a user-supplied functor to each node. More...

Detailed Description

Implementation of a depth-first node visitor.

Note: This algorithm is single-threaded by design and intended for rare use cases where this is desirable. It is highly recommended to use the NodeManager or DynamicNodeManager for much greater threaded performance.

Definition in file NodeVisitor.h.

Classes