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
|
/*=========================================================================
*
* 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.
*
*=========================================================================*/
// First include the header file to be tested:
#include "itkNeighborhoodAllocator.h"
#include <gtest/gtest.h>
#include <type_traits> // For is_pointer, is_const, and remove_reference.
namespace
{
template <typename T>
void
Expect_data_returns_pointer_to_first_element(T & container)
{
static_assert(std::is_pointer_v<decltype(container.data())>, "data() must return a pointer");
static_assert(std::is_const_v<std::remove_reference_t<decltype(*(container.data()))>> ==
std::is_const_v<std::remove_reference_t<decltype(container[0])>>,
"*container.data() and container[0] must have the same const-ness");
EXPECT_EQ(container.data(), &container[0]);
}
// Counts the number of instances of the class.
class ObjectCounter
{
private:
static size_t m_Count;
public:
ITK_DISALLOW_COPY_AND_MOVE(ObjectCounter);
ObjectCounter() noexcept { ++m_Count; }
~ObjectCounter() { --m_Count; }
static size_t
GetCount()
{
return m_Count;
}
};
size_t ObjectCounter::m_Count{};
} // namespace
// Tests that for a non-empty NeighborhoodAllocator, data() returns a pointer to the first element.
TEST(NeighborhoodAllocator, DataReturnsPointerToFirstElement)
{
itk::NeighborhoodAllocator<int> neighborhoodAllocator;
neighborhoodAllocator.set_size(1);
neighborhoodAllocator[0] = 0;
Expect_data_returns_pointer_to_first_element(neighborhoodAllocator);
const itk::NeighborhoodAllocator<int> constNeighborhoodAllocator = neighborhoodAllocator;
Expect_data_returns_pointer_to_first_element(constNeighborhoodAllocator);
}
// Tests that neighborhoodAllocator.Allocate(i) sets the size to the specified number.
TEST(NeighborhoodAllocator, AllocateSetsSizeToSpecifiedNumber)
{
for (unsigned int i{}; i <= 3; ++i)
{
itk::NeighborhoodAllocator<int> neighborhoodAllocator;
neighborhoodAllocator.Allocate(i);
EXPECT_EQ(neighborhoodAllocator.size(), i);
}
}
// Tests that neighborhoodAllocator.Deallocate() sets the size to zero.
TEST(NeighborhoodAllocator, DeallocateSetsSizeToZero)
{
for (unsigned int i{}; i <= 3; ++i)
{
itk::NeighborhoodAllocator<int> neighborhoodAllocator;
neighborhoodAllocator.set_size(i);
neighborhoodAllocator.Deallocate();
EXPECT_EQ(neighborhoodAllocator.size(), 0);
}
}
// Tests that neighborhoodAllocator.Allocate(i) constructs the specified number of objects.
TEST(NeighborhoodAllocator, AllocateConstructsTheSpecifiedNumberOfObjects)
{
ASSERT_EQ(ObjectCounter::GetCount(), 0);
for (unsigned int i{}; i <= 3; ++i)
{
itk::NeighborhoodAllocator<ObjectCounter> neighborhoodAllocator;
neighborhoodAllocator.Allocate(i);
EXPECT_EQ(ObjectCounter::GetCount(), i);
}
}
// Tests that neighborhoodAllocator.Deallocate() destructs all objects that were there.
TEST(NeighborhoodAllocator, DeallocateDestructsAllObjects)
{
ASSERT_EQ(ObjectCounter::GetCount(), 0);
for (unsigned int i{}; i <= 3; ++i)
{
itk::NeighborhoodAllocator<ObjectCounter> neighborhoodAllocator;
neighborhoodAllocator.set_size(i);
ASSERT_EQ(ObjectCounter::GetCount(), i);
neighborhoodAllocator.Deallocate();
// Expect that there are zero objects left, after Deallocate():
EXPECT_EQ(ObjectCounter::GetCount(), 0);
}
}
|
