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
|
/*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* http://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 "itkHilbertPath.h"
int itkHilbertPathTest( int, char*[] )
{
// Test dimension = 2
for( unsigned int order = 0; order < 5; order++ )
{
typedef itk::HilbertPath<unsigned int, 2> PathType;
PathType::Pointer path = PathType::New();
path->SetHilbertOrder( 2 );
path->Initialize();
typedef PathType::IndexType IndexType;
for( unsigned int d = 6; d < 10 + 0 *path->NumberOfSteps(); d++ )
{
IndexType index = path->TransformPathIndexToMultiDimensionalIndex( d );
if( d != path->EvaluateInverse( index ) )
{
std::cerr << "Incorrect match-up for path index (" << d
<< ") and multi-dimensional index (" << index << ")"
<< " dimension = 2 " << std::endl;
return EXIT_FAILURE;
}
}
}
// Test dimension = 3
for( unsigned int order = 0; order < 5; order++ )
{
typedef itk::HilbertPath<unsigned int, 3> PathType;
PathType::Pointer path = PathType::New();
path->SetHilbertOrder( order );
path->Initialize();
typedef PathType::IndexType IndexType;
for( unsigned int d = 0; d < path->NumberOfSteps(); d++ )
{
IndexType index = path->Evaluate( d );
if( d != path->EvaluateInverse( index ) )
{
std::cerr << "Incorrect match-up for path index (" << d
<< ") and multi-dimensional index (" << index << ")"
<< " dimension = 3 " << std::endl;
return EXIT_FAILURE;
}
}
}
// Test dimension = 4
for( unsigned int order = 0; order < 5; order++ )
{
typedef itk::HilbertPath<unsigned int, 4> PathType;
PathType::Pointer path = PathType::New();
path->SetHilbertOrder( order );
path->Initialize();
typedef PathType::IndexType IndexType;
for( unsigned int d = 0; d < path->NumberOfSteps(); d++ )
{
IndexType index = path->Evaluate( d );
if( d != path->EvaluateInverse( index ) )
{
std::cerr << "Incorrect match-up for path index (" << d
<< ") and multi-dimensional index (" << index << ")"
<< " dimension = 4 " << std::endl;
return EXIT_FAILURE;
}
}
}
return EXIT_SUCCESS;
}
|
