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
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#include "vtkMultiTimeStepAlgorithm.h"
#include "vtkCommand.h"
#include "vtkCompositeDataPipeline.h"
#include "vtkDataSet.h"
#include "vtkInformation.h"
#include "vtkInformationDoubleVectorKey.h"
#include "vtkInformationKey.h"
#include "vtkInformationVector.h"
#include "vtkMultiBlockDataSet.h"
#include "vtkObjectFactory.h"
#include "vtkSmartPointer.h"
#include "vtkStreamingDemandDrivenPipeline.h"
VTK_ABI_NAMESPACE_BEGIN
vtkStandardNewMacro(vtkMultiTimeStepAlgorithm);
vtkInformationKeyMacro(vtkMultiTimeStepAlgorithm, UPDATE_TIME_STEPS, DoubleVector);
//------------------------------------------------------------------------------
// Instantiate object so that cell data is not passed to output.
vtkMultiTimeStepAlgorithm::vtkMultiTimeStepAlgorithm()
{
this->RequestUpdateIndex = 0;
this->SetNumberOfInputPorts(1);
this->CacheData = false;
this->NumberOfCacheEntries = 1;
}
//------------------------------------------------------------------------------
bool vtkMultiTimeStepAlgorithm::IsInCache(double time, size_t& idx)
{
std::vector<TimeCache>::iterator it = this->Cache.begin();
for (idx = 0; it != this->Cache.end(); ++it, ++idx)
{
if (time == it->TimeValue)
{
return true;
}
}
return false;
}
//------------------------------------------------------------------------------
vtkTypeBool vtkMultiTimeStepAlgorithm::ProcessRequest(
vtkInformation* request, vtkInformationVector** inputVector, vtkInformationVector* outputVector)
{
// create the output
if (request->Has(vtkDemandDrivenPipeline::REQUEST_DATA_OBJECT()))
{
return this->RequestDataObject(request, inputVector, outputVector);
}
// set update extent
if (request->Has(vtkCompositeDataPipeline::REQUEST_UPDATE_EXTENT()))
{
int retVal(1);
vtkInformation* inInfo = inputVector[0]->GetInformationObject(0);
if (this->RequestUpdateIndex == 0)
{
retVal = this->RequestUpdateExtent(request, inputVector, outputVector);
double* upTimes = inInfo->Get(UPDATE_TIME_STEPS());
int numUpTimes = inInfo->Length(UPDATE_TIME_STEPS());
this->UpdateTimeSteps.clear();
for (int i = 0; i < numUpTimes; i++)
{
this->UpdateTimeSteps.push_back(upTimes[i]);
}
inInfo->Remove(UPDATE_TIME_STEPS());
}
size_t nTimeSteps = this->UpdateTimeSteps.size();
if (nTimeSteps > 0)
{
bool inCache = true;
for (size_t i = 0; i < nTimeSteps; i++)
{
size_t idx;
if (!this->IsInCache(this->UpdateTimeSteps[i], idx))
{
inCache = false;
break;
}
}
if (!inCache)
{
inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP(),
this->UpdateTimeSteps[this->RequestUpdateIndex]);
}
else
{
// Ask for any time step. This should not update unless something else changed.
inInfo->Remove(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP());
}
}
return retVal;
}
// generate the data
if (request->Has(vtkCompositeDataPipeline::REQUEST_DATA()))
{
int retVal = 1;
vtkInformation* inInfo = inputVector[0]->GetInformationObject(0);
auto inData = vtk::MakeSmartPointer(inInfo->Get(vtkDataObject::DATA_OBJECT()));
if (this->UpdateTimeSteps.empty())
{
vtkErrorMacro("No temporal data has been requested. ");
return 0;
}
size_t idx;
if (!this->IsInCache(this->UpdateTimeSteps[this->RequestUpdateIndex], idx))
{
auto inDataCopy = vtk::TakeSmartPointer(inData->NewInstance());
inDataCopy->ShallowCopy(inData);
this->Cache.emplace_back(this->UpdateTimeSteps[this->RequestUpdateIndex], inDataCopy);
}
this->RequestUpdateIndex++;
const size_t nTimeSteps = this->UpdateTimeSteps.size();
if (this->RequestUpdateIndex == static_cast<int>(nTimeSteps)) // all the time steps are here
{
// try calling the newer / recommended API first.
std::vector<vtkSmartPointer<vtkDataObject>> inputs(nTimeSteps);
for (size_t cc = 0; cc < nTimeSteps; ++cc)
{
if (this->IsInCache(this->UpdateTimeSteps[cc], idx))
{
inputs[cc] = this->Cache[idx].Data;
}
else
{
// This should never happen
vtkErrorMacro("exceptional condition reached! Please report.");
return 0;
}
}
retVal = this->Execute(request, inputs, outputVector);
this->UpdateTimeSteps.clear();
this->RequestUpdateIndex = 0;
if (!this->CacheData)
{
// No caching, remove all
this->Cache.clear();
}
else
{
// Caching, erase ones outside the cache
// Note that this is a first in first out implementation
size_t cacheSize = this->Cache.size();
if (cacheSize > this->NumberOfCacheEntries)
{
size_t nToErase = cacheSize - this->NumberOfCacheEntries;
this->Cache.erase(this->Cache.begin(), this->Cache.begin() + nToErase);
}
}
request->Remove(vtkStreamingDemandDrivenPipeline::CONTINUE_EXECUTING());
}
else
{
request->Set(vtkStreamingDemandDrivenPipeline::CONTINUE_EXECUTING(), 1);
}
return retVal;
}
// execute information
if (request->Has(vtkDemandDrivenPipeline::REQUEST_INFORMATION()))
{
// Upstream changed, clear the cache.
this->Cache.clear();
return this->RequestInformation(request, inputVector, outputVector);
}
return this->Superclass::ProcessRequest(request, inputVector, outputVector);
}
//------------------------------------------------------------------------------
void vtkMultiTimeStepAlgorithm::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
VTK_ABI_NAMESPACE_END
|
