<!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_stack.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('a00587_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_stack.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00587.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">// Stack 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_stack.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{stack}</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_STACK_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_STACK_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 FILO 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</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * another container, and provides a wrapper interface to that</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * container. The wrapper is what enforces strict</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * first-in-last-out %stack behavior.</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> *</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * The second template parameter defines the type of the underlying</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * sequence/container. It defaults to std::deque, but it can be</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * any type that supports @c back, @c push_back, and @c pop_back,</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * such as std::list, std::vector, or an appropriate user-defined</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * type.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> *</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * Members not found in @a normal containers are @c container_type,</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> * which is a typedef for the second Sequence parameter, and @c</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * push, @c pop, and @c top, which are standard %stack/FILO</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * operations.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> */</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</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="l00099"></a><span class="lineno"><a class="line" href="a07791.html"> 99</a></span>  <span class="keyword">class </span><a class="code" href="a07791.html">stack</a></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::value_type _Sequence_value_type;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="preprocessor"># if __cplusplus < 201103L</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)</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>  __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Seq1></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  operator==(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp1, _Seq1></a>&, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp1, _Seq1></a>&);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Seq1></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  operator<(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp1, _Seq1></a>&, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp1, _Seq1></a>&);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">using</span> _Uses = <span class="keyword">typename</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="a04191.html">enable_if<uses_allocator<_Sequence, _Alloc>::value</a>>::type;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::value_type value_type;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::reference reference;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::const_reference const_reference;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Sequence::size_type size_type;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">typedef</span> _Sequence container_type;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// See queue::c for notes on this name.</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  _Sequence c;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// XXX removed old def ctor, added def arg to this one to match 14882</span><span class="comment"></span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> /**</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> */</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(<span class="keyword">const</span> _Sequence& __c = _Sequence())</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  : c(__c) { }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</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="l00147"></a><span class="lineno"> 147</span>  <a class="code" href="a04191.html">enable_if<is_default_constructible<_Seq>::value</a>>::type></div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4"> 148</a></span>  <a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>()</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  : c() { }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(<span class="keyword">const</span> _Sequence& __c)</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  : c(__c) { }</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="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(_Sequence&& __c)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  : c(<a class="code" href="a01541.html">std</a>::move(__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">template</span><<span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _Requires = _Uses<_Alloc>></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(<span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  : c(__a) { }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</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="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(<span class="keyword">const</span> _Sequence& __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  : c(__c, __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="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(_Sequence&& __c, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  : c(<a class="code" href="a01541.html">std</a>::move(__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="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(<span class="keyword">const</span> <a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>& __q, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  : c(__q.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="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>(<a class="code" href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">stack</a>&& __q, <span class="keyword">const</span> _Alloc& __a)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  : c(<a class="code" href="a01541.html">std</a>::move(__q.c), __a) { }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"></span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> /**</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * Returns true if the %stack is empty.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> */</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="a07791.html#a86e3c205d6100cd4bb98b4b7e36bb35e"> 185</a></span>  <a class="code" href="a07791.html#a86e3c205d6100cd4bb98b4b7e36bb35e">empty</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> c.empty(); }</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="comment"> /** Returns the number of elements in the %stack. */</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  size_type</div><div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="a07791.html#a625c78a7dc1b563f9754e33879243f4e"> 190</a></span>  <a class="code" href="a07791.html#a625c78a7dc1b563f9754e33879243f4e">size</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> c.size(); }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"></span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> /**</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * Returns a read/write reference to the data at the first</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> * element of the %stack.</span></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>  reference</div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="a07791.html#adc6f199f89b9bcf05884bcfcf96e18ea"> 198</a></span>  <a class="code" href="a07791.html#adc6f199f89b9bcf05884bcfcf96e18ea">top</a>()</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> c.back();</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"></span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> /**</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> * Returns a read-only (constant) reference to the data at the first</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> * element of the %stack.</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>  const_reference</div><div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="a07791.html#a9dd3184636ea0325d194346266e4e516"> 209</a></span>  <a class="code" href="a07791.html#a9dd3184636ea0325d194346266e4e516">top</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> c.back();</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"></span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> /**</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> * @brief Add data to the top of the %stack.</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * @param __x Data to be added.</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"> * This is a typical %stack operation. The function creates an</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"> * element at the top of the %stack and assigns the given data</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> * to it. The time complexity of the operation depends on the</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> * underlying sequence.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> */</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="a07791.html#a7efe15f8159c166b68a24486ec561608"> 225</a></span>  <a class="code" href="a07791.html#a7efe15f8159c166b68a24486ec561608">push</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  { c.push_back(__x); }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="a07791.html#a7efe15f8159c166b68a24486ec561608">push</a>(value_type&& __x)</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  { c.push_back(std::move(__x)); }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="preprocessor">#if __cplusplus > 201402L</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  decltype(<span class="keyword">auto</span>)</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  emplace(_Args&&... __args)</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  { <span class="keywordflow">return</span> c.emplace_back(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  emplace(_Args&&... __args)</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  { c.emplace_back(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"></span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> /**</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> * @brief Removes first element.</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"> *</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> * This is a typical %stack operation. It shrinks the %stack</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> * by one. The time complexity of the operation depends on the</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> * underlying sequence.</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> *</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> * Note that no data is returned, and if the first element's</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> * data is needed, it should be retrieved before pop() is</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> * called.</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> */</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="a07791.html#a16b93d714717c5af52a14ebd6fec11b7"> 258</a></span>  <a class="code" href="a07791.html#a16b93d714717c5af52a14ebd6fec11b7">pop</a>()</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  __glibcxx_requires_nonempty();</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  c.pop_back();</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  swap(<a class="code" href="a07791.html">stack</a>& __s)</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="preprocessor">#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  noexcept(__is_nothrow_swappable<_Sequence>::value)</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  noexcept(__is_nothrow_swappable<_Tp>::value)</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  {</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  swap(c, __s.c);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> <span class="preprocessor">#endif // __cplusplus >= 201103L</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  };</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="preprocessor">#if __cpp_deduction_guides >= 201606</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Container,</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  stack(_Container) -> stack<typename _Container::value_type, _Container>;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Container, <span class="keyword">typename</span> _Allocator,</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">typename</span> = enable_if_t<!__is_allocator<_Container>::value>,</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">typename</span> = enable_if_t<__is_allocator<_Allocator>::value>></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  stack(_Container, _Allocator)</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  -> stack<typename _Container::value_type, _Container>;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="comment"></span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment"> /**</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"> * @brief Stack equality comparison.</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"> * @param __x A %stack.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> * @param __y A %stack of the same type as @a __x.</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> * @return True iff the size and elements of the stacks are equal.</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> *</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> * This is an equivalence relation. Complexity and semantics</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment"> * depend on the underlying sequence type, but the expected rules</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"> * are: this relation is linear in the size of the sequences, and</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"> * stacks are considered equivalent if their sequences compare</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> * equal.</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> */</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="a01541.html#a05fbef1e7e15558f5933ed15a339e97d"> 305</a></span>  operator==(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  { <span class="keywordflow">return</span> __x.c == __y.c; }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"></span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> /**</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> * @brief Stack ordering relation.</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> * @param __x A %stack.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> * @param __y A %stack of the same type as @a x.</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> * @return True iff @a x is lexicographically less than @a __y.</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> *</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> * This is an total ordering relation. Complexity and semantics</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> * depend on the underlying sequence type, but the expected rules</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> * are: this relation is linear in the size of the sequences, the</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> * elements must be comparable with @c <, and</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> * std::lexicographical_compare() is usually used to make the</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"> * determination.</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> */</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00323"></a><span class="lineno"><a class="line" href="a01541.html#a53d215eee36632ee43c5039c54d648ae"> 323</a></span>  operator<(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  { <span class="keywordflow">return</span> __x.c < __y.c; }</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"></span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"> /// Based on operator==</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</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="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="a01541.html#a481ee02f06a7c42bd2762516975d7082"> 329</a></span>  operator!=(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment"></span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</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="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00335"></a><span class="lineno"><a class="line" href="a01541.html#a886fc839debeebe4e1453774a028d1e3"> 335</a></span>  operator>(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"></span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</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="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00341"></a><span class="lineno"><a class="line" href="a01541.html#a930dd0467ade4b159f585b09a918c395"> 341</a></span>  operator<=(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"></span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</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="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00347"></a><span class="lineno"><a class="line" href="a01541.html#a11bb9b3800196c309babae27f4b4a900"> 347</a></span>  operator>=(<span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __x, <span class="keyword">const</span> <a class="code" href="a07791.html">stack<_Tp, _Seq></a>& __y)</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Seq></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="preprocessor">#if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// Constrained free swap overload, see p0185r1</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">typename</span> enable_if<__is_swappable<_Seq>::value>::type</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y)</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  noexcept(noexcept(__x.swap(__y)))</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  { __x.swap(__y); }</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</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="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">struct </span>uses_allocator<stack<_Tp, _Seq>, _Alloc></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  : <span class="keyword">public</span> uses_allocator<_Seq, _Alloc>::type { };</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="preprocessor">#endif // __cplusplus >= 201103L</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_STACK_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07791_html_ad95ef4166cdb0aa8bae1dcd7ae2839e4"><div class="ttname"><a href="a07791.html#ad95ef4166cdb0aa8bae1dcd7ae2839e4">std::stack::stack</a></div><div class="ttdeci">stack()</div><div class="ttdoc">Default constructor creates no elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00148">stl_stack.h:148</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="a07791_html_a7efe15f8159c166b68a24486ec561608"><div class="ttname"><a href="a07791.html#a7efe15f8159c166b68a24486ec561608">std::stack::push</a></div><div class="ttdeci">void push(const value_type &__x)</div><div class="ttdoc">Add data to the top of the stack.</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00225">stl_stack.h:225</a></div></div>
<div class="ttc" id="a07791_html_adc6f199f89b9bcf05884bcfcf96e18ea"><div class="ttname"><a href="a07791.html#adc6f199f89b9bcf05884bcfcf96e18ea">std::stack::top</a></div><div class="ttdeci">reference top()</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00198">stl_stack.h:198</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="a00746_html"><div class="ttname"><a href="a00746.html">debug.h</a></div></div>
<div class="ttc" id="a07791_html_a16b93d714717c5af52a14ebd6fec11b7"><div class="ttname"><a href="a07791.html#a16b93d714717c5af52a14ebd6fec11b7">std::stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">Removes first element.</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00258">stl_stack.h:258</a></div></div>
<div class="ttc" id="a07791_html_a625c78a7dc1b563f9754e33879243f4e"><div class="ttname"><a href="a07791.html#a625c78a7dc1b563f9754e33879243f4e">std::stack::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00190">stl_stack.h:190</a></div></div>
<div class="ttc" id="a07791_html_a9dd3184636ea0325d194346266e4e516"><div class="ttname"><a href="a07791.html#a9dd3184636ea0325d194346266e4e516">std::stack::top</a></div><div class="ttdeci">const_reference top() const</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00209">stl_stack.h:209</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="a07791_html_a86e3c205d6100cd4bb98b4b7e36bb35e"><div class="ttname"><a href="a07791.html#a86e3c205d6100cd4bb98b4b7e36bb35e">std::stack::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00185">stl_stack.h:185</a></div></div>
<div class="ttc" id="a07791_html"><div class="ttname"><a href="a07791.html">std::stack</a></div><div class="ttdoc">A standard container giving FILO behavior.</div><div class="ttdef"><b>Definition:</b> <a href="a00587_source.html#l00099">stl_stack.h:99</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="a00587.html">stl_stack.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
>
538
