<!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++: functional 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('a16824_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">experimental/functional</div> </div>
</div><!--header-->
<div class="contents">
<a href="a16824.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> // <experimental/functional> -*- 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) 2014-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> /** @file experimental/functional</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  * This is a TS C++ Library header.</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  */</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> #ifndef _GLIBCXX_EXPERIMENTAL_FUNCTIONAL</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> #define _GLIBCXX_EXPERIMENTAL_FUNCTIONAL 1</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> #pragma GCC system_header</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> #if __cplusplus >= 201402L</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> #include <functional></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> #include <tuple></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> #include <iterator></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> #include <unordered_map></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> #include <vector></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> #include <array></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> #include <bits/stl_algo.h></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> #ifdef _GLIBCXX_PARALLEL</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> # include <parallel/algorithm> // For std::__parallel::search</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> #endif</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> #include <experimental/bits/lfts_config.h></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> namespace std _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> namespace experimental</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> inline namespace fundamentals_v1</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  // See C++14 ยง20.9.9, Function object binders</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  /// Variable template for std::is_bind_expression</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  template<typename _Tp></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  constexpr bool is_bind_expression_v = std::is_bind_expression<_Tp>::value;</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>  /// Variable template for std::is_placeholder</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  template<typename _Tp></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  constexpr int is_placeholder_v = std::is_placeholder<_Tp>::value;</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> #define __cpp_lib_experimental_boyer_moore_searching 201411</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>  // Searchers</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  template<typename _ForwardIterator1, typename _BinaryPredicate = equal_to<>></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  class default_searcher</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  public:</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  default_searcher(_ForwardIterator1 __pat_first,</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  _ForwardIterator1 __pat_last,</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  _BinaryPredicate __pred = _BinaryPredicate())</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  : _M_m(__pat_first, __pat_last, std::move(__pred))</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> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  template<typename _ForwardIterator2></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  _ForwardIterator2</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  operator()(_ForwardIterator2 __first, _ForwardIterator2 __last) const</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  return std::search(__first, __last,</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  std::get<0>(_M_m), std::get<1>(_M_m),</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  std::get<2>(_M_m));</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  private:</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  std::tuple<_ForwardIterator1, _ForwardIterator1, _BinaryPredicate> _M_m;</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> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  template<typename _Key, typename _Tp, typename _Hash, typename _Pred></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  struct __boyer_moore_map_base</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  template<typename _RAIter></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  __boyer_moore_map_base(_RAIter __pat, size_t __patlen,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  _Hash&& __hf, _Pred&& __pred)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  : _M_bad_char{ __patlen, std::move(__hf), std::move(__pred) }</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  if (__patlen > 0)</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  for (__diff_type __i = 0; __i < __patlen - 1; ++__i)</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _M_bad_char[__pat[__i]] = __patlen - 1 - __i;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</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>  using __diff_type = _Tp;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  __diff_type</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  _M_lookup(_Key __key, __diff_type __not_found) const</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  auto __iter = _M_bad_char.find(__key);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  if (__iter == _M_bad_char.end())</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  return __not_found;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  return __iter->second;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _Pred</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  _M_pred() const { return _M_bad_char.key_eq(); }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;</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> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  template<typename _Tp, size_t _Len, typename _Pred></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  struct __boyer_moore_array_base</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  {</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  template<typename _RAIter, typename _Unused></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  __boyer_moore_array_base(_RAIter __pat, size_t __patlen,</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  _Unused&&, _Pred&& __pred)</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  : _M_bad_char{ _GLIBCXX_STD_C::array<_Tp, _Len>{}, std::move(__pred) }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::get<0>(_M_bad_char).fill(__patlen);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  if (__patlen > 0)</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  for (__diff_type __i = 0; __i < __patlen - 1; ++__i)</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  auto __ch = __pat[__i];</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  using _UCh = std::make_unsigned_t<decltype(__ch)>;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  auto __uch = static_cast<_UCh>(__ch);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  std::get<0>(_M_bad_char)[__uch] = __patlen - 1 - __i;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</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>  using __diff_type = _Tp;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  template<typename _Key></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  __diff_type</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  _M_lookup(_Key __key, __diff_type __not_found) const</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  {</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  auto __ukey = static_cast<std::make_unsigned_t<_Key>>(__key);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  if (__ukey >= _Len)</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  return __not_found;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  return std::get<0>(_M_bad_char)[__ukey];</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> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  const _Pred&</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  _M_pred() const { return std::get<1>(_M_bad_char); }</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>  std::tuple<_GLIBCXX_STD_C::array<_Tp, _Len>, _Pred> _M_bad_char;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  };</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  // Use __boyer_moore_array_base when pattern consists of narrow characters</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  // (or std::byte) and uses std::equal_to as the predicate.</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  template<typename _RAIter, typename _Hash, typename _Pred,</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  typename _Val = typename iterator_traits<_RAIter>::value_type,</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  typename _Diff = typename iterator_traits<_RAIter>::difference_type></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  using __boyer_moore_base_t</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  = std::conditional_t<std::__is_byte_like<_Val, _Pred>::value,</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  __boyer_moore_array_base<_Diff, 256, _Pred>,</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  __boyer_moore_map_base<_Val, _Diff, _Hash, _Pred>>;</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>  template<typename _RAIter, typename _Hash</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  = std::hash<typename std::iterator_traits<_RAIter>::value_type>,</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  typename _BinaryPredicate = std::equal_to<>></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  class boyer_moore_searcher</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate></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>  using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  using typename _Base::__diff_type;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  public:</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  _Hash __hf = _Hash(),</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  _BinaryPredicate __pred = _BinaryPredicate());</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  template<typename _RandomAccessIterator2></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  _RandomAccessIterator2</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  operator()(_RandomAccessIterator2 __first,</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  _RandomAccessIterator2 __last) const;</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>  private:</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  bool</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  _M_is_prefix(_RAIter __word, __diff_type __len,</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  __diff_type __pos)</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>  const auto& __pred = this->_M_pred();</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  __diff_type __suffixlen = __len - __pos;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  for (__diff_type __i = 0; __i < __suffixlen; ++__i)</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  if (!__pred(__word[__i], __word[__pos + __i]))</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  return false;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  return true;</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>  __diff_type</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  _M_suffix_length(_RAIter __word, __diff_type __len,</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  __diff_type __pos)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  {</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  const auto& __pred = this->_M_pred();</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  __diff_type __i = 0;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  while (__pred(__word[__pos - __i], __word[__len - 1 - __i])</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  && __i < __pos)</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>  ++__i;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  return __i;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  template<typename _Tp></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  __diff_type</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  _M_bad_char_shift(_Tp __c) const</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  { return this->_M_lookup(__c, _M_pat_end - _M_pat); }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  _RAIter _M_pat;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  _RAIter _M_pat_end;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  };</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  template<typename _RAIter, typename _Hash</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  = std::hash<typename std::iterator_traits<_RAIter>::value_type>,</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  typename _BinaryPredicate = std::equal_to<>></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  class boyer_moore_horspool_searcher</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate></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>  using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  using typename _Base::__diff_type;</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  public:</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  boyer_moore_horspool_searcher(_RAIter __pat,</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  _RAIter __pat_end,</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  _Hash __hf = _Hash(),</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  _BinaryPredicate __pred</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  = _BinaryPredicate())</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  _M_pat(__pat), _M_pat_end(__pat_end)</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> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  template<typename _RandomAccessIterator2></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  _RandomAccessIterator2</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  operator()(_RandomAccessIterator2 __first,</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  _RandomAccessIterator2 __last) const</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  {</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  const auto& __pred = this->_M_pred();</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  auto __patlen = _M_pat_end - _M_pat;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  if (__patlen == 0)</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  return __first;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  auto __len = __last - __first;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  while (__len >= __patlen)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  {</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  for (auto __scan = __patlen - 1;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  __pred(__first[__scan], _M_pat[__scan]); --__scan)</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  if (__scan == 0)</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  return __first;</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  auto __shift = _M_bad_char_shift(__first[__patlen - 1]);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  __len -= __shift;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  __first += __shift;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  }</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  return __last;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</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>  private:</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  template<typename _Tp></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  __diff_type</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  _M_bad_char_shift(_Tp __c) const</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  { return this->_M_lookup(__c, _M_pat_end - _M_pat); }</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>  _RAIter _M_pat;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  _RAIter _M_pat_end;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  };</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> </div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  /// Generator function for default_searcher</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  template<typename _ForwardIterator,</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  typename _BinaryPredicate = std::equal_to<>></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  inline default_searcher<_ForwardIterator, _BinaryPredicate></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  make_default_searcher(_ForwardIterator __pat_first,</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  _ForwardIterator __pat_last,</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  _BinaryPredicate __pred = _BinaryPredicate())</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  { return { __pat_first, __pat_last, __pred }; }</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>  /// Generator function for boyer_moore_searcher</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  template<typename _RAIter, typename _Hash</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  = std::hash<typename std::iterator_traits<_RAIter>::value_type>,</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  typename _BinaryPredicate = equal_to<>></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  inline boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  make_boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  _Hash __hf = _Hash(),</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  _BinaryPredicate __pred = _BinaryPredicate())</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  { return { __pat_first, __pat_last, std::move(__hf), std::move(__pred) }; }</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  /// Generator function for boyer_moore_horspool_searcher</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  template<typename _RAIter, typename _Hash</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  = std::hash<typename std::iterator_traits<_RAIter>::value_type>,</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  typename _BinaryPredicate = equal_to<>></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  inline boyer_moore_horspool_searcher<_RAIter, _Hash, _BinaryPredicate></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  make_boyer_moore_horspool_searcher(_RAIter __pat_first, _RAIter __pat_last,</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  _Hash __hf = _Hash(),</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  _BinaryPredicate __pred</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  = _BinaryPredicate())</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  { return { __pat_first, __pat_last, std::move(__hf), std::move(__pred) }; }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  template<typename _RAIter, typename _Hash, typename _BinaryPredicate></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  boyer_moore_searcher(_RAIter __pat, _RAIter __pat_end,</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  _Hash __hf, _BinaryPredicate __pred)</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  _M_pat(__pat), _M_pat_end(__pat_end), _M_good_suffix(__pat_end - __pat)</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  {</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  auto __patlen = __pat_end - __pat;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  if (__patlen == 0)</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  return;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  __diff_type __last_prefix = __patlen - 1;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  for (__diff_type __p = __patlen - 1; __p >= 0; --__p)</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  {</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  if (_M_is_prefix(__pat, __patlen, __p + 1))</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  __last_prefix = __p + 1;</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  _M_good_suffix[__p] = __last_prefix + (__patlen - 1 - __p);</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>  for (__diff_type __p = 0; __p < __patlen - 1; ++__p)</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  auto __slen = _M_suffix_length(__pat, __patlen, __p);</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  auto __pos = __patlen - 1 - __slen;</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  if (!__pred(__pat[__p - __slen], __pat[__pos]))</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  _M_good_suffix[__pos] = __patlen - 1 - __p + __slen;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</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<typename _RAIter, typename _Hash, typename _BinaryPredicate></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  template<typename _RandomAccessIterator2></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  _RandomAccessIterator2</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  operator()(_RandomAccessIterator2 __first,</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  _RandomAccessIterator2 __last) const</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  {</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  auto __patlen = _M_pat_end - _M_pat;</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  if (__patlen == 0)</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  return __first;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  const auto& __pred = this->_M_pred();</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  __diff_type __i = __patlen - 1;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  auto __stringlen = __last - __first;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  while (__i < __stringlen)</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  {</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  __diff_type __j = __patlen - 1;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  while (__j >= 0 && __pred(__first[__i], _M_pat[__j]))</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  {</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  --__i;</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  --__j;</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  }</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  if (__j < 0)</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  return __first + __i + 1;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  __i += std::max(_M_bad_char_shift(__first[__i]),</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  _M_good_suffix[__j]);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  return __last;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  }</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> } // namespace fundamentals_v1</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> </div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> inline namespace fundamentals_v2</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> #define __cpp_lib_experimental_not_fn 201406</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  /// [func.not_fn] Function template not_fn</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  template<typename _Fn></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  inline auto</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  not_fn(_Fn&& __fn)</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  noexcept(std::is_nothrow_constructible<std::decay_t<_Fn>, _Fn&&>::value)</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  return std::_Not_fn<std::decay_t<_Fn>>{std::forward<_Fn>(__fn), 0};</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  }</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> } // namespace fundamentals_v2</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> } // namespace experimental</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> } // namespace std</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> #endif // C++14</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> #endif // _GLIBCXX_EXPERIMENTAL_FUNCTIONAL</div></div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_97d1772a3aa272579d5e3bb2a6422878.html">experimental</a></li><li class="navelem"><a class="el" href="a16824.html">functional</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
>
6473
