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
|
/*=========================================================================
*
* 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 "itkMath.h"
#include "itkPriorityQueueContainer.h"
int
itkPriorityQueueTest(int, char *[])
{
using ElementIdentifier = itk::IdentifierType;
using MinPQElementType = itk::MinPriorityQueueElementWrapper<size_t, double, ElementIdentifier>;
using MaxPQElementType = itk::MaxPriorityQueueElementWrapper<size_t, double, ElementIdentifier>;
using MinPQType = itk::PriorityQueueContainer<MinPQElementType, MinPQElementType, double, ElementIdentifier>;
auto min_priority_queue = MinPQType::New();
std::cout << min_priority_queue->GetNameOfClass() << std::endl;
using MaxPQType = itk::PriorityQueueContainer<MaxPQElementType, MaxPQElementType, double, ElementIdentifier>;
auto max_priority_queue = MaxPQType::New();
std::list<double> sequence;
sequence.push_back(-0.1);
sequence.push_back(0.1);
sequence.push_back(0.4);
sequence.push_back(-0.2);
sequence.push_back(-0.3);
sequence.push_back(0.3);
sequence.push_back(0.2);
sequence.push_back(0.5);
sequence.push_back(-0.6);
sequence.push_back(-0.5);
sequence.push_back(0.6);
sequence.push_back(1.);
sequence.push_back(-1.);
std::list<double>::const_iterator it = sequence.begin();
size_t i = 0;
for (; it != sequence.end(); ++it, ++i)
{
min_priority_queue->Push(MinPQElementType(i, *it));
max_priority_queue->Push(MaxPQElementType(i, *it));
}
sequence.sort();
it = sequence.begin();
i = sequence.size();
std::cout << "Min Priority Queue ";
while (!min_priority_queue->Empty())
{
if (itk::Math::NotAlmostEquals(min_priority_queue->Peek().m_Priority, *it))
{
std::cout << min_priority_queue->Peek().m_Priority << ' ' << *it << std::endl;
return EXIT_FAILURE;
}
if (min_priority_queue->Size() != i)
{
std::cout << "Size " << min_priority_queue->Size() << ' ' << i << std::endl;
return EXIT_FAILURE;
}
min_priority_queue->Pop();
++it;
--i;
}
std::cout << "OK" << std::endl;
std::cout << "Max Priority Queue ";
while (!max_priority_queue->Empty())
{
if (itk::Math::NotAlmostEquals(max_priority_queue->Peek().m_Priority, sequence.back()))
{
std::cout << max_priority_queue->Peek().m_Priority << ' ' << sequence.back() << std::endl;
return EXIT_FAILURE;
}
if (max_priority_queue->Size() != sequence.size())
{
std::cout << "Size " << max_priority_queue->Size() << ' ' << sequence.size() << std::endl;
return EXIT_FAILURE;
}
max_priority_queue->Pop();
if (max_priority_queue->Empty())
{
break;
}
sequence.pop_back();
}
std::cout << "OK" << std::endl;
return EXIT_SUCCESS;
}
|
