<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: priority_queue.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a01118_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">priority_queue.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01118.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2005-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Permission to use, copy, modify, sell, and distribute this software</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// is hereby granted without fee, provided that the above copyright</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// notice appears in all copies, and that both that copyright notice</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// and this permission notice appear in supporting documentation. None</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// of the above authors, nor IBM Haifa Research Laboratories, make any</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// representation about the suitability of this software for any</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// purpose. It is provided "as is" without express or implied</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// warranty.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">/**</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * @file priority_queue.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains priority_queues.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> */</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#ifndef PB_DS_PRIORITY_QUEUE_HPP</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#define PB_DS_PRIORITY_QUEUE_HPP</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <<a class="code" href="a00656.html">bits/c++config.h</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a01121.html">ext/pb_ds/tag_and_trait.hpp</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include <<a class="code" href="a01139.html">ext/pb_ds/detail/priority_queue_base_dispatch.hpp</a>></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <<a class="code" href="a01142.html">ext/pb_ds/detail/standard_policies.hpp</a>></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">namespace </span><a class="code" href="a01590.html">__gnu_pbds</a></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> {<span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> /**</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * @defgroup heap-based Heap-Based</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * @ingroup containers-pbds</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * @{</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> */</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"></span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> /**</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * @defgroup heap-detail Base and Policy Classes</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * @ingroup heap-based</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> */</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> /**</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * A priority queue composed of one specific heap policy.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> *</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * @tparam _Tv Value type.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * @tparam Cmp_Fn Comparison functor.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * @tparam Tag Instantiating data structure type,</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> * see container_tag.</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * @tparam _Alloc Allocator type.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> *</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * Base is dispatched at compile time via Tag, from the following</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * choices: binary_heap_tag, binomial_heap_tag, pairing_heap_tag,</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * rc_binomial_heap_tag, thin_heap_tag</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> *</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * Base choices are: detail::binary_heap, detail::binomial_heap,</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * detail::pairing_heap, detail::rc_binomial_heap,</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * detail::thin_heap.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> */</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tv,</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">typename</span> Cmp_Fn = <a class="code" href="a07376.html">std::less<_Tv></a>,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">typename</span> Tag = pairing_heap_tag,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">typename</span> _Alloc = <a class="code" href="a04704.html">std::allocator<char></a> ></div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="a11108.html"> 83</a></span>  <span class="keyword">class </span><a class="code" href="a11108.html">priority_queue</a></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  : <span class="keyword">public</span> <a class="code" href="a11276.html">detail::container_base_dispatch</a><_Tv, Cmp_Fn, _Alloc, Tag>::type</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">typedef</span> _Tv value_type;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typedef</span> Cmp_Fn cmp_fn;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">typedef</span> Tag container_category;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> allocator_type::size_type size_type;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> allocator_type::difference_type difference_type;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a11276.html">detail::container_base_dispatch</a><_Tv, Cmp_Fn, _Alloc,</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  Tag>::type</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  base_type;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<_Tv> __rebind_v;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_v::other __rebind_va;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_va::reference reference;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_va::const_reference const_reference;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_va::pointer pointer;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __rebind_va::const_pointer const_pointer;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::point_iterator point_iterator;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::point_const_iterator point_const_iterator;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::iterator iterator;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::const_iterator const_iterator;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <a class="code" href="a11108.html">priority_queue</a>() { }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"></span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> /// Constructor taking some policy objects. r_cmp_fn will be</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> /// copied by the Cmp_Fn object of the container object.</span></div><div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="a01524.html#gaa6332f0e852dc89f0879cb5408d168c0"> 116</a></span> <span class="comment"></span> <a class="code" href="a01524.html#gaa6332f0e852dc89f0879cb5408d168c0">priority_queue</a>(<span class="keyword">const</span> cmp_fn& r_cmp_fn) : base_type(r_cmp_fn) { }</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> /// Constructor taking __iterators to a range of value_types. The</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> /// value_types between first_it and last_it will be inserted into</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> /// the container object.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="a01524.html#ga2b637d89cbd874881a4da920d57b0487"> 122</a></span>  <a class="code" href="a01524.html#ga2b637d89cbd874881a4da920d57b0487">priority_queue</a>(It first_it, It last_it)</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  { base_type::copy_from_range(first_it, last_it); }</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"></span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> /// Constructor taking __iterators to a range of value_types and</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> /// some policy objects The value_types between first_it and</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"> /// last_it will be inserted into the container object. r_cmp_fn</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> /// will be copied by the cmp_fn object of the container object.</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="a01524.html#gad0141192206747833a170be548fd51e0"> 130</a></span>  <a class="code" href="a01524.html#gad0141192206747833a170be548fd51e0">priority_queue</a>(It first_it, It last_it, <span class="keyword">const</span> cmp_fn& r_cmp_fn)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  : base_type(r_cmp_fn)</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  { base_type::copy_from_range(first_it, last_it); }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="a11108.html">priority_queue</a>(<span class="keyword">const</span> <a class="code" href="a11108.html">priority_queue</a>& other)</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  : base_type((const base_type& )other) { }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">virtual</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  ~priority_queue() { }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  priority_queue&</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  operator=(<span class="keyword">const</span> priority_queue& other)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> != &other)</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  priority_queue tmp(other);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  swap(tmp);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  swap(priority_queue& other)</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  { base_type::swap(other); }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  };</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> } <span class="comment">// namespace __gnu_pbds</span><span class="comment"></span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> //@} heap-based</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"></span><span class="preprocessor">#endif</span></div><div class="ttc" id="a04704_html"><div class="ttname"><a href="a04704.html">std::allocator</a></div><div class="ttdoc">The standard allocator, as per [20.4].</div><div class="ttdef"><b>Definition:</b> <a href="a00272_source.html#l00108">allocator.h:108</a></div></div>
<div class="ttc" id="a00656_html"><div class="ttname"><a href="a00656.html">c++config.h</a></div></div>
<div class="ttc" id="a01139_html"><div class="ttname"><a href="a01139.html">priority_queue_base_dispatch.hpp</a></div></div>
<div class="ttc" id="a01142_html"><div class="ttname"><a href="a01142.html">standard_policies.hpp</a></div></div>
<div class="ttc" id="a01524_html_ga2b637d89cbd874881a4da920d57b0487"><div class="ttname"><a href="a01524.html#ga2b637d89cbd874881a4da920d57b0487">__gnu_pbds::priority_queue::priority_queue</a></div><div class="ttdeci">priority_queue(It first_it, It last_it)</div><div class="ttdoc">Constructor taking __iterators to a range of value_types. The value_types between first_it and last_i...</div><div class="ttdef"><b>Definition:</b> <a href="a01118_source.html#l00122">priority_queue.hpp:122</a></div></div>
<div class="ttc" id="a01121_html"><div class="ttname"><a href="a01121.html">tag_and_trait.hpp</a></div></div>
<div class="ttc" id="a11108_html"><div class="ttname"><a href="a11108.html">__gnu_pbds::priority_queue</a></div><div class="ttdef"><b>Definition:</b> <a href="a01118_source.html#l00083">priority_queue.hpp:83</a></div></div>
<div class="ttc" id="a01524_html_gad0141192206747833a170be548fd51e0"><div class="ttname"><a href="a01524.html#gad0141192206747833a170be548fd51e0">__gnu_pbds::priority_queue::priority_queue</a></div><div class="ttdeci">priority_queue(It first_it, It last_it, const cmp_fn &r_cmp_fn)</div><div class="ttdoc">Constructor taking __iterators to a range of value_types and some policy objects The value_types betw...</div><div class="ttdef"><b>Definition:</b> <a href="a01118_source.html#l00130">priority_queue.hpp:130</a></div></div>
<div class="ttc" id="a01590_html"><div class="ttname"><a href="a01590.html">__gnu_pbds</a></div><div class="ttdoc">GNU extensions for policy-based data structures for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a01106_source.html#l00051">assoc_container.hpp:51</a></div></div>
<div class="ttc" id="a01524_html_gaa6332f0e852dc89f0879cb5408d168c0"><div class="ttname"><a href="a01524.html#gaa6332f0e852dc89f0879cb5408d168c0">__gnu_pbds::priority_queue::priority_queue</a></div><div class="ttdeci">priority_queue(const cmp_fn &r_cmp_fn)</div><div class="ttdoc">Constructor taking some policy objects. r_cmp_fn will be copied by the Cmp_Fn object of the container...</div><div class="ttdef"><b>Definition:</b> <a href="a01118_source.html#l00116">priority_queue.hpp:116</a></div></div>
<div class="ttc" id="a11276_html"><div class="ttname"><a href="a11276.html">__gnu_pbds::detail::container_base_dispatch</a></div><div class="ttdoc">Dispatch mechanism, primary template for associative types.</div><div class="ttdef"><b>Definition:</b> <a href="a01121_source.html#l00449">tag_and_trait.hpp:449</a></div></div>
<div class="ttc" id="a07376_html"><div class="ttname"><a href="a07376.html">std::less</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00340">stl_function.h:340</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="dir_afaff2f5b61f44d50c9875b428318082.html">pb_ds</a></li><li class="navelem"><a class="el" href="a01118.html">priority_queue.hpp</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
1001
