#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 trueif the position of this iterator is in a valid range.
 | 
|  | 
| bool | test () const | 
|  | Return trueif this iterator is not yet exhausted.
 | 
|  | 
|  | operator bool () const | 
|  | Return trueif this iterator is not yet exhausted.
 | 
|  | 
| bool | empty () const | 
|  | Return trueif this iterator is exhausted.
 | 
|  | 
| bool | operator!= (const Iterator &other) const | 
|  | 
| bool | operator== (const Iterator &other) const | 
|  | 
| const LeafRange & | leafRange () const | 
|  | 
◆ Iterator() [1/2]
◆ Iterator() [2/2]
◆ buffer()
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()
Return true if this iterator is exhausted. 
 
 
◆ isValid()
Return true if the position of this iterator is in a valid range. 
 
 
◆ leafRange()
◆ operator bool()
Return true if this iterator is not yet exhausted. 
 
 
◆ operator!=()
template<typename TreeT> 
  
  | 
        
          | bool operator!= | ( | const Iterator & | other | ) | const |  | inline | 
 
 
◆ operator*()
Return a reference to the leaf node to which this iterator is pointing. 
 
 
◆ operator++()
Advance to the next leaf node. 
 
 
◆ operator->()
Return a pointer to the leaf node to which this iterator is pointing. 
 
 
◆ operator=()
◆ operator==()
template<typename TreeT> 
  
  | 
        
          | bool operator== | ( | const Iterator & | other | ) | const |  | inline | 
 
 
◆ pos()
Return the index into the leaf array of the current leaf node. 
 
 
◆ test()
Return true if this iterator is not yet exhausted.