blob: a0ccd200bfb7c6b89a9fa80c577db48f30da1bc7 (
plain) (
blame)
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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <deque>
// iterator erase(const_iterator f, const_iterator l)
// Erasing items from the beginning or the end of a deque shall not invalidate iterators
// to items that were not erased.
#include <deque>
#include <cstdint>
#include <cassert>
template <typename C>
void del_at_start(C c, size_t num)
{
typename C::iterator first = c.begin();
typename C::iterator last = first + num;
typename C::iterator it1 = last;
typename C::iterator it2 = c.end() - 1;
c.erase (first, last);
typename C::iterator it3 = c.begin();
typename C::iterator it4 = c.end() - 1;
assert( it1 == it3);
assert( *it1 == *it3);
assert(&*it1 == &*it3);
assert( it2 == it4);
assert( *it2 == *it4);
assert(&*it2 == &*it4);
}
template <typename C>
void del_at_end(C c, size_t num)
{
typename C::iterator last = c.end();
typename C::iterator first = last - num;
typename C::iterator it1 = c.begin();
typename C::iterator it2 = first - 1;
c.erase (first, last);
typename C::iterator it3 = c.begin();
typename C::iterator it4 = c.end() - 1;
assert( it1 == it3);
assert( *it1 == *it3);
assert(&*it1 == &*it3);
assert( it2 == it4);
assert( *it2 == *it4);
assert(&*it2 == &*it4);
}
int main()
{
std::deque<int> queue;
for (int i = 0; i < 20; ++i)
queue.push_back(i);
while (queue.size() > 1)
{
for (size_t i = 1; i < queue.size(); ++i)
{
del_at_start(queue, i);
del_at_end (queue, i);
}
queue.pop_back();
}
}
|
