<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.13"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: utility 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"> $(document).ready(initResizable); </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.13 --> </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"> $(document).ready(function(){initNavTree('a00170_source.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">utility</div> </div> </div><!--header--> <div class="contents"> <a href="a00170.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> // <utility> -*- C++ -*-</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> // Copyright (C) 2001-2015 Free Software Foundation, Inc.</div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> //</div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> // This file is part of the GNU ISO C++ Library. This library is free</div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> // software; you can redistribute it and/or modify it under the</div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> // terms of the GNU General Public License as published by the</div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> // Free Software Foundation; either version 3, or (at your option)</div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> // any later version.</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> // This library is distributed in the hope that it will be useful,</div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> // but WITHOUT ANY WARRANTY; without even the implied warranty of</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> // GNU General Public License for more details.</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> // Under Section 7 of GPL version 3, you are granted additional</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> // permissions described in the GCC Runtime Library Exception, version</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> // 3.1, as published by the Free Software Foundation.</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> // You should have received a copy of the GNU General Public License and</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> // a copy of the GCC Runtime Library Exception along with this program;</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> // <http://www.gnu.org/licenses/>.</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> /*</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  *</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  * Copyright (c) 1994</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  * Hewlett-Packard Company</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  *</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  * Permission to use, copy, modify, distribute and sell this software</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  * and its documentation for any purpose is hereby granted without fee,</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  * provided that the above copyright notice appear in all copies and</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  * that both that copyright notice and this permission notice appear</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  * in supporting documentation. Hewlett-Packard Company makes no</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  * representations about the suitability of this software for any</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  * purpose. It is provided "as is" without express or implied warranty.</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  *</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  *</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  * Copyright (c) 1996,1997</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  * Silicon Graphics Computer Systems, Inc.</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  *</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  * Permission to use, copy, modify, distribute and sell this software</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  * and its documentation for any purpose is hereby granted without fee,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  * provided that the above copyright notice appear in all copies and</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  * that both that copyright notice and this permission notice appear</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  * in supporting documentation. Silicon Graphics makes no</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  * representations about the suitability of this software for any</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  * purpose. It is provided "as is" without express or implied warranty.</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  */</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> /** @file include/utility</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  * This is a Standard C++ Library header. </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  */</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> #ifndef _GLIBCXX_UTILITY</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> #define _GLIBCXX_UTILITY 1</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> #pragma GCC system_header</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> /**</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  * @defgroup utilities Utilities</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  *</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  * Components deemed generally useful. Includes pair, tuple,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  * forward/move helpers, ratio, function object, metaprogramming and</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  * type traits, time, date, and memory functions.</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> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> #include <bits/c++config.h></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> #include <bits/stl_relops.h></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> #include <bits/stl_pair.h></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> #include <bits/move.h></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> #include <initializer_list></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> namespace std _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> {</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  template<class _Tp></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  class tuple_size;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  template<std::size_t _Int, class _Tp></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  class tuple_element;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  // Various functions which give std::pair a tuple-like interface.</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  /// Partial specialization for std::pair</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  template<class _Tp1, class _Tp2></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  struct tuple_size<std::pair<_Tp1, _Tp2>></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  : public integral_constant<std::size_t, 2> { };</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  /// Partial specialization for std::pair</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  template<class _Tp1, class _Tp2></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  struct tuple_element<0, std::pair<_Tp1, _Tp2>></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  { typedef _Tp1 type; };</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  /// Partial specialization for std::pair</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  template<class _Tp1, class _Tp2></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  struct tuple_element<1, std::pair<_Tp1, _Tp2>></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  { typedef _Tp2 type; };</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  template<std::size_t _Int></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  struct __pair_get;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  template<></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  struct __pair_get<0></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  template<typename _Tp1, typename _Tp2></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  static constexpr _Tp1&</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  __get(std::pair<_Tp1, _Tp2>& __pair) noexcept</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  { return __pair.first; }</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>  template<typename _Tp1, typename _Tp2></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  static constexpr _Tp1&&</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  __move_get(std::pair<_Tp1, _Tp2>&& __pair) noexcept</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  { return std::forward<_Tp1>(__pair.first); }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  template<typename _Tp1, typename _Tp2></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  static constexpr const _Tp1&</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  __const_get(const std::pair<_Tp1, _Tp2>& __pair) noexcept</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  { return __pair.first; }</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> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  template<></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  struct __pair_get<1></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  template<typename _Tp1, typename _Tp2></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  static constexpr _Tp2&</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  __get(std::pair<_Tp1, _Tp2>& __pair) noexcept</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  { return __pair.second; }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  template<typename _Tp1, typename _Tp2></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  static constexpr _Tp2&&</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __move_get(std::pair<_Tp1, _Tp2>&& __pair) noexcept</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  { return std::forward<_Tp2>(__pair.second); }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  template<typename _Tp1, typename _Tp2></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  static constexpr const _Tp2&</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  __const_get(const std::pair<_Tp1, _Tp2>& __pair) noexcept</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  { return __pair.second; }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  };</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  template<std::size_t _Int, class _Tp1, class _Tp2></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  constexpr typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  get(std::pair<_Tp1, _Tp2>& __in) noexcept</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  { return __pair_get<_Int>::__get(__in); }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  template<std::size_t _Int, class _Tp1, class _Tp2></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  constexpr typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&&</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  get(std::pair<_Tp1, _Tp2>&& __in) noexcept</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  { return __pair_get<_Int>::__move_get(std::move(__in)); }</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>  template<std::size_t _Int, class _Tp1, class _Tp2></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  constexpr const typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  get(const std::pair<_Tp1, _Tp2>& __in) noexcept</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  { return __pair_get<_Int>::__const_get(__in); }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> #if __cplusplus > 201103L</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> #define __cpp_lib_tuples_by_type 201304</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>  template <typename _Tp, typename _Up></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  constexpr _Tp&</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  get(pair<_Tp, _Up>& __p) noexcept</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  { return __p.first; }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  template <typename _Tp, typename _Up></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  constexpr const _Tp&</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  get(const pair<_Tp, _Up>& __p) noexcept</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  { return __p.first; }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  template <typename _Tp, typename _Up></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  constexpr _Tp&&</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  get(pair<_Tp, _Up>&& __p) noexcept</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  { return std::move(__p.first); }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  template <typename _Tp, typename _Up></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  constexpr _Tp&</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  get(pair<_Up, _Tp>& __p) noexcept</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  { return __p.second; }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  template <typename _Tp, typename _Up></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  constexpr const _Tp&</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  get(const pair<_Up, _Tp>& __p) noexcept</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  { return __p.second; }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  template <typename _Tp, typename _Up></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  constexpr _Tp&&</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  get(pair<_Up, _Tp>&& __p) noexcept</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  { return std::move(__p.second); }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> #define __cpp_lib_exchange_function 201304</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  /// Assign @p __new_val to @p __obj and return its previous value.</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  template <typename _Tp, typename _Up = _Tp></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  inline _Tp</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  exchange(_Tp& __obj, _Up&& __new_val)</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  { return std::__exchange(__obj, std::forward<_Up>(__new_val)); }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> #endif</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>  // Stores a tuple of indices. Used by tuple and pair, and by bind() to</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  // extract the elements in a tuple.</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  template<size_t... _Indexes> struct _Index_tuple { };</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>  // Concatenates two _Index_tuples.</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  template<typename _Itup1, typename _Itup2> struct _Itup_cat;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  template<size_t... _Ind1, size_t... _Ind2></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  struct _Itup_cat<_Index_tuple<_Ind1...>, _Index_tuple<_Ind2...>></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  {</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  using __type = _Index_tuple<_Ind1..., (_Ind2 + sizeof...(_Ind1))...>;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  };</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  // Builds an _Index_tuple<0, 1, 2, ..., _Num-1>.</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  template<size_t _Num></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  struct _Build_index_tuple</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  : _Itup_cat<typename _Build_index_tuple<_Num / 2>::__type,</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  typename _Build_index_tuple<_Num - _Num / 2>::__type></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  { };</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  template<></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  struct _Build_index_tuple<1></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>  typedef _Index_tuple<0> __type;</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> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  template<></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  struct _Build_index_tuple<0></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  typedef _Index_tuple<> __type;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  };</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> #if __cplusplus > 201103L</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> #define __cpp_lib_integer_sequence 201304</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  /// Class template integer_sequence</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  template<typename _Tp, _Tp... _Idx></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  struct integer_sequence</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  {</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  typedef _Tp value_type;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  static constexpr size_t size() { return sizeof...(_Idx); }</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  };</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  template<typename _Tp, _Tp _Num,</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  typename _ISeq = typename _Build_index_tuple<_Num>::__type></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  struct _Make_integer_sequence;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  template<typename _Tp, _Tp _Num, size_t... _Idx></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  struct _Make_integer_sequence<_Tp, _Num, _Index_tuple<_Idx...>></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>  static_assert( _Num >= 0,</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  "Cannot make integer sequence of negative length" );</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  typedef integer_sequence<_Tp, static_cast<_Tp>(_Idx)...> __type;</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> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  /// Alias template make_integer_sequence</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  template<typename _Tp, _Tp _Num></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  using make_integer_sequence</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  = typename _Make_integer_sequence<_Tp, _Num>::__type;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  /// Alias template index_sequence</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  template<size_t... _Idx></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  using index_sequence = integer_sequence<size_t, _Idx...>;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  /// Alias template make_index_sequence</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  template<size_t _Num></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  using make_index_sequence = make_integer_sequence<size_t, _Num>;</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>  /// Alias template index_sequence_for</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  template<typename... _Types></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  using index_sequence_for = make_index_sequence<sizeof...(_Types)>;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> #endif</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> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> } // namespace</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> #endif</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> #endif /* _GLIBCXX_UTILITY */</div></div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="a00170.html">utility</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.13 </li> </ul> </div> </body> </html>