<!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++: bitset 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('a00047_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">bitset</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00047.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> // <bitset> -*- 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-2018 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>  * Copyright (c) 1998</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  * Silicon Graphics Computer Systems, Inc.</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  *</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  * Permission to use, copy, modify, distribute and sell this software</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  * and its documentation for any purpose is hereby granted without fee,</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  * provided that the above copyright notice appear in all copies and</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  * that both that copyright notice and this permission notice appear</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  * in supporting documentation. Silicon Graphics makes no</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  * representations about the suitability of this software for any</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  * purpose. It is provided "as is" without express or implied warranty.</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  */</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> /** @file include/bitset</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  * This is a Standard C++ Library header.</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  */</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> #ifndef _GLIBCXX_BITSET</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> #define _GLIBCXX_BITSET 1</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> #pragma GCC system_header</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> #include <string></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> #include <bits/functexcept.h> // For invalid_argument, out_of_range,</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  // overflow_error</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> #include <iosfwd></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> #include <bits/cxxabi_forced.h></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> # include <bits/functional_hash.h></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> #endif</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> #define _GLIBCXX_BITSET_BITS_PER_WORD (__CHAR_BIT__ * __SIZEOF_LONG__)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> #define _GLIBCXX_BITSET_WORDS(__n) \</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  ((__n) / _GLIBCXX_BITSET_BITS_PER_WORD + \</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  ((__n) % _GLIBCXX_BITSET_BITS_PER_WORD == 0 ? 0 : 1))</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> #define _GLIBCXX_BITSET_BITS_PER_ULL (__CHAR_BIT__ * __SIZEOF_LONG_LONG__)</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> namespace std _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</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>  /**</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  * Base class, general case. It is a class invariant that _Nw will be</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  * nonnegative.</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>  * See documentation for bitset.</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>  template<size_t _Nw></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  struct _Base_bitset</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>  typedef unsigned long _WordT;</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>  /// 0 is the least significant word.</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  _WordT _M_w[_Nw];</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  _GLIBCXX_CONSTEXPR _Base_bitset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  : _M_w() { }</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  constexpr _Base_bitset(unsigned long long __val) noexcept</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  : _M_w{ _WordT(__val)</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> #if __SIZEOF_LONG_LONG__ > __SIZEOF_LONG__</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  , _WordT(__val >> _GLIBCXX_BITSET_BITS_PER_WORD)</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> #endif</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  } { }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> #else</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  _Base_bitset(unsigned long __val)</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  : _M_w()</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  { _M_w[0] = __val; }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> #endif</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  _S_whichword(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _S_whichbyte(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  _S_whichbit(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }</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>  static _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  _S_maskbit(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  _WordT&</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  _M_getword(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  { return _M_w[_S_whichword(__pos)]; }</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  _M_getword(size_t __pos) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  { return _M_w[_S_whichword(__pos)]; }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  const _WordT*</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  _M_getdata() const noexcept</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  { return _M_w; }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> #endif</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  _WordT&</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  _M_hiword() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  { return _M_w[_Nw - 1]; }</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>  _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  _M_hiword() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  { return _M_w[_Nw - 1]; }</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>  void</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  _M_do_and(const _Base_bitset<_Nw>& __x) _GLIBCXX_NOEXCEPT</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>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  _M_w[__i] &= __x._M_w[__i];</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  void</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _M_do_or(const _Base_bitset<_Nw>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  _M_w[__i] |= __x._M_w[__i];</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  void</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  _M_do_xor(const _Base_bitset<_Nw>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  {</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _M_w[__i] ^= __x._M_w[__i];</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  void</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  _M_do_left_shift(size_t __shift) _GLIBCXX_NOEXCEPT;</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>  void</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  _M_do_right_shift(size_t __shift) _GLIBCXX_NOEXCEPT;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  void</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  _M_do_flip() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  _M_w[__i] = ~_M_w[__i];</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> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  void</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  _M_do_set() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  {</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  _M_w[__i] = ~static_cast<_WordT>(0);</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> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  void</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  _M_do_reset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  { __builtin_memset(_M_w, 0, _Nw * sizeof(_WordT)); }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  bool</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  _M_is_equal(const _Base_bitset<_Nw>& __x) const _GLIBCXX_NOEXCEPT</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>  for (size_t __i = 0; __i < _Nw; ++__i)</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  if (_M_w[__i] != __x._M_w[__i])</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  return false;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  return true;</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> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  template<size_t _Nb></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  bool</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  _M_are_all() const _GLIBCXX_NOEXCEPT</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>  for (size_t __i = 0; __i < _Nw - 1; __i++)</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  if (_M_w[__i] != ~static_cast<_WordT>(0))</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  return false;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  return _M_hiword() == (~static_cast<_WordT>(0)</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  >> (_Nw * _GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  - _Nb));</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  bool</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  _M_is_any() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  if (_M_w[__i] != static_cast<_WordT>(0))</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  return true;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  return false;</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> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  size_t</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  _M_do_count() const _GLIBCXX_NOEXCEPT</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>  size_t __result = 0;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  __result += __builtin_popcountl(_M_w[__i]);</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  return __result;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  unsigned long</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  _M_do_to_ulong() const;</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> #if __cplusplus >= 201103L</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  unsigned long long</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  _M_do_to_ullong() const;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> #endif</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>  // find first "on" bit</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  size_t</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  _M_do_find_first(size_t) const _GLIBCXX_NOEXCEPT;</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>  // find the next "on" bit that follows "prev"</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  size_t</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  _M_do_find_next(size_t, size_t) const _GLIBCXX_NOEXCEPT;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  };</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>  // Definitions of non-inline functions from _Base_bitset.</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  template<size_t _Nw></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  void</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  if (__builtin_expect(__shift != 0, 1))</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD;</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>  if (__offset == 0)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  for (size_t __n = _Nw - 1; __n >= __wshift; --__n)</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  _M_w[__n] = _M_w[__n - __wshift];</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  else</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  {</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  - __offset);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  for (size_t __n = _Nw - 1; __n > __wshift; --__n)</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  _M_w[__n] = ((_M_w[__n - __wshift] << __offset)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  | (_M_w[__n - __wshift - 1] >> __sub_offset));</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  _M_w[__wshift] = _M_w[0] << __offset;</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>  std::fill(_M_w + 0, _M_w + __wshift, static_cast<_WordT>(0));</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</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>  template<size_t _Nw></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  void</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  if (__builtin_expect(__shift != 0, 1))</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  {</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD;</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  const size_t __limit = _Nw - __wshift - 1;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  if (__offset == 0)</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  for (size_t __n = 0; __n <= __limit; ++__n)</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  _M_w[__n] = _M_w[__n + __wshift];</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  else</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>  const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  - __offset);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  for (size_t __n = 0; __n < __limit; ++__n)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  _M_w[__n] = ((_M_w[__n + __wshift] >> __offset)</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  | (_M_w[__n + __wshift + 1] << __sub_offset));</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  _M_w[__limit] = _M_w[_Nw-1] >> __offset;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::fill(_M_w + __limit + 1, _M_w + _Nw, static_cast<_WordT>(0));</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  template<size_t _Nw></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  unsigned long</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  _Base_bitset<_Nw>::_M_do_to_ulong() const</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  for (size_t __i = 1; __i < _Nw; ++__i)</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  if (_M_w[__i])</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  __throw_overflow_error(__N("_Base_bitset::_M_do_to_ulong"));</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  return _M_w[0];</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  template<size_t _Nw></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  unsigned long long</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  _Base_bitset<_Nw>::_M_do_to_ullong() const</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  const bool __dw = sizeof(unsigned long long) > sizeof(unsigned long);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  for (size_t __i = 1 + __dw; __i < _Nw; ++__i)</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  if (_M_w[__i])</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  __throw_overflow_error(__N("_Base_bitset::_M_do_to_ullong"));</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  if (__dw)</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  return _M_w[0] + (static_cast<unsigned long long>(_M_w[1])</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  << _GLIBCXX_BITSET_BITS_PER_WORD);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  return _M_w[0];</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> #endif</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  template<size_t _Nw></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  size_t</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  _Base_bitset<_Nw>::</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  _M_do_find_first(size_t __not_found) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  for (size_t __i = 0; __i < _Nw; __i++)</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  {</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  _WordT __thisword = _M_w[__i];</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  if (__thisword != static_cast<_WordT>(0))</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  return (__i * _GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  + __builtin_ctzl(__thisword));</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  }</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  // not found, so return an indication of failure.</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  return __not_found;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  template<size_t _Nw></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  size_t</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  _Base_bitset<_Nw>::</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  _M_do_find_next(size_t __prev, size_t __not_found) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  // make bound inclusive</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  ++__prev;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  // check out of bounds</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  if (__prev >= _Nw * _GLIBCXX_BITSET_BITS_PER_WORD)</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  return __not_found;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  // search first word</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  size_t __i = _S_whichword(__prev);</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  _WordT __thisword = _M_w[__i];</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>  // mask off bits below bound</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  __thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev);</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  if (__thisword != static_cast<_WordT>(0))</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  return (__i * _GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  + __builtin_ctzl(__thisword));</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  // check subsequent words</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  __i++;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  for (; __i < _Nw; __i++)</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  {</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  __thisword = _M_w[__i];</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  if (__thisword != static_cast<_WordT>(0))</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  return (__i * _GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  + __builtin_ctzl(__thisword));</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  // not found, so return an indication of failure.</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  return __not_found;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  } // end _M_do_find_next</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</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>  * Base class, specialization for a single word.</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  *</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  * See documentation for bitset.</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  */</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  template<></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  struct _Base_bitset<1></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  typedef unsigned long _WordT;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  _WordT _M_w;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  _GLIBCXX_CONSTEXPR _Base_bitset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  : _M_w(0)</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  { }</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  constexpr _Base_bitset(unsigned long long __val) noexcept</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> #else</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  _Base_bitset(unsigned long __val)</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> #endif</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  : _M_w(__val)</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  { }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  _S_whichword(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  _S_whichbyte(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  _S_whichbit(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  static _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  _S_maskbit(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> </div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  _WordT&</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  _M_getword(size_t) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  { return _M_w; }</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  _M_getword(size_t) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  { return _M_w; }</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  const _WordT*</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  _M_getdata() const noexcept</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  { return &_M_w; }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> #endif</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  _WordT&</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  _M_hiword() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  { return _M_w; }</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> </div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  _M_hiword() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  { return _M_w; }</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> </div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  void</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  _M_do_and(const _Base_bitset<1>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  { _M_w &= __x._M_w; }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  void</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  _M_do_or(const _Base_bitset<1>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  { _M_w |= __x._M_w; }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> </div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  void</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  _M_do_xor(const _Base_bitset<1>& __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  { _M_w ^= __x._M_w; }</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  void</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  _M_do_left_shift(size_t __shift) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  { _M_w <<= __shift; }</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  void</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  _M_do_right_shift(size_t __shift) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  { _M_w >>= __shift; }</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  void</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  _M_do_flip() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  { _M_w = ~_M_w; }</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  void</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  _M_do_set() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  { _M_w = ~static_cast<_WordT>(0); }</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  void</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  _M_do_reset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  { _M_w = 0; }</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> </div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  bool</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  _M_is_equal(const _Base_bitset<1>& __x) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  { return _M_w == __x._M_w; }</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> </div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  template<size_t _Nb></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  bool</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  _M_are_all() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  { return _M_w == (~static_cast<_WordT>(0)</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  >> (_GLIBCXX_BITSET_BITS_PER_WORD - _Nb)); }</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> </div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  bool</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  _M_is_any() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  { return _M_w != 0; }</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  size_t</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  _M_do_count() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  { return __builtin_popcountl(_M_w); }</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  unsigned long</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  _M_do_to_ulong() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  { return _M_w; }</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  unsigned long long</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  _M_do_to_ullong() const noexcept</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  { return _M_w; }</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> #endif</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  size_t</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  _M_do_find_first(size_t __not_found) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  if (_M_w != 0)</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  return __builtin_ctzl(_M_w);</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  else</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  return __not_found;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  }</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  // find the next "on" bit that follows "prev"</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  size_t</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  _M_do_find_next(size_t __prev, size_t __not_found) const</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  {</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  ++__prev;</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  if (__prev >= ((size_t) _GLIBCXX_BITSET_BITS_PER_WORD))</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  return __not_found;</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  _WordT __x = _M_w >> __prev;</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  if (__x != 0)</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  return __builtin_ctzl(__x) + __prev;</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  else</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  return __not_found;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  }</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  };</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> </div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  /**</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  * Base class, specialization for no storage (zero-length %bitset).</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  *</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  * See documentation for bitset.</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  */</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  template<></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  struct _Base_bitset<0></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  {</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  typedef unsigned long _WordT;</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  _GLIBCXX_CONSTEXPR _Base_bitset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  { }</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  constexpr _Base_bitset(unsigned long long) noexcept</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> #else</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  _Base_bitset(unsigned long)</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> #endif</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  { }</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  _S_whichword(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  { return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  _S_whichbyte(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  { return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  static _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  _S_whichbit(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  { return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  static _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  _S_maskbit(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  { return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  // This would normally give access to the data. The bounds-checking</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  // in the bitset class will prevent the user from getting this far,</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  // but (1) it must still return an lvalue to compile, and (2) the</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  // user might call _Unchecked_set directly, in which case this /needs/</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  // to fail. Let's not penalize zero-length users unless they actually</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  // make an unchecked call; all the memory ugliness is therefore</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  // localized to this single should-never-get-this-far function.</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  _WordT&</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  _M_getword(size_t) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  {</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  __throw_out_of_range(__N("_Base_bitset::_M_getword"));</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  return *new _WordT;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  _M_getword(size_t) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  { return 0; }</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> </div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  _GLIBCXX_CONSTEXPR _WordT</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  _M_hiword() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  { return 0; }</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  void</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  _M_do_and(const _Base_bitset<0>&) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  { }</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> </div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  void</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  _M_do_or(const _Base_bitset<0>&) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  { }</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> </div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  void</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  _M_do_xor(const _Base_bitset<0>&) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  { }</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  void</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  _M_do_left_shift(size_t) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  { }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  void</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  _M_do_right_shift(size_t) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  { }</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> </div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  void</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  _M_do_flip() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  { }</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  void</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  _M_do_set() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  { }</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> </div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  void</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  _M_do_reset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  { }</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> </div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  // Are all empty bitsets equal to each other? Are they equal to</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  // themselves? How to compare a thing which has no state? What is</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  // the sound of one zero-length bitset clapping?</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  bool</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  _M_is_equal(const _Base_bitset<0>&) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  { return true; }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> </div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  template<size_t _Nb></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  bool</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  _M_are_all() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  { return true; }</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  bool</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  _M_is_any() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  { return false; }</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> </div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  size_t</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  _M_do_count() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  { return 0; }</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> </div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  unsigned long</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  _M_do_to_ulong() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  { return 0; }</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> </div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  unsigned long long</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  _M_do_to_ullong() const noexcept</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  { return 0; }</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span> #endif</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> </div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  // Normally "not found" is the size, but that could also be</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  // misinterpreted as an index in this corner case. Oh well.</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  size_t</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  _M_do_find_first(size_t) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  { return 0; }</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> </div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  size_t</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  _M_do_find_next(size_t, size_t) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  { return 0; }</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  };</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> </div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  // Helper class to zero out the unused high-order bits in the highest word.</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  template<size_t _Extrabits></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  struct _Sanitize</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  {</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  typedef unsigned long _WordT;</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> </div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  static void</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  _S_do_sanitize(_WordT& __val) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  { __val &= ~((~static_cast<_WordT>(0)) << _Extrabits); }</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  };</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  template<></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  struct _Sanitize<0></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  {</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  typedef unsigned long _WordT;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> </div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  static void</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  _S_do_sanitize(_WordT) _GLIBCXX_NOEXCEPT { }</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  };</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  template<size_t _Nb, bool = (_Nb < _GLIBCXX_BITSET_BITS_PER_ULL)></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  struct _Sanitize_val</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  {</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  static constexpr unsigned long long</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  _S_do_sanitize_val(unsigned long long __val)</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  { return __val; }</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  };</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> </div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  template<size_t _Nb></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  struct _Sanitize_val<_Nb, true></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  static constexpr unsigned long long</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  _S_do_sanitize_val(unsigned long long __val)</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  { return __val & ~((~static_cast<unsigned long long>(0)) << _Nb); }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  };</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span> #endif</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> </div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  /**</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  * @brief The %bitset class represents a @e fixed-size sequence of bits.</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  * @ingroup utilities</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  *</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  * (Note that %bitset does @e not meet the formal requirements of a</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  * <a href="tables.html#65">container</a>. Mainly, it lacks iterators.)</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  *</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  * The template argument, @a Nb, may be any non-negative number,</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  * specifying the number of bits (e.g., "0", "12", "1024*1024").</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  *</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  * In the general unoptimized case, storage is allocated in word-sized</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  * blocks. Let B be the number of bits in a word, then (Nb+(B-1))/B</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  * words will be used for storage. B - Nb%B bits are unused. (They are</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  * the high-order bits in the highest word.) It is a class invariant</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  * that those unused bits are always zero.</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  *</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  * If you think of %bitset as <em>a simple array of bits</em>, be</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  * aware that your mental picture is reversed: a %bitset behaves</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  * the same way as bits in integers do, with the bit at index 0 in</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  * the <em>least significant / right-hand</em> position, and the bit at</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  * index Nb-1 in the <em>most significant / left-hand</em> position.</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  * Thus, unlike other containers, a %bitset's index <em>counts from</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  * right to left</em>, to put it very loosely.</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  *</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  * This behavior is preserved when translating to and from strings. For</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  * example, the first line of the following program probably prints</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  * <em>b(&apos;a&apos;) is 0001100001</em> on a modern ASCII system.</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  *</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  * @code</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  * #include <bitset></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  * #include <iostream></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  * #include <sstream></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  *</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  * using namespace std;</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  *</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  * int main()</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  * {</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  * long a = 'a';</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  * bitset<10> b(a);</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  *</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  * cout << "b('a') is " << b << endl;</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  *</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  * ostringstream s;</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  * s << b;</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  * string str = s.str();</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  * cout << "index 3 in the string is " << str[3] << " but\n"</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  * << "index 3 in the bitset is " << b[3] << endl;</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  * }</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  * @endcode</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  *</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  * Also see:</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  * https://gcc.gnu.org/onlinedocs/libstdc++/manual/ext_containers.html</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  * for a description of extensions.</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  *</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  * Most of the actual code isn't contained in %bitset<> itself, but in the</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  * base class _Base_bitset. The base class works with whole words, not with</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  * individual bits. This allows us to specialize _Base_bitset for the</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  * important special case where the %bitset is only a single word.</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  *</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  * Extra confusion can result due to the fact that the storage for</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  * _Base_bitset @e is a regular array, and is indexed as such. This is</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  * carefully encapsulated.</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  */</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  template<size_t _Nb></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  class bitset</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  : private _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  {</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  private:</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base;</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  typedef unsigned long _WordT;</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> </div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  void</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  _M_check_initial_position(const std::basic_string<_CharT, _Traits, _Alloc>& __s,</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  size_t __position) const</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  if (__position > __s.size())</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  __throw_out_of_range_fmt(__N("bitset::bitset: __position "</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  "(which is %zu) > __s.size() "</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  "(which is %zu)"),</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  __position, __s.size());</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  }</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> </div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  void _M_check(size_t __position, const char *__s) const</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  {</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  if (__position >= _Nb)</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  __throw_out_of_range_fmt(__N("%s: __position (which is %zu) "</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  ">= _Nb (which is %zu)"),</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  __s, __position, _Nb);</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  }</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  void</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  _M_do_sanitize() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  {</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  typedef _Sanitize<_Nb % _GLIBCXX_BITSET_BITS_PER_WORD> __sanitize_type;</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  __sanitize_type::_S_do_sanitize(this->_M_hiword());</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> </div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  friend struct std::hash<bitset>;</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> #endif</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  public:</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  /**</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  * This encapsulates the concept of a single bit. An instance of this</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  * class is a proxy for an actual bit; this way the individual bit</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  * operations are done as faster word-size bitwise instructions.</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  *</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  * Most users will never need to use this class directly; conversions</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  * to and from bool are automatic and should be transparent. Overloaded</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  * operators help to preserve the illusion.</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  *</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  * (On a typical system, this <em>bit %reference</em> is 64</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  * times the size of an actual bit. Ha.)</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  */</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  class reference</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  {</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  friend class bitset;</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> </div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  _WordT* _M_wp;</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  size_t _M_bpos;</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> </div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  // left undefined</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  reference();</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> </div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  public:</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  reference(bitset& __b, size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  {</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  _M_wp = &__b._M_getword(__pos);</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  _M_bpos = _Base::_S_whichbit(__pos);</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  }</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> </div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  ~reference() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  { }</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> </div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  // For b[i] = __x;</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  reference&</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  operator=(bool __x) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  if (__x)</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  *_M_wp |= _Base::_S_maskbit(_M_bpos);</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  else</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  *_M_wp &= ~_Base::_S_maskbit(_M_bpos);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  return *this;</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> </div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  // For b[i] = b[__j];</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  reference&</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  operator=(const reference& __j) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  {</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos)))</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  *_M_wp |= _Base::_S_maskbit(_M_bpos);</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  else</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  *_M_wp &= ~_Base::_S_maskbit(_M_bpos);</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  return *this;</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> </div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  // Flips the bit</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  bool</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  operator~() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) == 0; }</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  // For __x = b[i];</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  operator bool() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  { return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) != 0; }</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span> </div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  // For b[i].flip();</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  reference&</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  flip() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  {</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  *_M_wp ^= _Base::_S_maskbit(_M_bpos);</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  return *this;</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  }</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  };</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  friend class reference;</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> </div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  // 23.3.5.1 constructors:</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  /// All bits set to zero.</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  _GLIBCXX_CONSTEXPR bitset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  { }</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span> </div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  /// Initial bits bitwise-copied from a single word (others set to zero).</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  constexpr bitset(unsigned long long __val) noexcept</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  : _Base(_Sanitize_val<_Nb>::_S_do_sanitize_val(__val)) { }</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> #else</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  bitset(unsigned long __val)</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  : _Base(__val)</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  { _M_do_sanitize(); }</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span> #endif</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> </div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  /**</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  * Use a subset of a string.</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  * @param __s A string of @a 0 and @a 1 characters.</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  * @param __position Index of the first character in @a __s to use;</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  * defaults to zero.</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  * @throw std::out_of_range If @a pos is bigger the size of @a __s.</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  * @throw std::invalid_argument If a character appears in the string</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  * which is neither @a 0 nor @a 1.</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  */</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  explicit</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  size_t __position = 0)</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  : _Base()</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  {</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  _M_check_initial_position(__s, __position);</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  _M_copy_from_string(__s, __position,</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  std::basic_string<_CharT, _Traits, _Alloc>::npos,</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  _CharT('0'), _CharT('1'));</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  }</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> </div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  /**</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  * Use a subset of a string.</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  * @param __s A string of @a 0 and @a 1 characters.</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  * @param __position Index of the first character in @a __s to use.</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  * @param __n The number of characters to copy.</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  * @throw std::out_of_range If @a __position is bigger the size</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  * of @a __s.</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  * @throw std::invalid_argument If a character appears in the string</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  * which is neither @a 0 nor @a 1.</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  */</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  size_t __position, size_t __n)</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  : _Base()</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  {</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  _M_check_initial_position(__s, __position);</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  _M_copy_from_string(__s, __position, __n, _CharT('0'), _CharT('1'));</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span> </div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  // 396. what are characters zero and one.</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  size_t __position, size_t __n,</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  _CharT __zero, _CharT __one = _CharT('1'))</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  : _Base()</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  {</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  _M_check_initial_position(__s, __position);</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  _M_copy_from_string(__s, __position, __n, __zero, __one);</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  }</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> </div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  /**</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  * Construct from a character %array.</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  * @param __str An %array of characters @a zero and @a one.</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  * @param __n The number of characters to use.</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  * @param __zero The character corresponding to the value 0.</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  * @param __one The character corresponding to the value 1.</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  * @throw std::invalid_argument If a character appears in the string</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  * which is neither @a __zero nor @a __one.</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  */</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  template<typename _CharT></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  explicit</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  bitset(const _CharT* __str,</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  typename std::basic_string<_CharT>::size_type __n</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  = std::basic_string<_CharT>::npos,</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  _CharT __zero = _CharT('0'), _CharT __one = _CharT('1'))</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  : _Base()</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  {</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  if (!__str)</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  __throw_logic_error(__N("bitset::bitset(const _CharT*, ...)"));</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> </div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  if (__n == std::basic_string<_CharT>::npos)</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  __n = std::char_traits<_CharT>::length(__str);</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  _M_copy_from_ptr<_CharT, std::char_traits<_CharT>>(__str, __n, 0,</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  __n, __zero,</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  __one);</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  }</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> #endif</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> </div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  // 23.3.5.2 bitset operations:</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  //@{</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  /**</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  * Operations on bitsets.</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  * @param __rhs A same-sized bitset.</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  *</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  * These should be self-explanatory.</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  */</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  bitset<_Nb>&</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  operator&=(const bitset<_Nb>& __rhs) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  {</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  this->_M_do_and(__rhs);</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  return *this;</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  }</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> </div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  bitset<_Nb>&</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  operator|=(const bitset<_Nb>& __rhs) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  {</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  this->_M_do_or(__rhs);</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  return *this;</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  }</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> </div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  bitset<_Nb>&</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  operator^=(const bitset<_Nb>& __rhs) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  {</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  this->_M_do_xor(__rhs);</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  return *this;</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  }</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  //@}</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> </div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  //@{</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  /**</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  * Operations on bitsets.</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  * @param __position The number of places to shift.</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  *</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  * These should be self-explanatory.</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  */</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  bitset<_Nb>&</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  operator<<=(size_t __position) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  {</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  if (__builtin_expect(__position < _Nb, 1))</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  {</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  this->_M_do_left_shift(__position);</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  this->_M_do_sanitize();</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  else</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  this->_M_do_reset();</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  return *this;</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  }</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> </div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  bitset<_Nb>&</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  operator>>=(size_t __position) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  {</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  if (__builtin_expect(__position < _Nb, 1))</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  {</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  this->_M_do_right_shift(__position);</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  this->_M_do_sanitize();</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  }</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  else</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  this->_M_do_reset();</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  return *this;</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  }</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  //@}</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  //@{</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  /**</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  * These versions of single-bit set, reset, flip, and test are</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  * extensions from the SGI version. They do no range checking.</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  * @ingroup SGIextensions</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  */</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  bitset<_Nb>&</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  _Unchecked_set(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  {</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  this->_M_getword(__pos) |= _Base::_S_maskbit(__pos);</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  return *this;</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> </div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  bitset<_Nb>&</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  _Unchecked_set(size_t __pos, int __val) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  {</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  if (__val)</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  this->_M_getword(__pos) |= _Base::_S_maskbit(__pos);</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  else</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos);</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  return *this;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> </div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  bitset<_Nb>&</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  _Unchecked_reset(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos);</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  return *this;</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> </div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  bitset<_Nb>&</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  _Unchecked_flip(size_t __pos) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  {</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  this->_M_getword(__pos) ^= _Base::_S_maskbit(__pos);</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  return *this;</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> </div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  _GLIBCXX_CONSTEXPR bool</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  _Unchecked_test(size_t __pos) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  { return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos))</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  != static_cast<_WordT>(0)); }</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  //@}</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> </div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  // Set, reset, and flip.</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  /**</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  * @brief Sets every bit to true.</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  */</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  bitset<_Nb>&</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  set() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  {</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  this->_M_do_set();</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  this->_M_do_sanitize();</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  return *this;</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  }</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span> </div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  /**</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  * @brief Sets a given bit to a particular value.</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  * @param __position The index of the bit.</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  * @param __val Either true or false, defaults to true.</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  * @throw std::out_of_range If @a pos is bigger the size of the %set.</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  */</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  bitset<_Nb>&</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  set(size_t __position, bool __val = true)</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  {</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  this->_M_check(__position, __N("bitset::set"));</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  return _Unchecked_set(__position, __val);</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  }</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> </div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  /**</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  * @brief Sets every bit to false.</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  */</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  bitset<_Nb>&</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  reset() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  {</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  this->_M_do_reset();</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  return *this;</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  }</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span> </div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  /**</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  * @brief Sets a given bit to false.</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  * @param __position The index of the bit.</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  * @throw std::out_of_range If @a pos is bigger the size of the %set.</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  *</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  * Same as writing @c set(pos,false).</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  */</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  bitset<_Nb>&</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  reset(size_t __position)</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  {</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  this->_M_check(__position, __N("bitset::reset"));</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  return _Unchecked_reset(__position);</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  }</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> </div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  /**</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  * @brief Toggles every bit to its opposite value.</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  */</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  bitset<_Nb>&</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  flip() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  {</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  this->_M_do_flip();</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  this->_M_do_sanitize();</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  return *this;</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  }</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> </div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  /**</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  * @brief Toggles a given bit to its opposite value.</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  * @param __position The index of the bit.</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  * @throw std::out_of_range If @a pos is bigger the size of the %set.</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  */</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  bitset<_Nb>&</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  flip(size_t __position)</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  {</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  this->_M_check(__position, __N("bitset::flip"));</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  return _Unchecked_flip(__position);</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  }</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> </div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  /// See the no-argument flip().</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  bitset<_Nb></div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  operator~() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  { return bitset<_Nb>(*this).flip(); }</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span> </div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  //@{</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  /**</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  * @brief Array-indexing support.</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  * @param __position Index into the %bitset.</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  * @return A bool for a <em>const %bitset</em>. For non-const</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  * bitsets, an instance of the reference proxy class.</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  * @note These operators do no range checking and throw no exceptions,</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  * as required by DR 11 to the standard.</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  *</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  * _GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  * resolves DR 11 (items 1 and 2), but does not do the range-checking</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  * required by that DR's resolution. -pme</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  * The DR has since been changed: range-checking is a precondition</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  * (users' responsibility), and these functions must not throw. -pme</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  */</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  reference</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  operator[](size_t __position)</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  { return reference(*this, __position); }</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span> </div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  _GLIBCXX_CONSTEXPR bool</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  operator[](size_t __position) const</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  { return _Unchecked_test(__position); }</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  //@}</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> </div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  /**</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  * @brief Returns a numerical interpretation of the %bitset.</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  * @return The integral equivalent of the bits.</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  * @throw std::overflow_error If there are too many bits to be</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  * represented in an @c unsigned @c long.</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  */</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  unsigned long</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  to_ulong() const</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  { return this->_M_do_to_ulong(); }</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> </div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  unsigned long long</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  to_ullong() const</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  { return this->_M_do_to_ullong(); }</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> #endif</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> </div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  /**</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  * @brief Returns a character interpretation of the %bitset.</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  * @return The string equivalent of the bits.</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  *</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  * Note the ordering of the bits: decreasing character positions</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  * correspond to increasing bit positions (see the main class notes for</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  * an example).</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  */</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  std::basic_string<_CharT, _Traits, _Alloc></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  to_string() const</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  {</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  std::basic_string<_CharT, _Traits, _Alloc> __result;</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  _M_copy_to_string(__result, _CharT('0'), _CharT('1'));</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  return __result;</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  }</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> </div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  // 396. what are characters zero and one.</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  std::basic_string<_CharT, _Traits, _Alloc></div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  to_string(_CharT __zero, _CharT __one = _CharT('1')) const</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  {</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  std::basic_string<_CharT, _Traits, _Alloc> __result;</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  _M_copy_to_string(__result, __zero, __one);</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  return __result;</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  }</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> </div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  // 434. bitset::to_string() hard to use.</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  template<class _CharT, class _Traits></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  std::basic_string<_CharT, _Traits, std::allocator<_CharT> ></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  to_string() const</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  { return to_string<_CharT, _Traits, std::allocator<_CharT> >(); }</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> </div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  // 853. to_string needs updating with zero and one.</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  template<class _CharT, class _Traits></div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  std::basic_string<_CharT, _Traits, std::allocator<_CharT> ></div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  to_string(_CharT __zero, _CharT __one = _CharT('1')) const</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  { return to_string<_CharT, _Traits,</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  std::allocator<_CharT> >(__zero, __one); }</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> </div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  template<class _CharT></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  std::basic_string<_CharT, std::char_traits<_CharT>,</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  std::allocator<_CharT> ></div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  to_string() const</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  {</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  return to_string<_CharT, std::char_traits<_CharT>,</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  std::allocator<_CharT> >();</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  }</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span> </div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  template<class _CharT></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  std::basic_string<_CharT, std::char_traits<_CharT>,</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  std::allocator<_CharT> ></div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  to_string(_CharT __zero, _CharT __one = _CharT('1')) const</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  {</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  return to_string<_CharT, std::char_traits<_CharT>,</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  std::allocator<_CharT> >(__zero, __one);</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  }</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> </div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  std::basic_string<char, std::char_traits<char>, std::allocator<char> ></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  to_string() const</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  {</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  return to_string<char, std::char_traits<char>,</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  std::allocator<char> >();</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  }</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> </div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  std::basic_string<char, std::char_traits<char>, std::allocator<char> ></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  to_string(char __zero, char __one = '1') const</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  {</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  return to_string<char, std::char_traits<char>,</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  std::allocator<char> >(__zero, __one);</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  }</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> </div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  // Helper functions for string operations.</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  template<class _CharT, class _Traits></div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  void</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  _M_copy_from_ptr(const _CharT*, size_t, size_t, size_t,</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  _CharT, _CharT);</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> </div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  void</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  _M_copy_from_string(const std::basic_string<_CharT,</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  _Traits, _Alloc>& __s, size_t __pos, size_t __n,</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  _CharT __zero, _CharT __one)</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  { _M_copy_from_ptr<_CharT, _Traits>(__s.data(), __s.size(), __pos, __n,</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  __zero, __one); }</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> </div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  void</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&,</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  _CharT, _CharT) const;</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> </div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  // NB: Backward compat.</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  void</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  _M_copy_from_string(const std::basic_string<_CharT,</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  _Traits, _Alloc>& __s, size_t __pos, size_t __n)</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  { _M_copy_from_string(__s, __pos, __n, _CharT('0'), _CharT('1')); }</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span> </div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  void</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  _M_copy_to_string(std::basic_string<_CharT, _Traits,_Alloc>& __s) const</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  { _M_copy_to_string(__s, _CharT('0'), _CharT('1')); }</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> </div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  /// Returns the number of bits which are set.</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  size_t</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  count() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  { return this->_M_do_count(); }</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> </div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  /// Returns the total number of bits.</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  _GLIBCXX_CONSTEXPR size_t</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  size() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  { return _Nb; }</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> </div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  //@{</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  /// These comparisons for equality/inequality are, well, @e bitwise.</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  bool</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  operator==(const bitset<_Nb>& __rhs) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  { return this->_M_is_equal(__rhs); }</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span> </div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  bool</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  operator!=(const bitset<_Nb>& __rhs) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  { return !this->_M_is_equal(__rhs); }</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  //@}</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> </div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  /**</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  * @brief Tests the value of a bit.</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  * @param __position The index of a bit.</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  * @return The value at @a pos.</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  * @throw std::out_of_range If @a pos is bigger the size of the %set.</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  */</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  bool</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  test(size_t __position) const</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  {</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  this->_M_check(__position, __N("bitset::test"));</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  return _Unchecked_test(__position);</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  }</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> </div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  // DR 693. std::bitset::all() missing.</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  /**</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  * @brief Tests whether all the bits are on.</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  * @return True if all the bits are set.</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  */</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  bool</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  all() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  { return this->template _M_are_all<_Nb>(); }</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span> </div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  /**</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  * @brief Tests whether any of the bits are on.</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  * @return True if at least one bit is set.</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  */</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  bool</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  any() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  { return this->_M_is_any(); }</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span> </div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  /**</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  * @brief Tests whether any of the bits are on.</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  * @return True if none of the bits are set.</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  */</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  bool</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  none() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  { return !this->_M_is_any(); }</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span> </div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  //@{</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  /// Self-explanatory.</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  bitset<_Nb></div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  operator<<(size_t __position) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  { return bitset<_Nb>(*this) <<= __position; }</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> </div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  bitset<_Nb></div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  operator>>(size_t __position) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  { return bitset<_Nb>(*this) >>= __position; }</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  //@}</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> </div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  /**</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  * @brief Finds the index of the first "on" bit.</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  * @return The index of the first bit set, or size() if not found.</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  * @ingroup SGIextensions</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  * @sa _Find_next</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  */</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  size_t</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  _Find_first() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  { return this->_M_do_find_first(_Nb); }</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span> </div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  /**</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  * @brief Finds the index of the next "on" bit after prev.</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  * @return The index of the next bit set, or size() if not found.</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  * @param __prev Where to start searching.</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  * @ingroup SGIextensions</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  * @sa _Find_first</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  */</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  size_t</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  _Find_next(size_t __prev) const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  { return this->_M_do_find_next(__prev, _Nb); }</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  };</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span> </div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  // Definitions of non-inline member functions.</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  template<size_t _Nb></div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  template<class _CharT, class _Traits></div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  void</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  bitset<_Nb>::</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  _M_copy_from_ptr(const _CharT* __s, size_t __len,</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  size_t __pos, size_t __n, _CharT __zero, _CharT __one)</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  {</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  reset();</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  const size_t __nbits = std::min(_Nb, std::min(__n, size_t(__len - __pos)));</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  for (size_t __i = __nbits; __i > 0; --__i)</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  {</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  const _CharT __c = __s[__pos + __nbits - __i];</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  if (_Traits::eq(__c, __zero))</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  ;</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  else if (_Traits::eq(__c, __one))</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  _Unchecked_set(__i - 1);</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  else</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  __throw_invalid_argument(__N("bitset::_M_copy_from_ptr"));</div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  }</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  }</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> </div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  template<size_t _Nb></div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  template<class _CharT, class _Traits, class _Alloc></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  void</div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  bitset<_Nb>::</div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s,</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  _CharT __zero, _CharT __one) const</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  {</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  __s.assign(_Nb, __zero);</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  for (size_t __i = _Nb; __i > 0; --__i)</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  if (_Unchecked_test(__i - 1))</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  _Traits::assign(__s[_Nb - __i], __one);</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  }</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> </div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  // 23.3.5.3 bitset operations:</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  //@{</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  /**</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  * @brief Global bitwise operations on bitsets.</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  * @param __x A bitset.</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  * @param __y A bitset of the same size as @a __x.</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  * @return A new bitset.</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  *</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  * These should be self-explanatory.</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  */</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  template<size_t _Nb></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  inline bitset<_Nb></div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  {</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  bitset<_Nb> __result(__x);</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  __result &= __y;</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  return __result;</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  }</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> </div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  template<size_t _Nb></div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  inline bitset<_Nb></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  {</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  bitset<_Nb> __result(__x);</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  __result |= __y;</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  return __result;</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  }</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> </div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  template <size_t _Nb></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  inline bitset<_Nb></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y) _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  {</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  bitset<_Nb> __result(__x);</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  __result ^= __y;</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  return __result;</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  }</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  //@}</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span> </div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  //@{</div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  /**</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  * @brief Global I/O operators for bitsets.</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  *</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  * Direct I/O between streams and bitsets is supported. Output is</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  * straightforward. Input will skip whitespace, only accept @a 0 and @a 1</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  * characters, and will only extract as many digits as the %bitset will</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  * hold.</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  */</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  template<class _CharT, class _Traits, size_t _Nb></div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  std::basic_istream<_CharT, _Traits>&</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  {</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  typedef typename _Traits::char_type char_type;</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  typedef std::basic_istream<_CharT, _Traits> __istream_type;</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  typedef typename __istream_type::ios_base __ios_base;</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> </div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  std::basic_string<_CharT, _Traits> __tmp;</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  __tmp.reserve(_Nb);</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> </div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  // 303. Bitset input operator underspecified</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  const char_type __zero = __is.widen('0');</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  const char_type __one = __is.widen('1');</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span> </div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  typename __ios_base::iostate __state = __ios_base::goodbit;</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  typename __istream_type::sentry __sentry(__is);</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  if (__sentry)</div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  {</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  __try</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  {</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  for (size_t __i = _Nb; __i > 0; --__i)</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  {</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  static typename _Traits::int_type __eof = _Traits::eof();</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> </div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  typename _Traits::int_type __c1 = __is.rdbuf()->sbumpc();</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  if (_Traits::eq_int_type(__c1, __eof))</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  {</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  __state |= __ios_base::eofbit;</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  break;</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  }</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  else</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  {</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  const char_type __c2 = _Traits::to_char_type(__c1);</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  if (_Traits::eq(__c2, __zero))</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  __tmp.push_back(__zero);</div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  else if (_Traits::eq(__c2, __one))</div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  __tmp.push_back(__one);</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  else if (_Traits::</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  eq_int_type(__is.rdbuf()->sputbackc(__c2),</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  __eof))</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  {</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  __state |= __ios_base::failbit;</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  break;</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  }</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  }</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  }</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  }</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  __catch(__cxxabiv1::__forced_unwind&)</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  {</div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  __is._M_setstate(__ios_base::badbit);</div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  __throw_exception_again;</div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  }</div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  __catch(...)</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  { __is._M_setstate(__ios_base::badbit); }</div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  }</div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> </div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  if (__tmp.empty() && _Nb)</div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  __state |= __ios_base::failbit;</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  else</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  __x._M_copy_from_string(__tmp, static_cast<size_t>(0), _Nb,</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  __zero, __one);</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  if (__state)</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  __is.setstate(__state);</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  return __is;</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  }</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span> </div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  template <class _CharT, class _Traits, size_t _Nb></div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  std::basic_ostream<_CharT, _Traits>&</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  operator<<(std::basic_ostream<_CharT, _Traits>& __os,</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  const bitset<_Nb>& __x)</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  {</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  std::basic_string<_CharT, _Traits> __tmp;</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span> </div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  // _GLIBCXX_RESOLVE_LIB_DEFECTS</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  // 396. what are characters zero and one.</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__os.getloc());</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  __x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1'));</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  return __os << __tmp;</div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  }</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  //@}</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span> </div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span> } // namespace std</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> </div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> #undef _GLIBCXX_BITSET_WORDS</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> #undef _GLIBCXX_BITSET_BITS_PER_WORD</div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span> #undef _GLIBCXX_BITSET_BITS_PER_ULL</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span> </div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span> #if __cplusplus >= 201103L</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span> </div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> namespace std _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span> {</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span> </div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  // DR 1182.</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  /// std::hash specialization for bitset.</div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  template<size_t _Nb></div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  struct hash<_GLIBCXX_STD_C::bitset<_Nb>></div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  : public __hash_base<size_t, _GLIBCXX_STD_C::bitset<_Nb>></div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  {</div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  size_t</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  operator()(const _GLIBCXX_STD_C::bitset<_Nb>& __b) const noexcept</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  {</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  const size_t __clength = (_Nb + __CHAR_BIT__ - 1) / __CHAR_BIT__;</div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  return std::_Hash_impl::hash(__b._M_getdata(), __clength);</div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  }</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  };</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span> </div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  template<></div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  struct hash<_GLIBCXX_STD_C::bitset<0>></div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  : public __hash_base<size_t, _GLIBCXX_STD_C::bitset<0>></div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  {</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  size_t</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  operator()(const _GLIBCXX_STD_C::bitset<0>&) const noexcept</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  { return 0; }</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  };</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span> </div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span> } // namespace</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span> </div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> #endif // C++11</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span> </div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span> #ifdef _GLIBCXX_DEBUG</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span> # include <debug/bitset></div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span> #endif</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span> </div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span> #ifdef _GLIBCXX_PROFILE</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span> # include <profile/bitset></div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span> #endif</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span> </div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span> #endif /* _GLIBCXX_BITSET */</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="a00047.html">bitset</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
>
46
