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
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-FileCopyrightText: Copyright 2008 Sandia Corporation
// SPDX-License-Identifier: LicenseRef-BSD-3-Clause-Sandia-USGov
#include "vtkArraySort.h"
VTK_ABI_NAMESPACE_BEGIN
vtkArraySort::vtkArraySort() = default;
vtkArraySort::vtkArraySort(DimensionT i)
: Storage(1)
{
this->Storage[0] = i;
}
vtkArraySort::vtkArraySort(DimensionT i, DimensionT j)
: Storage(2)
{
this->Storage[0] = i;
this->Storage[1] = j;
}
vtkArraySort::vtkArraySort(DimensionT i, DimensionT j, DimensionT k)
: Storage(3)
{
this->Storage[0] = i;
this->Storage[1] = j;
this->Storage[2] = k;
}
vtkArraySort::DimensionT vtkArraySort::GetDimensions() const
{
return static_cast<vtkArraySort::DimensionT>(this->Storage.size());
}
void vtkArraySort::SetDimensions(DimensionT dimensions)
{
this->Storage.assign(dimensions, 0);
}
vtkArraySort::DimensionT& vtkArraySort::operator[](DimensionT i)
{
return this->Storage[i];
}
const vtkArraySort::DimensionT& vtkArraySort::operator[](DimensionT i) const
{
return this->Storage[i];
}
bool vtkArraySort::operator==(const vtkArraySort& rhs) const
{
return this->Storage == rhs.Storage;
}
bool vtkArraySort::operator!=(const vtkArraySort& rhs) const
{
return !(*this == rhs);
}
ostream& operator<<(ostream& stream, const vtkArraySort& rhs)
{
for (vtkArraySort::DimensionT i = 0; i != rhs.GetDimensions(); ++i)
{
if (i)
stream << ",";
stream << rhs[i];
}
return stream;
}
VTK_ABI_NAMESPACE_END
|
