Leaf nodes have no children, so their child iterators have no get/set accessors.  
 More...
|  | 
|  | ChildIter () | 
|  | 
|  | ChildIter (const MaskIterT &iter, NodeT *parent) | 
|  | 
| ValueType & | getItem (Index) const | 
|  | Return the item at the given index in the parent node's table. 
 | 
|  | 
| void | setItem (Index, const ValueType &) const | 
|  | Set the value of the item at the given index in the parent node's table. 
 | 
|  | 
| ValueType & | operator* () const | 
|  | Return a reference to the item to which this iterator is pointing. 
 | 
|  | 
| ValueType * | operator-> () const | 
|  | Return a pointer to the item to which this iterator is pointing. 
 | 
|  | 
| ValueType & | getValue () const | 
|  | Return the item to which this iterator is pointing. 
 | 
|  | 
| void | setValue (const ValueType &value) const | 
|  | Set the value of the item to which this iterator is pointing. (Not valid for const iterators.) 
 | 
|  | 
| void | modifyValue (const ModifyOp &op) const | 
|  | Apply a functor to the item to which this iterator is pointing. (Not valid for const iterators.) 
 | 
|  | 
| bool | operator== (const IteratorBase &other) const | 
|  | 
| bool | operator!= (const IteratorBase &other) const | 
|  | 
| NodeT * | getParentNode () const | 
|  | Return a pointer to the node (if any) over which this iterator is iterating. 
 | 
|  | 
| NodeT & | parent () const | 
|  | Return a reference to the node over which this iterator is iterating. 
 | 
|  | 
| Index | offset () const | 
|  | Return this iterator's position as an index into the parent node's table. 
 | 
|  | 
| Index | pos () const | 
|  | Identical to offset. 
 | 
|  | 
| bool | test () const | 
|  | Return trueif this iterator is not yet exhausted.
 | 
|  | 
|  | operator bool () const | 
|  | Return trueif this iterator is not yet exhausted.
 | 
|  | 
| bool | next () | 
|  | Advance to the next item in the parent node's table. 
 | 
|  | 
| void | increment () | 
|  | Advance to the next item in the parent node's table. 
 | 
|  | 
| void | increment (Index n) | 
|  | Advance n items in the parent node's table. 
 | 
|  | 
| IteratorBase & | operator++ () | 
|  | Advance to the next item in the parent node's table. 
 | 
|  | 
| bool | isValueOn () const | 
|  | Return trueif this iterator is pointing to an active value. Returnfalseif it is pointing to either an inactive value or a child node.
 | 
|  | 
| void | setValueOn (bool on=true) const | 
|  | If this iterator is pointing to a value, set the value's active state. Otherwise, do nothing. 
 | 
|  | 
| void | setValueOff () const | 
|  | If this iterator is pointing to a value, mark the value as inactive. 
 | 
|  | 
| Coord | getCoord () const | 
|  | Return the coordinates of the item to which this iterator is pointing. 
 | 
|  | 
| void | getCoord (Coord &xyz) const | 
|  | Return in xyz the coordinates of the item to which this iterator is pointing. 
 | 
|  | 
template<typename T, 
Index Log2Dim>
template<typename MaskIterT, typename NodeT, typename TagT>
struct openvdb::v12_0::tree::LeafNode< T, Log2Dim >::ChildIter< MaskIterT, NodeT, TagT >
Leaf nodes have no children, so their child iterators have no get/set accessors. 
template<typename MaskIterT, typename NodeT> 
  
  | 
        
          | void setValueOff | ( |  | ) | const |  | inlineinherited | 
 
If this iterator is pointing to a value, mark the value as inactive. 
If this iterator is pointing to a child node, then the current item in the parent node's table is required to be inactive. In that case, this method has no effect.