<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: regex_grep_matcher.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a01011.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">regex_grep_matcher.h</div> </div>
</div>
<div class="contents">
<a href="a01011.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// class template regex -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2010, 2011 Free Software Foundation, Inc.</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00006"></a>00006 <span class="comment">// software; you can redistribute it and/or modify it under the</span>
<a name="l00007"></a>00007 <span class="comment">// terms of the GNU General Public License as published by the</span>
<a name="l00008"></a>00008 <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span>
<a name="l00009"></a>00009 <span class="comment">// any later version.</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="comment">// This library is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00014"></a>00014 <span class="comment">// GNU General Public License for more details.</span>
<a name="l00015"></a>00015
<a name="l00016"></a>00016 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00017"></a>00017 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00018"></a>00018 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00021"></a>00021 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00022"></a>00022 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00023"></a>00023 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00024"></a>00024 <span class="comment"></span>
<a name="l00025"></a>00025 <span class="comment">/**</span>
<a name="l00026"></a>00026 <span class="comment"> * @file bits/regex_grep_matcher.h</span>
<a name="l00027"></a>00027 <span class="comment"> * This is an internal header file, included by other library headers.</span>
<a name="l00028"></a>00028 <span class="comment"> * Do not attempt to use it directly. @headername{regex}</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00032"></a>00032 {
<a name="l00033"></a>00033 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="keyword">template</span><<span class="keyword">typename</span> _BiIter>
<a name="l00036"></a>00036 <span class="keyword">class </span>sub_match;
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="keyword">template</span><<span class="keyword">typename</span> _Bi_iter, <span class="keyword">typename</span> _Allocator>
<a name="l00039"></a>00039 <span class="keyword">class </span>match_results;
<a name="l00040"></a>00040
<a name="l00041"></a>00041 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">namespace </span>__regex
<a name="l00044"></a>00044 {
<a name="l00045"></a>00045 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00046"></a>00046
<a name="l00047"></a>00047 <span class="comment">// A _Results facade specialized for wrapping a templated match_results.</span>
<a name="l00048"></a>00048 <span class="keyword">template</span><<span class="keyword">typename</span> _FwdIterT, <span class="keyword">typename</span> _Alloc>
<a name="l00049"></a>00049 <span class="keyword">class </span>_SpecializedResults
<a name="l00050"></a>00050 : <span class="keyword">public</span> _Results
<a name="l00051"></a>00051 {
<a name="l00052"></a>00052 <span class="keyword">public</span>:
<a name="l00053"></a>00053 _SpecializedResults(<span class="keyword">const</span> _Automaton::_SizeT __size,
<a name="l00054"></a>00054 <span class="keyword">const</span> _SpecializedCursor<_FwdIterT>& __cursor,
<a name="l00055"></a>00055 match_results<_FwdIterT, _Alloc>& __m);
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="keywordtype">void</span>
<a name="l00058"></a>00058 _M_set_pos(<span class="keywordtype">int</span> __i, <span class="keywordtype">int</span> __j, <span class="keyword">const</span> _PatternCursor& __pc);
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keywordtype">void</span>
<a name="l00061"></a>00061 _M_set_matched(<span class="keywordtype">int</span> __i, <span class="keywordtype">bool</span> __is_matched)
<a name="l00062"></a>00062 { _M_results.at(__i).matched = __is_matched; }
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keyword">private</span>:
<a name="l00065"></a>00065 match_results<_FwdIterT, _Alloc>& _M_results;
<a name="l00066"></a>00066 };
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keyword">template</span><<span class="keyword">typename</span> _FwdIterT, <span class="keyword">typename</span> _Alloc>
<a name="l00069"></a>00069 _SpecializedResults<_FwdIterT, _Alloc>::
<a name="l00070"></a>00070 _SpecializedResults(<span class="keyword">const</span> _Automaton::_SizeT __size,
<a name="l00071"></a>00071 <span class="keyword">const</span> _SpecializedCursor<_FwdIterT>& __cursor,
<a name="l00072"></a>00072 match_results<_FwdIterT, _Alloc>& __m)
<a name="l00073"></a>00073 : _M_results(__m)
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075 _M_results.clear();
<a name="l00076"></a>00076 _M_results.reserve(__size + 2);
<a name="l00077"></a>00077 _M_results.resize(__size);
<a name="l00078"></a>00078 <span class="keyword">typename</span> match_results<_FwdIterT, _Alloc>::value_type __sm;
<a name="l00079"></a>00079 __sm.first = __sm.second = __cursor._M_begin();
<a name="l00080"></a>00080 _M_results.push_back(__sm);
<a name="l00081"></a>00081 __sm.first = __sm.second = __cursor._M_end();
<a name="l00082"></a>00082 _M_results.push_back(__sm);
<a name="l00083"></a>00083 }
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keyword">template</span><<span class="keyword">typename</span> _FwdIterT, <span class="keyword">typename</span> _Alloc>
<a name="l00086"></a>00086 <span class="keywordtype">void</span>
<a name="l00087"></a>00087 _SpecializedResults<_FwdIterT, _Alloc>::
<a name="l00088"></a>00088 _M_set_pos(<span class="keywordtype">int</span> __i, <span class="keywordtype">int</span> __j, <span class="keyword">const</span> _PatternCursor& __pc)
<a name="l00089"></a>00089 {
<a name="l00090"></a>00090 <span class="keyword">typedef</span> <span class="keyword">const</span> _SpecializedCursor<_FwdIterT>& _CursorT;
<a name="l00091"></a>00091 _CursorT __c = <span class="keyword">static_cast<</span>_CursorT<span class="keyword">></span>(__pc);
<a name="l00092"></a>00092 <span class="keywordflow">if</span> (__j == 0)
<a name="l00093"></a>00093 _M_results.at(__i).first = __c._M_pos();
<a name="l00094"></a>00094 <span class="keywordflow">else</span>
<a name="l00095"></a>00095 _M_results.at(__i).second = __c._M_pos()+1;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="comment">// A stack of states used in evaluating the NFA.</span>
<a name="l00099"></a>00099 <span class="keyword">typedef</span> <a class="code" href="a00266.html" title="A standard container giving FILO behavior.">std::stack<_StateIdT, std::vector<_StateIdT></a> > _StateStack;
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <span class="comment">// Executes a regular expression NFA/DFA over a range using a variant of</span>
<a name="l00102"></a>00102 <span class="comment">// the parallel execution algorithm featured in the grep utility, modified</span>
<a name="l00103"></a>00103 <span class="comment">// to use Laurikari tags.</span>
<a name="l00104"></a>00104 <span class="keyword">class </span>_Grep_matcher
<a name="l00105"></a>00105 {
<a name="l00106"></a>00106 <span class="keyword">public</span>:
<a name="l00107"></a>00107 _Grep_matcher(_PatternCursor& __p,
<a name="l00108"></a>00108 _Results& __r,
<a name="l00109"></a>00109 <span class="keyword">const</span> _AutomatonPtr& __automaton,
<a name="l00110"></a>00110 <a class="code" href="a01151.html#a98adb09ee60de1b79934e537c821d3fd" title="This is a bitmask type indicating regex matching rules.">regex_constants::match_flag_type</a> __flags);
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="keyword">private</span>:
<a name="l00113"></a>00113 _StateSet
<a name="l00114"></a>00114 _M_e_closure(_StateIdT __i);
<a name="l00115"></a>00115
<a name="l00116"></a>00116 _StateSet
<a name="l00117"></a>00117 _M_e_closure(<span class="keyword">const</span> _StateSet& __s);
<a name="l00118"></a>00118
<a name="l00119"></a>00119 _StateSet
<a name="l00120"></a>00120 _M_e_closure(_StateStack& __stack, <span class="keyword">const</span> _StateSet& __s);
<a name="l00121"></a>00121
<a name="l00122"></a>00122 <span class="keyword">private</span>:
<a name="l00123"></a>00123 <span class="keyword">const</span> <a class="code" href="a00265.html">std::shared_ptr<_Nfa></a> _M_nfa;
<a name="l00124"></a>00124 _PatternCursor& _M_pattern;
<a name="l00125"></a>00125 _Results& _M_results;
<a name="l00126"></a>00126 };
<a name="l00127"></a>00127
<a name="l00128"></a>00128 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00129"></a>00129 } <span class="comment">// namespace __regex</span>
<a name="l00130"></a>00130 } <span class="comment">// namespace</span>
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="preprocessor">#include <<a class="code" href="a01012.html">bits/regex_grep_matcher.tcc</a>></span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a01011.html">regex_grep_matcher.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.7.4 </li>
</ul>
</div>
</body>
</html>
