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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkFEMPArrayTest.cxx,v $
Language: C++
Date: $Date: 2006-11-07 23:23:16 $
Version: $Revision: 1.8 $
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 debug warnings in MS compiler
#ifdef _MSC_VER
#pragma warning(disable: 4786)
#endif
#include <iostream>
#include "itkFEMLoadImplementationGenericLandmarkLoad.h"
#include "itkFEMElement2DC0LinearQuadrilateralMembrane.h"
#include "itkFEM.h"
#include "itkFEMLinearSystemWrapperItpack.h"
//
int itkFEMPArrayTest(int, char*[])
{
typedef itk::fem::Node NodeType;
typedef itk::fem::Element ElementType;
typedef NodeType::ArrayType ArrayType;
typedef itk::fem::FEMP<NodeType> FEMPointer;
ArrayType array;
NodeType::Pointer n1 = NodeType::New();
ElementType::VectorType pt(2);
pt[0]=0.;
pt[1]=0.;
n1->SetCoordinates(pt);
array.push_back( FEMPointer(&*n1));
n1=NodeType::New();
pt[0]=1.;
pt[1]=1.;
n1->SetCoordinates(pt);
array.push_back( FEMPointer(&*n1));
n1=NodeType::New();
pt[0]=3.;
pt[1]=2.;
n1->SetCoordinates(pt);
array.push_back( FEMPointer(&*n1));
n1=NodeType::New();
pt[0]=0.;
pt[1]=3.;
n1->SetCoordinates(pt);
array.push_back( FEMPointer(&*n1));
array.Renumber();
std::cout << "Nodes\n";
try
{
array.Find(0);
array.Find(1);
array.Find(2);
array.Find(3);
}
catch ( itk::ExceptionObject &e)
{
std::cout << "Exception caught: " << e << std::endl;
return EXIT_FAILURE;
}
// try an element with GN larger than the array size
n1=NodeType::New();
pt[0]=0.;
pt[1]=3.;
n1->SetCoordinates(pt);
n1->GN = 200;
array.push_back( FEMPointer(&*n1));
NodeType::Pointer node;
try
{
node = &*array.Find(200);
}
catch ( itk::ExceptionObject &e)
{
std::cout << "Exception caught: " << e << std::endl;
return EXIT_FAILURE;
}
try
{
// Intentionally fail, by asking for a non-existing element
node = &*array.Find(1000);
std::cout << "Error: exception should have been thrown here... " << std::endl;
return EXIT_FAILURE;
}
catch ( itk::ExceptionObject &e)
{
std::cout << "Passed Exception test: " << e << std::endl;
}
// Use the node in order to avoid warning for unused variable
ElementType::VectorType coordinates = node->GetCoordinates();
std::cout << "Coordinates = " << std::endl;
for( unsigned int c=0; c<coordinates.size(); c++)
{
std::cout << coordinates[c] << " " << std::endl;
}
std::cout << "Test PASSED!\n";
return EXIT_SUCCESS;
}
|
