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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
// -*- C++ -*-
// Copyright (C) 2005-2019 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/>.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice
// and this permission notice appear in supporting documentation. None
// of the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied
// warranty.
/**
* @file basic_priority_queue_example.cpp
* A basic example showing how to use priority queues.
*/
/**
* This example shows how to use priority queues. It defines a
* function performing a sequence of operations on
* a generic container. It then calls this function with some containers.
*/
#include <cassert>
#include <iostream>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_pbds;
// The following function performs a sequence of operations on a
// priority queue object storing integers.
template<class Cntnr>
void
some_op_sequence(Cntnr& r_c)
{
assert(r_c.empty());
assert(r_c.size() == 0);
for (size_t i = 0; i < 10; ++i)
r_c.push(i);
cout << endl << "All values in the container:" << endl;
typedef typename Cntnr::const_iterator const_iterator;
for (const_iterator it = r_c.begin(); it != r_c.end(); ++it)
cout << *it << endl;
assert(!r_c.empty());
assert(r_c.size() == 10);
cout << "Popping all values: " << endl;
while (!r_c.empty())
{
cout << r_c.top() << endl;
r_c.pop();
}
assert(r_c.empty());
assert(r_c.size() == 0);
cout << endl;
}
int main()
{
{
// Perform operations on a pairing-heap queue.
cout << "Pairing heap" << endl;
__gnu_pbds::priority_queue<int, less<int>, pairing_heap_tag> c;
some_op_sequence(c);
}
{
// Perform operations on a binomial-heap queue.
cout << "Binomial heap" << endl;
__gnu_pbds::priority_queue<int, less<int>, binomial_heap_tag> c;
some_op_sequence(c);
}
{
// Perform operations on a binomial-heap queue.
cout << "Redundant-counter binomial heap" << endl;
__gnu_pbds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
some_op_sequence(c);
}
{
// Perform operations on a binomial-heap queue.
cout << "Binary heap" << endl;
__gnu_pbds::priority_queue<int, less<int>, binary_heap_tag> c;
some_op_sequence(c);
}
{
// Perform operations on a thin-heap queue.
cout << "Thin heap" << endl;
__gnu_pbds::priority_queue<int, less<int>, thin_heap_tag> c;
some_op_sequence(c);
}
return 0;
}
|
