1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkInformationVector.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 "vtkInformationVector.h"
#include "vtkGarbageCollector.h"
#include "vtkInformation.h"
#include "vtkObjectFactory.h"
#include <vector>
vtkStandardNewMacro(vtkInformationVector);
class vtkInformationVectorInternals
{
public:
std::vector<vtkInformation*> Vector;
~vtkInformationVectorInternals();
};
//----------------------------------------------------------------------------
vtkInformationVectorInternals::~vtkInformationVectorInternals()
{
// Delete all the information objects.
for(std::vector<vtkInformation*>::iterator i = this->Vector.begin();
i != this->Vector.end(); ++i)
{
if(vtkInformation* info = *i)
{
info->Delete();
}
}
}
//----------------------------------------------------------------------------
vtkInformationVector::vtkInformationVector()
{
this->Internal = new vtkInformationVectorInternals;
this->NumberOfInformationObjects = 0;
}
//----------------------------------------------------------------------------
vtkInformationVector::~vtkInformationVector()
{
delete this->Internal;
}
//----------------------------------------------------------------------------
void vtkInformationVector::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "Number of Information Objects: " << this->NumberOfInformationObjects << "\n";
os << indent << "Information Objects:\n";
for(int i=0; i < this->NumberOfInformationObjects; ++i)
{
vtkInformation* info = this->GetInformationObject(i);
vtkIndent nextIndent = indent.GetNextIndent();
os << nextIndent << info->GetClassName() << "(" << info << "):\n";
info->PrintSelf(os, nextIndent.GetNextIndent());
}
}
//----------------------------------------------------------------------------
void vtkInformationVector::SetNumberOfInformationObjects(int newNumber)
{
// Adjust the number of objects.
int oldNumber = this->NumberOfInformationObjects;
if(newNumber > oldNumber)
{
// Create new information objects.
this->Internal->Vector.resize(newNumber, 0);
for(int i=oldNumber; i < newNumber; ++i)
{
this->Internal->Vector[i] = vtkInformation::New();
}
this->NumberOfInformationObjects = newNumber;
}
else if(newNumber < oldNumber)
{
// Delete old information objects.
for(int i=newNumber; i < oldNumber; ++i)
{
if(vtkInformation* info = this->Internal->Vector[i])
{
// Set the pointer to NULL first to avoid reporting of the
// entry if deleting the information object causes a garbage
// collection reference walk.
this->Internal->Vector[i] = 0;
info->Delete();
}
}
this->Internal->Vector.resize(newNumber);
this->NumberOfInformationObjects = newNumber;
}
}
//----------------------------------------------------------------------------
void vtkInformationVector::SetInformationObject(int index,
vtkInformation* newInfo)
{
if(newInfo && index >= 0 && index < this->NumberOfInformationObjects)
{
// Replace an existing information object.
vtkInformation* oldInfo = this->Internal->Vector[index];
if(oldInfo != newInfo)
{
newInfo->Register(this);
this->Internal->Vector[index] = newInfo;
oldInfo->UnRegister(this);
}
}
else if(newInfo && index >= this->NumberOfInformationObjects)
{
// If a hole will be created fill it with empty objects.
if(index > this->NumberOfInformationObjects)
{
this->SetNumberOfInformationObjects(index);
}
// Store the information object in a new entry.
newInfo->Register(this);
this->Internal->Vector.push_back(newInfo);
this->NumberOfInformationObjects++;
}
else if(!newInfo && index >= 0 &&
index < this->NumberOfInformationObjects-1)
{
// We do not allow NULL information objects. Create an empty one
// to fill in the hole.
vtkInformation* oldInfo = this->Internal->Vector[index];
this->Internal->Vector[index] = vtkInformation::New();
oldInfo->UnRegister(this);
}
else if(!newInfo && index >= 0 &&
index == this->NumberOfInformationObjects-1)
{
// Remove the last information object.
this->SetNumberOfInformationObjects(index);
}
}
//----------------------------------------------------------------------------
vtkInformation* vtkInformationVector::GetInformationObject(int index)
{
if(index >= 0 && index < this->NumberOfInformationObjects)
{
return this->Internal->Vector[index];
}
return 0;
}
//----------------------------------------------------------------------------
void vtkInformationVector::Append(vtkInformation* info)
{
// Setting an entry beyond the end will automatically append.
this->SetInformationObject(this->NumberOfInformationObjects, info);
}
//----------------------------------------------------------------------------
void vtkInformationVector::Remove(vtkInformation* info)
{
// Search for the information object and remove it.
for(int i=0; i < this->NumberOfInformationObjects; ++i)
{
if(this->Internal->Vector[i] == info)
{
this->Internal->Vector.erase(this->Internal->Vector.begin()+i);
info->UnRegister(this);
this->NumberOfInformationObjects--;
}
}
}
//----------------------------------------------------------------------------
void vtkInformationVector::Remove(int i)
{
if (i < this->NumberOfInformationObjects)
{
if (this->Internal->Vector[i])
{
this->Internal->Vector[i]->UnRegister(this);
}
this->Internal->Vector.erase(this->Internal->Vector.begin()+i);
this->NumberOfInformationObjects--;
}
}
//----------------------------------------------------------------------------
void vtkInformationVector::Copy(vtkInformationVector* from, int deep)
{
// if deep we can reuse existing info objects
if (deep)
{
this->SetNumberOfInformationObjects(from->GetNumberOfInformationObjects());
for (int i = 0; i < from->GetNumberOfInformationObjects(); ++i)
{
this->Internal->Vector[i]->Copy(from->GetInformationObject(i),deep);
}
return;
}
// otherwise it is a shallow copy and we must copy pointers
this->SetNumberOfInformationObjects(0);
// copy the data
for (int i = 0; i < from->GetNumberOfInformationObjects(); ++i)
{
vtkInformation *fromI = from->GetInformationObject(i);
this->SetInformationObject(i,fromI);
}
}
//----------------------------------------------------------------------------
void vtkInformationVector::Register(vtkObjectBase* o)
{
this->RegisterInternal(o, 1);
}
//----------------------------------------------------------------------------
void vtkInformationVector::UnRegister(vtkObjectBase* o)
{
this->UnRegisterInternal(o, 1);
}
//----------------------------------------------------------------------------
void vtkInformationVector::ReportReferences(vtkGarbageCollector* collector)
{
this->Superclass::ReportReferences(collector);
for(int i=0; i < this->NumberOfInformationObjects; ++i)
{
vtkGarbageCollectorReport(collector, this->Internal->Vector[i], "Entry");
}
}
|