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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkMapContainerTest.cxx,v $
Language: C++
Date: $Date: 2003-09-10 14:30:09 $
Version: $Revision: 1.7 $
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/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 notices for more information.
=========================================================================*/
// Disable warning for long symbol names in this file only
#ifdef _MSC_VER
#pragma warning ( disable : 4786 )
#endif
#include "itkMapContainer.h"
#include "itkPoint.h"
#include "itkVector.h"
#include <iostream>
#include <string>
/**
* Some typedefs to make things easier.
*/
typedef itk::Point<float,3> PointType;
typedef itk::Vector<float,3> VectorType;
typedef itk::MapContainer< unsigned long,
PointType > ContainerType;
typedef ContainerType::Pointer ContainerPointer;
int itkMapContainerTest(int, char* [] )
{
/**
* Create the Container
*/
ContainerPointer container = ContainerType::New();
PointType pointA;
PointType pointB;
PointType pointC;
PointType pointD;
VectorType displacement;
displacement[0] = 2;
displacement[1] = 5;
displacement[2] = 9;
pointA.Fill( 0.0 );
pointB = pointA + displacement;
pointC = pointB + displacement;
pointD = pointC + displacement;
container->SetElement( 0, pointA );
container->SetElement( 1, pointB );
container->SetElement( 2, pointC );
container->SetElement( 3, pointD );
ContainerType::Iterator p = container->Begin();
while( p != container->End() )
{
std::cout << p.Value() << std::endl;
p++;
}
container->Initialize();
if( container->Size() != 0 )
{
std::cerr << "Initialize() didn't get rid of elements" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
