1 // class template regex -*- C++ -*-
3 // Copyright (C) 2010, 2011 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
26 * @file bits/regex_grep_matcher.h
27 * This is an internal header file, included by other library headers.
28 * Do not attempt to use it directly. @headername{regex}
31 namespace std _GLIBCXX_VISIBILITY(default)
34 template<typename _BiIter>
37 template<typename _Bi_iter, typename _Allocator>
42 _GLIBCXX_BEGIN_NAMESPACE_VERSION
44 // A _Results facade specialized for wrapping a templated match_results.
45 template<typename _FwdIterT, typename _Alloc>
46 class _SpecializedResults
50 _SpecializedResults(const _Automaton::_SizeT __size,
51 const _SpecializedCursor<_FwdIterT>& __cursor,
52 match_results<_FwdIterT, _Alloc>& __m);
55 _M_set_pos(int __i, int __j, const _PatternCursor& __pc);
58 _M_set_matched(int __i, bool __is_matched)
59 { _M_results.at(__i).matched = __is_matched; }
62 match_results<_FwdIterT, _Alloc>& _M_results;
65 template<typename _FwdIterT, typename _Alloc>
66 _SpecializedResults<_FwdIterT, _Alloc>::
67 _SpecializedResults(const _Automaton::_SizeT __size,
68 const _SpecializedCursor<_FwdIterT>& __cursor,
69 match_results<_FwdIterT, _Alloc>& __m)
73 _M_results.reserve(__size + 2);
74 _M_results.resize(__size);
75 typename match_results<_FwdIterT, _Alloc>::value_type __sm;
76 __sm.first = __sm.second = __cursor._M_begin();
77 _M_results.push_back(__sm);
78 __sm.first = __sm.second = __cursor._M_end();
79 _M_results.push_back(__sm);
82 template<typename _FwdIterT, typename _Alloc>
84 _SpecializedResults<_FwdIterT, _Alloc>::
85 _M_set_pos(int __i, int __j, const _PatternCursor& __pc)
87 typedef const _SpecializedCursor<_FwdIterT>& _CursorT;
88 _CursorT __c = static_cast<_CursorT>(__pc);
90 _M_results.at(__i).first = __c._M_pos();
92 _M_results.at(__i).second = __c._M_pos()+1;
95 // A stack of states used in evaluating the NFA.
96 typedef std::stack<_StateIdT, std::vector<_StateIdT> > _StateStack;
98 // Executes a regular expression NFA/DFA over a range using a variant of
99 // the parallel execution algorithm featured in the grep utility, modified
100 // to use Laurikari tags.
104 _Grep_matcher(_PatternCursor& __p,
106 const _AutomatonPtr& __automaton,
107 regex_constants::match_flag_type __flags);
111 _M_e_closure(_StateIdT __i);
114 _M_e_closure(const _StateSet& __s);
117 _M_e_closure(_StateStack& __stack, const _StateSet& __s);
120 const std::shared_ptr<_Nfa> _M_nfa;
121 _PatternCursor& _M_pattern;
122 _Results& _M_results;
125 _GLIBCXX_END_NAMESPACE_VERSION
126 } // namespace __regex
129 #include <bits/regex_grep_matcher.tcc>