#include <openvdb/tree/NodeManager.h>
◆ Iterator() [1/2]
template<typename NodeT >
◆ Iterator() [2/2]
template<typename NodeT >
◆ empty()
template<typename NodeT >
Return true
if this iterator is exhausted.
◆ isValid()
template<typename NodeT >
◆ nodeRange()
template<typename NodeT >
◆ operator bool()
template<typename NodeT >
Return true
if this iterator is not yet exhausted.
◆ operator!=()
template<typename NodeT >
bool operator!= |
( |
const Iterator & |
other | ) |
const |
|
inline |
◆ operator*()
template<typename NodeT >
NodeT & operator* |
( |
| ) |
const |
|
inline |
Return a reference to the node to which this iterator is pointing.
◆ operator++()
template<typename NodeT >
Advance to the next node.
◆ operator->()
template<typename NodeT >
NodeT * operator-> |
( |
| ) |
const |
|
inline |
Return a pointer to the node to which this iterator is pointing.
◆ operator=()
template<typename NodeT >
◆ operator==()
template<typename NodeT >
bool operator== |
( |
const Iterator & |
other | ) |
const |
|
inline |
◆ pos()
template<typename NodeT >
Return the index into the list of the current node.
◆ test()
template<typename NodeT >
Return true
if this iterator is not yet exhausted.