blob: e0bd8618300a73705dbf1c803c7a0251c18c964e (
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
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
|
// 2002-06-28 pme
// Copyright (C) 2002 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
// 23.2.3 container adaptros
#include <queue>
#include <stack>
#include <testsuite_hooks.h>
// libstdc++/7157
void
test01()
{
std::queue<int> q;
q.push(1);
q.front();
q.pop();
}
// libstdc++/7158
void
test02()
{
std::stack<int> st;
st.push(1);
st.top() = 42;
st.pop();
}
// libstdc++/7161
void
test03()
{
int data[] = {1, 2, 3};
std::priority_queue<int> pq;
std::size_t size = pq.size();
for (int i = 0; i < 3; ++i)
pq.push(data[i]);
size = pq.size();
pq.top();
for (int i = 0; i < 2; ++i)
pq.pop();
while (!pq.empty())
pq.pop();
}
int main()
{
test01();
test02();
test03();
return 0;
}
|
