Sophie

Sophie

distrib > Mageia > 7 > armv7hl > media > core-updates > by-pkgid > bfb47da7e0322bcb0e23e4b1838d9db9 > files > 449

libstdc++-docs-8.4.0-1.mga7.noarch.rpm

<!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++: regex_executor.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;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&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00488_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">regex_executor.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="a00488.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// class template regex -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment">// Copyright (C) 2013-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment">// This file is part of the GNU ISO C++ Library.  This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="comment">// &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">/**</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *  @file bits/regex_executor.h</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<span class="comment"> *  This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="comment"> *  Do not attempt to use it directly. @headername{regex}</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="comment">// FIXME convert comments to doxygen format.</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;{</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;_GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="keyword">namespace </span>__detail</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;{<span class="comment"></span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="comment">  /**</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="comment">   * @addtogroup regex-detail</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment">   * @{</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="comment">  /**</span></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment">   * @brief Takes a regex and an input string and does the matching.</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<span class="comment">   *</span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="comment">   * The %_Executor class has two modes: DFS mode and BFS mode, controlled</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="comment">   * by the template parameter %__dfs_mode.</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;  <span class="keyword">template</span>&lt;<span class="keyword">typename</span> _BiIter, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> _TraitsT,</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;           <span class="keywordtype">bool</span> __dfs_mode&gt;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="keyword">class </span>_Executor</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    {</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;      <span class="keyword">using</span> __search_mode = integral_constant&lt;bool, __dfs_mode&gt;;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;      <span class="keyword">using</span> __dfs = <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>;</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;      <span class="keyword">using</span> __bfs = <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;      <span class="keyword">enum class</span> _Match_mode : unsigned char { _Exact, _Prefix };</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="keyword">public</span>:</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;      <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits&lt;_BiIter&gt;::value_type _CharT;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;      <span class="keyword">typedef</span> basic_regex&lt;_CharT, _TraitsT&gt;                 _RegexT;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;      <span class="keyword">typedef</span> <a class="code" href="a07923.html">std::vector&lt;sub_match&lt;_BiIter&gt;</a>, _Alloc&gt;       _ResultsVec;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;      <span class="keyword">typedef</span> <a class="code" href="a01567.html#aaa717c7c94d1075dfb06f79feb4ca11c">regex_constants::match_flag_type</a>              _FlagT;</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;      <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsT::char_class_type            _ClassT;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;      <span class="keyword">typedef</span> _NFA&lt;_TraitsT&gt;                                _NFAT;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    <span class="keyword">public</span>:</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;      _Executor(_BiIter         __begin,</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;                _BiIter         __end,</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                _ResultsVec&amp;    __results,</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;                <span class="keyword">const</span> _RegexT&amp;  __re,</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                _FlagT          __flags)</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;      : _M_begin(__begin),</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;      _M_end(__end),</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;      _M_re(__re),</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;      _M_nfa(*__re._M_automaton),</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;      _M_results(__results),</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;      _M_rep_count(_M_nfa.size()),</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;      _M_states(_M_nfa._M_start(), _M_nfa.size()),</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;      _M_flags((__flags &amp; regex_constants::<a class="code" href="a01567.html#ad48b9cdb07f0c311ec5ffeb093c209d5">match_prev_avail</a>)</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;               ? (__flags</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;                  &amp; ~regex_constants::<a class="code" href="a01567.html#af0a051640e6d5b7be783ecef1bd6057c">match_not_bol</a></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;                  &amp; ~regex_constants::<a class="code" href="a01567.html#ae61a11ae1d6998a161bdbb50c63dd0e2">match_not_bow</a>)</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;               : __flags)</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;      { }</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;      <span class="comment">// Set matched when string exactly matches the pattern.</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;      _M_match()</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;      {</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        _M_current = _M_begin;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        <span class="keywordflow">return</span> _M_main(_Match_mode::_Exact);</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;      }</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;      <span class="comment">// Set matched when some prefix of the string matches the pattern.</span></div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;      _M_search_from_first()</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;      {</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        _M_current = _M_begin;</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        <span class="keywordflow">return</span> _M_main(_Match_mode::_Prefix);</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;      }</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;      _M_search();</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    <span class="keyword">private</span>:</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;      _M_rep_once_more(_Match_mode __match_mode, _StateIdT);</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;      _M_handle_repeat(_Match_mode, _StateIdT);</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;      _M_handle_subexpr_begin(_Match_mode, _StateIdT);</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;      _M_handle_subexpr_end(_Match_mode, _StateIdT);</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;      _M_handle_line_begin_assertion(_Match_mode, _StateIdT);</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;      _M_handle_line_end_assertion(_Match_mode, _StateIdT);</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;      _M_handle_word_boundary(_Match_mode, _StateIdT);</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;      _M_handle_subexpr_lookahead(_Match_mode, _StateIdT);</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;      _M_handle_match(_Match_mode, _StateIdT);</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;      _M_handle_backref(_Match_mode, _StateIdT);</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;      _M_handle_accept(_Match_mode, _StateIdT);</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;      _M_handle_alternative(_Match_mode, _StateIdT);</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;      <span class="keywordtype">void</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;      _M_dfs(_Match_mode __match_mode, _StateIdT __start);</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;      _M_main(_Match_mode __match_mode)</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;      { <span class="keywordflow">return</span> _M_main_dispatch(__match_mode, __search_mode{}); }</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;      _M_main_dispatch(_Match_mode __match_mode, __dfs);</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;      _M_main_dispatch(_Match_mode __match_mode, __bfs);</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;      _M_is_word(_CharT __ch)<span class="keyword"> const</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;<span class="keyword">      </span>{</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        <span class="keyword">static</span> <span class="keyword">const</span> _CharT __s[2] = { <span class="charliteral">&#39;w&#39;</span> };</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        <span class="keywordflow">return</span> _M_re._M_automaton-&gt;_M_traits.isctype</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;          (__ch, _M_re._M_automaton-&gt;_M_traits.lookup_classname(__s, __s+1));</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;      }</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;      _M_at_begin()<span class="keyword"> const</span></div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;<span class="keyword">      </span>{</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        <span class="keywordflow">return</span> _M_current == _M_begin</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;          &amp;&amp; !(_M_flags &amp; (<a class="code" href="a01567.html#af0a051640e6d5b7be783ecef1bd6057c">regex_constants::match_not_bol</a></div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                           | <a class="code" href="a01567.html#ad48b9cdb07f0c311ec5ffeb093c209d5">regex_constants::match_prev_avail</a>));</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;      }</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;      _M_at_end()<span class="keyword"> const</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="keyword">      </span>{</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;        <span class="keywordflow">return</span> _M_current == _M_end</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;          &amp;&amp; !(_M_flags &amp; <a class="code" href="a01567.html#a2fa4bcec54ff420f477a7bbfe6f9925b">regex_constants::match_not_eol</a>);</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;      }</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;      _M_word_boundary() <span class="keyword">const</span>;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;      <span class="keywordtype">bool</span></div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;      _M_lookahead(_StateIdT __next);</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;       <span class="comment">// Holds additional information used in BFS-mode.</span></div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;      <span class="keyword">template</span>&lt;<span class="keyword">typename</span> _SearchMode, <span class="keyword">typename</span> _ResultsVec&gt;</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        <span class="keyword">struct </span>_State_info;</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;      <span class="keyword">template</span>&lt;<span class="keyword">typename</span> _ResultsVec&gt;</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;        <span class="keyword">struct </span>_State_info&lt;__bfs, _ResultsVec&gt;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;        {</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;          <span class="keyword">explicit</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;          _State_info(_StateIdT __start, <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;          : _M_visited_states(new bool[__n]()), _M_start(__start)</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;          { }</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;          <span class="keywordtype">bool</span> _M_visited(_StateIdT __i)</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;          {</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;            <span class="keywordflow">if</span> (_M_visited_states[__i])</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;              <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;            _M_visited_states[__i] = <span class="keyword">true</span>;</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;          }</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;          <span class="keywordtype">void</span> _M_queue(_StateIdT __i, <span class="keyword">const</span> _ResultsVec&amp; __res)</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;          { _M_match_queue.emplace_back(__i, __res); }</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;          <span class="comment">// Dummy implementations for BFS mode.</span></div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;          _BiIter* _M_get_sol_pos() { <span class="keywordflow">return</span> <span class="keyword">nullptr</span>; }</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;          <span class="comment">// Saves states that need to be considered for the next character.</span></div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;          vector&lt;pair&lt;_StateIdT, _ResultsVec&gt;&gt;  _M_match_queue;</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;          <span class="comment">// Indicates which states are already visited.</span></div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;          unique_ptr&lt;bool[]&gt;                    _M_visited_states;</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;          <span class="comment">// To record current solution.</span></div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;          _StateIdT _M_start;</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;        };</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;      <span class="keyword">template</span>&lt;<span class="keyword">typename</span> _ResultsVec&gt;</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="keyword">struct </span>_State_info&lt;__dfs, _ResultsVec&gt;</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        {</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;          <span class="keyword">explicit</span></div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;          _State_info(_StateIdT __start, <span class="keywordtype">size_t</span>) : _M_start(__start)</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;          { }</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;          <span class="comment">// Dummy implementations for DFS mode.</span></div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;          <span class="keywordtype">bool</span> _M_visited(_StateIdT)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;          <span class="keywordtype">void</span> _M_queue(_StateIdT, <span class="keyword">const</span> _ResultsVec&amp;) { }</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;          _BiIter* _M_get_sol_pos() { <span class="keywordflow">return</span> &amp;_M_sol_pos; }</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;          <span class="comment">// To record current solution.</span></div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;          _StateIdT _M_start;</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;          _BiIter   _M_sol_pos;</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;        };</div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;    <span class="keyword">public</span>:</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;      _ResultsVec                                           _M_cur_results;</div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;      _BiIter                                               _M_current;</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;      _BiIter                                               _M_begin;</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;      <span class="keyword">const</span> _BiIter                                         _M_end;</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;      <span class="keyword">const</span> _RegexT&amp;                                        _M_re;</div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;      <span class="keyword">const</span> _NFAT&amp;                                          _M_nfa;</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;      _ResultsVec&amp;                                          _M_results;</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;      vector&lt;pair&lt;_BiIter, int&gt;&gt;                            _M_rep_count;</div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;      _State_info&lt;__search_mode, _ResultsVec&gt;               _M_states;</div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;      _FlagT                                                _M_flags;</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;      <span class="comment">// Do we have a solution so far?</span></div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;      <span class="keywordtype">bool</span>                                                  _M_has_sol;</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;    };</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;<span class="comment"> //@} regex-detail</span></div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;<span class="comment"></span>} <span class="comment">// namespace __detail</span></div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;_GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;} <span class="comment">// namespace std</span></div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00491.html">bits/regex_executor.tcc</a>&gt;</span></div><div class="ttc" id="a07923_html"><div class="ttname"><a href="a07923.html">std::vector</a></div><div class="ttdoc">A standard container which offers fixed time access to individual elements in any order.</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00339">stl_vector.h:339</a></div></div>
<div class="ttc" id="a01479_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant&lt; bool, true &gt; true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00075">type_traits:75</a></div></div>
<div class="ttc" id="a00491_html"><div class="ttname"><a href="a00491.html">regex_executor.tcc</a></div></div>
<div class="ttc" id="a01567_html_af0a051640e6d5b7be783ecef1bd6057c"><div class="ttname"><a href="a01567.html#af0a051640e6d5b7be783ecef1bd6057c">std::regex_constants::match_not_bol</a></div><div class="ttdeci">_GLIBCXX17_INLINE constexpr match_flag_type match_not_bol</div><div class="ttdef"><b>Definition:</b> <a href="a00482_source.html#l00268">regex_constants.h:268</a></div></div>
<div class="ttc" id="a01567_html_aaa717c7c94d1075dfb06f79feb4ca11c"><div class="ttname"><a href="a01567.html#aaa717c7c94d1075dfb06f79feb4ca11c">std::regex_constants::match_flag_type</a></div><div class="ttdeci">match_flag_type</div><div class="ttdoc">This is a bitmask type indicating regex matching rules.</div><div class="ttdef"><b>Definition:</b> <a href="a00482_source.html#l00255">regex_constants.h:255</a></div></div>
<div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a01567_html_ae61a11ae1d6998a161bdbb50c63dd0e2"><div class="ttname"><a href="a01567.html#ae61a11ae1d6998a161bdbb50c63dd0e2">std::regex_constants::match_not_bow</a></div><div class="ttdeci">_GLIBCXX17_INLINE constexpr match_flag_type match_not_bow</div><div class="ttdef"><b>Definition:</b> <a href="a00482_source.html#l00283">regex_constants.h:283</a></div></div>
<div class="ttc" id="a01479_html_gaebe6729ab5488ecc76c762873d226857"><div class="ttname"><a href="a01479.html#gaebe6729ab5488ecc76c762873d226857">std::false_type</a></div><div class="ttdeci">integral_constant&lt; bool, false &gt; false_type</div><div class="ttdoc">The type used as a compile-time boolean with false value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00078">type_traits:78</a></div></div>
<div class="ttc" id="a01567_html_ad48b9cdb07f0c311ec5ffeb093c209d5"><div class="ttname"><a href="a01567.html#ad48b9cdb07f0c311ec5ffeb093c209d5">std::regex_constants::match_prev_avail</a></div><div class="ttdeci">_GLIBCXX17_INLINE constexpr match_flag_type match_prev_avail</div><div class="ttdef"><b>Definition:</b> <a href="a00482_source.html#l00317">regex_constants.h:317</a></div></div>
<div class="ttc" id="a01567_html_a2fa4bcec54ff420f477a7bbfe6f9925b"><div class="ttname"><a href="a01567.html#a2fa4bcec54ff420f477a7bbfe6f9925b">std::regex_constants::match_not_eol</a></div><div class="ttdeci">_GLIBCXX17_INLINE constexpr match_flag_type match_not_eol</div><div class="ttdef"><b>Definition:</b> <a href="a00482_source.html#l00276">regex_constants.h:276</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00488.html">regex_executor.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
  </ul>
</div>
</body>
</html>