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
|
// Deque iterator invalidation tests
// Copyright (C) 2003, 2004, 2005, 2006, 2009 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library 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 3, or (at your option)
// any later version.
// This library 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 library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
#include <debug/deque>
#include <testsuite_hooks.h>
using __gnu_debug::deque;
bool test = true;
// Insert
void test03()
{
deque<int> v(10, 17);
// Insert a single element
deque<int>::iterator before = v.begin() + 6;
deque<int>::iterator at = before + 1;
deque<int>::iterator after = at;
at = v.insert(at, 42);
VERIFY(before._M_singular());
VERIFY(at._M_dereferenceable());
VERIFY(after._M_singular());
// Insert multiple copies
before = v.begin() + 6;
at = before + 1;
v.insert(at, 3, 42);
VERIFY(before._M_singular());
VERIFY(at._M_singular());
// Insert iterator range
static int data[] = { 2, 3, 5, 7 };
before = v.begin() + 6;
at = before + 1;
v.insert(at, &data[0], &data[0] + 4);
VERIFY(before._M_singular());
VERIFY(at._M_singular());
}
int main()
{
test03();
return 0;
}
|
