File: itkFixedArrayTest.cxx

package info (click to toggle)
insighttoolkit5 5.4.3-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 704,384 kB
  • sloc: cpp: 783,592; ansic: 628,724; xml: 44,704; fortran: 34,250; python: 22,874; sh: 4,078; pascal: 2,636; lisp: 2,158; makefile: 464; yacc: 328; asm: 205; perl: 203; lex: 146; tcl: 132; javascript: 98; csh: 81
file content (175 lines) | stat: -rw-r--r-- 5,075 bytes parent folder | download
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
/*=========================================================================
 *
 *  Copyright NumFOCUS
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *         https://www.apache.org/licenses/LICENSE-2.0.txt
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 *=========================================================================*/

#include <iostream>
#include "itkFixedArray.h"

// Explicit instantiation to make sure all methods are compiled.
template class itk::FixedArray<float, 3>;

void
Set_c_Array(int x[3])
{
  x[0] = 1;
  x[1] = 2;
  x[2] = 3;
}

void
Print_Array(itk::FixedArray<int, 3> x, std::ostream & os)
{
  os << '{' << x[0] << ',' << x[1] << ',' << x[2] << '}' << std::endl;
}

void
Print_c_ArrayConst(const int x[3], std::ostream & os)
{
  os << '{' << x[0] << ',' << x[1] << ',' << x[2] << '}' << std::endl;
}

void
Print_Array5(itk::FixedArray<int, 5> x, std::ostream & os)
{
  os << '{' << x[0] << ',' << x[1] << ',' << x[2] << ',' << x[3] << ',' << x[4] << '}' << std::endl;
}

int
itkFixedArrayTest(int, char *[])
{
  // Test out many combinations of using c-style arrays and FixedArray

  int c_Array1[3] = { 0, 0, 0 };

  Set_c_Array(c_Array1);
  Print_Array(c_Array1, std::cout);
  Print_c_ArrayConst(c_Array1, std::cout);

  int c_Array2[3] = { 0, 0, 0 };
  Print_Array(c_Array2, std::cout);

  int                     array3Init[3] = { 4, 4, 4 };
  itk::FixedArray<int, 3> array3 = array3Init;
  Print_Array(array3, std::cout);
  Print_c_ArrayConst(array3.GetDataPointer(), std::cout);

  Set_c_Array(array3.GetDataPointer());
  Print_Array(array3, std::cout);

  itk::FixedArray<int, 3> array4;
  array4.Fill(0);
  Print_Array(array4, std::cout);

  // Test operator!= and operator==
  if (array4 != array4)
    return EXIT_FAILURE; // should be equal
  if (!(array4 == array4))
    return EXIT_FAILURE; // should be equal

  // Test Get/Set element
  constexpr unsigned int           n = 20;
  itk::FixedArray<unsigned int, n> array20;
  for (unsigned int i = 0; i < n; ++i)
  {
    array20.SetElement(i, i);
  }

  for (unsigned int k = 0; k < n; ++k)
  {
    if (array20.GetElement(k) != k)
    {
      std::cerr << "Set/Get element test failed" << std::endl;
      return EXIT_FAILURE;
    }
  }

  std::cout << "FixedArray<unsigned int, 20>::Iterator it = array20.Begin();" << std::endl;
  itk::FixedArray<unsigned int, 20>::Iterator it = array20.Begin();
  while (it != array20.End())
  {
    std::cout << *it << std::endl;
    ++it;
  }

  std::cout << "FixedArray<unsigned int, 20>::Iterator it = array20.End();" << std::endl;
  itk::FixedArray<unsigned int, 20>::Iterator bit = array20.End();
  while (--bit >= array20.Begin())
  {
    std::cout << *bit << std::endl;
  }

  std::cout << "FixedArray<unsigned int, 20>::ConstIterator it = array20.Begin();" << std::endl;
  itk::FixedArray<unsigned int, 20>::ConstIterator cit = array20.Begin();
  while (cit != array20.End())
  {
    std::cout << *cit << std::endl;
    ++cit;
  }

  std::cout << "FixedArray<unsigned int, 20>::reverse_iterator rit = array20.rbegin();" << std::endl;
  itk::FixedArray<unsigned int, 20>::reverse_iterator rit = array20.rbegin();
  while (rit != array20.rend())
  {
    std::cout << *rit << std::endl;
    ++rit;
  }

  std::cout << "FixedArray<unsigned int, 20>::const_reverse_iterator crit = array20.rbegin();" << std::endl;
  itk::FixedArray<unsigned int, 20>::const_reverse_iterator crit = array20.rbegin();
  while (crit != array20.rend())
  {
    std::cout << *crit << std::endl;
    ++crit;
  }

  // Try all index types
#define TRY_INDEX_CONST(T)                      \
  {                                             \
    T in = 10;                                  \
    if (array20[in] != 10)                      \
    {                                           \
      std::cerr << "index failed" << std::endl; \
      return EXIT_FAILURE;                      \
    }                                           \
  }                                             \
  ITK_MACROEND_NOOP_STATEMENT

  TRY_INDEX_CONST(short);
  TRY_INDEX_CONST(unsigned short);
  TRY_INDEX_CONST(int);
  TRY_INDEX_CONST(unsigned int);
  TRY_INDEX_CONST(long);
  TRY_INDEX_CONST(unsigned long);
  TRY_INDEX_CONST(long long);
  TRY_INDEX_CONST(unsigned long long);
#define TRY_INDEX(T)  \
  {                   \
    T in = 10;        \
    array20[in] = 10; \
  }                   \
  ITK_MACROEND_NOOP_STATEMENT

  TRY_INDEX(short);
  TRY_INDEX(unsigned short);
  TRY_INDEX(int);
  TRY_INDEX(unsigned int);
  TRY_INDEX(long);
  TRY_INDEX(unsigned long);
  TRY_INDEX(long long);
  TRY_INDEX(unsigned long long);
  return EXIT_SUCCESS;
}