29 #ifndef _GLIBCXX_EXPERIMENTAL_FUNCTIONAL 30 #define _GLIBCXX_EXPERIMENTAL_FUNCTIONAL 1 32 #pragma GCC system_header 34 #if __cplusplus <= 201103L 47 namespace std _GLIBCXX_VISIBILITY(default)
49 namespace experimental
51 inline namespace fundamentals_v1
53 _GLIBCXX_BEGIN_NAMESPACE_VERSION
58 template<
typename _Tp>
62 template<
typename _Tp>
65 #define __cpp_lib_experimental_boyer_moore_searching 201411 69 template<
typename _ForwardIterator1,
typename _BinaryPredicate = equal_to<>>
70 class default_searcher
73 default_searcher(_ForwardIterator1 __pat_first,
74 _ForwardIterator1 __pat_last,
75 _BinaryPredicate __pred = _BinaryPredicate())
76 : _M_m(__pat_first, __pat_last, std::move(__pred))
79 template<
typename _ForwardIterator2>
81 operator()(_ForwardIterator2 __first, _ForwardIterator2 __last)
const 84 std::get<0>(_M_m), std::get<1>(_M_m),
92 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Pred>
93 struct __boyer_moore_map_base
95 template<
typename _RAIter>
96 __boyer_moore_map_base(_RAIter __pat,
size_t __patlen,
97 _Hash&& __hf, _Pred&& __pred)
98 : _M_bad_char{ __patlen, std::move(__hf), std::move(__pred) }
101 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
102 _M_bad_char[__pat[__i]] = __patlen - 1 - __i;
105 using __diff_type = _Tp;
108 _M_lookup(_Key __key, __diff_type __not_found)
const 110 auto __iter = _M_bad_char.find(__key);
111 if (__iter == _M_bad_char.end())
113 return __iter->second;
117 _M_pred()
const {
return _M_bad_char.key_eq(); }
119 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
122 template<
typename _Tp,
size_t _Len,
typename _Pred>
123 struct __boyer_moore_array_base
125 template<
typename _RAIter,
typename _Unused>
126 __boyer_moore_array_base(_RAIter __pat,
size_t __patlen,
127 _Unused&&, _Pred&& __pred)
128 : _M_bad_char{ _GLIBCXX_STD_C::array<_Tp, _Len>{}, std::move(__pred) }
130 std::get<0>(_M_bad_char).fill(__patlen);
132 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
134 auto __ch = __pat[__i];
135 using _UCh = std::make_unsigned_t<decltype(__ch)>;
136 auto __uch =
static_cast<_UCh
>(__ch);
137 std::get<0>(_M_bad_char)[__uch] = __patlen - 1 - __i;
141 using __diff_type = _Tp;
143 template<
typename _Key>
145 _M_lookup(_Key __key, __diff_type __not_found)
const 147 auto __ukey =
static_cast<std::make_unsigned_t<_Key>
>(__key);
150 return std::get<0>(_M_bad_char)[__ukey];
154 _M_pred()
const {
return std::get<1>(_M_bad_char); }
159 template<
typename _Pred>
167 template<
typename _RAIter,
typename _Hash,
typename _Pred,
168 typename _Val =
typename iterator_traits<_RAIter>::value_type,
169 typename _Diff =
typename iterator_traits<_RAIter>::difference_type>
170 using __boyer_moore_base_t
171 = std::conditional_t<sizeof(_Val) == 1 && is_integral<_Val>::value
172 && __is_std_equal_to<_Pred>::value,
173 __boyer_moore_array_base<_Diff, 256, _Pred>,
174 __boyer_moore_map_base<_Val, _Diff, _Hash, _Pred>>;
176 template<
typename _RAIter,
typename _Hash
179 class boyer_moore_searcher
180 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
182 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
183 using typename _Base::__diff_type;
186 boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,
187 _Hash __hf = _Hash(),
188 _BinaryPredicate __pred = _BinaryPredicate());
190 template<
typename _RandomAccessIterator2>
191 _RandomAccessIterator2
192 operator()(_RandomAccessIterator2 __first,
193 _RandomAccessIterator2 __last)
const;
197 _M_is_prefix(_RAIter __word, __diff_type __len,
200 const auto& __pred = this->_M_pred();
201 __diff_type __suffixlen = __len - __pos;
202 for (__diff_type __i = 0; __i < __suffixlen; ++__i)
203 if (!__pred(__word[__i], __word[__pos + __i]))
209 _M_suffix_length(_RAIter __word, __diff_type __len,
212 const auto& __pred = this->_M_pred();
214 while (__pred(__word[__pos - __i], __word[__len - 1 - __i])
222 template<
typename _Tp>
224 _M_bad_char_shift(_Tp __c)
const 225 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
229 _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;
232 template<
typename _RAIter,
typename _Hash
235 class boyer_moore_horspool_searcher
236 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
238 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
239 using typename _Base::__diff_type;
242 boyer_moore_horspool_searcher(_RAIter __pat,
244 _Hash __hf = _Hash(),
245 _BinaryPredicate __pred
246 = _BinaryPredicate())
247 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
248 _M_pat(__pat), _M_pat_end(__pat_end)
251 template<
typename _RandomAccessIterator2>
252 _RandomAccessIterator2
253 operator()(_RandomAccessIterator2 __first,
254 _RandomAccessIterator2 __last)
const 256 const auto& __pred = this->_M_pred();
257 auto __patlen = _M_pat_end - _M_pat;
260 auto __len = __last - __first;
261 while (__len >= __patlen)
263 for (
auto __scan = __patlen - 1;
264 __pred(__first[__scan], _M_pat[__scan]); --__scan)
267 auto __shift = _M_bad_char_shift(__first[__patlen - 1]);
275 template<
typename _Tp>
277 _M_bad_char_shift(_Tp __c)
const 278 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
285 template<
typename _ForwardIterator,
287 inline default_searcher<_ForwardIterator, _BinaryPredicate>
289 _ForwardIterator __pat_last,
290 _BinaryPredicate __pred = _BinaryPredicate())
291 {
return { __pat_first, __pat_last, __pred }; }
294 template<
typename _RAIter,
typename _Hash
297 inline boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>
299 _Hash __hf = _Hash(),
300 _BinaryPredicate __pred = _BinaryPredicate())
301 {
return { __pat_first, __pat_last, std::move(__hf), std::move(__pred) }; }
304 template<
typename _RAIter,
typename _Hash
307 inline boyer_moore_horspool_searcher<_RAIter, _Hash, _BinaryPredicate>
309 _Hash __hf = _Hash(),
310 _BinaryPredicate __pred
311 = _BinaryPredicate())
312 {
return { __pat_first, __pat_last, std::move(__hf), std::move(__pred) }; }
314 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
315 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
316 boyer_moore_searcher(_RAIter __pat, _RAIter __pat_end,
317 _Hash __hf, _BinaryPredicate __pred)
318 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
319 _M_pat(__pat), _M_pat_end(__pat_end), _M_good_suffix(__pat_end - __pat)
321 auto __patlen = __pat_end - __pat;
324 __diff_type __last_prefix = __patlen - 1;
325 for (__diff_type __p = __patlen - 1; __p >= 0; --__p)
327 if (_M_is_prefix(__pat, __patlen, __p + 1))
328 __last_prefix = __p + 1;
329 _M_good_suffix[__p] = __last_prefix + (__patlen - 1 - __p);
331 for (__diff_type __p = 0; __p < __patlen - 1; ++__p)
333 auto __slen = _M_suffix_length(__pat, __patlen, __p);
334 auto __pos = __patlen - 1 - __slen;
335 if (!__pred(__pat[__p - __slen], __pat[__pos]))
336 _M_good_suffix[__pos] = __patlen - 1 - __p + __slen;
340 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
341 template<
typename _RandomAccessIterator2>
342 _RandomAccessIterator2
343 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
344 operator()(_RandomAccessIterator2 __first,
345 _RandomAccessIterator2 __last)
const 347 auto __patlen = _M_pat_end - _M_pat;
350 const auto& __pred = this->_M_pred();
351 __diff_type __i = __patlen - 1;
352 auto __stringlen = __last - __first;
353 while (__i < __stringlen)
355 __diff_type __j = __patlen - 1;
356 while (__j >= 0 && __pred(__first[__i], _M_pat[__j]))
362 return __first + __i + 1;
363 __i +=
std::max(_M_bad_char_shift(__first[__i]),
364 _M_good_suffix[__j]);
369 _GLIBCXX_END_NAMESPACE_VERSION
372 inline namespace fundamentals_v2
374 _GLIBCXX_BEGIN_NAMESPACE_VERSION
376 #define __cpp_lib_experimental_not_fn 201406 379 template<
typename _Fn>
385 template<
typename _Fn2>
387 _Not_fn(_Fn2&& __fn,
int) : _M_fn(std::forward<_Fn2>(__fn)) { }
395 template<
typename... _Args>
397 operator()(_Args&&... __args)
398 noexcept(noexcept(!_M_fn(std::forward<_Args>(__args)...)))
399 -> decltype(!_M_fn(std::forward<_Args>(__args)...))
400 {
return !_M_fn(std::forward<_Args>(__args)...); }
402 template<
typename... _Args>
404 operator()(_Args&&... __args)
const 405 noexcept(noexcept(!_M_fn(std::forward<_Args>(__args)...)))
406 -> decltype(!_M_fn(std::forward<_Args>(__args)...))
407 {
return !_M_fn(std::forward<_Args>(__args)...); }
409 template<
typename... _Args>
411 operator()(_Args&&... __args)
volatile 412 noexcept(noexcept(!_M_fn(std::forward<_Args>(__args)...)))
413 -> decltype(!_M_fn(std::forward<_Args>(__args)...))
414 {
return !_M_fn(std::forward<_Args>(__args)...); }
416 template<
typename... _Args>
418 operator()(_Args&&... __args)
const volatile 419 noexcept(noexcept(!_M_fn(std::forward<_Args>(__args)...)))
420 -> decltype(!_M_fn(std::forward<_Args>(__args)...))
421 {
return !_M_fn(std::forward<_Args>(__args)...); }
425 template<
typename _Fn>
428 noexcept(std::is_nothrow_constructible<std::decay_t<_Fn>, _Fn&&>::value)
434 _GLIBCXX_END_NAMESPACE_VERSION
441 #endif // _GLIBCXX_EXPERIMENTAL_FUNCTIONAL boyer_moore_horspool_searcher< _RAIter, _Hash, _BinaryPredicate > make_boyer_moore_horspool_searcher(_RAIter __pat_first, _RAIter __pat_last, _Hash __hf=_Hash(), _BinaryPredicate __pred=_BinaryPredicate())
Generator function for boyer_moore_horspool_searcher.
Determines if the given type _Tp is a placeholder in a bind() expression and, if so, which placeholder it is. [TR1 3.6.2].
_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
Determines if the given type _Tp is a function object should be treated as a subexpression when evalu...
constexpr int is_placeholder_v
Variable template for std::is_placeholder.
boyer_moore_searcher< _RAIter, _Hash, _BinaryPredicate > make_boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last, _Hash __hf=_Hash(), _BinaryPredicate __pred=_BinaryPredicate())
Generator function for boyer_moore_searcher.
One of the comparison functors.
ISO C++ entities toplevel namespace is std.
auto not_fn(_Fn &&__fn) noexcept(std::is_nothrow_constructible< std::decay_t< _Fn >, _Fn &&>::value)
[func.not_fn] Function template not_fn
constexpr bool is_bind_expression_v
Variable template for std::is_bind_expression.
Primary class template hash.
default_searcher< _ForwardIterator, _BinaryPredicate > make_default_searcher(_ForwardIterator __pat_first, _ForwardIterator __pat_last, _BinaryPredicate __pred=_BinaryPredicate())
Generator function for default_searcher.
_ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate)
Search a sequence for a matching sub-sequence using a predicate.