line |
stmt |
bran |
cond |
sub |
pod |
time |
code |
1
|
|
|
|
|
|
|
// class template regex -*- C++ -*- |
2
|
|
|
|
|
|
|
|
3
|
|
|
|
|
|
|
// Copyright (C) 2010-2015 Free Software Foundation, Inc. |
4
|
|
|
|
|
|
|
// |
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) |
9
|
|
|
|
|
|
|
// any later version. |
10
|
|
|
|
|
|
|
|
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. |
15
|
|
|
|
|
|
|
|
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. |
19
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
// . |
24
|
|
|
|
|
|
|
|
25
|
|
|
|
|
|
|
/** |
26
|
|
|
|
|
|
|
* @file bits/regex_compiler.h |
27
|
|
|
|
|
|
|
* This is an internal header file, included by other library headers. |
28
|
|
|
|
|
|
|
* Do not attempt to use it directly. @headername{regex} |
29
|
|
|
|
|
|
|
*/ |
30
|
|
|
|
|
|
|
|
31
|
|
|
|
|
|
|
namespace std _GLIBCXX_VISIBILITY(default) |
32
|
|
|
|
|
|
|
{ |
33
|
|
|
|
|
|
|
namespace __detail |
34
|
|
|
|
|
|
|
{ |
35
|
|
|
|
|
|
|
_GLIBCXX_BEGIN_NAMESPACE_VERSION |
36
|
|
|
|
|
|
|
|
37
|
|
|
|
|
|
|
/** |
38
|
|
|
|
|
|
|
* @addtogroup regex-detail |
39
|
|
|
|
|
|
|
* @{ |
40
|
|
|
|
|
|
|
*/ |
41
|
|
|
|
|
|
|
|
42
|
|
|
|
|
|
|
template |
43
|
|
|
|
|
|
|
struct _BracketMatcher; |
44
|
|
|
|
|
|
|
|
45
|
|
|
|
|
|
|
/** |
46
|
|
|
|
|
|
|
* @brief Builds an NFA from an input iterator range. |
47
|
|
|
|
|
|
|
* |
48
|
|
|
|
|
|
|
* The %_TraitsT type should fulfill requirements [28.3]. |
49
|
|
|
|
|
|
|
*/ |
50
|
|
|
|
|
|
|
template |
51
|
0
|
|
|
|
|
|
class _Compiler |
52
|
|
|
|
|
|
|
{ |
53
|
|
|
|
|
|
|
public: |
54
|
|
|
|
|
|
|
typedef typename _TraitsT::char_type _CharT; |
55
|
|
|
|
|
|
|
typedef const _CharT* _IterT; |
56
|
|
|
|
|
|
|
typedef _NFA<_TraitsT> _RegexT; |
57
|
|
|
|
|
|
|
typedef regex_constants::syntax_option_type _FlagT; |
58
|
|
|
|
|
|
|
|
59
|
|
|
|
|
|
|
_Compiler(_IterT __b, _IterT __e, |
60
|
|
|
|
|
|
|
const typename _TraitsT::locale_type& __traits, _FlagT __flags); |
61
|
|
|
|
|
|
|
|
62
|
|
|
|
|
|
|
shared_ptr |
63
|
0
|
|
|
|
|
|
_M_get_nfa() |
64
|
0
|
|
|
|
|
|
{ return std::move(_M_nfa); } |
65
|
|
|
|
|
|
|
|
66
|
|
|
|
|
|
|
private: |
67
|
|
|
|
|
|
|
typedef _Scanner<_CharT> _ScannerT; |
68
|
|
|
|
|
|
|
typedef typename _TraitsT::string_type _StringT; |
69
|
|
|
|
|
|
|
typedef typename _ScannerT::_TokenT _TokenT; |
70
|
|
|
|
|
|
|
typedef _StateSeq<_TraitsT> _StateSeqT; |
71
|
|
|
|
|
|
|
typedef std::stack<_StateSeqT> _StackT; |
72
|
|
|
|
|
|
|
typedef std::ctype<_CharT> _CtypeT; |
73
|
|
|
|
|
|
|
|
74
|
|
|
|
|
|
|
// accepts a specific token or returns false. |
75
|
|
|
|
|
|
|
bool |
76
|
|
|
|
|
|
|
_M_match_token(_TokenT __token); |
77
|
|
|
|
|
|
|
|
78
|
|
|
|
|
|
|
void |
79
|
|
|
|
|
|
|
_M_disjunction(); |
80
|
|
|
|
|
|
|
|
81
|
|
|
|
|
|
|
void |
82
|
|
|
|
|
|
|
_M_alternative(); |
83
|
|
|
|
|
|
|
|
84
|
|
|
|
|
|
|
bool |
85
|
|
|
|
|
|
|
_M_term(); |
86
|
|
|
|
|
|
|
|
87
|
|
|
|
|
|
|
bool |
88
|
|
|
|
|
|
|
_M_assertion(); |
89
|
|
|
|
|
|
|
|
90
|
|
|
|
|
|
|
bool |
91
|
|
|
|
|
|
|
_M_quantifier(); |
92
|
|
|
|
|
|
|
|
93
|
|
|
|
|
|
|
bool |
94
|
|
|
|
|
|
|
_M_atom(); |
95
|
|
|
|
|
|
|
|
96
|
|
|
|
|
|
|
bool |
97
|
|
|
|
|
|
|
_M_bracket_expression(); |
98
|
|
|
|
|
|
|
|
99
|
|
|
|
|
|
|
template |
100
|
|
|
|
|
|
|
void |
101
|
|
|
|
|
|
|
_M_insert_any_matcher_ecma(); |
102
|
|
|
|
|
|
|
|
103
|
|
|
|
|
|
|
template |
104
|
|
|
|
|
|
|
void |
105
|
|
|
|
|
|
|
_M_insert_any_matcher_posix(); |
106
|
|
|
|
|
|
|
|
107
|
|
|
|
|
|
|
template |
108
|
|
|
|
|
|
|
void |
109
|
|
|
|
|
|
|
_M_insert_char_matcher(); |
110
|
|
|
|
|
|
|
|
111
|
|
|
|
|
|
|
template |
112
|
|
|
|
|
|
|
void |
113
|
|
|
|
|
|
|
_M_insert_character_class_matcher(); |
114
|
|
|
|
|
|
|
|
115
|
|
|
|
|
|
|
template |
116
|
|
|
|
|
|
|
void |
117
|
|
|
|
|
|
|
_M_insert_bracket_matcher(bool __neg); |
118
|
|
|
|
|
|
|
|
119
|
|
|
|
|
|
|
// Returns true if successfully matched one term and should continue. |
120
|
|
|
|
|
|
|
// Returns false if the compiler should move on. |
121
|
|
|
|
|
|
|
template |
122
|
|
|
|
|
|
|
bool |
123
|
|
|
|
|
|
|
_M_expression_term(pair& __last_char, |
124
|
|
|
|
|
|
|
_BracketMatcher<_TraitsT, __icase, __collate>& |
125
|
|
|
|
|
|
|
__matcher); |
126
|
|
|
|
|
|
|
|
127
|
|
|
|
|
|
|
int |
128
|
|
|
|
|
|
|
_M_cur_int_value(int __radix); |
129
|
|
|
|
|
|
|
|
130
|
|
|
|
|
|
|
bool |
131
|
|
|
|
|
|
|
_M_try_char(); |
132
|
|
|
|
|
|
|
|
133
|
|
|
|
|
|
|
_StateSeqT |
134
|
0
|
|
|
|
|
|
_M_pop() |
135
|
|
|
|
|
|
|
{ |
136
|
0
|
|
|
|
|
|
auto ret = _M_stack.top(); |
137
|
0
|
|
|
|
|
|
_M_stack.pop(); |
138
|
0
|
|
|
|
|
|
return ret; |
139
|
|
|
|
|
|
|
} |
140
|
|
|
|
|
|
|
|
141
|
|
|
|
|
|
|
_FlagT _M_flags; |
142
|
|
|
|
|
|
|
_ScannerT _M_scanner; |
143
|
|
|
|
|
|
|
shared_ptr<_RegexT> _M_nfa; |
144
|
|
|
|
|
|
|
_StringT _M_value; |
145
|
|
|
|
|
|
|
_StackT _M_stack; |
146
|
|
|
|
|
|
|
const _TraitsT& _M_traits; |
147
|
|
|
|
|
|
|
const _CtypeT& _M_ctype; |
148
|
|
|
|
|
|
|
}; |
149
|
|
|
|
|
|
|
|
150
|
|
|
|
|
|
|
template |
151
|
|
|
|
|
|
|
struct __has_contiguous_iter : std::false_type { }; |
152
|
|
|
|
|
|
|
|
153
|
|
|
|
|
|
|
template |
154
|
|
|
|
|
|
|
struct __has_contiguous_iter> |
155
|
|
|
|
|
|
|
: std::true_type |
156
|
|
|
|
|
|
|
{ }; |
157
|
|
|
|
|
|
|
|
158
|
|
|
|
|
|
|
template |
159
|
|
|
|
|
|
|
struct __has_contiguous_iter> |
160
|
|
|
|
|
|
|
: std::true_type |
161
|
|
|
|
|
|
|
{ }; |
162
|
|
|
|
|
|
|
|
163
|
|
|
|
|
|
|
template |
164
|
|
|
|
|
|
|
struct __is_contiguous_normal_iter : std::false_type { }; |
165
|
|
|
|
|
|
|
|
166
|
|
|
|
|
|
|
template |
167
|
|
|
|
|
|
|
struct __is_contiguous_normal_iter<_CharT*> : std::true_type { }; |
168
|
|
|
|
|
|
|
|
169
|
|
|
|
|
|
|
template |
170
|
|
|
|
|
|
|
struct |
171
|
|
|
|
|
|
|
__is_contiguous_normal_iter<__gnu_cxx::__normal_iterator<_Tp, _Cont>> |
172
|
|
|
|
|
|
|
: __has_contiguous_iter<_Cont>::type |
173
|
|
|
|
|
|
|
{ }; |
174
|
|
|
|
|
|
|
|
175
|
|
|
|
|
|
|
template |
176
|
|
|
|
|
|
|
using __enable_if_contiguous_normal_iter |
177
|
|
|
|
|
|
|
= typename enable_if< __is_contiguous_normal_iter<_Iter>::value, |
178
|
|
|
|
|
|
|
std::shared_ptr> >::type; |
179
|
|
|
|
|
|
|
|
180
|
|
|
|
|
|
|
template |
181
|
|
|
|
|
|
|
using __disable_if_contiguous_normal_iter |
182
|
|
|
|
|
|
|
= typename enable_if< !__is_contiguous_normal_iter<_Iter>::value, |
183
|
|
|
|
|
|
|
std::shared_ptr> >::type; |
184
|
|
|
|
|
|
|
|
185
|
|
|
|
|
|
|
template |
186
|
|
|
|
|
|
|
inline __enable_if_contiguous_normal_iter<_FwdIter, _TraitsT> |
187
|
0
|
|
|
|
|
|
__compile_nfa(_FwdIter __first, _FwdIter __last, |
188
|
|
|
|
|
|
|
const typename _TraitsT::locale_type& __loc, |
189
|
|
|
|
|
|
|
regex_constants::syntax_option_type __flags) |
190
|
|
|
|
|
|
|
{ |
191
|
0
|
|
|
|
|
|
size_t __len = __last - __first; |
192
|
0
|
0
|
|
|
|
|
const auto* __cfirst = __len ? std::__addressof(*__first) : nullptr; |
193
|
|
|
|
|
|
|
using _Cmplr = _Compiler<_TraitsT>; |
194
|
0
|
|
|
|
|
|
return _Cmplr(__cfirst, __cfirst + __len, __loc, __flags)._M_get_nfa(); |
195
|
|
|
|
|
|
|
} |
196
|
|
|
|
|
|
|
|
197
|
|
|
|
|
|
|
template |
198
|
|
|
|
|
|
|
inline __disable_if_contiguous_normal_iter<_FwdIter, _TraitsT> |
199
|
|
|
|
|
|
|
__compile_nfa(_FwdIter __first, _FwdIter __last, |
200
|
|
|
|
|
|
|
const typename _TraitsT::locale_type& __loc, |
201
|
|
|
|
|
|
|
regex_constants::syntax_option_type __flags) |
202
|
|
|
|
|
|
|
{ |
203
|
|
|
|
|
|
|
basic_string __str(__first, __last); |
204
|
|
|
|
|
|
|
return __compile_nfa(__str.data(), __str.data() + __str.size(), __loc, |
205
|
|
|
|
|
|
|
__flags); |
206
|
|
|
|
|
|
|
} |
207
|
|
|
|
|
|
|
|
208
|
|
|
|
|
|
|
// [28.13.14] |
209
|
|
|
|
|
|
|
template |
210
|
|
|
|
|
|
|
class _RegexTranslator |
211
|
|
|
|
|
|
|
{ |
212
|
|
|
|
|
|
|
public: |
213
|
|
|
|
|
|
|
typedef typename _TraitsT::char_type _CharT; |
214
|
|
|
|
|
|
|
typedef typename _TraitsT::string_type _StringT; |
215
|
|
|
|
|
|
|
typedef typename std::conditional<__collate, |
216
|
|
|
|
|
|
|
_StringT, |
217
|
|
|
|
|
|
|
_CharT>::type _StrTransT; |
218
|
|
|
|
|
|
|
|
219
|
|
|
|
|
|
|
explicit |
220
|
0
|
|
|
|
|
|
_RegexTranslator(const _TraitsT& __traits) |
221
|
0
|
|
|
|
|
|
: _M_traits(__traits) |
222
|
0
|
|
|
|
|
|
{ } |
223
|
|
|
|
|
|
|
|
224
|
|
|
|
|
|
|
_CharT |
225
|
0
|
|
|
|
|
|
_M_translate(_CharT __ch) const |
226
|
|
|
|
|
|
|
{ |
227
|
|
|
|
|
|
|
if (__icase) |
228
|
0
|
|
|
|
|
|
return _M_traits.translate_nocase(__ch); |
229
|
|
|
|
|
|
|
else if (__collate) |
230
|
0
|
|
|
|
|
|
return _M_traits.translate(__ch); |
231
|
|
|
|
|
|
|
else |
232
|
|
|
|
|
|
|
return __ch; |
233
|
|
|
|
|
|
|
} |
234
|
|
|
|
|
|
|
|
235
|
|
|
|
|
|
|
_StrTransT |
236
|
0
|
|
|
|
|
|
_M_transform(_CharT __ch) const |
237
|
|
|
|
|
|
|
{ |
238
|
0
|
|
|
|
|
|
return _M_transform_impl(__ch, typename integral_constant
|
239
|
0
|
0
|
|
|
|
|
__collate>::type()); |
|
|
0
|
|
|
|
|
|
240
|
|
|
|
|
|
|
} |
241
|
|
|
|
|
|
|
|
242
|
|
|
|
|
|
|
private: |
243
|
|
|
|
|
|
|
_StrTransT |
244
|
0
|
|
|
|
|
|
_M_transform_impl(_CharT __ch, false_type) const |
245
|
0
|
|
|
|
|
|
{ return __ch; } |
246
|
|
|
|
|
|
|
|
247
|
|
|
|
|
|
|
_StrTransT |
248
|
0
|
|
|
|
|
|
_M_transform_impl(_CharT __ch, true_type) const |
249
|
|
|
|
|
|
|
{ |
250
|
0
|
0
|
|
|
|
|
_StrTransT __str = _StrTransT(1, _M_translate(__ch)); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
251
|
0
|
0
|
|
|
|
|
return _M_traits.transform(__str.begin(), __str.end()); |
|
|
0
|
|
|
|
|
|
252
|
|
|
|
|
|
|
} |
253
|
|
|
|
|
|
|
|
254
|
|
|
|
|
|
|
const _TraitsT& _M_traits; |
255
|
|
|
|
|
|
|
}; |
256
|
|
|
|
|
|
|
|
257
|
|
|
|
|
|
|
template |
258
|
|
|
|
|
|
|
class _RegexTranslator<_TraitsT, false, false> |
259
|
|
|
|
|
|
|
{ |
260
|
|
|
|
|
|
|
public: |
261
|
|
|
|
|
|
|
typedef typename _TraitsT::char_type _CharT; |
262
|
|
|
|
|
|
|
typedef _CharT _StrTransT; |
263
|
|
|
|
|
|
|
|
264
|
|
|
|
|
|
|
explicit |
265
|
0
|
|
|
|
|
|
_RegexTranslator(const _TraitsT&) |
266
|
0
|
|
|
|
|
|
{ } |
267
|
|
|
|
|
|
|
|
268
|
|
|
|
|
|
|
_CharT |
269
|
0
|
|
|
|
|
|
_M_translate(_CharT __ch) const |
270
|
0
|
|
|
|
|
|
{ return __ch; } |
271
|
|
|
|
|
|
|
|
272
|
|
|
|
|
|
|
_StrTransT |
273
|
0
|
|
|
|
|
|
_M_transform(_CharT __ch) const |
274
|
0
|
|
|
|
|
|
{ return __ch; } |
275
|
|
|
|
|
|
|
}; |
276
|
|
|
|
|
|
|
|
277
|
|
|
|
|
|
|
template |
278
|
|
|
|
|
|
|
struct _AnyMatcher; |
279
|
|
|
|
|
|
|
|
280
|
|
|
|
|
|
|
template |
281
|
|
|
|
|
|
|
struct _AnyMatcher<_TraitsT, false, __icase, __collate> |
282
|
|
|
|
|
|
|
{ |
283
|
|
|
|
|
|
|
typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT; |
284
|
|
|
|
|
|
|
typedef typename _TransT::_CharT _CharT; |
285
|
|
|
|
|
|
|
|
286
|
|
|
|
|
|
|
explicit |
287
|
0
|
|
|
|
|
|
_AnyMatcher(const _TraitsT& __traits) |
288
|
0
|
|
|
|
|
|
: _M_translator(__traits) |
289
|
0
|
|
|
|
|
|
{ } |
290
|
|
|
|
|
|
|
|
291
|
|
|
|
|
|
|
bool |
292
|
0
|
|
|
|
|
|
operator()(_CharT __ch) const |
293
|
|
|
|
|
|
|
{ |
294
|
0
|
0
|
|
|
|
|
static auto __nul = _M_translator._M_translate('\0'); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
295
|
0
|
|
|
|
|
|
return _M_translator._M_translate(__ch) != __nul; |
296
|
|
|
|
|
|
|
} |
297
|
|
|
|
|
|
|
|
298
|
|
|
|
|
|
|
_TransT _M_translator; |
299
|
|
|
|
|
|
|
}; |
300
|
|
|
|
|
|
|
|
301
|
|
|
|
|
|
|
template |
302
|
|
|
|
|
|
|
struct _AnyMatcher<_TraitsT, true, __icase, __collate> |
303
|
|
|
|
|
|
|
{ |
304
|
|
|
|
|
|
|
typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT; |
305
|
|
|
|
|
|
|
typedef typename _TransT::_CharT _CharT; |
306
|
|
|
|
|
|
|
|
307
|
|
|
|
|
|
|
explicit |
308
|
0
|
|
|
|
|
|
_AnyMatcher(const _TraitsT& __traits) |
309
|
0
|
|
|
|
|
|
: _M_translator(__traits) |
310
|
0
|
|
|
|
|
|
{ } |
311
|
|
|
|
|
|
|
|
312
|
|
|
|
|
|
|
bool |
313
|
0
|
|
|
|
|
|
operator()(_CharT __ch) const |
314
|
0
|
0
|
|
|
|
|
{ return _M_apply(__ch, typename is_same<_CharT, char>::type()); } |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
315
|
|
|
|
|
|
|
|
316
|
|
|
|
|
|
|
bool |
317
|
0
|
|
|
|
|
|
_M_apply(_CharT __ch, true_type) const |
318
|
|
|
|
|
|
|
{ |
319
|
0
|
|
|
|
|
|
auto __c = _M_translator._M_translate(__ch); |
320
|
0
|
|
|
|
|
|
auto __n = _M_translator._M_translate('\n'); |
321
|
0
|
|
|
|
|
|
auto __r = _M_translator._M_translate('\r'); |
322
|
0
|
0
|
|
|
|
|
return __c != __n && __c != __r; |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
323
|
|
|
|
|
|
|
} |
324
|
|
|
|
|
|
|
|
325
|
|
|
|
|
|
|
bool |
326
|
|
|
|
|
|
|
_M_apply(_CharT __ch, false_type) const |
327
|
|
|
|
|
|
|
{ |
328
|
|
|
|
|
|
|
auto __c = _M_translator._M_translate(__ch); |
329
|
|
|
|
|
|
|
auto __n = _M_translator._M_translate('\n'); |
330
|
|
|
|
|
|
|
auto __r = _M_translator._M_translate('\r'); |
331
|
|
|
|
|
|
|
auto __u2028 = _M_translator._M_translate(u'\u2028'); |
332
|
|
|
|
|
|
|
auto __u2029 = _M_translator._M_translate(u'\u2029'); |
333
|
|
|
|
|
|
|
return __c != __n && __c != __r && __c != __u2028 && __c != __u2029; |
334
|
|
|
|
|
|
|
} |
335
|
|
|
|
|
|
|
|
336
|
|
|
|
|
|
|
_TransT _M_translator; |
337
|
|
|
|
|
|
|
}; |
338
|
|
|
|
|
|
|
|
339
|
|
|
|
|
|
|
template |
340
|
|
|
|
|
|
|
struct _CharMatcher |
341
|
|
|
|
|
|
|
{ |
342
|
|
|
|
|
|
|
typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT; |
343
|
|
|
|
|
|
|
typedef typename _TransT::_CharT _CharT; |
344
|
|
|
|
|
|
|
|
345
|
0
|
|
|
|
|
|
_CharMatcher(_CharT __ch, const _TraitsT& __traits) |
346
|
0
|
|
|
|
|
|
: _M_translator(__traits), _M_ch(_M_translator._M_translate(__ch)) |
347
|
0
|
|
|
|
|
|
{ } |
348
|
|
|
|
|
|
|
|
349
|
|
|
|
|
|
|
bool |
350
|
0
|
|
|
|
|
|
operator()(_CharT __ch) const |
351
|
0
|
|
|
|
|
|
{ return _M_ch == _M_translator._M_translate(__ch); } |
352
|
|
|
|
|
|
|
|
353
|
|
|
|
|
|
|
_TransT _M_translator; |
354
|
|
|
|
|
|
|
_CharT _M_ch; |
355
|
|
|
|
|
|
|
}; |
356
|
|
|
|
|
|
|
|
357
|
|
|
|
|
|
|
/// Matches a character range (bracket expression) |
358
|
|
|
|
|
|
|
template |
359
|
0
|
0
|
|
|
|
|
struct _BracketMatcher |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
360
|
|
|
|
|
|
|
{ |
361
|
|
|
|
|
|
|
public: |
362
|
|
|
|
|
|
|
typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT; |
363
|
|
|
|
|
|
|
typedef typename _TransT::_CharT _CharT; |
364
|
|
|
|
|
|
|
typedef typename _TransT::_StrTransT _StrTransT; |
365
|
|
|
|
|
|
|
typedef typename _TraitsT::string_type _StringT; |
366
|
|
|
|
|
|
|
typedef typename _TraitsT::char_class_type _CharClassT; |
367
|
|
|
|
|
|
|
|
368
|
|
|
|
|
|
|
public: |
369
|
0
|
|
|
|
|
|
_BracketMatcher(bool __is_non_matching, |
370
|
|
|
|
|
|
|
const _TraitsT& __traits) |
371
|
|
|
|
|
|
|
: _M_class_set(0), _M_translator(__traits), _M_traits(__traits), |
372
|
0
|
|
|
|
|
|
_M_is_non_matching(__is_non_matching) |
373
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
374
|
|
|
|
|
|
|
, _M_is_ready(false) |
375
|
|
|
|
|
|
|
#endif |
376
|
0
|
|
|
|
|
|
{ } |
377
|
|
|
|
|
|
|
|
378
|
|
|
|
|
|
|
bool |
379
|
0
|
|
|
|
|
|
operator()(_CharT __ch) const |
380
|
|
|
|
|
|
|
{ |
381
|
|
|
|
|
|
|
_GLIBCXX_DEBUG_ASSERT(_M_is_ready); |
382
|
0
|
|
|
|
|
|
return _M_apply(__ch, _UseCache()); |
383
|
|
|
|
|
|
|
} |
384
|
|
|
|
|
|
|
|
385
|
|
|
|
|
|
|
void |
386
|
0
|
|
|
|
|
|
_M_add_char(_CharT __c) |
387
|
|
|
|
|
|
|
{ |
388
|
0
|
0
|
|
|
|
|
_M_char_set.push_back(_M_translator._M_translate(__c)); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
389
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
390
|
|
|
|
|
|
|
_M_is_ready = false; |
391
|
|
|
|
|
|
|
#endif |
392
|
0
|
|
|
|
|
|
} |
393
|
|
|
|
|
|
|
|
394
|
|
|
|
|
|
|
_StringT |
395
|
0
|
|
|
|
|
|
_M_add_collate_element(const _StringT& __s) |
396
|
|
|
|
|
|
|
{ |
397
|
|
|
|
|
|
|
auto __st = _M_traits.lookup_collatename(__s.data(), |
398
|
0
|
|
|
|
|
|
__s.data() + __s.size()); |
399
|
0
|
0
|
|
|
|
|
if (__st.empty()) |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
400
|
0
|
0
|
|
|
|
|
__throw_regex_error(regex_constants::error_collate); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
401
|
0
|
0
|
|
|
|
|
_M_char_set.push_back(_M_translator._M_translate(__st[0])); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
402
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
403
|
|
|
|
|
|
|
_M_is_ready = false; |
404
|
|
|
|
|
|
|
#endif |
405
|
0
|
|
|
|
|
|
return __st; |
406
|
|
|
|
|
|
|
} |
407
|
|
|
|
|
|
|
|
408
|
|
|
|
|
|
|
void |
409
|
0
|
|
|
|
|
|
_M_add_equivalence_class(const _StringT& __s) |
410
|
|
|
|
|
|
|
{ |
411
|
|
|
|
|
|
|
auto __st = _M_traits.lookup_collatename(__s.data(), |
412
|
0
|
0
|
|
|
|
|
__s.data() + __s.size()); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
413
|
0
|
0
|
|
|
|
|
if (__st.empty()) |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
414
|
0
|
0
|
|
|
|
|
__throw_regex_error(regex_constants::error_collate); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
415
|
0
|
0
|
|
|
|
|
__st = _M_traits.transform_primary(__st.data(), |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
416
|
0
|
|
|
|
|
|
__st.data() + __st.size()); |
417
|
0
|
0
|
|
|
|
|
_M_equiv_set.push_back(__st); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
418
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
419
|
|
|
|
|
|
|
_M_is_ready = false; |
420
|
|
|
|
|
|
|
#endif |
421
|
0
|
|
|
|
|
|
} |
422
|
|
|
|
|
|
|
|
423
|
|
|
|
|
|
|
// __neg should be true for \D, \S and \W only. |
424
|
|
|
|
|
|
|
void |
425
|
0
|
|
|
|
|
|
_M_add_character_class(const _StringT& __s, bool __neg) |
426
|
|
|
|
|
|
|
{ |
427
|
|
|
|
|
|
|
auto __mask = _M_traits.lookup_classname(__s.data(), |
428
|
0
|
|
|
|
|
|
__s.data() + __s.size(), |
429
|
0
|
0
|
|
|
|
|
__icase); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
430
|
0
|
0
|
|
|
|
|
if (__mask == 0) |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
431
|
0
|
0
|
|
|
|
|
__throw_regex_error(regex_constants::error_ctype); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
432
|
0
|
0
|
|
|
|
|
if (!__neg) |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
433
|
0
|
|
|
|
|
|
_M_class_set |= __mask; |
434
|
|
|
|
|
|
|
else |
435
|
0
|
0
|
|
|
|
|
_M_neg_class_set.push_back(__mask); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
436
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
437
|
|
|
|
|
|
|
_M_is_ready = false; |
438
|
|
|
|
|
|
|
#endif |
439
|
0
|
|
|
|
|
|
} |
440
|
|
|
|
|
|
|
|
441
|
|
|
|
|
|
|
void |
442
|
0
|
|
|
|
|
|
_M_make_range(_CharT __l, _CharT __r) |
443
|
|
|
|
|
|
|
{ |
444
|
0
|
0
|
|
|
|
|
if (__l > __r) |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
445
|
0
|
|
|
|
|
|
__throw_regex_error(regex_constants::error_range); |
446
|
0
|
0
|
|
|
|
|
_M_range_set.push_back(make_pair(_M_translator._M_transform(__l), |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
447
|
|
|
|
|
|
|
_M_translator._M_transform(__r))); |
448
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
449
|
|
|
|
|
|
|
_M_is_ready = false; |
450
|
|
|
|
|
|
|
#endif |
451
|
0
|
|
|
|
|
|
} |
452
|
|
|
|
|
|
|
|
453
|
|
|
|
|
|
|
void |
454
|
0
|
|
|
|
|
|
_M_ready() |
455
|
|
|
|
|
|
|
{ |
456
|
0
|
0
|
|
|
|
|
std::sort(_M_char_set.begin(), _M_char_set.end()); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
457
|
0
|
0
|
|
|
|
|
auto __end = std::unique(_M_char_set.begin(), _M_char_set.end()); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
458
|
0
|
0
|
|
|
|
|
_M_char_set.erase(__end, _M_char_set.end()); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
459
|
0
|
0
|
|
|
|
|
_M_make_cache(_UseCache()); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
460
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
461
|
|
|
|
|
|
|
_M_is_ready = true; |
462
|
|
|
|
|
|
|
#endif |
463
|
0
|
|
|
|
|
|
} |
464
|
|
|
|
|
|
|
|
465
|
|
|
|
|
|
|
private: |
466
|
|
|
|
|
|
|
// Currently we only use the cache for char |
467
|
|
|
|
|
|
|
typedef typename std::is_same<_CharT, char>::type _UseCache; |
468
|
|
|
|
|
|
|
|
469
|
|
|
|
|
|
|
static constexpr size_t |
470
|
|
|
|
|
|
|
_S_cache_size() |
471
|
|
|
|
|
|
|
{ |
472
|
|
|
|
|
|
|
return 1ul << (sizeof(_CharT) * __CHAR_BIT__ * int(_UseCache::value)); |
473
|
|
|
|
|
|
|
} |
474
|
|
|
|
|
|
|
|
475
|
|
|
|
|
|
|
struct _Dummy { }; |
476
|
|
|
|
|
|
|
typedef typename std::conditional<_UseCache::value, |
477
|
|
|
|
|
|
|
std::bitset<_S_cache_size()>, |
478
|
|
|
|
|
|
|
_Dummy>::type _CacheT; |
479
|
|
|
|
|
|
|
typedef typename std::make_unsigned<_CharT>::type _UnsignedCharT; |
480
|
|
|
|
|
|
|
|
481
|
|
|
|
|
|
|
bool |
482
|
|
|
|
|
|
|
_M_apply(_CharT __ch, false_type) const; |
483
|
|
|
|
|
|
|
|
484
|
|
|
|
|
|
|
bool |
485
|
0
|
|
|
|
|
|
_M_apply(_CharT __ch, true_type) const |
486
|
0
|
|
|
|
|
|
{ return _M_cache[static_cast<_UnsignedCharT>(__ch)]; } |
487
|
|
|
|
|
|
|
|
488
|
|
|
|
|
|
|
void |
489
|
0
|
|
|
|
|
|
_M_make_cache(true_type) |
490
|
|
|
|
|
|
|
{ |
491
|
0
|
0
|
|
|
|
|
for (unsigned __i = 0; __i < _M_cache.size(); __i++) |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
492
|
0
|
0
|
|
|
|
|
_M_cache[__i] = _M_apply(static_cast<_CharT>(__i), false_type()); |
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
|
|
0
|
|
|
|
|
|
493
|
0
|
|
|
|
|
|
} |
494
|
|
|
|
|
|
|
|
495
|
|
|
|
|
|
|
void |
496
|
|
|
|
|
|
|
_M_make_cache(false_type) |
497
|
|
|
|
|
|
|
{ } |
498
|
|
|
|
|
|
|
|
499
|
|
|
|
|
|
|
private: |
500
|
|
|
|
|
|
|
std::vector<_CharT> _M_char_set; |
501
|
|
|
|
|
|
|
std::vector<_StringT> _M_equiv_set; |
502
|
|
|
|
|
|
|
std::vector> _M_range_set; |
503
|
|
|
|
|
|
|
std::vector<_CharClassT> _M_neg_class_set; |
504
|
|
|
|
|
|
|
_CharClassT _M_class_set; |
505
|
|
|
|
|
|
|
_TransT _M_translator; |
506
|
|
|
|
|
|
|
const _TraitsT& _M_traits; |
507
|
|
|
|
|
|
|
bool _M_is_non_matching; |
508
|
|
|
|
|
|
|
_CacheT _M_cache; |
509
|
|
|
|
|
|
|
#ifdef _GLIBCXX_DEBUG |
510
|
|
|
|
|
|
|
bool _M_is_ready; |
511
|
|
|
|
|
|
|
#endif |
512
|
|
|
|
|
|
|
}; |
513
|
|
|
|
|
|
|
|
514
|
|
|
|
|
|
|
//@} regex-detail |
515
|
|
|
|
|
|
|
_GLIBCXX_END_NAMESPACE_VERSION |
516
|
|
|
|
|
|
|
} // namespace __detail |
517
|
|
|
|
|
|
|
} // namespace std |
518
|
|
|
|
|
|
|
|
519
|
|
|
|
|
|
|
#include |