------------------------------------------------------------------------------
| 336 | |
| 337 | //------------------------------------------------------------------------------ |
| 338 | void vtkDataObjectTreeIterator::GoToNextItem() |
| 339 | { |
| 340 | if (!this->Internals->Iterator->IsDoneWithTraversal()) |
| 341 | { |
| 342 | this->NextInternal(); |
| 343 | |
| 344 | while (!this->Internals->Iterator->IsDoneWithTraversal()) |
| 345 | { |
| 346 | vtkDataObject* dObj = this->Internals->Iterator->GetCurrentDataObject(); |
| 347 | if ((!dObj && this->SkipEmptyNodes) || |
| 348 | (this->VisitOnlyLeaves && vtkDataObjectTreeIterator::IsDataObjectTree(dObj))) |
| 349 | { |
| 350 | this->NextInternal(); |
| 351 | } |
| 352 | else |
| 353 | { |
| 354 | break; |
| 355 | } |
| 356 | } |
| 357 | } |
| 358 | } |
| 359 | |
| 360 | //------------------------------------------------------------------------------ |
| 361 | void vtkDataObjectTreeIterator::NextInternal() |