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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkAMRDataInternals2.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 "vtkAMRDataInternals2.h"
#include "vtkUniformGrid.h"
#include "vtkObjectFactory.h"
#include <cassert>
vtkStandardNewMacro(vtkAMRDataInternals2);
vtkAMRDataInternals2::Block::Block(unsigned int i, vtkUniformGrid* g)
{
this->Index = i;
this->Grid = g;
}
//-----------------------------------------------------------------------------
vtkAMRDataInternals2::vtkAMRDataInternals2()
{
this->HasBlocksInserted = false;
}
void vtkAMRDataInternals2::Initialize(unsigned int size)
{
this->ClearSparseBlocks();
this->Blocks.clear();
if (size)
{
this->SparseBlocks.resize(size*8,NULL);
}
}
vtkAMRDataInternals2::~vtkAMRDataInternals2()
{
this->ClearSparseBlocks();
this->Blocks.clear();
}
void vtkAMRDataInternals2::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
void vtkAMRDataInternals2::Insert(unsigned int index, vtkUniformGrid* grid)
{
if(index < this->SparseBlocks.size())
{
this->SparseBlocks[index*8] = new Block(index,grid);
this->HasBlocksInserted = true;
return;
}
// Old behavior for consistency
this->Blocks.push_back(Block(index,grid));
int i = static_cast<int>(this->Blocks.size())-2;
while( i>=0 && this->Blocks[i].Index > this->Blocks[i+1].Index)
{
std::swap(this->Blocks[i],this->Blocks[i+1]);
i--;
}
}
vtkUniformGrid* vtkAMRDataInternals2::GetDataSet(unsigned int compositeIndex)
{
unsigned int i = compositeIndex*8;
if(i >= this->SparseBlocks.size() || !this->SparseBlocks[i])
{
return NULL;
}
return this->SparseBlocks[i]->Grid;
}
void vtkAMRDataInternals2::ShallowCopy(vtkObject *src)
{
if( src == this )
{
return;
}
if(vtkAMRDataInternals2 * hbds = vtkAMRDataInternals2::SafeDownCast(src))
{
this->Blocks = hbds->Blocks;
this->ClearSparseBlocks();
this->SparseBlocks = hbds->SparseBlocks;
this->HasBlocksInserted = hbds->HasBlocksInserted;
}
this->Modified();
}
void vtkAMRDataInternals2::ClearSparseBlocks()
{
std::vector<Block*>::iterator it = this->SparseBlocks.begin();
while(it < this->SparseBlocks.end())
{
if(*it) delete (*it);
it += 8;
}
this->SparseBlocks.clear();
this->HasBlocksInserted = false;
}
void vtkAMRDataInternals2::CompactBlocks() const
{
this->Blocks.clear();
std::vector<Block*>::const_iterator it = this->SparseBlocks.begin();
while(it < this->SparseBlocks.end())
{
if(*it) this->Blocks.push_back(**it);
it += 8;
}
this->HasBlocksInserted = false;
}
|
