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
|
/*=========================================================================
Program: Visualization Toolkit
Module: TestCompositeDataSetRange.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 <vtkCompositeDataIterator.h>
#include <vtkCompositeDataSetRange.h>
#include <vtkMultiBlockDataSet.h>
#include <vtkNew.h>
#include <vtkPolyData.h>
#include <vtkSmartPointer.h>
#include <algorithm>
#define TEST_FAIL(msg) \
std::cerr << "Test failed! " msg << "\n"; \
return false
namespace
{
bool TestCopy(vtkCompositeDataSet* src)
{
// Clone dataset:
auto dst = vtk::TakeSmartPointer(src->NewInstance());
// Create tree structure:
dst->CopyStructure(src);
{ // Copy dataset pointer into new dataset:
const auto srcRange = vtk::Range(src);
const auto dstRange = vtk::Range(dst);
std::copy(srcRange.begin(), srcRange.end(), dstRange.begin());
}
{ // Verify that the dataset pointers are correct:
const auto srcRange = vtk::Range(src);
const auto dstRange = vtk::Range(dst);
if (!std::equal(srcRange.begin(), srcRange.end(), dstRange.begin()))
{
TEST_FAIL("Range iterators failed with std::copy/std::equal.");
}
}
return true;
}
// Test that the for-range iterators behave the same as the regular iterators.
bool TestConfig(vtkCompositeDataSet* cds, vtk::CompositeDataSetOptions opts)
{
using Opts = vtk::CompositeDataSetOptions;
auto refIter = vtk::TakeSmartPointer(cds->NewIterator());
refIter->SetSkipEmptyNodes((opts & Opts::SkipEmptyNodes) != Opts::None);
refIter->InitTraversal();
// ref is a vtk::CompositeDataSetNodeReference:
for (auto node : vtk::Range(cds, opts))
{
if (refIter->IsDoneWithTraversal())
{
TEST_FAIL("Reference iterator finished before Range iterator.");
}
auto refDObj = refIter->GetCurrentDataObject();
// Test operator bool ()
if (node)
{
if (!refDObj)
{
TEST_FAIL("NodeReference::operator bool () incorrectly returned true.");
}
}
else if (refDObj)
{
TEST_FAIL("NodeReference::operator bool () incorrectly returned false.");
}
// Test GetDataObject()
if (node.GetDataObject() != refDObj)
{
TEST_FAIL("NodeReference::GetDataObject() does not match reference.");
}
// Test operator vtkDataObject* ()
if (node != refDObj)
{
TEST_FAIL("NodeReference::operator vtkDataObject* () "
"does not match reference.");
}
// Test operator -> ()
if (node)
{
if (node->GetMTime() != refDObj->GetMTime())
{
TEST_FAIL("NodeReference::operator -> () "
"does not match reference.");
}
}
// Test SetDataObject(vtkDataObject*)
{
// Set to invalid pointer, check that other iterator also shows same
// pointer
vtkSmartPointer<vtkDataObject> cache = node.GetDataObject();
vtkNew<vtkPolyData> dummy;
node.SetDataObject(dummy);
// Sanity check -- see note below about the buggy internal iterator's
// GetCurrentDataObject method. This check ensure that our iterators
// behave as expected when assigned to:
if (node.GetDataObject() != dummy)
{
TEST_FAIL("NodeReference::SetDataObject(vtkDataObject*) and "
"NodeReference::GetDataObject() are not sane.");
}
// NOTE refIter->GetCurrentDataObject is buggy -- it caches the
// vtkDataObject pointer internally, so if the dataset changes, the
// iterator will hold a stale value. Look up the data object in the
// dataset instead. See VTK issue #17529.
// vtkDataObject *refDummy = refIter->GetCurrentDataObject();
vtkDataObject* refDummy = refIter->GetDataSet()->GetDataSet(refIter);
node.SetDataObject(cache);
if (refDummy != dummy)
{
TEST_FAIL("NodeReference::SetDataObject(vtkDataObject*) "
"failed to set object.");
}
}
// Test operator=(vtkDataObject*)
{
// Set to invalid pointer, check that other iterator also shows same
// pointer
vtkSmartPointer<vtkDataObject> cache = node.GetDataObject();
vtkNew<vtkPolyData> dummy;
node = dummy; // NodeReference::operator=(vtkDataObject*)
// Sanity check -- see note below about the buggy internal iterator's
// GetCurrentDataObject method. This check ensure that our iterators
// behave as expected when assigned to:
if (node.GetDataObject() != dummy)
{
TEST_FAIL("NodeReference::operator=(vtkDataObject*) and "
"NodeReference::GetDataObject() are not sane.");
}
// NOTE refIter->GetCurrentDataObject is buggy -- it caches the
// vtkDataObject pointer internally, so if the dataset changes, the
// iterator will hold a stale value. Look up the data object in the
// dataset instead. See VTK issue #17529.
// vtkDataObject *refDummy = refIter->GetCurrentDataObject();
vtkDataObject* refDummy = refIter->GetDataSet()->GetDataSet(refIter);
node.SetDataObject(cache);
if (refDummy != dummy)
{
TEST_FAIL("NodeReference::operator=(vtkDataObject*) "
"failed to set object.");
}
}
// Test GetFlatIndex()
if (node.GetFlatIndex() != refIter->GetCurrentFlatIndex())
{
TEST_FAIL("NodeReference::GetFlatIndex() does not match reference.");
}
// Test HasMetaData
if (node.HasMetaData() != (refIter->HasCurrentMetaData() != 0))
{
TEST_FAIL("NodeReference::HasMetaData() does not match reference.");
}
refIter->GoToNextItem();
}
if (!refIter->IsDoneWithTraversal())
{
TEST_FAIL("Range iterator did not completely traverse composite dataset.");
}
return true;
}
bool TestOptions(vtkCompositeDataSet* cds)
{
using Opts = vtk::CompositeDataSetOptions;
if (!TestConfig(cds, Opts::None))
{
TEST_FAIL("Error while testing options 'None'.");
}
if (!TestConfig(cds, Opts::SkipEmptyNodes))
{
TEST_FAIL("Error while testing options 'SkipEmptyNodes'.");
}
if (!TestCopy(cds))
{
TEST_FAIL("Error while testing iterator copy.");
}
return true;
}
// Construct the following hierarchy for testing:
// M = MBDS; P = PolyData; 0 = null dataset
//
// ------------------------M------------------------ // depth 0
// | | | |
// P 0 -------------------M-- M // depth 1
// | | | | |
// -----M----- 0 P ------M ------------M // depth 2
// | | | | | | |
// 0 0 0 P 0 ------M----- 0 // depth 3
// | | |
// M 0 P // depth 4
// |
// P // depth 5
//
vtkSmartPointer<vtkCompositeDataSet> CreateDataSet()
{
auto addPolyData = [](unsigned int blockNum,
vtkMultiBlockDataSet* mbds) -> vtkSmartPointer<vtkPolyData> {
vtkNew<vtkPolyData> pd;
mbds->SetBlock(blockNum, pd);
return { pd };
};
auto addMultiBlock = [](unsigned int blockNum,
vtkMultiBlockDataSet* mbds) -> vtkSmartPointer<vtkMultiBlockDataSet> {
auto newMbds = vtkSmartPointer<vtkMultiBlockDataSet>::New();
mbds->SetBlock(blockNum, newMbds);
return newMbds;
};
auto addNullDataSet = [](unsigned int blockNum, vtkMultiBlockDataSet* mbds) -> void {
mbds->SetBlock(blockNum, nullptr);
};
auto cds00 = vtkSmartPointer<vtkMultiBlockDataSet>::New();
cds00->SetNumberOfBlocks(4);
addPolyData(0, cds00);
addNullDataSet(1, cds00);
auto cds10 = addMultiBlock(2, cds00);
auto cds11 = addMultiBlock(3, cds00);
cds10->SetNumberOfBlocks(4);
auto cds20 = addMultiBlock(0, cds10);
addNullDataSet(1, cds10);
addPolyData(2, cds10);
auto cds21 = addMultiBlock(3, cds10);
cds11->SetNumberOfBlocks(1);
auto cds22 = addMultiBlock(0, cds11);
cds20->SetNumberOfBlocks(3);
addNullDataSet(0, cds20);
addNullDataSet(1, cds20);
addNullDataSet(2, cds20);
cds21->SetNumberOfBlocks(2);
addPolyData(0, cds21);
addNullDataSet(1, cds21);
cds22->SetNumberOfBlocks(2);
auto cds30 = addMultiBlock(0, cds22);
addNullDataSet(1, cds22);
cds30->SetNumberOfBlocks(3);
auto cds40 = addMultiBlock(0, cds30);
addNullDataSet(1, cds30);
addPolyData(2, cds30);
cds40->SetNumberOfBlocks(1);
addPolyData(0, cds40);
// explicit move needed to silence warnings about C++11 defect
return std::move(cds00);
}
} // end anon namespace
int TestCompositeDataSetRange(int, char*[])
{
auto cds = CreateDataSet();
return TestOptions(cds) ? EXIT_SUCCESS : EXIT_FAILURE;
}
|