vtkDataObjectTreeIterator.h

Go to the documentation of this file.

/*=========================================================================
 
  Program:   Visualization Toolkit
  Module:    vtkDataObjectTreeIterator.h
 
  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
  All rights reserved.
  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
 
     This software is distributed WITHOUT ANY WARRANTY; without even
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
     PURPOSE.  See the above copyright notice for more information.
 
=========================================================================*/
#ifndef vtkDataObjectTreeIterator_h
#define vtkDataObjectTreeIterator_h
 
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkCompositeDataIterator.h"
#include "vtkSmartPointer.h" //to store data sets
 
class vtkDataObjectTree;
class vtkDataObjectTreeInternals;
class vtkDataObjectTreeIndex;
class vtkDataObject;
class vtkInformation;
 
class VTKCOMMONDATAMODEL_EXPORT vtkDataObjectTreeIterator : public vtkCompositeDataIterator
{
public:
  static vtkDataObjectTreeIterator* New();
  vtkTypeMacro(vtkDataObjectTreeIterator, vtkCompositeDataIterator);
  void PrintSelf(ostream& os, vtkIndent indent);
 
  virtual void GoToFirstItem();
 
  virtual void GoToNextItem();
 
  virtual int IsDoneWithTraversal();
 
  virtual vtkDataObject* GetCurrentDataObject();
 
  virtual vtkInformation* GetCurrentMetaData();
 
  virtual int HasCurrentMetaData();
 
  virtual unsigned int GetCurrentFlatIndex();
 
 
  vtkSetMacro(VisitOnlyLeaves, int);
  vtkGetMacro(VisitOnlyLeaves, int);
  vtkBooleanMacro(VisitOnlyLeaves, int);
 
 
  vtkSetMacro(TraverseSubTree, int);
  vtkGetMacro(TraverseSubTree, int);
  vtkBooleanMacro(TraverseSubTree, int);
 
//BTX
protected:
  vtkDataObjectTreeIterator();
  virtual ~vtkDataObjectTreeIterator();
 
  // Takes the current location to the next dataset. This traverses the tree in
  // preorder fashion.
  // If the current location is a composite dataset, next is its 1st child dataset.
  // If the current is not a composite dataset, then next is the next dataset.
  // This method gives no guarantees  whether the current dataset will be
  // non-null or leaf.
  void NextInternal();
 
  vtkDataObjectTreeIndex GetCurrentIndex();
 
  // Needs access to GetCurrentIndex().
  friend class vtkDataObjectTree;
  friend class vtkMultiDataSetInternal;
 
  unsigned int CurrentFlatIndex;
 
private:
  vtkDataObjectTreeIterator(const vtkDataObjectTreeIterator&); // Not implemented.
  void operator=(const vtkDataObjectTreeIterator&); // Not implemented.
 
  class vtkInternals;
  vtkInternals* Internals;
  friend class vtkInternals;
 
  int TraverseSubTree;
  int VisitOnlyLeaves;
 
  vtkDataObjectTreeInternals* GetInternals(vtkDataObjectTree*);
 
  // Cannot be called when this->IsDoneWithTraversal() return 1.
  void UpdateLocation();
//ETX
};
 
#endif