33 #ifndef OPENVDB_TREE_TREEITERATOR_HAS_BEEN_INCLUDED
34 #define OPENVDB_TREE_TREEITERATOR_HAS_BEEN_INCLUDED
36 #include <boost/mpl/front.hpp>
37 #include <boost/mpl/pop_front.hpp>
38 #include <boost/mpl/push_back.hpp>
39 #include <boost/mpl/size.hpp>
40 #include <boost/mpl/vector.hpp>
41 #include <boost/static_assert.hpp>
42 #include <boost/type_traits/remove_const.hpp>
43 #include <tbb/blocked_range.h>
44 #include <tbb/parallel_for.h>
45 #include <openvdb/version.h>
46 #include <openvdb/Types.h>
51 #define ENABLE_TREE_VALUE_DEPTH_BOUND_OPTIMIZATION
66 typedef typename boost::remove_const<ToType>::type
Type;
68 template<
typename FromType,
typename ToType>
struct CopyConstness<const FromType, ToType> {
78 template<
typename HeadT,
int HeadLevel>
81 typedef typename boost::mpl::push_back<SubtreeT, HeadT>::type
Type;
83 template<
typename HeadT>
85 typedef typename boost::mpl::vector<typename HeadT::ChildNodeType, HeadT>::type
Type;
105 template<
typename NodeT,
typename IterT>
108 template<
typename ChildT>
static ChildT*
getChild(
const IterT&) {
return NULL; }
111 template<
typename NodeT>
114 typedef typename NodeT::ChildOnIter
IterT;
115 static IterT begin(NodeT& node) {
return node.beginChildOn(); }
117 return &iter.getValue();
119 template<
typename OtherNodeT>
struct NodeConverter {
120 typedef typename OtherNodeT::ChildOnIter
Type;
124 template<
typename NodeT>
127 typedef typename NodeT::ChildOnCIter
IterT;
128 static IterT begin(
const NodeT& node) {
return node.cbeginChildOn(); }
129 template<
typename ChildT>
static const ChildT*
getChild(
const IterT& iter) {
130 return &iter.getValue();
132 template<
typename OtherNodeT>
struct NodeConverter {
133 typedef typename OtherNodeT::ChildOnCIter
Type;
137 template<
typename NodeT>
140 typedef typename NodeT::ChildOffIter
IterT;
141 static IterT begin(NodeT& node) {
return node.beginChildOff(); }
142 template<
typename OtherNodeT>
struct NodeConverter {
143 typedef typename OtherNodeT::ChildOffIter
Type;
147 template<
typename NodeT>
150 typedef typename NodeT::ChildOffCIter
IterT;
151 static IterT begin(
const NodeT& node) {
return node.cbeginChildOff(); }
152 template<
typename OtherNodeT>
struct NodeConverter {
153 typedef typename OtherNodeT::ChildOffCIter
Type;
157 template<
typename NodeT>
160 typedef typename NodeT::ChildAllIter
IterT;
161 static IterT begin(NodeT& node) {
return node.beginChildAll(); }
163 typename IterT::NonConstValueType val;
164 return iter.probeChild(val);
166 template<
typename OtherNodeT>
struct NodeConverter {
167 typedef typename OtherNodeT::ChildAllIter
Type;
171 template<
typename NodeT>
174 typedef typename NodeT::ChildAllCIter
IterT;
175 static IterT begin(
const NodeT& node) {
return node.cbeginChildAll(); }
177 typename IterT::NonConstValueType val;
178 return iter.probeChild(val);
180 template<
typename OtherNodeT>
struct NodeConverter {
181 typedef typename OtherNodeT::ChildAllCIter
Type;
185 template<
typename NodeT>
188 typedef typename NodeT::ValueOnIter
IterT;
189 static IterT begin(NodeT& node) {
return node.beginValueOn(); }
190 template<
typename OtherNodeT>
struct NodeConverter {
191 typedef typename OtherNodeT::ValueOnIter
Type;
195 template<
typename NodeT>
198 typedef typename NodeT::ValueOnCIter
IterT;
199 static IterT begin(
const NodeT& node) {
return node.cbeginValueOn(); }
200 template<
typename OtherNodeT>
struct NodeConverter {
201 typedef typename OtherNodeT::ValueOnCIter
Type;
205 template<
typename NodeT>
208 typedef typename NodeT::ValueOffIter
IterT;
209 static IterT begin(NodeT& node) {
return node.beginValueOff(); }
210 template<
typename OtherNodeT>
struct NodeConverter {
211 typedef typename OtherNodeT::ValueOffIter
Type;
215 template<
typename NodeT>
218 typedef typename NodeT::ValueOffCIter
IterT;
219 static IterT begin(
const NodeT& node) {
return node.cbeginValueOff(); }
220 template<
typename OtherNodeT>
struct NodeConverter {
221 typedef typename OtherNodeT::ValueOffCIter
Type;
225 template<
typename NodeT>
228 typedef typename NodeT::ValueAllIter
IterT;
229 static IterT begin(NodeT& node) {
return node.beginValueAll(); }
230 template<
typename OtherNodeT>
struct NodeConverter {
231 typedef typename OtherNodeT::ValueAllIter
Type;
235 template<
typename NodeT>
238 typedef typename NodeT::ValueAllCIter
IterT;
239 static IterT begin(
const NodeT& node) {
return node.cbeginValueAll(); }
240 template<
typename OtherNodeT>
struct NodeConverter {
241 typedef typename OtherNodeT::ValueAllCIter
Type;
259 template<
typename PrevItemT,
typename NodeVecT,
size_t VecSize, Index _Level>
266 typedef typename boost::mpl::front<NodeVecT>::type
_NodeT;
272 typedef typename IterT::NodeType
NodeT;
274 typedef typename IterT::NonConstNodeType
NCNodeT;
276 typedef typename IterT::NonConstValueType
NCValueT;
290 if (&other !=
this) {
301 template<
typename OtherIterT>
302 void setIter(
const OtherIterT& iter) { mNext.setIter(iter); }
307 node = (lvl <= Level) ? mIter.getParentNode() : NULL;
310 template<
typename OtherNodeT>
311 void getNode(
Index lvl, OtherNodeT*& node)
const { mNext.getNode(lvl, node); }
318 template<
typename OtherIterListItemT>
322 const NodeT* node = NULL;
323 otherListItem.getNode(lvl, node);
324 mIter = (node == NULL) ?
IterT() : ITraits::begin(*const_cast<NodeT*>(node));
327 mNext.initLevel(lvl, otherListItem);
332 Index pos(
Index lvl)
const {
return (lvl == Level) ? mIter.pos() : mNext.pos(lvl); }
335 bool test(
Index lvl)
const {
return (lvl == Level) ? mIter.test() : mNext.test(lvl); }
338 bool next(
Index lvl) {
return (lvl == Level) ? mIter.next() : mNext.next(lvl); }
344 if (lvl == Level && mPrev != NULL && mIter) {
345 if (
ChildT* child = ITraits::template getChild<ChildT>(mIter)) {
346 mPrev->setIter(PrevItemT::ITraits::begin(*child));
350 return (lvl > Level) ? mNext.down(lvl) :
false;
357 return (lvl == Level) ? mIter.getCoord() : mNext.getCoord(lvl);
361 return (lvl == Level) ? NodeT::getChildDim() : mNext.getChildDim(lvl);
366 return (lvl == Level) ? ChildT::NUM_VOXELS : mNext.getVoxelCount(lvl);
372 return (lvl == Level) ? mIter.isValueOn() : mNext.isValueOn(lvl);
378 if (lvl == Level)
return mIter.getValue();
379 return mNext.getValue(lvl);
387 if (lvl == Level) mIter.setValue(val);
else mNext.setValue(lvl, val);
394 if (lvl == Level) mIter.setValueOn(on);
else mNext.setValueOn(lvl, on);
401 if (lvl == Level) mIter.setValueOff();
else mNext.setValueOff(lvl);
406 template<
typename ModifyOp>
409 if (lvl == Level) mIter.modifyValue(op);
else mNext.modifyValue(lvl, op);
413 typedef typename boost::mpl::pop_front<NodeVecT>::type RestT;
423 template<
typename PrevItemT,
typename NodeVecT,
size_t VecSize>
430 typedef typename boost::mpl::front<NodeVecT>::type
_NodeT;
436 typedef typename IterT::NodeType
NodeT;
438 typedef typename IterT::NonConstNodeType
NCNodeT;
440 typedef typename IterT::NonConstValueType
NCValueT;
450 if (&other !=
this) {
461 template<
typename OtherIterT>
462 void setIter(
const OtherIterT& iter) { mNext.setIter(iter); }
466 node = (lvl == 0) ? mIter.getParentNode() : NULL;
468 template<
typename OtherNodeT>
469 void getNode(
Index lvl, OtherNodeT*& node)
const { mNext.getNode(lvl, node); }
471 template<
typename OtherIterListItemT>
475 const NodeT* node = NULL;
476 otherListItem.getNode(lvl, node);
477 mIter = (node == NULL) ?
IterT() : ITraits::begin(*const_cast<NodeT*>(node));
479 mNext.initLevel(lvl, otherListItem);
483 Index pos(
Index lvl)
const {
return (lvl == 0) ? mIter.pos() : mNext.pos(lvl); }
485 bool test(
Index lvl)
const {
return (lvl == 0) ? mIter.test() : mNext.test(lvl); }
487 bool next(
Index lvl) {
return (lvl == 0) ? mIter.next() : mNext.next(lvl); }
489 bool down(
Index lvl) {
return (lvl == 0) ?
false : mNext.down(lvl); }
493 return (lvl == 0) ? mIter.getCoord() : mNext.getCoord(lvl);
497 return (lvl == 0) ? NodeT::getChildDim() : mNext.getChildDim(lvl);
502 return (lvl == 0) ? 1 : mNext.getVoxelCount(lvl);
507 return (lvl == 0) ? mIter.isValueOn() : mNext.isValueOn(lvl);
512 if (lvl == 0)
return mIter.getValue();
513 return mNext.getValue(lvl);
518 if (lvl == 0) mIter.setValue(val);
else mNext.setValue(lvl, val);
522 if (lvl == 0) mIter.setValueOn(on);
else mNext.setValueOn(lvl, on);
526 if (lvl == 0) mIter.setValueOff();
else mNext.setValueOff(lvl);
529 template<
typename ModifyOp>
532 if (lvl == 0) mIter.modifyValue(op);
else mNext.modifyValue(lvl, op);
536 typedef typename boost::mpl::pop_front<NodeVecT>::type RestT;
546 template<
typename PrevItemT,
typename NodeVecT, Index _Level>
550 typedef typename boost::mpl::front<NodeVecT>::type
_NodeT;
558 typedef typename IterT::NodeType
NodeT;
560 typedef typename IterT::NonConstNodeType
NCNodeT;
562 typedef typename IterT::NonConstValueType
NCValueT;
576 if (&other !=
this) {
592 node = (lvl <= Level) ? mIter.getParentNode() : NULL;
595 template<
typename OtherIterListItemT>
599 const NodeT* node = NULL;
600 otherListItem.getNode(lvl, node);
601 mIter = (node == NULL) ?
IterT() : ITraits::begin(*const_cast<NodeT*>(node));
607 bool test(
Index lvl)
const {
return (lvl == Level) ? mIter.test() :
false; }
609 bool next(
Index lvl) {
return (lvl == Level) ? mIter.next() :
false; }
613 if (lvl == Level && mPrev != NULL && mIter) {
614 if (
ChildT* child = ITraits::template getChild<ChildT>(mIter)) {
615 mPrev->setIter(PrevItemT::ITraits::begin(*child));
622 Coord
getCoord(
Index lvl)
const {
return (lvl == Level) ? mIter.getCoord() : Coord(); }
626 bool isValueOn(
Index lvl)
const {
return (lvl == Level) ? mIter.isValueOn() :
false; }
630 assert(lvl == Level);
632 return mIter.getValue();
636 void setValueOn(
Index lvl,
bool on =
true)
const {
if (lvl == Level) mIter.setValueOn(on); }
639 template<
typename ModifyOp>
642 if (lvl == Level) mIter.modifyValue(op);
657 template<
typename _TreeT,
typename ValueIterT>
662 typedef typename ValueIterT::NodeType
NodeT;
663 typedef typename ValueIterT::NonConstValueType
ValueT;
665 static const Index ROOT_LEVEL = NodeT::LEVEL;
666 BOOST_STATIC_ASSERT(ValueIterT::NodeType::LEVEL == ROOT_LEVEL);
667 static const Index LEAF_LEVEL = 0, ROOT_DEPTH = 0, LEAF_DEPTH = ROOT_LEVEL;
675 void setMinDepth(
Index minDepth);
679 void setMaxDepth(
Index maxDepth);
684 bool test()
const {
return mValueIterList.test(mLevel); }
686 operator bool()
const {
return this->test(); }
707 template<
typename NodeType>
708 void getNode(NodeType*& node)
const { mValueIterList.getNode(mLevel, node); }
712 Coord
getCoord()
const {
return mValueIterList.getCoord(mLevel); }
716 bool getBoundingBox(CoordBBox&)
const;
729 bool isValueOn()
const {
return mValueIterList.isValueOn(mLevel); }
732 const ValueT& getValue()
const {
return mValueIterList.getValue(mLevel); }
752 template<
typename ModifyOp>
753 void modifyValue(
const ModifyOp& op)
const { mValueIterList.modifyValue(mLevel, op); }
759 std::string summary()
const;
762 bool advance(
bool dontIncrement =
false);
765 struct PrevChildItem {
typedef ChildOnIterT IterT; };
766 struct PrevValueItem {
typedef ValueIterT IterT; };
768 IterListItem<PrevChildItem, InvTreeT, ROOT_LEVEL+1, 0> mChildIterList;
769 IterListItem<PrevValueItem, InvTreeT, ROOT_LEVEL+1, 0> mValueIterList;
771 int mMinLevel, mMaxLevel;
776 template<
typename TreeT,
typename ValueIterT>
779 mChildIterList(NULL),
780 mValueIterList(NULL),
782 mMinLevel(int(LEAF_LEVEL)),
783 mMaxLevel(int(ROOT_LEVEL)),
792 template<
typename TreeT,
typename ValueIterT>
795 mChildIterList(other.mChildIterList),
796 mValueIterList(other.mValueIterList),
797 mLevel(other.mLevel),
798 mMinLevel(other.mMinLevel),
799 mMaxLevel(other.mMaxLevel),
807 template<
typename TreeT,
typename ValueIterT>
811 if (&other !=
this) {
812 mChildIterList = other.mChildIterList;
813 mValueIterList = other.mValueIterList;
814 mLevel = other.mLevel;
815 mMinLevel = other.mMinLevel;
816 mMaxLevel = other.mMaxLevel;
818 mChildIterList.updateBackPointers();
819 mValueIterList.updateBackPointers();
825 template<
typename TreeT,
typename ValueIterT>
829 mMaxLevel = int(ROOT_LEVEL - minDepth);
830 if (
int(mLevel) > mMaxLevel) this->next();
834 template<
typename TreeT,
typename ValueIterT>
839 mMinLevel = int(ROOT_LEVEL -
std::min(maxDepth, this->getLeafDepth()));
840 if (
int(mLevel) < mMinLevel) this->next();
844 template<
typename TreeT,
typename ValueIterT>
849 if (!this->advance())
return false;
850 }
while (
int(mLevel) < mMinLevel ||
int(mLevel) > mMaxLevel);
855 template<
typename TreeT,
typename ValueIterT>
860 vPos = mValueIterList.pos(mLevel),
861 cPos = mChildIterList.pos(mLevel);
862 if (vPos == cPos && mChildIterList.test(mLevel)) {
864 mValueIterList.
next(mLevel);
865 vPos = mValueIterList.pos(mLevel);
868 if (dontIncrement)
return true;
869 if (mValueIterList.next(mLevel)) {
870 if (mValueIterList.pos(mLevel) == cPos && mChildIterList.test(mLevel)) {
872 mValueIterList.next(mLevel);
875 if (mValueIterList.pos(mLevel) < cPos)
return true;
879 if (!dontIncrement) mChildIterList.next(mLevel);
881 #ifdef DEBUG_TREE_VALUE_ITERATOR
882 std::cout <<
"\n" << this->summary() << std::flush;
886 while (mChildIterList.pos(mLevel) < mValueIterList.pos(mLevel)) {
887 #ifdef ENABLE_TREE_VALUE_DEPTH_BOUND_OPTIMIZATION
888 if (
int(mLevel) == mMinLevel) {
893 while (mChildIterList.test(mLevel)) mChildIterList.next(mLevel);
896 if (mChildIterList.down(mLevel)) {
898 mValueIterList.initLevel(mLevel, mChildIterList);
899 if (mValueIterList.pos(mLevel) == mChildIterList.pos(mLevel)
900 && mChildIterList.test(mLevel))
903 mValueIterList.next(mLevel);
906 #ifdef DEBUG_TREE_VALUE_ITERATOR
907 std::cout <<
"\n" << this->summary() << std::flush;
911 while (!mChildIterList.test(mLevel) && !mValueIterList.test(mLevel)) {
912 if (mLevel == ROOT_LEVEL)
return false;
914 mChildIterList.next(mLevel);
921 template<
typename TreeT,
typename ValueIterT>
929 bbox.min() = mValueIterList.getCoord(mLevel);
930 bbox.max() = bbox.min().offsetBy(mValueIterList.getChildDim(mLevel) - 1);
935 template<
typename TreeT,
typename ValueIterT>
939 std::ostringstream ostr;
940 for (
int lvl =
int(ROOT_LEVEL); lvl >= 0 && lvl >= int(mLevel); --lvl) {
941 if (lvl == 0) ostr <<
"leaf";
942 else if (lvl ==
int(ROOT_LEVEL)) ostr <<
"root";
943 else ostr <<
"int" << (ROOT_LEVEL - lvl);
944 ostr <<
" v" << mValueIterList.pos(lvl)
945 <<
" c" << mChildIterList.pos(lvl);
946 if (lvl >
int(mLevel)) ostr <<
" / ";
948 if (this->test() && mValueIterList.pos(mLevel) < mChildIterList.pos(mLevel)) {
950 ostr <<
" " << this->getCoord();
952 ostr <<
" " << this->getBoundingBox();
963 template<
typename _TreeT,
typename RootChildOnIterT>
993 bool test()
const {
return !mDone; }
995 operator bool()
const {
return this->
test(); }
1029 template<
typename NodeT>
1037 struct PrevItem {
typedef RootIterT IterT; };
1041 int mMinLevel, mMaxLevel;
1047 template<
typename TreeT,
typename RootChildOnIterT>
1052 mMinLevel(int(LEAF_LEVEL)),
1053 mMaxLevel(int(ROOT_LEVEL)),
1060 template<
typename TreeT,
typename RootChildOnIterT>
1065 mMinLevel(int(LEAF_LEVEL)),
1066 mMaxLevel(int(ROOT_LEVEL)),
1070 mIterList.
setIter(RootIterTraits::begin(tree.getRootNode()));
1074 template<
typename TreeT,
typename RootChildOnIterT>
1077 mIterList(other.mIterList),
1078 mLevel(other.mLevel),
1079 mMinLevel(other.mMinLevel),
1080 mMaxLevel(other.mMaxLevel),
1088 template<
typename TreeT,
typename RootChildOnIterT>
1092 if (&other !=
this) {
1093 mLevel = other.mLevel;
1094 mMinLevel = other.mMinLevel;
1095 mMaxLevel = other.mMaxLevel;
1096 mDone = other.mDone;
1097 mTree = other.mTree;
1098 mIterList = other.mIterList;
1105 template<
typename TreeT,
typename RootChildOnIterT>
1109 mMaxLevel = int(ROOT_LEVEL - minDepth);
1110 if (
int(mLevel) > mMaxLevel) this->next();
1114 template<
typename TreeT,
typename RootChildOnIterT>
1119 mMinLevel = int(ROOT_LEVEL -
std::min(maxDepth, this->getLeafDepth()));
1120 if (
int(mLevel) < mMinLevel) this->next();
1124 template<
typename TreeT,
typename RootChildOnIterT>
1129 if (mDone)
return false;
1133 if (
int(mLevel) > mMinLevel && mIterList.test(mLevel)) {
1134 if (!mIterList.down(mLevel))
return false;
1138 while (!mIterList.test(mLevel)) {
1139 if (mLevel == ROOT_LEVEL) {
1145 mIterList.next(mLevel);
1148 if (!mIterList.down(mLevel))
return false;
1151 }
while (
int(mLevel) < mMinLevel || int(mLevel) > mMaxLevel);
1156 template<
typename TreeT,
typename RootChildOnIterT>
1160 if (mLevel != ROOT_LEVEL)
return mIterList.getCoord(mLevel + 1);
1162 this->getNode(root);
1163 return root ? root->getMinIndex() :
Coord::min();
1167 template<
typename TreeT,
typename RootChildOnIterT>
1171 if (mLevel == ROOT_LEVEL) {
1173 this->getNode(root);
1178 root->getIndexRange(bbox);
1181 bbox.min() = mIterList.getCoord(mLevel + 1);
1182 bbox.max() = bbox.min().offsetBy(mIterList.getChildDim(mLevel + 1) - 1);
1187 template<
typename TreeT,
typename RootChildOnIterT>
1191 std::ostringstream ostr;
1192 for (
int lvl =
int(ROOT_LEVEL); lvl >= 0 && lvl >= int(mLevel); --lvl) {
1193 if (lvl == 0) ostr <<
"leaf";
1194 else if (lvl ==
int(ROOT_LEVEL)) ostr <<
"root";
1195 else ostr <<
"int" << (ROOT_LEVEL - lvl);
1196 ostr <<
" c" << mIterList.pos(lvl);
1197 if (lvl >
int(mLevel)) ostr <<
" / ";
1200 this->getBoundingBox(bbox);
1201 ostr <<
" " << bbox;
1210 template<
typename TreeT,
typename RootChildOnIterT>
1230 mIterList.
setIter(RootIterTraits::begin(tree.getRootNode()));
1233 for ( ; lvl > 0 && mIterList.
down(lvl); --lvl) {}
1235 if (lvl > 0) this->
next();
1244 if (&other !=
this) {
1245 mTree = other.mTree;
1246 mIterList = other.mIterList;
1260 operator bool()
const {
return this->
test(); }
1274 struct PrevItem {
typedef RootIterT IterT; };
1284 template<
typename TreeT,
typename RootChildOnIterT>
1290 if (mIterList.test(LEAF_PARENT_LEVEL) && mIterList.next(LEAF_PARENT_LEVEL)) {
1291 mIterList.down(LEAF_PARENT_LEVEL);
1295 Index lvl = LEAF_PARENT_LEVEL;
1296 while (!mIterList.test(LEAF_PARENT_LEVEL)) {
1297 if (mIterList.test(lvl)) {
1298 mIterList.next(lvl);
1303 if (lvl == ROOT_LEVEL)
return false;
1305 if (mIterList.test(lvl)) mIterList.next(lvl);
1306 }
while (!mIterList.test(lvl));
1309 while (lvl > LEAF_PARENT_LEVEL && mIterList.down(lvl)) --lvl;
1311 mIterList.down(LEAF_PARENT_LEVEL);
1321 template<
typename IterT>
1327 mGrainSize(grainSize),
1330 mSize = this->size();
1334 mGrainSize(other.mGrainSize),
1335 mSize(other.mSize >> 1)
1345 bool empty()
const {
return mSize == 0 || !mIter.test(); }
1347 operator bool()
const {
return !this->
empty(); }
1354 void increment(
Index n = 1) {
for ( ; n > 0 && mSize > 0; --n, --mSize, ++mIter) {} }
1362 Index size()
const {
Index n = 0;
for (IterT it(mIter); it.test(); ++n, ++it) {}
return n; }
1384 #endif // OPENVDB_TREE_TREEITERATOR_HAS_BEEN_INCLUDED
void setActiveState(bool on) const
Change the active/inactive state of the tile or voxel value to which this iterator is currently point...
Definition: TreeIterator.h:743
static IterT begin(const NodeT &node)
Definition: TreeIterator.h:199
void increment(Index n)
Increment the iterator n times.
Definition: TreeIterator.h:1005
Index getChildDim(Index lvl) const
Definition: TreeIterator.h:495
_TreeT TreeT
Definition: TreeIterator.h:967
Base class for tree-traversal iterators over tile and voxel values.
Definition: TreeIterator.h:658
static const Index LEAF_DEPTH
Definition: TreeIterator.h:973
IterTraits< typename PrevIterT::NonConstNodeType, PrevIterT >::template NodeConverter< _NodeT >::Type IterT
The type of iterator stored in this list item (e.g., InternalNode::ValueOnCIter)
Definition: TreeIterator.h:269
void setValue(Index lvl, const NCValueT &val) const
Definition: TreeIterator.h:516
Coord getCoord() const
Return the global coordinates of the voxel or tile to which this iterator is currently pointing...
Definition: TreeIterator.h:712
IterTraits< typename PrevIterT::NonConstNodeType, PrevIterT >::template NodeConverter< _NodeT >::Type IterT
The type of iterator stored in this list item (e.g., InternalNode::ValueOnCIter)
Definition: TreeIterator.h:433
void setIter(const OtherIterT &iter)
Definition: TreeIterator.h:302
LeafNodeT & operator*() const
Return the leaf node to which the iterator is pointing.
Definition: TreeIterator.h:1255
void increment(Index n=1)
Advance the iterator n times.
Definition: TreeIterator.h:1354
CopyConstness< NCNodeT, typename NCNodeT::ChildNodeType >::Type NCChildT
NodeT's child node type with const qualifiers removed.
Definition: TreeIterator.h:566
NodeIteratorBase()
Definition: TreeIterator.h:1049
Index pos(Index lvl) const
Definition: TreeIterator.h:483
NodeT::ValueOffCIter IterT
Definition: TreeIterator.h:218
NodeT::ChildOffIter IterT
Definition: TreeIterator.h:140
OtherNodeT::ValueAllIter Type
Definition: TreeIterator.h:231
bool next(Index lvl)
Definition: TreeIterator.h:609
IteratorRange(IteratorRange &other, tbb::split)
Definition: TreeIterator.h:1332
IterTraits< NCNodeT, IterT > ITraits
Definition: TreeIterator.h:281
CopyConstness< NodeT, typename NodeT::ChildNodeType >::Type ChildT
NodeT's child node type, with the same constness (e.g., const InternalNode<...>)
Definition: TreeIterator.h:278
static IterT begin(const NodeT &node)
Definition: TreeIterator.h:175
IterTraits< typename PrevIterT::NonConstNodeType, PrevIterT >::template NodeConverter< _NodeT >::Type IterT
The type of iterator stored in this list item (e.g., RootNode::ValueOnCIter)
Definition: TreeIterator.h:555
ValueIterT::NodeType NodeT
Definition: TreeIterator.h:662
OtherNodeT::ValueOffCIter Type
Definition: TreeIterator.h:221
void setMaxDepth(Index maxDepth)
Specify the depth of the lowest level of the tree to which to descend (depth 0 = root).
Definition: TreeIterator.h:1116
Base class for tree-traversal iterators over all leaf nodes (but not leaf voxels) ...
Definition: TreeIterator.h:1211
void initLevel(Index lvl, OtherIterListItemT &otherListItem)
Initialize the iterator for level lvl of the tree with the node over which the corresponding iterator...
Definition: TreeIterator.h:319
Index64 getVoxelCount(Index lvl) const
Definition: TreeIterator.h:500
static const Index LEAF_LEVEL
Definition: TreeIterator.h:1221
static ChildT * getChild(const IterT &)
Definition: TreeIterator.h:108
Coord getCoord() const
Return the global coordinates of the voxel or tile to which this iterator is currently pointing...
Definition: TreeIterator.h:1158
ValueIterT::NonConstValueType ValueT
Definition: TreeIterator.h:663
void setMinDepth(Index minDepth)
Specify the depth of the highest level of the tree to which to ascend (depth 0 = root).
Definition: TreeIterator.h:1107
static IterT begin(const NodeT &node)
Definition: TreeIterator.h:128
IterTraits< NCRootNodeT, RootIterT > RootIterTraits
Definition: TreeIterator.h:1223
TreeValueIteratorBase(TreeT &)
Definition: TreeIterator.h:778
void modifyValue(Index lvl, const ModifyOp &op) const
Definition: TreeIterator.h:640
boost::mpl::push_back< SubtreeT, HeadT >::type Type
Definition: TreeIterator.h:81
IterTraits< NCNodeT, IterT > ITraits
Definition: TreeIterator.h:567
void setValue(const ValueT &val) const
Change the tile or voxel value to which this iterator is currently pointing and mark it as active...
Definition: TreeIterator.h:740
void getNode(Index lvl, OtherNodeT *&node) const
Definition: TreeIterator.h:469
OtherNodeT::ValueOnCIter Type
Definition: TreeIterator.h:201
void modifyValue(Index lvl, const ModifyOp &op) const
Definition: TreeIterator.h:530
void getNode(Index lvl, NodeT *&node) const
Definition: TreeIterator.h:590
Index getMinDepth() const
Return the depth of the highest level of the tree to which this iterator ascends. ...
Definition: TreeIterator.h:986
void setValueOff(Index lvl) const
Definition: TreeIterator.h:524
bool isValueOn(Index lvl) const
Definition: TreeIterator.h:505
static IterT begin(NodeT &node)
Definition: TreeIterator.h:229
IterT::NonConstValueType NCValueT
The type of value (with const qualifiers removed) to which the iterator points.
Definition: TreeIterator.h:562
const ToType Type
Definition: TreeIterator.h:69
NodeT::ValueOnIter IterT
Definition: TreeIterator.h:188
IterTraits< NCRootNodeT, RootIterT > RootIterTraits
Definition: TreeIterator.h:975
CoordBBox getBoundingBox() const
Return the axis-aligned bounding box of the voxel or tile to which this iterator is currently pointin...
Definition: TreeIterator.h:719
Coord getCoord(Index lvl) const
Definition: TreeIterator.h:491
void setValueOff() const
Mark the tile or voxel value to which this iterator is currently pointing as inactive.
Definition: TreeIterator.h:745
static const Index LEAF_LEVEL
Definition: TreeIterator.h:973
void setValue(Index lvl, const NCValueT &val) const
Definition: TreeIterator.h:635
RootChildOnIterT RootIterT
Definition: TreeIterator.h:1214
Definition: TreeIterator.h:1322
std::string summary() const
Definition: TreeIterator.h:1189
IterT::NonConstNodeType NCNodeT
The type of the node with const qualifiers removed ("Non-Const")
Definition: TreeIterator.h:274
Index getChildDim(Index lvl) const
Definition: TreeIterator.h:623
InvertedTree< typename HeadT::ChildNodeType, HeadLevel-1 >::Type SubtreeT
Definition: TreeIterator.h:80
static ChildT * getChild(const IterT &iter)
Definition: TreeIterator.h:176
static const Index ROOT_DEPTH
Definition: TreeIterator.h:973
boost::mpl::front< NodeVecT >::type _NodeT
The type of node (non-const) whose iterator is stored in this list item.
Definition: TreeIterator.h:430
void getNode(NodeType *&node) const
Return in node a pointer to the node over which this iterator is currently iterating or one of that n...
Definition: TreeIterator.h:708
LeafIteratorBase & operator=(const LeafIteratorBase &other)
Definition: TreeIterator.h:1242
static ChildT * getChild(const IterT &iter)
Definition: TreeIterator.h:116
static IterT begin(NodeT &node)
Definition: TreeIterator.h:189
IterListItem(const IterListItem &other)
Definition: TreeIterator.h:447
Index getLevel() const
Return the level in the tree (0 = leaf) of the node to which this iterator is currently pointing...
Definition: TreeIterator.h:697
IterListItem(PrevItemT *prev)
Definition: TreeIterator.h:571
bool test(Index lvl) const
Return true if the iterator at level lvl of the tree has not yet reached its end. ...
Definition: TreeIterator.h:335
const NCValueT & getValue(Index lvl) const
Definition: TreeIterator.h:628
Definition: TreeIterator.h:79
Coord getCoord(Index lvl) const
Definition: TreeIterator.h:622
Index getLevel() const
Return the level in the tree (0 = leaf) of the node to which this iterator is currently pointing...
Definition: TreeIterator.h:1009
boost::remove_const< ToType >::type Type
Definition: TreeIterator.h:66
Definition: TreeIterator.h:65
TreeT * getTree() const
Definition: TreeIterator.h:1271
TreeValueIteratorBase & operator=(const TreeValueIteratorBase &other)
Definition: TreeIterator.h:809
IterListItem & operator=(const IterListItem &other)
Definition: TreeIterator.h:448
void updateBackPointers(PrevItemT *prev)
Definition: TreeIterator.h:583
void setIter(const IterT &iter)
Definition: TreeIterator.h:300
bool down(Index lvl)
Definition: TreeIterator.h:611
Index getDepth() const
Return the depth in the tree (0 = root) of the node to which this iterator is currently pointing...
Definition: TreeIterator.h:700
void modifyValue(const ModifyOp &op) const
Apply a functor to the item to which this iterator is pointing. (Not valid for const iterators...
Definition: TreeIterator.h:753
CopyConstness< NCNodeT, typename NCNodeT::ChildNodeType >::Type NCChildT
NodeT's child node type with const qualifiers removed.
Definition: TreeIterator.h:280
NodeIteratorBase & operator=(const NodeIteratorBase &other)
Definition: TreeIterator.h:1090
LeafIteratorBase & operator++()
Advance the iterator to the next leaf node.
Definition: TreeIterator.h:1266
PrevItemT::IterT PrevIterT
The type of iterator stored in the previous list item.
Definition: TreeIterator.h:264
Coord getCoord(Index lvl) const
Return the global coordinates of the voxel or tile to which the iterator at level lvl of the tree is ...
Definition: TreeIterator.h:355
bool down(Index lvl)
Definition: TreeIterator.h:489
bool next(Index lvl)
Definition: TreeIterator.h:487
void updateBackPointers(PrevItemT *=NULL)
Definition: TreeIterator.h:458
Index64 getVoxelCount(Index lvl) const
Definition: TreeIterator.h:624
IterListItem & operator=(const IterListItem &other)
Definition: TreeIterator.h:288
bool next(Index lvl)
Increment the iterator at level lvl of the tree.
Definition: TreeIterator.h:338
NodeT::ValueAllCIter IterT
Definition: TreeIterator.h:238
static IterT begin(NodeT &node)
Definition: TreeIterator.h:161
NodeT::ChildOnCIter ChildOnIterT
Definition: TreeIterator.h:664
static const Index LEAF_PARENT_LEVEL
Definition: TreeIterator.h:1221
bool down(Index lvl)
If the iterator at level lvl of the tree points to a child node, initialize the next iterator in this...
Definition: TreeIterator.h:342
IterT::NodeType NodeT
The type of node over which IterT iterates (e.g., const RootNode<...>)
Definition: TreeIterator.h:558
NodeIteratorBase & operator++()
Definition: TreeIterator.h:1003
boost::mpl::front< NodeVecT >::type _NodeT
Definition: TreeIterator.h:550
static IterT begin(NodeT &node)
Definition: TreeIterator.h:209
void getNode(Index lvl, NodeT *&node) const
Return the node over which this list element's iterator iterates.
Definition: TreeIterator.h:305
IterT::NonConstValueType NCValueT
The type of value (with const qualifiers removed) to which the iterator points.
Definition: TreeIterator.h:440
void getNode(Index lvl, NodeT *&node) const
Definition: TreeIterator.h:464
Index pos(Index lvl) const
Return The table offset of the iterator at level lvl of the tree.
Definition: TreeIterator.h:332
NodeT::ValueOnCIter IterT
Definition: TreeIterator.h:198
Index getMaxDepth() const
Return the depth of the lowest level of the tree to which this iterator ascends.
Definition: TreeIterator.h:990
void getNode(Index lvl, OtherNodeT *&node) const
Return the node over which one of the following list elements' iterator iterates. ...
Definition: TreeIterator.h:311
CoordBBox getBoundingBox() const
Return the axis-aligned bounding box of the voxel or tile to which this iterator is currently pointin...
Definition: TreeIterator.h:1024
static IterT begin(const NodeT &node)
Definition: TreeIterator.h:239
#define OPENVDB_VERSION_NAME
Definition: version.h:45
OtherNodeT::ChildOnIter Type
Definition: TreeIterator.h:120
void setValueOff(Index lvl) const
Mark the value to which the iterator at level lvl of the tree points as inactive. ...
Definition: TreeIterator.h:399
RootChildOnIterT RootIterT
Definition: TreeIterator.h:968
static const ChildT * getChild(const IterT &iter)
Definition: TreeIterator.h:129
IterListItem(PrevItemT *)
Definition: TreeIterator.h:445
TreeT * getTree() const
Definition: TreeIterator.h:1032
IterTraits< NCNodeT, IterT > ITraits
Definition: TreeIterator.h:441
bool test() const
Definition: TreeIterator.h:1346
_TreeT TreeT
Definition: TreeIterator.h:661
static const Index ROOT_LEVEL
Definition: TreeIterator.h:971
CopyConstness< RootNodeT, NCLeafNodeT >::Type LeafNodeT
Definition: TreeIterator.h:1220
OtherNodeT::ChildAllCIter Type
Definition: TreeIterator.h:181
Index getMinDepth() const
Return the depth of the highest level of the tree to which this iterator ascends. ...
Definition: TreeIterator.h:677
bool test(Index lvl) const
Definition: TreeIterator.h:607
void setValueOn(Index lvl, bool on=true) const
Set the value (to val) to which the iterator at level lvl of the tree points and mark the value as ac...
Definition: TreeIterator.h:392
bool isTileValue() const
Return true if this iterator is currently pointing to a (non-leaf) tile value.
Definition: TreeIterator.h:725
bool test() const
Definition: TreeIterator.h:1259
boost::mpl::vector< typename HeadT::ChildNodeType, HeadT >::type Type
Definition: TreeIterator.h:85
void setIter(const OtherIterT &iter)
Definition: TreeIterator.h:462
IterListItem(const IterListItem &other)
Definition: TreeIterator.h:573
RootIterT::NonConstNodeType NCRootNodeT
Definition: TreeIterator.h:970
OPENVDB_API Hermite min(const Hermite &, const Hermite &)
min and max operations done directly on the compressed data.
CopyConstness< NodeT, typename NodeT::ChildNodeType >::Type ChildT
NodeT's child node type, with the same constness (e.g., const InternalNode<...>)
Definition: TreeIterator.h:564
const ValueT * operator->() const
Return the tile or voxel value to which this iterator is currently pointing.
Definition: TreeIterator.h:735
void setValueOn(Index lvl, bool on=true) const
Definition: TreeIterator.h:520
NodeT::ValueOffIter IterT
Definition: TreeIterator.h:208
boost::mpl::front< NodeVecT >::type _NodeT
The type of node (non-const) whose iterator is stored in this list item.
Definition: TreeIterator.h:266
static IterT begin(const NodeT &node)
Definition: TreeIterator.h:151
NodeT::ChildOnCIter IterT
Definition: TreeIterator.h:127
void initLevel(Index lvl, OtherIterListItemT &otherListItem)
Definition: TreeIterator.h:596
Index pos(Index lvl) const
Definition: TreeIterator.h:605
RootIterT::NodeType RootNodeT
Definition: TreeIterator.h:969
const IterT & iterator() const
Return a reference to this range's iterator.
Definition: TreeIterator.h:1343
IterListItem(const IterListItem &other)
Definition: TreeIterator.h:287
IterT::NodeType NodeT
The type of node (const or non-const) over which IterT iterates (e.g., const RootNode<...>)
Definition: TreeIterator.h:436
void setMinDepth(Index minDepth)
Specify the depth of the highest level of the tree to which to ascend (depth 0 = root).
Definition: TreeIterator.h:827
OtherNodeT::ValueAllCIter Type
Definition: TreeIterator.h:241
LeafNodeT * operator->() const
Return the leaf node to which the iterator is pointing.
Definition: TreeIterator.h:1256
std::string summary() const
Return a string (for debugging, mainly) describing this iterator's current state. ...
Definition: TreeIterator.h:937
Index64 getVoxelCount() const
Return the number of (virtual) voxels corresponding to the value.
Definition: TreeIterator.h:722
static const Index ROOT_LEVEL
Definition: TreeIterator.h:1217
IterListItem & operator=(const IterListItem &other)
Definition: TreeIterator.h:574
RootIterT::NodeType RootNodeT
Definition: TreeIterator.h:1215
bool next()
Advance the iterator to the next leaf node.
Definition: TreeIterator.h:1286
LeafIteratorBase(TreeT &tree)
Definition: TreeIterator.h:1227
void increment()
Advance the iterator to the next leaf node.
Definition: TreeIterator.h:1265
void setMaxDepth(Index maxDepth)
Specify the depth of the lowest level of the tree to which to descend (depth 0 = root).
Definition: TreeIterator.h:836
bool isVoxelValue() const
Return true if this iterator is currently pointing to a (leaf) voxel value.
Definition: TreeIterator.h:727
static ChildT * getChild(const IterT &iter)
Definition: TreeIterator.h:162
IteratorRange & operator++()
Advance the iterator to the next item.
Definition: TreeIterator.h:1356
IterT::NonConstValueType NCValueT
The type of value (with const qualifiers removed) to which the iterator points.
Definition: TreeIterator.h:276
const NCValueT & getValue(Index lvl) const
Return the value to which the iterator at level lvl of the tree points.
Definition: TreeIterator.h:376
IterT::NonConstNodeType NCNodeT
The type of the node with const qualifiers removed ("Non-Const")
Definition: TreeIterator.h:560
bool next()
Advance to the next tile or voxel value.
Definition: TreeIterator.h:1126
const NCValueT & getValue(Index lvl) const
Definition: TreeIterator.h:510
TreeT * getTree() const
Return a pointer to the tree over which this iterator is iterating.
Definition: TreeIterator.h:756
Base class for tree-traversal iterators over all nodes.
Definition: TreeIterator.h:964
Index32 Index
Definition: Types.h:56
void setIter(const IterT &iter)
Definition: TreeIterator.h:460
void setValueOn(Index lvl, bool on=true) const
Definition: TreeIterator.h:636
RootIterT::NonConstNodeType NCRootNodeT
Definition: TreeIterator.h:1216
NodeT::ChildOffCIter IterT
Definition: TreeIterator.h:150
Index getChildDim(Index lvl) const
Definition: TreeIterator.h:359
IterListItem(PrevItemT *prev)
Definition: TreeIterator.h:285
static Index getLeafDepth()
Definition: TreeIterator.h:1013
bool isValueOn() const
Return true if the value to which this iterator is currently pointing is active.
Definition: TreeIterator.h:729
bool isValueOn(Index lvl) const
Definition: TreeIterator.h:626
Definition: TreeIterator.h:106
LeafNodeT * getLeaf() const
Return the leaf node to which the iterator is pointing.
Definition: TreeIterator.h:1254
IteratorRange(const IterT &iter, size_t grainSize=8)
Definition: TreeIterator.h:1325
PrevItemT::IterT PrevIterT
The type of iterator stored in the previous list item.
Definition: TreeIterator.h:552
static IterT begin(NodeT &node)
Definition: TreeIterator.h:115
An IterListItem is an element of a compile-time linked list of iterators to nodes of different types...
Definition: TreeIterator.h:260
LeafIteratorBase(const LeafIteratorBase &other)
Definition: TreeIterator.h:1238
bool test(Index lvl) const
Definition: TreeIterator.h:485
TreeValueIteratorBase & operator++()
Advance to the next tile or voxel value.
Definition: TreeIterator.h:693
IterT::NodeType NodeT
The type of node (const or non-const) over which IterT iterates (e.g., const RootNode<...>)
Definition: TreeIterator.h:272
OtherNodeT::ChildOffCIter Type
Definition: TreeIterator.h:153
static Index getLeafDepth()
Definition: TreeIterator.h:701
OtherNodeT::ValueOffIter Type
Definition: TreeIterator.h:211
static IterT begin(const NodeT &node)
Definition: TreeIterator.h:219
NodeT::ValueAllIter IterT
Definition: TreeIterator.h:228
bool test() const
Return true if this iterator is not yet exhausted.
Definition: TreeIterator.h:994
bool isValueOn(Index lvl) const
Return true if the iterator at level lvl of the tree points to an active value.
Definition: TreeIterator.h:370
OtherNodeT::ChildAllIter Type
Definition: TreeIterator.h:167
OtherNodeT::ChildOffIter Type
Definition: TreeIterator.h:143
Index getMaxDepth() const
Return the depth of the lowest level of the tree to which this iterator ascends.
Definition: TreeIterator.h:681
PrevItemT::IterT PrevIterT
The type of iterator stored in the previous list item.
Definition: TreeIterator.h:428
const ValueT & operator*() const
Return the tile or voxel value to which this iterator is currently pointing.
Definition: TreeIterator.h:734
OtherNodeT::ValueOnIter Type
Definition: TreeIterator.h:191
Index64 getVoxelCount(Index lvl) const
Return the number of (virtual) voxels spanned by a tile value or child node.
Definition: TreeIterator.h:364
void modifyValue(Index lvl, const ModifyOp &op) const
Apply a functor to the item to which this iterator is pointing.
Definition: TreeIterator.h:407
IterT::NonConstNodeType NCNodeT
The type of the node with const qualifiers removed ("Non-Const")
Definition: TreeIterator.h:438
LeafIteratorBase()
Definition: TreeIterator.h:1225
#define OPENVDB_USE_VERSION_NAMESPACE
Definition: version.h:56
bool next()
Advance the iterator to the next item.
Definition: TreeIterator.h:1359
bool empty() const
Definition: TreeIterator.h:1345
NodeT::ChildAllCIter IterT
Definition: TreeIterator.h:174
void increment()
Advance the iterator to the next leaf node.
Definition: TreeIterator.h:1002
void setValueOff(Index lvl) const
Definition: TreeIterator.h:637
uint64_t Index64
Definition: Types.h:55
bool next()
Advance to the next tile or voxel value. Return true if this iterator is not yet exhausted.
Definition: TreeIterator.h:846
iter::InvertedTree< NCRootNodeT, ROOT_LEVEL >::Type InvTreeT
Definition: TreeIterator.h:972
boost::mpl::front< InvTreeT >::type NCLeafNodeT
Definition: TreeIterator.h:1219
Mat3< typename promote< T0, T1 >::type > operator*(const Mat3< T0 > &m0, const Mat3< T1 > &m1)
Matrix multiplication.
Definition: Mat3.h:608
void getNode(NodeT *&node) const
Return the node to which the iterator is pointing.
Definition: TreeIterator.h:1030
void updateBackPointers(PrevItemT *prev)
Definition: TreeIterator.h:298
void setValue(Index lvl, const NCValueT &val) const
Set the value (to val) to which the iterator at level lvl of the tree points and mark the value as ac...
Definition: TreeIterator.h:385
iter::InvertedTree< NCRootNodeT, ROOT_LEVEL >::Type InvTreeT
Definition: TreeIterator.h:1218
NodeT::ChildAllIter IterT
Definition: TreeIterator.h:160
OtherNodeT::ChildOnCIter Type
Definition: TreeIterator.h:133
static IterT begin(NodeT &node)
Definition: TreeIterator.h:141
void setIter(const IterT &iter)
Definition: TreeIterator.h:588
bool is_divisible() const
Return true if this range is splittable (i.e., if the iterator can be advanced more than mGrainSize t...
Definition: TreeIterator.h:1351
NodeT::ChildOnIter IterT
Definition: TreeIterator.h:114
Index getDepth() const
Return the depth in the tree (0 = root) of the node to which this iterator is currently pointing...
Definition: TreeIterator.h:1012
void initLevel(Index lvl, OtherIterListItemT &otherListItem)
Definition: TreeIterator.h:472