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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
/** \file test_enumerator.h */
// Copyright (C) 2010 Daniel Burrows
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; see the file COPYING. If not, write to
// the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
#include <generic/util/enumerator.h>
#include <boost/array.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/weak_ptr.hpp>
using aptitude::util::enumerator;
using aptitude::util::iterator_enumerator;
using aptitude::util::iterator_enumerator_with_keepalive;
using boost::weak_ptr;
struct fourNumbers
{
std::vector<int> numbers;
boost::shared_ptr<std::vector<int> > numbersShared;
typedef iterator_enumerator<std::vector<int>::const_iterator> int_enum;
typedef iterator_enumerator_with_keepalive<std::vector<int>::const_iterator,
std::vector<int> > int_keepalive_enum;
fourNumbers()
: numbersShared(new std::vector<int>)
{
for(int i = 1; i <= 4; ++i)
{
numbers.push_back(i);
numbersShared->push_back(i);
}
}
};
BOOST_FIXTURE_TEST_CASE(iteratorEnumeratorCurrent, fourNumbers)
{
int_enum e1(numbers.begin(), numbers.end());
int_enum e2(numbers.begin() + 1, numbers.end());
int_enum e3(numbers.begin() + 2, numbers.end());
int_enum e4(numbers.begin() + 3, numbers.end());
BOOST_REQUIRE(e1.advance());
BOOST_CHECK_EQUAL(e1.get_current(), 1);
BOOST_REQUIRE(e2.advance());
BOOST_CHECK_EQUAL(e2.get_current(), 2);
BOOST_REQUIRE(e3.advance());
BOOST_CHECK_EQUAL(e3.get_current(), 3);
BOOST_REQUIRE(e4.advance());
BOOST_CHECK_EQUAL(e4.get_current(), 4);
}
BOOST_FIXTURE_TEST_CASE(iteratorEnumeratorAdvance, fourNumbers)
{
int_enum e1(numbers.begin(), numbers.end());
int_enum e2(numbers.begin() + 1, numbers.end());
int_enum e3(numbers.begin() + 2, numbers.end());
int_enum e4(numbers.begin() + 3, numbers.end());
int_enum e_end(numbers.end(), numbers.end());
BOOST_REQUIRE(e1.advance());
BOOST_REQUIRE(e1.advance());
BOOST_CHECK_EQUAL(e1.get_current(), 2);
BOOST_REQUIRE(e2.advance());
BOOST_REQUIRE(e2.advance());
BOOST_CHECK_EQUAL(e2.get_current(), 3);
BOOST_REQUIRE(e3.advance());
BOOST_REQUIRE(e3.advance());
BOOST_CHECK_EQUAL(e3.get_current(), 4);
BOOST_REQUIRE(e4.advance());
BOOST_CHECK(!e4.advance());
BOOST_CHECK(!e_end.advance());
}
BOOST_FIXTURE_TEST_CASE(iteratorEnumeratorKeepaliveCurrent, fourNumbers)
{
int_keepalive_enum e1(numbersShared->begin(), numbersShared->end(),
numbersShared);
int_keepalive_enum e2(numbersShared->begin() + 1, numbersShared->end(),
numbersShared);
int_keepalive_enum e3(numbersShared->begin() + 2, numbersShared->end(),
numbersShared);
int_keepalive_enum e4(numbersShared->begin() + 3, numbersShared->end(),
numbersShared);
BOOST_REQUIRE(e1.advance());
BOOST_CHECK_EQUAL(e1.get_current(), 1);
BOOST_REQUIRE(e2.advance());
BOOST_CHECK_EQUAL(e2.get_current(), 2);
BOOST_REQUIRE(e3.advance());
BOOST_CHECK_EQUAL(e3.get_current(), 3);
BOOST_REQUIRE(e4.advance());
BOOST_CHECK_EQUAL(e4.get_current(), 4);
}
BOOST_FIXTURE_TEST_CASE(iteratorEnumeratorKeepaliveAdvance, fourNumbers)
{
int_keepalive_enum e1(numbersShared->begin(), numbersShared->end(),
numbersShared);
int_keepalive_enum e2(numbersShared->begin() + 1, numbersShared->end(),
numbersShared);
int_keepalive_enum e3(numbersShared->begin() + 2, numbersShared->end(),
numbersShared);
int_keepalive_enum e4(numbersShared->begin() + 3, numbersShared->end(),
numbersShared);
int_keepalive_enum e_end(numbersShared->end(), numbersShared->end(),
numbersShared);
BOOST_REQUIRE(e1.advance());
BOOST_REQUIRE(e1.advance());
BOOST_CHECK_EQUAL(e1.get_current(), 2);
BOOST_REQUIRE(e2.advance());
BOOST_REQUIRE(e2.advance());
BOOST_CHECK_EQUAL(e2.get_current(), 3);
BOOST_REQUIRE(e3.advance());
BOOST_REQUIRE(e3.advance());
BOOST_CHECK_EQUAL(e3.get_current(), 4);
BOOST_REQUIRE(e4.advance());
BOOST_CHECK(!e4.advance());
BOOST_CHECK(!e_end.advance());
}
BOOST_FIXTURE_TEST_CASE(iteratorEnumeratorKeepalive, fourNumbers)
{
weak_ptr<std::vector<int> > numbersWeak(numbersShared);
{
int_keepalive_enum e(numbersShared->begin(),
numbersShared->end(),
numbersShared);
BOOST_CHECK(!numbersWeak.expired());
numbersShared.reset();
BOOST_CHECK(!numbersWeak.expired());
}
BOOST_CHECK(numbersWeak.expired());
}
|
