#include <openvdb/tree/LeafManager.h>
|
| Iterator (const LeafRange &range, size_t pos) |
|
| Iterator (const Iterator &)=default |
|
Iterator & | operator= (const Iterator &)=default |
|
Iterator & | operator++ () |
| Advance to the next leaf node.
|
|
LeafType & | operator* () const |
| Return a reference to the leaf node to which this iterator is pointing.
|
|
LeafType * | operator-> () const |
| Return a pointer to the leaf node to which this iterator is pointing.
|
|
BufferType & | buffer (size_t bufferIdx) |
| Return the nth buffer for the leaf node to which this iterator is pointing, where n = bufferIdx and n = 0 corresponds to the leaf node's own buffer.
|
|
size_t | pos () const |
| Return the index into the leaf array of the current leaf node.
|
|
bool | isValid () const |
| Return true if the position of this iterator is in a valid range.
|
|
bool | test () const |
| Return true if this iterator is not yet exhausted.
|
|
| operator bool () const |
| Return true if this iterator is not yet exhausted.
|
|
bool | empty () const |
| Return true if this iterator is exhausted.
|
|
bool | operator!= (const Iterator &other) const |
|
bool | operator== (const Iterator &other) const |
|
const LeafRange & | leafRange () const |
|
◆ Iterator() [1/2]
template<typename TreeT >
◆ Iterator() [2/2]
template<typename TreeT >
◆ buffer()
template<typename TreeT >
Return the nth buffer for the leaf node to which this iterator is pointing, where n = bufferIdx and n = 0 corresponds to the leaf node's own buffer.
◆ empty()
template<typename TreeT >
Return true
if this iterator is exhausted.
◆ isValid()
template<typename TreeT >
Return true
if the position of this iterator is in a valid range.
◆ leafRange()
template<typename TreeT >
◆ operator bool()
template<typename TreeT >
Return true
if this iterator is not yet exhausted.
◆ operator!=()
template<typename TreeT >
bool operator!= |
( |
const Iterator & |
other | ) |
const |
|
inline |
◆ operator*()
template<typename TreeT >
Return a reference to the leaf node to which this iterator is pointing.
◆ operator++()
template<typename TreeT >
Advance to the next leaf node.
◆ operator->()
template<typename TreeT >
Return a pointer to the leaf node to which this iterator is pointing.
◆ operator=()
template<typename TreeT >
◆ operator==()
template<typename TreeT >
bool operator== |
( |
const Iterator & |
other | ) |
const |
|
inline |
◆ pos()
template<typename TreeT >
Return the index into the leaf array of the current leaf node.
◆ test()
template<typename TreeT >
Return true
if this iterator is not yet exhausted.