29 #ifndef _GLIBCXX_EXPERIMENTAL_FUNCTIONAL
30 #define _GLIBCXX_EXPERIMENTAL_FUNCTIONAL 1
32 #pragma GCC system_header
34 #if __cplusplus <= 201103L
45 #ifdef _GLIBCXX_PARALLEL
50 namespace std _GLIBCXX_VISIBILITY(default)
52 namespace experimental
54 inline namespace fundamentals_v1
56 _GLIBCXX_BEGIN_NAMESPACE_VERSION
61 template<
typename _Tp>
65 template<
typename _Tp>
68 #define __cpp_lib_experimental_boyer_moore_searching 201411
72 template<
typename _ForwardIterator1,
typename _BinaryPredicate = equal_to<>>
73 class default_searcher
76 default_searcher(_ForwardIterator1 __pat_first,
77 _ForwardIterator1 __pat_last,
78 _BinaryPredicate __pred = _BinaryPredicate())
79 : _M_m(__pat_first, __pat_last, std::move(__pred))
82 template<
typename _ForwardIterator2>
84 operator()(_ForwardIterator2 __first, _ForwardIterator2 __last)
const
87 std::get<0>(_M_m), std::get<1>(_M_m),
95 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Pred>
96 struct __boyer_moore_map_base
98 template<
typename _RAIter>
99 __boyer_moore_map_base(_RAIter __pat,
size_t __patlen,
100 _Hash&& __hf, _Pred&& __pred)
101 : _M_bad_char{ __patlen, std::move(__hf), std::move(__pred) }
104 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
105 _M_bad_char[__pat[__i]] = __patlen - 1 - __i;
108 using __diff_type = _Tp;
111 _M_lookup(_Key __key, __diff_type __not_found)
const
113 auto __iter = _M_bad_char.find(__key);
114 if (__iter == _M_bad_char.end())
116 return __iter->second;
120 _M_pred()
const {
return _M_bad_char.key_eq(); }
122 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
125 template<
typename _Tp,
size_t _Len,
typename _Pred>
126 struct __boyer_moore_array_base
128 template<
typename _RAIter,
typename _Unused>
129 __boyer_moore_array_base(_RAIter __pat,
size_t __patlen,
130 _Unused&&, _Pred&& __pred)
131 : _M_bad_char{ _GLIBCXX_STD_C::array<_Tp, _Len>{}, std::move(__pred) }
133 std::get<0>(_M_bad_char).fill(__patlen);
135 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
137 auto __ch = __pat[__i];
138 using _UCh = std::make_unsigned_t<decltype(__ch)>;
139 auto __uch =
static_cast<_UCh
>(__ch);
140 std::get<0>(_M_bad_char)[__uch] = __patlen - 1 - __i;
144 using __diff_type = _Tp;
146 template<
typename _Key>
148 _M_lookup(_Key __key, __diff_type __not_found)
const
150 auto __ukey =
static_cast<std::make_unsigned_t<_Key>
>(__key);
153 return std::get<0>(_M_bad_char)[__ukey];
157 _M_pred()
const {
return std::get<1>(_M_bad_char); }
162 template<
typename _Pred>
166 struct __is_std_equal_to<std::equal_to<void>> :
std::true_type { };
170 template<
typename _RAIter,
typename _Hash,
typename _Pred,
171 typename _Val =
typename iterator_traits<_RAIter>::value_type,
172 typename _Diff =
typename iterator_traits<_RAIter>::difference_type>
173 using __boyer_moore_base_t
174 = std::conditional_t<sizeof(_Val) == 1 && is_integral<_Val>::value
175 && __is_std_equal_to<_Pred>::value,
176 __boyer_moore_array_base<_Diff, 256, _Pred>,
177 __boyer_moore_map_base<_Val, _Diff, _Hash, _Pred>>;
179 template<
typename _RAIter,
typename _Hash
182 class boyer_moore_searcher
183 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
185 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
186 using typename _Base::__diff_type;
189 boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,
190 _Hash __hf = _Hash(),
191 _BinaryPredicate __pred = _BinaryPredicate());
193 template<
typename _RandomAccessIterator2>
194 _RandomAccessIterator2
195 operator()(_RandomAccessIterator2 __first,
196 _RandomAccessIterator2 __last)
const;
200 _M_is_prefix(_RAIter __word, __diff_type __len,
203 const auto& __pred = this->_M_pred();
204 __diff_type __suffixlen = __len - __pos;
205 for (__diff_type __i = 0; __i < __suffixlen; ++__i)
206 if (!__pred(__word[__i], __word[__pos + __i]))
212 _M_suffix_length(_RAIter __word, __diff_type __len,
215 const auto& __pred = this->_M_pred();
217 while (__pred(__word[__pos - __i], __word[__len - 1 - __i])
225 template<
typename _Tp>
227 _M_bad_char_shift(_Tp __c)
const
228 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
232 _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;
235 template<
typename _RAIter,
typename _Hash
238 class boyer_moore_horspool_searcher
239 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
241 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
242 using typename _Base::__diff_type;
245 boyer_moore_horspool_searcher(_RAIter __pat,
247 _Hash __hf = _Hash(),
248 _BinaryPredicate __pred
249 = _BinaryPredicate())
250 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
251 _M_pat(__pat), _M_pat_end(__pat_end)
254 template<
typename _RandomAccessIterator2>
255 _RandomAccessIterator2
256 operator()(_RandomAccessIterator2 __first,
257 _RandomAccessIterator2 __last)
const
259 const auto& __pred = this->_M_pred();
260 auto __patlen = _M_pat_end - _M_pat;
263 auto __len = __last - __first;
264 while (__len >= __patlen)
266 for (
auto __scan = __patlen - 1;
267 __pred(__first[__scan], _M_pat[__scan]); --__scan)
270 auto __shift = _M_bad_char_shift(__first[__patlen - 1]);
278 template<
typename _Tp>
280 _M_bad_char_shift(_Tp __c)
const
281 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
288 template<
typename _ForwardIterator,
290 inline default_searcher<_ForwardIterator, _BinaryPredicate>
291 make_default_searcher(_ForwardIterator __pat_first,
292 _ForwardIterator __pat_last,
293 _BinaryPredicate __pred = _BinaryPredicate())
294 {
return { __pat_first, __pat_last, __pred }; }
297 template<
typename _RAIter,
typename _Hash
299 typename _BinaryPredicate = equal_to<>>
300 inline boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>
301 make_boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,
302 _Hash __hf = _Hash(),
303 _BinaryPredicate __pred = _BinaryPredicate())
304 {
return { __pat_first, __pat_last, std::move(__hf), std::move(__pred) }; }
307 template<
typename _RAIter,
typename _Hash
309 typename _BinaryPredicate = equal_to<>>
310 inline boyer_moore_horspool_searcher<_RAIter, _Hash, _BinaryPredicate>
311 make_boyer_moore_horspool_searcher(_RAIter __pat_first, _RAIter __pat_last,
312 _Hash __hf = _Hash(),
313 _BinaryPredicate __pred
314 = _BinaryPredicate())
315 {
return { __pat_first, __pat_last, std::move(__hf), std::move(__pred) }; }
317 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
318 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
319 boyer_moore_searcher(_RAIter __pat, _RAIter __pat_end,
320 _Hash __hf, _BinaryPredicate __pred)
321 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
322 _M_pat(__pat), _M_pat_end(__pat_end), _M_good_suffix(__pat_end - __pat)
324 auto __patlen = __pat_end - __pat;
327 __diff_type __last_prefix = __patlen - 1;
328 for (__diff_type __p = __patlen - 1; __p >= 0; --__p)
330 if (_M_is_prefix(__pat, __patlen, __p + 1))
331 __last_prefix = __p + 1;
332 _M_good_suffix[__p] = __last_prefix + (__patlen - 1 - __p);
334 for (__diff_type __p = 0; __p < __patlen - 1; ++__p)
336 auto __slen = _M_suffix_length(__pat, __patlen, __p);
337 auto __pos = __patlen - 1 - __slen;
338 if (!__pred(__pat[__p - __slen], __pat[__pos]))
339 _M_good_suffix[__pos] = __patlen - 1 - __p + __slen;
343 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
344 template<
typename _RandomAccessIterator2>
345 _RandomAccessIterator2
346 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
347 operator()(_RandomAccessIterator2 __first,
348 _RandomAccessIterator2 __last)
const
350 auto __patlen = _M_pat_end - _M_pat;
353 const auto& __pred = this->_M_pred();
354 __diff_type __i = __patlen - 1;
355 auto __stringlen = __last - __first;
356 while (__i < __stringlen)
358 __diff_type __j = __patlen - 1;
359 while (__j >= 0 && __pred(__first[__i], _M_pat[__j]))
365 return __first + __i + 1;
366 __i +=
std::max(_M_bad_char_shift(__first[__i]),
367 _M_good_suffix[__j]);
372 _GLIBCXX_END_NAMESPACE_VERSION
375 inline namespace fundamentals_v2
377 _GLIBCXX_BEGIN_NAMESPACE_VERSION
379 #define __cpp_lib_experimental_not_fn 201406
382 template<
typename _Fn>
385 noexcept(std::is_nothrow_constructible<std::decay_t<_Fn>, _Fn&&>::value)
390 _GLIBCXX_END_NAMESPACE_VERSION
397 #endif // _GLIBCXX_EXPERIMENTAL_FUNCTIONAL
Primary class template hash.
One of the comparison functors.
_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 that should be treated as a subexpression when ...
Determines if the given type _Tp is a placeholder in a bind() expression and, if so, which placeholder it is.
_ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate)
Search a sequence for a matching sub-sequence using a predicate.