blob: 699d7f5593069cb886158fa71e71e92a8ac7aca2 (
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
|
// Copyright (C) 2013-2015 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/>.
// { dg-options "-std=gnu++11" }
#include <algorithm>
#include <functional>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
#include <testsuite_rvalref.h>
using __gnu_test::test_container;
using __gnu_test::random_access_iterator_wrapper;
using __gnu_test::rvalstruct;
typedef test_container<rvalstruct, random_access_iterator_wrapper> container;
void test01()
{
{
rvalstruct makeheap[1];
container makecon(makeheap, makeheap + 1);
std::push_heap(makecon.begin(), makecon.end());
std::pop_heap(makecon.begin(), makecon.end());
}
{
rvalstruct makeheap[1];
container makecon(makeheap, makeheap + 1);
std::push_heap(makecon.begin(), makecon.end(), std::less<rvalstruct>());
std::pop_heap(makecon.begin(), makecon.end(), std::less<rvalstruct>());
}
}
int main()
{
test01();
return 0;
}
|
