#include <TreeIterator.h>
template<typename IterT>
class openvdb::v6_0::tree::IteratorRange< IterT >
An IteratorRange wraps a tree or node iterator, giving the iterator TBB splittable range semantics.
◆ IteratorRange() [1/2]
◆ IteratorRange() [2/2]
◆ empty()
◆ increment()
void increment |
( |
Index |
n = 1 | ) |
|
|
inline |
Advance the iterator n times.
◆ is_divisible()
bool is_divisible |
( |
| ) |
const |
|
inline |
Return true
if this range is splittable (i.e., if the iterator can be advanced more than mGrainSize times).
◆ iterator()
const IterT& iterator |
( |
| ) |
const |
|
inline |
Return a reference to this range's iterator.
- Note
- The reference is const, because the iterator should not be incremented directly. Use this range object's increment() instead.
◆ next()
Advance the iterator to the next item.
- Returns
true
if the iterator is not yet exhausted.
◆ operator bool()
◆ operator++()
Advance the iterator to the next item.
◆ test()
The documentation for this class was generated from the following file: