You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
93 lines
2.0 KiB
C++
93 lines
2.0 KiB
C++
1 month ago
|
/*=========================================================================
|
||
|
|
|
||
|
|
Program: Visualization Toolkit
|
||
|
|
Module: vtkTreeIterator.cxx
|
||
|
|
|
||
|
|
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.
|
||
|
|
|
||
|
|
=========================================================================*/
|
||
|
|
|
||
|
|
#include "vtkTreeIterator.h"
|
||
|
|
|
||
|
|
//#include "vtkObjectFactory.h"
|
||
|
|
#include "vtkTree.h"
|
||
|
|
|
||
|
|
vtkTreeIterator::vtkTreeIterator()
|
||
|
|
{
|
||
|
|
this->Tree = NULL;
|
||
|
|
this->StartVertex = -1;
|
||
|
|
this->NextId = -1;
|
||
|
|
}
|
||
|
|
|
||
|
|
vtkTreeIterator::~vtkTreeIterator()
|
||
|
|
{
|
||
|
|
if (this->Tree)
|
||
|
|
{
|
||
|
|
this->Tree->Delete();
|
||
|
|
this->Tree = NULL;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void vtkTreeIterator::PrintSelf(ostream& os, vtkIndent indent)
|
||
|
|
{
|
||
|
|
this->Superclass::PrintSelf(os, indent);
|
||
|
|
os << indent << "Tree: " << this->Tree << endl;
|
||
|
|
os << indent << "StartVertex: " << this->StartVertex << endl;
|
||
|
|
os << indent << "NextId: " << this->NextId << endl;
|
||
|
|
}
|
||
|
|
|
||
|
|
void vtkTreeIterator::SetTree(vtkTree* tree)
|
||
|
|
{
|
||
|
|
vtkDebugMacro(<< this->GetClassName() << " (" << this
|
||
|
|
<< "): setting Tree to " << tree );
|
||
|
|
if (this->Tree != tree)
|
||
|
|
{
|
||
|
|
vtkTree* temp = this->Tree;
|
||
|
|
this->Tree = tree;
|
||
|
|
if (this->Tree != NULL) { this->Tree->Register(this); }
|
||
|
|
if (temp != NULL)
|
||
|
|
{
|
||
|
|
temp->UnRegister(this);
|
||
|
|
}
|
||
|
|
this->StartVertex = -1;
|
||
|
|
this->Initialize();
|
||
|
|
this->Modified();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void vtkTreeIterator::SetStartVertex(vtkIdType vertex)
|
||
|
|
{
|
||
|
|
if (this->StartVertex != vertex)
|
||
|
|
{
|
||
|
|
this->StartVertex = vertex;
|
||
|
|
this->Initialize();
|
||
|
|
this->Modified();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
vtkIdType vtkTreeIterator::Next()
|
||
|
|
{
|
||
|
|
vtkIdType last = this->NextId;
|
||
|
|
if(last != -1)
|
||
|
|
{
|
||
|
|
this->NextId = this->NextInternal();
|
||
|
|
}
|
||
|
|
return last;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool vtkTreeIterator::HasNext()
|
||
|
|
{
|
||
|
|
return this->NextId != -1;
|
||
|
|
}
|
||
|
|
|
||
|
|
void vtkTreeIterator::Restart()
|
||
|
|
{
|
||
|
|
this->Initialize();
|
||
|
|
}
|