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 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396
|
/*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile: vtkBitArray.cxx,v $
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 "vtkBitArray.h"
#include "vtkObjectFactory.h"
vtkCxxRevisionMacro(vtkBitArray, "$Revision: 1.59.4.1 $");
vtkStandardNewMacro(vtkBitArray);
// Instantiate object.
vtkBitArray::vtkBitArray(vtkIdType numComp)
{
this->NumberOfComponents = (numComp < 1 ? 1 : numComp);
this->Array = NULL;
this->TupleSize = 3;
this->Tuple = new double[this->TupleSize]; //used for conversion
this->SaveUserArray = 0;
}
vtkBitArray::~vtkBitArray()
{
if ((this->Array) && (!this->SaveUserArray))
{
delete [] this->Array;
}
delete [] this->Tuple;
}
unsigned char *vtkBitArray::WritePointer(vtkIdType id, vtkIdType number)
{
vtkIdType newSize=id+number;
if ( newSize > this->Size )
{
this->ResizeAndExtend(newSize);
}
if ( (--newSize) > this->MaxId )
{
this->MaxId = newSize;
}
return this->Array + id/8;
}
// This method lets the user specify data to be held by the array. The
// array argument is a pointer to the data. size is the size of
// the array supplied by the user. Set save to 1 to keep the class
// from deleting the array when it cleans up or reallocates memory.
// The class uses the actual array provided; it does not copy the data
// from the suppled array.
void vtkBitArray::SetArray(unsigned char* array, vtkIdType size, int save)
{
if ((this->Array) && (!this->SaveUserArray))
{
vtkDebugMacro (<< "Deleting the array...");
delete [] this->Array;
}
else
{
vtkDebugMacro (<<"Warning, array not deleted, but will point to new array.");
}
vtkDebugMacro(<<"Setting array to: " << array);
this->Array = array;
this->Size = size;
this->MaxId = size-1;
this->SaveUserArray = save;
}
// Get the data at a particular index.
int vtkBitArray::GetValue(vtkIdType id)
{
if (this->Array[id/8]&(0x80 >> (id%8)))
{
return 1;
}
return 0;
}
// Allocate memory for this array. Delete old storage only if necessary.
int vtkBitArray::Allocate(vtkIdType sz, vtkIdType vtkNotUsed(ext))
{
if ( sz > this->Size )
{
if (( this->Array != NULL ) && (!this->SaveUserArray))
{
delete [] this->Array;
}
this->Size = ( sz > 0 ? sz : 1);
if ( (this->Array = new unsigned char[(this->Size+7)/8]) == NULL )
{
return 0;
}
this->SaveUserArray = 0;
}
this->MaxId = -1;
return 1;
}
// Release storage and reset array to initial state.
void vtkBitArray::Initialize()
{
if (( this->Array != NULL ) && (!this->SaveUserArray))
{
delete [] this->Array;
}
this->Array = NULL;
this->Size = 0;
this->MaxId = -1;
this->SaveUserArray = 0;
}
// Deep copy of another bit array.
void vtkBitArray::DeepCopy(vtkDataArray *ia)
{
// Do nothing on a NULL input.
if (ia == NULL)
{
return;
}
if (ia->GetDataType() != VTK_BIT)
{
vtkIdType numTuples = ia->GetNumberOfTuples();
this->NumberOfComponents = ia->GetNumberOfComponents();
this->SetNumberOfTuples(numTuples);
for (vtkIdType i = 0; i < numTuples; i++)
{
this->SetTuple(i, ia->GetTuple(i));
}
return;
}
if ( this != ia )
{
if ((this->Array) && (!this->SaveUserArray))
{
delete [] this->Array;
}
this->NumberOfComponents = ia->GetNumberOfComponents();
this->MaxId = ia->GetMaxId();
this->Size = ia->GetSize();
this->SaveUserArray = 0;
this->Array = new unsigned char[(this->Size+7)/8];
memcpy(this->Array, (unsigned char*)ia->GetVoidPointer(0),
((this->Size+7)/8)*sizeof(unsigned char));
}
}
void vtkBitArray::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
if (this->Array)
{
os << indent << "Array: " << this->Array << "\n";
}
else
{
os << indent << "Array: (null)\n";
}
}
//
// Private function does "reallocate". Sz is the number of "bits", and we
// can allocate only 8-bit bytes.
unsigned char *vtkBitArray::ResizeAndExtend(vtkIdType sz)
{
unsigned char *newArray;
vtkIdType newSize;
if ( sz > this->Size )
{
newSize = this->Size + sz;
}
else if (sz == this->Size)
{
return this->Array;
}
else
{
newSize = sz;
}
if (newSize <= 0)
{
this->Initialize();
return 0;
}
if ( (newArray = new unsigned char[(newSize+7)/8]) == NULL )
{
vtkErrorMacro(<< "Cannot allocate memory\n");
return 0;
}
if (this->Array)
{
int usedSize = (sz < this->Size) ? sz : this->Size;
memcpy(newArray, this->Array,
((usedSize+7)/8)*sizeof(unsigned char));
if (!this->SaveUserArray)
{
delete[] this->Array;
}
}
if (newSize < this->Size)
{
this->MaxId = newSize-1;
}
this->Size = newSize;
this->Array = newArray;
this->SaveUserArray = 0;
return this->Array;
}
int vtkBitArray::Resize(vtkIdType sz)
{
unsigned char *newArray;
vtkIdType newSize = sz*this->NumberOfComponents;
if (newSize == this->Size)
{
return 1;
}
if (newSize <= 0)
{
this->Initialize();
return 1;
}
if ( (newArray = new unsigned char[(newSize+7)/8]) == NULL )
{
vtkErrorMacro(<< "Cannot allocate memory\n");
return 0;
}
if (this->Array)
{
int usedSize = (newSize < this->Size) ? newSize : this->Size;
memcpy(newArray, this->Array,
((usedSize+7)/8)*sizeof(unsigned char));
if (!this->SaveUserArray)
{
delete[] this->Array;
}
}
if (newSize < this->Size)
{
this->MaxId = newSize-1;
}
this->Size = newSize;
this->Array = newArray;
this->SaveUserArray = 0;
return 1;
}
// Set the number of n-tuples in the array.
void vtkBitArray::SetNumberOfTuples(vtkIdType number)
{
this->SetNumberOfValues(number*this->NumberOfComponents);
}
// Get a pointer to a tuple at the ith location. This is a dangerous method
// (it is not thread safe since a pointer is returned).
double *vtkBitArray::GetTuple(vtkIdType i)
{
if ( this->TupleSize < this->NumberOfComponents )
{
this->TupleSize = this->NumberOfComponents;
delete [] this->Tuple;
this->Tuple = new double[this->TupleSize];
}
int loc = this->NumberOfComponents*i;
for (int j=0; j<this->NumberOfComponents; j++)
{
this->Tuple[j] = (double)this->GetValue(loc+j);
}
return this->Tuple;
}
// Copy the tuple value into a user-provided array.
void vtkBitArray::GetTuple(vtkIdType i, double * tuple)
{
vtkIdType loc = this->NumberOfComponents*i;
for (int j=0; j<this->NumberOfComponents; j++)
{
tuple[j] = (double)this->GetValue(loc+j);
}
}
// Set the tuple value at the ith location in the array.
void vtkBitArray::SetTuple(vtkIdType i, const float * tuple)
{
vtkIdType loc = i * this->NumberOfComponents;
for (int j=0; j<this->NumberOfComponents; j++)
{
this->SetValue(loc+j,(int)tuple[j]);
}
}
void vtkBitArray::SetTuple(vtkIdType i, const double * tuple)
{
vtkIdType loc = i * this->NumberOfComponents;
for (int j=0; j<this->NumberOfComponents; j++)
{
this->SetValue(loc+j,(int)tuple[j]);
}
}
// Insert (memory allocation performed) the tuple into the ith location
// in the array.
void vtkBitArray::InsertTuple(vtkIdType i, const float * tuple)
{
vtkIdType loc = this->NumberOfComponents*i;
for (int j=0; j<this->NumberOfComponents; j++)
{
this->InsertValue(loc+j,(int)tuple[j]);
}
}
void vtkBitArray::InsertTuple(vtkIdType i, const double * tuple)
{
vtkIdType loc = this->NumberOfComponents*i;
for (int j=0; j<this->NumberOfComponents; j++)
{
this->InsertValue(loc+j,(int)tuple[j]);
}
}
// Insert (memory allocation performed) the tuple onto the end of the array.
vtkIdType vtkBitArray::InsertNextTuple(const float * tuple)
{
for (int i=0; i<this->NumberOfComponents; i++)
{
this->InsertNextValue((int)tuple[i]);
}
return this->MaxId / this->NumberOfComponents;
}
vtkIdType vtkBitArray::InsertNextTuple(const double * tuple)
{
for (int i=0; i<this->NumberOfComponents; i++)
{
this->InsertNextValue((int)tuple[i]);
}
return this->MaxId / this->NumberOfComponents;
}
void vtkBitArray::InsertComponent(vtkIdType i, int j, double c)
{
this->InsertValue(i*this->NumberOfComponents + j,
static_cast<int>(c));
}
// Set the data component at the ith tuple and jth component location.
// Note that i<NumberOfTuples and j<NumberOfComponents. Make sure enough
// memory has been allocated (use SetNumberOfTuples() and
// SetNumberOfComponents()).
void vtkBitArray::SetComponent(vtkIdType i, int j, double c)
{
this->SetValue(i*this->NumberOfComponents + j, static_cast<int>(c));
}
|