<!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++: stl_queue.h 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('a00575_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_queue.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00575.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">// Queue implementation -*- 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) 2001-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</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later 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,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but 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</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU 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">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996,1997</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></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">/** @file bits/stl_queue.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{queue}</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> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef _STL_QUEUE_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_QUEUE_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00308.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00746.html">debug/debug.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor"># include <bits/uses_allocator.h></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"></span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> /**</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * @brief A standard container giving FIFO behavior.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> *</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * @ingroup sequences</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> *</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * @tparam _Tp Type of element.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> *</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * Meets many of the requirements of a</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * <a href="tables.html#65">container</a>,</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * but does not define anything to do with iterators. Very few of the</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * other standard container interfaces are defined.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> *</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * This is not a true container, but an @e adaptor. It holds another</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * container, and provides a wrapper interface to that container. The</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * wrapper is what enforces strict first-in-first-out %queue behavior.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> *</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * The second template parameter defines the type of the underlying</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * sequence/container. It defaults to std::deque, but it can be any type</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * that supports @c front, @c back, @c push_back, and @c pop_front,</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * such as std::list or an appropriate user-defined type.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> *</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * Members not found in @a normal containers are @c container_type,</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * which is a typedef for the second Sequence parameter, and @c push and</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * @c pop, which are standard %queue/FIFO operations.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> */</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Sequence = deque<_Tp> ></div><div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="a07771.html"> 96</a></span>  <span class="keyword">class </span><a class="code" href="a07771.html">queue</a></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::value_type _Sequence_value_type;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor"># if __cplusplus < 201103L</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  __glibcxx_class_requires(_Sequence, _FrontInsertionSequenceConcept)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Seq1></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  operator==(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp1, _Seq1></a>&, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp1, _Seq1></a>&);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Seq1></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  operator<(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp1, _Seq1></a>&, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp1, _Seq1></a>&);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">using</span> _Uses = <span class="keyword">typename</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <a class="code" href="a04191.html">enable_if<uses_allocator<_Sequence, _Alloc>::value</a>>::type;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::value_type value_type;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::reference reference;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::const_reference const_reference;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::size_type size_type;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">typedef</span> _Sequence container_type;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">/* Maintainers wondering why this isn't uglified as per style</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> * guidelines should note that this name is specified in the standard,</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> * C++98 [23.2.3.1].</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> * (Why? Presumably for the same reason that it's protected instead</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> * of private: to allow derivation. But none of the other</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> * containers allow for derivation. Odd.)</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> */</span><span class="comment"></span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> /// @c c is the underlying container.</span></div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="a07771.html#a33f73620226c2827824851c0c935b28b"> 139</a></span> <span class="comment"></span> _Sequence <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> /**</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> */</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(<span class="keyword">const</span> _Sequence& __c = _Sequence())</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(__c) { }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Seq = _Sequence, <span class="keyword">typename</span> _Requires = <span class="keyword">typename</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="a04191.html">enable_if<is_default_constructible<_Seq>::value</a>>::type></div><div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b"> 152</a></span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>()</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>() { }</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="keyword">explicit</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(<span class="keyword">const</span> _Sequence& __c)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(__c) { }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(_Sequence&& __c)</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(<a class="code" href="a01541.html">std</a>::move(__c)) { }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(<span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(__a) { }</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(<span class="keyword">const</span> _Sequence& __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(__c, __a) { }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(_Sequence&& __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(<a class="code" href="a01541.html">std</a>::move(__c), __a) { }</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(<span class="keyword">const</span> <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>& __q, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(__q.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>, __a) { }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>(<a class="code" href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">queue</a>&& __q, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  : <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>(<a class="code" href="a01541.html">std</a>::move(__q.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>), __a) { }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"></span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> /**</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * Returns true if the %queue is empty.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> */</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00189"></a><span class="lineno"><a class="line" href="a07771.html#aeb2e07fc0b0b0e028954bc560663a9a8"> 189</a></span>  <a class="code" href="a07771.html#aeb2e07fc0b0b0e028954bc560663a9a8">empty</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.empty(); }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"></span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> /** Returns the number of elements in the %queue. */</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  size_type</div><div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="a07771.html#a39a435e44d6ff36f98f21dc45a2ac7f0"> 194</a></span>  <a class="code" href="a07771.html#a39a435e44d6ff36f98f21dc45a2ac7f0">size</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.size(); }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"></span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> /**</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> * Returns a read/write reference to the data at the first</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * element of the %queue.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> */</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  reference</div><div class="line"><a name="l00202"></a><span class="lineno"><a class="line" href="a07771.html#a4a2ec140f75225a04b64572f4b914331"> 202</a></span>  <a class="code" href="a07771.html#a4a2ec140f75225a04b64572f4b914331">front</a>()</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.front();</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"></span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> /**</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the first</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * element of the %queue.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> */</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  const_reference</div><div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="a07771.html#ac18027278a15d097de21b0bca5bcce40"> 213</a></span>  <a class="code" href="a07771.html#ac18027278a15d097de21b0bca5bcce40">front</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.front();</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"></span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> /**</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> * Returns a read/write reference to the data at the last</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> * element of the %queue.</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> */</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  reference</div><div class="line"><a name="l00224"></a><span class="lineno"><a class="line" href="a07771.html#afa9dca2075a73287acdad8800e9ad39d"> 224</a></span>  <a class="code" href="a07771.html#afa9dca2075a73287acdad8800e9ad39d">back</a>()</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.back();</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"></span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> /**</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the last</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> * element of the %queue.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> */</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  const_reference</div><div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="a07771.html#aa23dca99a4610fac87488f73839c274b"> 235</a></span>  <a class="code" href="a07771.html#aa23dca99a4610fac87488f73839c274b">back</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.back();</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"></span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> /**</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> * @brief Add data to the end of the %queue.</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> *</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> * This is a typical %queue operation. The function creates an</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> * element at the end of the %queue and assigns the given data</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> * to it. The time complexity of the operation depends on the</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"> * underlying sequence.</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> */</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00251"></a><span class="lineno"><a class="line" href="a07771.html#a18c27834d93d4d897d92f4fa6f910edf"> 251</a></span>  <a class="code" href="a07771.html#a18c27834d93d4d897d92f4fa6f910edf">push</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  { <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.push_back(__x); }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="a07771.html#a18c27834d93d4d897d92f4fa6f910edf">push</a>(value_type&& __x)</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  { <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.push_back(std::move(__x)); }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  decltype(<span class="keyword">auto</span>)</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  emplace(_Args&&... __args)</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  { <span class="keywordflow">return</span> <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.emplace_back(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  emplace(_Args&&... __args)</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  { <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.emplace_back(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"></span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> /**</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> * @brief Removes first element.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> *</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> * This is a typical %queue operation. It shrinks the %queue by one.</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="comment"> * The time complexity of the operation depends on the underlying</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"> * sequence.</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> *</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"> * Note that no data is returned, and if the first element's</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> <span class="comment"> * data is needed, it should be retrieved before pop() is</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"> * called.</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"> */</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="a07771.html#ab918d7f862088e93a884cffae6dd9058"> 284</a></span>  <a class="code" href="a07771.html#ab918d7f862088e93a884cffae6dd9058">pop</a>()</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>.pop_front();</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> </div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  swap(<a class="code" href="a07771.html">queue</a>& __q)</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="preprocessor">#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  noexcept(__is_nothrow_swappable<_Sequence>::value)</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  noexcept(__is_nothrow_swappable<_Tp>::value)</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  swap(<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>, __q.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>);</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="preprocessor">#endif // __cplusplus >= 201103L</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  };</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Container,</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  queue(_Container) -> queue<typename _Container::value_type, _Container>;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Container, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>,</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">typename</span> = enable_if_t<__is_allocator<_Allocator>::value>></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  queue(_Container, _Allocator)</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  -> queue<typename _Container::value_type, _Container>;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"></span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> /**</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> * @brief Queue equality comparison.</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"> * @param __x A %queue.</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> * @param __y A %queue of the same type as @a __x.</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> * @return True iff the size and elements of the queues are equal.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> *</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"> * This is an equivalence relation. Complexity and semantics depend on the</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"> * underlying sequence type, but the expected rules are: this relation is</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> * linear in the size of the sequences, and queues are considered equivalent</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"> * if their sequences compare equal.</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> */</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00330"></a><span class="lineno"><a class="line" href="a01541.html#a7aeb223367d887a2b7f358a50e15e6f2"> 330</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  { <span class="keywordflow">return</span> __x.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a> == __y.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>; }</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"></span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"> /**</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> * @brief Queue ordering relation.</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment"> * @param __x A %queue.</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="comment"> * @param __y A %queue of the same type as @a x.</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"> * @return True iff @a __x is lexicographically less than @a __y.</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> *</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> <span class="comment"> * This is an total ordering relation. Complexity and semantics</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="comment"> * depend on the underlying sequence type, but the expected rules</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"> * are: this relation is linear in the size of the sequences, the</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> * elements must be comparable with @c <, and</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> * std::lexicographical_compare() is usually used to make the</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> * determination.</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> */</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="a01541.html#a7d32b48a9dc0ee1316aedbde00a1a8fd"> 348</a></span>  operator<(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  { <span class="keywordflow">return</span> __x.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a> < __y.<a class="code" href="a07771.html#a33f73620226c2827824851c0c935b28b">c</a>; }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"></span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> /// Based on operator==</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00354"></a><span class="lineno"><a class="line" href="a01541.html#a98c391c7d64a5a01cf0d162c4fb959ca"> 354</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment"></span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00360"></a><span class="lineno"><a class="line" href="a01541.html#a6116f2ba6a75587900983e4a6662a528"> 360</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"></span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00366"></a><span class="lineno"><a class="line" href="a01541.html#a8d12abc1fb7e7cd1c53769a0fc5ff75f"> 366</a></span>  operator<=(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"></span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00372"></a><span class="lineno"><a class="line" href="a01541.html#ac65d320a052a5d4d1477ef25b5627be5"> 372</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07771.html">queue<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="preprocessor">#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">// Constrained free swap overload, see p0185r1</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">typename</span> enable_if<__is_swappable<_Seq>::value>::type</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y)</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  { __x.swap(__y); }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">struct </span>uses_allocator<queue<_Tp, _Seq>, _Alloc></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  : <span class="keyword">public</span> uses_allocator<_Seq, _Alloc>::type { };</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="preprocessor">#endif // __cplusplus >= 201103L</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"></span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> /**</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> * @brief A standard container automatically sorting its contents.</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"> *</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> * @ingroup sequences</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"> *</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> * @tparam _Tp Type of element.</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * @tparam _Sequence Type of underlying sequence, defaults to vector<_Tp>.</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> * @tparam _Compare Comparison function object type, defaults to</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="comment"> * less<_Sequence::value_type>.</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"> *</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> * This is not a true container, but an @e adaptor. It holds</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> * another container, and provides a wrapper interface to that</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * container. The wrapper is what enforces priority-based sorting</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> * and %queue behavior. Very few of the standard container/sequence</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> * interface requirements are met (e.g., iterators).</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"> *</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> * The second template parameter defines the type of the underlying</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> * sequence/container. It defaults to std::vector, but it can be</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="comment"> * any type that supports @c front(), @c push_back, @c pop_back,</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="comment"> * and random-access iterators, such as std::deque or an</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="comment"> * appropriate user-defined type.</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"> *</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> * The third template parameter supplies the means of making</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"> * priority comparisons. It defaults to @c less<value_type> but</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> * can be anything defining a strict weak ordering.</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> *</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> * Members not found in @a normal containers are @c container_type,</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="comment"> * which is a typedef for the second Sequence parameter, and @c</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment"> * push, @c pop, and @c top, which are standard %queue operations.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="comment"> *</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"> * @note No equality/comparison operators are provided for</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"> * %priority_queue.</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> *</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> * @note Sorting of the elements takes place as they are added to,</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> * and removed from, the %priority_queue using the</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> * %priority_queue's member functions. If you access the elements</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> * by other means, and change their data such that the sorting</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> * order would be different, the %priority_queue will not re-sort</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> * the elements for you. (How could it know to do so?)</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> */</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Sequence = vector<_Tp>,</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">typename</span> _Compare = less<<span class="keyword">typename</span> _Sequence::value_type> ></div><div class="line"><a name="l00435"></a><span class="lineno"><a class="line" href="a07779.html"> 435</a></span>  <span class="keyword">class </span><a class="code" href="a07779.html">priority_queue</a></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  {</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::value_type _Sequence_value_type;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="preprocessor"># if __cplusplus < 201103L</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  __glibcxx_class_requires(_Sequence, _SequenceConcept)</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept)</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  __glibcxx_class_requires4(_Compare, <span class="keywordtype">bool</span>, _Tp, _Tp,</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  _BinaryFunctionConcept)</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keyword">using</span> _Uses = <span class="keyword">typename</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="a04191.html">enable_if<uses_allocator<_Sequence, _Alloc>::value</a>>::type;</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> </div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::value_type value_type;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::reference reference;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::const_reference const_reference;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::size_type size_type;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">typedef</span> _Sequence container_type;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// DR 2684. priority_queue lacking comparator typedef</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">typedef</span> _Compare value_compare;</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// See queue::c for notes on these names.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  _Sequence c;</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  _Compare comp;</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> /**</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> */</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Compare& __x = _Compare(),</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">const</span> _Sequence& __s = _Sequence())</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  : c(__s), comp(__x)</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  { <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp); }</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Seq = _Sequence, <span class="keyword">typename</span> _Requires = <span class="keyword">typename</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <a class="code" href="a04191.html">enable_if<__and_<is_default_constructible<_Compare></a>,</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="a03579.html">is_default_constructible<_Seq></a>>::value>::type></div><div class="line"><a name="l00485"></a><span class="lineno"><a class="line" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42"> 485</a></span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>()</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  : c(), comp() { }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Compare& __x, <span class="keyword">const</span> _Sequence& __s)</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  : c(__s), comp(__x)</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  { <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp); }</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Compare& __x, _Sequence&& __s = _Sequence())</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  : c(<a class="code" href="a01541.html">std</a>::move(__s)), comp(__x)</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  { std::make_heap(c.begin(), c.end(), comp); }</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> </div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  : c(__a), comp() { }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Compare& __x, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  : c(__a), comp(__x) { }</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> </div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// 2537. Constructors [...] taking allocators should call make_heap</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Compare& __x, <span class="keyword">const</span> _Sequence& __c,</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  : c(__c, __a), comp(__x)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  { <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp); }</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> </div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> _Compare& __x, _Sequence&& __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  : c(<a class="code" href="a01541.html">std</a>::move(__c), __a), comp(__x)</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  { <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp); }</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> </div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<span class="keyword">const</span> <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>& __q, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  : c(__q.c, __a), comp(__q.comp) { }</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(<a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>&& __q, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  : c(<a class="code" href="a01541.html">std</a>::move(__q.c), __a), comp(<a class="code" href="a01541.html">std</a>::move(__q.comp)) { }</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="comment"></span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="comment"> /**</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="comment"> * @brief Builds a %queue from a range.</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment"> * @param __x A comparison functor describing a strict weak ordering.</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> * @param __s An initial sequence with which to start.</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> *</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> * Begins by copying @a __s, inserting a copy of the elements</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> * from @a [first,last) into the copy of @a __s, then ordering</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> * the copy according to @a __x.</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> *</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * For more information on function objects, see the</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> * documentation on @link functors functor base</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> * classes@endlink.</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"> */</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> _Compare& __x = _Compare(),</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">const</span> _Sequence& __s = _Sequence())</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  : c(__s), comp(__x)</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  {</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  c.insert(c.end(), __first, __last);</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00557"></a><span class="lineno"><a class="line" href="a07779.html#a83695f69303684e73b764c27d2da64d4"> 557</a></span>  <a class="code" href="a07779.html#a83695f69303684e73b764c27d2da64d4">priority_queue</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keyword">const</span> _Compare& __x,</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">const</span> _Sequence& __s)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  : c(__s), comp(__x)</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  {</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  c.insert(c.end(), __first, __last);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp);</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <a class="code" href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">priority_queue</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">const</span> _Compare& __x = _Compare(),</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  _Sequence&& __s = _Sequence())</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  : c(<a class="code" href="a01541.html">std</a>::move(__s)), comp(__x)</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  {</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  c.insert(c.end(), __first, __last);</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <a class="code" href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a>(c.begin(), c.end(), comp);</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"></span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment"> /**</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment"> * Returns true if the %queue is empty.</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment"> */</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00583"></a><span class="lineno"><a class="line" href="a07779.html#a4a1c1fe5e71410e31f9af1467b7c3472"> 583</a></span>  <a class="code" href="a07779.html#a4a1c1fe5e71410e31f9af1467b7c3472">empty</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> c.empty(); }</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment"></span></div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment"> /** Returns the number of elements in the %queue. */</span></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  size_type</div><div class="line"><a name="l00588"></a><span class="lineno"><a class="line" href="a07779.html#a22575e222bea1d4bdd5e978b2d6c3b04"> 588</a></span>  <a class="code" href="a07779.html#a22575e222bea1d4bdd5e978b2d6c3b04">size</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> c.size(); }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> <span class="comment"></span></div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> <span class="comment"> /**</span></div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the first</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> <span class="comment"> * element of the %queue.</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="comment"> */</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  const_reference</div><div class="line"><a name="l00596"></a><span class="lineno"><a class="line" href="a07779.html#abaedbd99739eef4ac53eefb478eb3900"> 596</a></span>  <a class="code" href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">top</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">return</span> c.front();</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"></span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> /**</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * @brief Add data to the %queue.</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * @param __x Data to be added.</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> *</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * This is a typical %queue operation.</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * The time complexity of the operation depends on the underlying</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> * sequence.</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment"> */</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00611"></a><span class="lineno"><a class="line" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688"> 611</a></span>  <a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  c.push_back(__x);</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <a class="code" href="a01506.html#gac0d64c0744947b3d233779d9e9f656cc">std::push_heap</a>(c.begin(), c.end(), comp);</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> </div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(value_type&& __x)</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  {</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  c.push_back(std::move(__x));</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <a class="code" href="a01506.html#gac0d64c0744947b3d233779d9e9f656cc">std::push_heap</a>(c.begin(), c.end(), comp);</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> </div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  emplace(_Args&&... __args)</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  {</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  c.emplace_back(std::forward<_Args>(__args)...);</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  std::push_heap(c.begin(), c.end(), comp);</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment"></span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="comment"> /**</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> <span class="comment"> * @brief Removes first element.</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="comment"> *</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="comment"> * This is a typical %queue operation. It shrinks the %queue</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment"> * by one. The time complexity of the operation depends on the</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> * underlying sequence.</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> *</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> * Note that no data is returned, and if the first element's</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> * data is needed, it should be retrieved before pop() is</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * called.</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> */</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00646"></a><span class="lineno"><a class="line" href="a07779.html#a935091a0132d887f9d3f87686c5598ac"> 646</a></span>  <a class="code" href="a07779.html#a935091a0132d887f9d3f87686c5598ac">pop</a>()</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  {</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <a class="code" href="a01506.html#ga27b771598145e151f01281b5cb0fdbbb">std::pop_heap</a>(c.begin(), c.end(), comp);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  c.pop_back();</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  }</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> </div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  swap(<a class="code" href="a07779.html">priority_queue</a>& __pq)</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  noexcept(__and_<</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> #<span class="keywordflow">if</span> __cplusplus > 201402L || !defined(__STRICT_ANSI__) <span class="comment">// c++1z or gnu++11</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  __is_nothrow_swappable<_Sequence>,</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> #<span class="keywordflow">else</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  __is_nothrow_swappable<_Tp>,</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> #endif</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  __is_nothrow_swappable<_Compare></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  >::value)</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  {</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  swap(c, __pq.c);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  swap(comp, __pq.comp);</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  }</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="preprocessor">#endif // __cplusplus >= 201103L</span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  };</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Container,</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Compare>::value>,</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  priority_queue(_Compare, _Container)</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  -> priority_queue<typename _Container::value_type, _Container, _Compare>;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> </div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _ValT</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  = <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type,</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">typename</span> _Compare = less<_ValT>,</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keyword">typename</span> _Container = vector<_ValT>,</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">typename</span> = _RequireInputIter<_InputIterator>,</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Compare>::value>,</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  priority_queue(_InputIterator, _InputIterator, _Compare = _Compare(),</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  _Container = _Container())</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  -> priority_queue<_ValT, _Container, _Compare>;</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> </div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Container, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Compare>::value>,</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>,</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keyword">typename</span> = enable_if_t<__is_allocator<_Allocator>::value>></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  priority_queue(_Compare, _Container, _Allocator)</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  -> priority_queue<typename _Container::value_type, _Container, _Compare>;</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> </div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// No equality/comparison operators are provided for priority_queue.</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> </div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Sequence, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="preprocessor">#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// Constrained free swap overload, see p0185r1</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">typename</span> enable_if<__and_<__is_swappable<_Sequence>,</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  __is_swappable<_Compare>>::value>::type</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  swap(priority_queue<_Tp, _Sequence, _Compare>& __x,</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  priority_queue<_Tp, _Sequence, _Compare>& __y)</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  { __x.swap(__y); }</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span> </div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Sequence, <span class="keyword">typename</span> _Compare,</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keyword">struct </span>uses_allocator<priority_queue<_Tp, _Sequence, _Compare>, _Alloc></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  : <span class="keyword">public</span> uses_allocator<_Sequence, _Alloc>::type { };</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="preprocessor">#endif // __cplusplus >= 201103L</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> </div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_QUEUE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07771_html_ac18027278a15d097de21b0bca5bcce40"><div class="ttname"><a href="a07771.html#ac18027278a15d097de21b0bca5bcce40">std::queue::front</a></div><div class="ttdeci">const_reference front() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00213">stl_queue.h:213</a></div></div>
<div class="ttc" id="a07779_html"><div class="ttname"><a href="a07779.html">std::priority_queue</a></div><div class="ttdoc">A standard container automatically sorting its contents.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00435">stl_queue.h:435</a></div></div>
<div class="ttc" id="a07779_html_a83695f69303684e73b764c27d2da64d4"><div class="ttname"><a href="a07779.html#a83695f69303684e73b764c27d2da64d4">std::priority_queue::priority_queue</a></div><div class="ttdeci">priority_queue(_InputIterator __first, _InputIterator __last, const _Compare &__x, const _Sequence &__s)</div><div class="ttdoc">Builds a queue from a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00557">stl_queue.h:557</a></div></div>
<div class="ttc" id="a04191_html"><div class="ttname"><a href="a04191.html">std::enable_if</a></div><div class="ttdoc">Define a member typedef type only if a boolean constant is true.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l01913">type_traits:1913</a></div></div>
<div class="ttc" id="a07779_html_a22575e222bea1d4bdd5e978b2d6c3b04"><div class="ttname"><a href="a07779.html#a22575e222bea1d4bdd5e978b2d6c3b04">std::priority_queue::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00588">stl_queue.h:588</a></div></div>
<div class="ttc" id="a01506_html_ga27b771598145e151f01281b5cb0fdbbb"><div class="ttname"><a href="a01506.html#ga27b771598145e151f01281b5cb0fdbbb">std::pop_heap</a></div><div class="ttdeci">void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</div><div class="ttdoc">Pop an element off a heap using comparison functor.</div><div class="ttdef"><b>Definition:</b> <a href="a00545_source.html#l00304">stl_heap.h:304</a></div></div>
<div class="ttc" id="a07771_html_aeb2e07fc0b0b0e028954bc560663a9a8"><div class="ttname"><a href="a07771.html#aeb2e07fc0b0b0e028954bc560663a9a8">std::queue::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00189">stl_queue.h:189</a></div></div>
<div class="ttc" id="a03579_html"><div class="ttname"><a href="a03579.html">std::is_default_constructible</a></div><div class="ttdoc">is_default_constructible</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00878">type_traits:878</a></div></div>
<div class="ttc" id="a07779_html_a935091a0132d887f9d3f87686c5598ac"><div class="ttname"><a href="a07779.html#a935091a0132d887f9d3f87686c5598ac">std::priority_queue::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">Removes first element.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00646">stl_queue.h:646</a></div></div>
<div class="ttc" id="a07771_html_ab918d7f862088e93a884cffae6dd9058"><div class="ttname"><a href="a07771.html#ab918d7f862088e93a884cffae6dd9058">std::queue::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">Removes first element.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00284">stl_queue.h:284</a></div></div>
<div class="ttc" id="a07771_html_a18c27834d93d4d897d92f4fa6f910edf"><div class="ttname"><a href="a07771.html#a18c27834d93d4d897d92f4fa6f910edf">std::queue::push</a></div><div class="ttdeci">void push(const value_type &__x)</div><div class="ttdoc">Add data to the end of the queue.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00251">stl_queue.h:251</a></div></div>
<div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a07771_html_afa9dca2075a73287acdad8800e9ad39d"><div class="ttname"><a href="a07771.html#afa9dca2075a73287acdad8800e9ad39d">std::queue::back</a></div><div class="ttdeci">reference back()</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00224">stl_queue.h:224</a></div></div>
<div class="ttc" id="a07771_html_a39a435e44d6ff36f98f21dc45a2ac7f0"><div class="ttname"><a href="a07771.html#a39a435e44d6ff36f98f21dc45a2ac7f0">std::queue::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00194">stl_queue.h:194</a></div></div>
<div class="ttc" id="a07771_html_a33f73620226c2827824851c0c935b28b"><div class="ttname"><a href="a07771.html#a33f73620226c2827824851c0c935b28b">std::queue::c</a></div><div class="ttdeci">_Sequence c</div><div class="ttdoc">c is the underlying container.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00139">stl_queue.h:139</a></div></div>
<div class="ttc" id="a00746_html"><div class="ttname"><a href="a00746.html">debug.h</a></div></div>
<div class="ttc" id="a07771_html_a4a2ec140f75225a04b64572f4b914331"><div class="ttname"><a href="a07771.html#a4a2ec140f75225a04b64572f4b914331">std::queue::front</a></div><div class="ttdeci">reference front()</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00202">stl_queue.h:202</a></div></div>
<div class="ttc" id="a07779_html_ad9ef96e9ae20769410ce372f0f7c4f42"><div class="ttname"><a href="a07779.html#ad9ef96e9ae20769410ce372f0f7c4f42">std::priority_queue::priority_queue</a></div><div class="ttdeci">priority_queue()</div><div class="ttdoc">Default constructor creates no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00485">stl_queue.h:485</a></div></div>
<div class="ttc" id="a01506_html_gac0d64c0744947b3d233779d9e9f656cc"><div class="ttname"><a href="a01506.html#gac0d64c0744947b3d233779d9e9f656cc">std::push_heap</a></div><div class="ttdeci">void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</div><div class="ttdoc">Push an element onto a heap using comparison functor.</div><div class="ttdef"><b>Definition:</b> <a href="a00545_source.html#l00189">stl_heap.h:189</a></div></div>
<div class="ttc" id="a07779_html_a4a1c1fe5e71410e31f9af1467b7c3472"><div class="ttname"><a href="a07779.html#a4a1c1fe5e71410e31f9af1467b7c3472">std::priority_queue::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00583">stl_queue.h:583</a></div></div>
<div class="ttc" id="a07771_html_aa23dca99a4610fac87488f73839c274b"><div class="ttname"><a href="a07771.html#aa23dca99a4610fac87488f73839c274b">std::queue::back</a></div><div class="ttdeci">const_reference back() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00235">stl_queue.h:235</a></div></div>
<div class="ttc" id="a07779_html_abaedbd99739eef4ac53eefb478eb3900"><div class="ttname"><a href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">std::priority_queue::top</a></div><div class="ttdeci">const_reference top() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00596">stl_queue.h:596</a></div></div>
<div class="ttc" id="a07771_html_abdaacb8e25703a65fc79cbfa5fe6934b"><div class="ttname"><a href="a07771.html#abdaacb8e25703a65fc79cbfa5fe6934b">std::queue::queue</a></div><div class="ttdeci">queue()</div><div class="ttdoc">Default constructor creates no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00152">stl_queue.h:152</a></div></div>
<div class="ttc" id="a07771_html"><div class="ttname"><a href="a07771.html">std::queue</a></div><div class="ttdoc">A standard container giving FIFO behavior.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00096">stl_queue.h:96</a></div></div>
<div class="ttc" id="a00308_html"><div class="ttname"><a href="a00308.html">concept_check.h</a></div></div>
<div class="ttc" id="a07779_html_acf5286a0e5aa7354459ca1553ba54688"><div class="ttname"><a href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">std::priority_queue::push</a></div><div class="ttdeci">void push(const value_type &__x)</div><div class="ttdoc">Add data to the queue.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00611">stl_queue.h:611</a></div></div>
<div class="ttc" id="a01506_html_ga84545d446162758eb0dc4a9ea5fa5cbc"><div class="ttname"><a href="a01506.html#ga84545d446162758eb0dc4a9ea5fa5cbc">std::make_heap</a></div><div class="ttdeci">void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)</div><div class="ttdoc">Construct a heap over a range using comparison functor.</div><div class="ttdef"><b>Definition:</b> <a href="a00545_source.html#l00386">stl_heap.h:386</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_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00575.html">stl_queue.h</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
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
527
