blob: b1b8ff82de355bb1016510c01cf7756ee7821383 (
plain)
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
|
// Copyright (C) 2008-2016 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/>.
// NB: This issue affected only debug-mode.
#include <vector>
#include <algorithm>
#include <iterator>
// http://gcc.gnu.org/ml/libstdc++/2008-05/msg00039.html
void test01()
{
typedef std::vector<unsigned> array_t;
typedef std::back_insert_iterator<array_t> bii_t;
array_t a;
// Push 5 elements.
a.push_back(0);
a.push_back(1);
a.push_back(2);
a.push_back(3);
a.push_back(4);
// Ensure that there is enough space for other two elements.
// (2 + 5 = 7)
if (a.capacity() < 7)
a.reserve(7);
// Add two new elements.
std::copy(a.begin(), a.begin() + 2, bii_t(a));
}
int main()
{
test01();
return 0;
}
|
