43 #ifndef _GLIBCXX_FUNCTIONAL
44 #define _GLIBCXX_FUNCTIONAL 1
46 #pragma GCC system_header
51 #if __cplusplus >= 201103L
60 #if __cplusplus > 201402L
61 # include <unordered_map>
68 namespace std _GLIBCXX_VISIBILITY(default)
70 _GLIBCXX_BEGIN_NAMESPACE_VERSION
72 #if __cplusplus > 201402L
73 # define __cpp_lib_invoke 201411
76 template<
typename _Callable,
typename... _Args>
77 inline invoke_result_t<_Callable, _Args...>
78 invoke(_Callable&& __fn, _Args&&... __args)
79 noexcept(is_nothrow_invocable_v<_Callable, _Args...>)
81 return std::__invoke(std::forward<_Callable>(__fn),
82 std::forward<_Args>(__args)...);
86 template<
typename _MemFunPtr,
87 bool __is_mem_fn = is_member_function_pointer<_MemFunPtr>::value>
89 :
public _Mem_fn_traits<_MemFunPtr>::__maybe_type
91 using _Traits = _Mem_fn_traits<_MemFunPtr>;
93 using _Arity =
typename _Traits::__arity;
94 using _Varargs =
typename _Traits::__vararg;
96 template<
typename _Func,
typename... _BoundArgs>
97 friend struct _Bind_check_arity;
103 using result_type =
typename _Traits::__result_type;
106 _Mem_fn_base(_MemFunPtr __pmf)
noexcept : _M_pmf(__pmf) { }
108 template<
typename... _Args>
110 operator()(_Args&&... __args) const
112 std::__invoke(_M_pmf, std::
forward<_Args>(__args)...)))
113 -> decltype(std::__invoke(_M_pmf, std::
forward<_Args>(__args)...))
114 {
return std::__invoke(_M_pmf, std::forward<_Args>(__args)...); }
118 template<
typename _MemObjPtr>
119 class _Mem_fn_base<_MemObjPtr, false>
121 using _Arity = integral_constant<size_t, 0>;
124 template<
typename _Func,
typename... _BoundArgs>
125 friend struct _Bind_check_arity;
131 _Mem_fn_base(_MemObjPtr __pm)
noexcept : _M_pm(__pm) { }
133 template<
typename _Tp>
135 operator()(_Tp&& __obj) const
137 -> decltype(std::__invoke(_M_pm, std::
forward<_Tp>(__obj)))
138 {
return std::__invoke(_M_pm, std::forward<_Tp>(__obj)); }
141 template<
typename _MemberPo
inter>
144 template<
typename _Res,
typename _Class>
145 struct _Mem_fn<_Res _Class::*>
146 : _Mem_fn_base<_Res _Class::*>
148 using _Mem_fn_base<_Res _Class::*>::_Mem_fn_base;
158 template<
typename _Tp,
typename _Class>
159 inline _Mem_fn<_Tp _Class::*>
162 return _Mem_fn<_Tp _Class::*>(__pm);
173 template<
typename _Tp>
184 template<
typename _Tp>
189 #if __cplusplus > 201402L
190 template <
typename _Tp>
inline constexpr
bool is_bind_expression_v
192 template <
typename _Tp>
inline constexpr
int is_placeholder_v
205 namespace placeholders
259 template<std::
size_t __i,
typename _Tuple>
260 using _Safe_tuple_element_t
261 =
typename enable_if<(__i < tuple_size<_Tuple>::value),
262 tuple_element<__i, _Tuple>>::type::type;
275 template<
typename _Arg,
276 bool _IsBindExp = is_bind_expression<_Arg>::value,
277 bool _IsPlaceholder = (is_placeholder<_Arg>::value > 0)>
285 template<
typename _Tp>
293 template<
typename _CVRef,
typename _Tuple>
295 operator()(_CVRef& __arg, _Tuple&)
const volatile
296 {
return __arg.get(); }
305 template<
typename _Arg>
306 class _Mu<_Arg, true, false>
309 template<
typename _CVArg,
typename... _Args>
311 operator()(_CVArg& __arg,
313 -> decltype(__arg(declval<_Args>()...))
316 typedef typename _Build_index_tuple<
sizeof...(_Args)>::__type
318 return this->__call(__arg, __tuple, _Indexes());
324 template<
typename _CVArg,
typename... _Args, std::size_t... _Indexes>
327 const _Index_tuple<_Indexes...>&)
const volatile
328 -> decltype(__arg(declval<_Args>()...))
330 return __arg(std::get<_Indexes>(std::move(__tuple))...);
339 template<
typename _Arg>
340 class _Mu<_Arg, false, true>
343 template<
typename _Tuple>
344 _Safe_tuple_element_t<(is_placeholder<_Arg>::value - 1), _Tuple>&&
345 operator()(
const volatile _Arg&, _Tuple& __tuple)
const volatile
348 ::std::get<(is_placeholder<_Arg>::value - 1)>(std::move(__tuple));
357 template<
typename _Arg>
358 class _Mu<_Arg, false, false>
361 template<
typename _CVArg,
typename _Tuple>
363 operator()(_CVArg&& __arg, _Tuple&)
const volatile
364 {
return std::forward<_CVArg>(__arg); }
368 template<std::size_t _Ind,
typename... _Tp>
371 -> __tuple_element_t<_Ind,
tuple<_Tp...>>
volatile&
372 {
return std::get<_Ind>(
const_cast<tuple<_Tp...
>&>(__tuple)); }
375 template<std::size_t _Ind,
typename... _Tp>
377 __volget(
const volatile tuple<_Tp...>& __tuple)
378 -> __tuple_element_t<_Ind, tuple<_Tp...>>
const volatile&
379 {
return std::get<_Ind>(
const_cast<const tuple<_Tp...
>&>(__tuple)); }
382 template<
typename _Signature>
385 template<
typename _Functor,
typename... _Bound_args>
386 class _Bind<_Functor(_Bound_args...)>
389 typedef typename _Build_index_tuple<
sizeof...(_Bound_args)>::__type
393 tuple<_Bound_args...> _M_bound_args;
396 template<
typename _Result,
typename... _Args, std::size_t... _Indexes>
400 return std::__invoke(_M_f,
406 template<
typename _Result,
typename... _Args, std::size_t... _Indexes>
410 return std::__invoke(_M_f,
416 template<
typename _Result,
typename... _Args, std::size_t... _Indexes>
418 __call_v(tuple<_Args...>&& __args,
419 _Index_tuple<_Indexes...>)
volatile
421 return std::__invoke(_M_f,
422 _Mu<_Bound_args>()(__volget<_Indexes>(_M_bound_args), __args)...
427 template<
typename _Result,
typename... _Args, std::size_t... _Indexes>
429 __call_c_v(tuple<_Args...>&& __args,
430 _Index_tuple<_Indexes...>)
const volatile
432 return std::__invoke(_M_f,
433 _Mu<_Bound_args>()(__volget<_Indexes>(_M_bound_args), __args)...
437 template<
typename _BoundArg,
typename _CallArgs>
438 using _Mu_type = decltype(
439 _Mu<
typename remove_cv<_BoundArg>::type>()(
440 std::declval<_BoundArg&>(), std::declval<_CallArgs&>()) );
442 template<
typename _Fn,
typename _CallArgs,
typename... _BArgs>
444 =
typename result_of< _Fn&(_Mu_type<_BArgs, _CallArgs>&&...) >::type;
446 template<
typename _CallArgs>
447 using _Res_type = _Res_type_impl<_Functor, _CallArgs, _Bound_args...>;
449 template<
typename _CallArgs>
450 using __dependent =
typename
451 enable_if<bool(tuple_size<_CallArgs>::value+1), _Functor>::type;
453 template<
typename _CallArgs,
template<
class>
class __cv_quals>
454 using _Res_type_cv = _Res_type_impl<
455 typename __cv_quals<__dependent<_CallArgs>>::type,
457 typename __cv_quals<_Bound_args>::type...>;
460 template<
typename... _Args>
461 explicit _Bind(
const _Functor& __f, _Args&&... __args)
462 : _M_f(__f), _M_bound_args(std::
forward<_Args>(__args)...)
465 template<
typename... _Args>
466 explicit _Bind(_Functor&& __f, _Args&&... __args)
467 : _M_f(std::move(__f)), _M_bound_args(std::
forward<_Args>(__args)...)
470 _Bind(
const _Bind&) =
default;
473 : _M_f(std::move(__b._M_f)), _M_bound_args(std::move(__b._M_bound_args))
477 template<
typename... _Args,
478 typename _Result = _Res_type<tuple<_Args...>>>
480 operator()(_Args&&... __args)
482 return this->__call<_Result>(
483 std::forward_as_tuple(std::forward<_Args>(__args)...),
488 template<
typename... _Args,
489 typename _Result = _Res_type_cv<tuple<_Args...>, add_const>>
491 operator()(_Args&&... __args)
const
493 return this->__call_c<_Result>(
494 std::forward_as_tuple(std::forward<_Args>(__args)...),
498 #if __cplusplus > 201402L
499 # define _GLIBCXX_DEPR_BIND \
500 [[deprecated("std::bind does not support volatile in C++17")]]
502 # define _GLIBCXX_DEPR_BIND
505 template<
typename... _Args,
506 typename _Result = _Res_type_cv<tuple<_Args...>, add_volatile>>
509 operator()(_Args&&... __args)
volatile
511 return this->__call_v<_Result>(
512 std::forward_as_tuple(std::forward<_Args>(__args)...),
517 template<
typename... _Args,
518 typename _Result = _Res_type_cv<tuple<_Args...>, add_cv>>
521 operator()(_Args&&... __args)
const volatile
523 return this->__call_c_v<_Result>(
524 std::forward_as_tuple(std::forward<_Args>(__args)...),
530 template<
typename _Result,
typename _Signature>
533 template<
typename _Result,
typename _Functor,
typename... _Bound_args>
536 typedef typename _Build_index_tuple<
sizeof...(_Bound_args)>::__type
540 tuple<_Bound_args...> _M_bound_args;
543 template<
typename _Res>
544 using __enable_if_void
547 template<
typename _Res>
548 using __disable_if_void
552 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
553 __disable_if_void<_Res>
557 (std::get<_Indexes>(_M_bound_args), __args)...);
561 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
562 __enable_if_void<_Res>
566 (std::get<_Indexes>(_M_bound_args), __args)...);
570 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
571 __disable_if_void<_Res>
575 (std::get<_Indexes>(_M_bound_args), __args)...);
579 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
580 __enable_if_void<_Res>
584 (std::get<_Indexes>(_M_bound_args), __args)...);
588 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
589 __disable_if_void<_Res>
593 (__volget<_Indexes>(_M_bound_args), __args)...);
597 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
598 __enable_if_void<_Res>
602 (__volget<_Indexes>(_M_bound_args), __args)...);
606 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
607 __disable_if_void<_Res>
609 _Index_tuple<_Indexes...>)
const volatile
612 (__volget<_Indexes>(_M_bound_args), __args)...);
616 template<
typename _Res,
typename... _Args, std::size_t... _Indexes>
617 __enable_if_void<_Res>
619 _Index_tuple<_Indexes...>)
const volatile
622 (__volget<_Indexes>(_M_bound_args), __args)...);
626 typedef _Result result_type;
628 template<
typename... _Args>
629 explicit _Bind_result(
const _Functor& __f, _Args&&... __args)
630 : _M_f(__f), _M_bound_args(std::forward<_Args>(__args)...)
633 template<
typename... _Args>
634 explicit _Bind_result(_Functor&& __f, _Args&&... __args)
635 : _M_f(std::move(__f)), _M_bound_args(std::forward<_Args>(__args)...)
638 _Bind_result(
const _Bind_result&) =
default;
640 _Bind_result(_Bind_result&& __b)
641 : _M_f(std::move(__b._M_f)), _M_bound_args(std::move(__b._M_bound_args))
645 template<
typename... _Args>
647 operator()(_Args&&... __args)
649 return this->__call<_Result>(
650 std::forward_as_tuple(std::forward<_Args>(__args)...),
655 template<
typename... _Args>
657 operator()(_Args&&... __args)
const
659 return this->__call<_Result>(
660 std::forward_as_tuple(std::forward<_Args>(__args)...),
665 template<
typename... _Args>
668 operator()(_Args&&... __args)
volatile
670 return this->__call<_Result>(
671 std::forward_as_tuple(std::forward<_Args>(__args)...),
676 template<
typename... _Args>
679 operator()(_Args&&... __args)
const volatile
681 return this->__call<_Result>(
682 std::forward_as_tuple(std::forward<_Args>(__args)...),
686 #undef _GLIBCXX_DEPR_BIND
692 template<
typename _Signature>
700 template<
typename _Signature>
708 template<
typename _Signature>
716 template<
typename _Signature>
724 template<
typename _Result,
typename _Signature>
732 template<
typename _Result,
typename _Signature>
740 template<
typename _Result,
typename _Signature>
748 template<
typename _Result,
typename _Signature>
752 template<
typename _Func,
typename... _BoundArgs>
753 struct _Bind_check_arity { };
755 template<
typename _Ret,
typename... _Args,
typename... _BoundArgs>
756 struct _Bind_check_arity<_Ret (*)(_Args...), _BoundArgs...>
758 static_assert(
sizeof...(_BoundArgs) ==
sizeof...(_Args),
759 "Wrong number of arguments for function");
762 template<
typename _Ret,
typename... _Args,
typename... _BoundArgs>
763 struct _Bind_check_arity<_Ret (*)(_Args......), _BoundArgs...>
765 static_assert(
sizeof...(_BoundArgs) >=
sizeof...(_Args),
766 "Wrong number of arguments for function");
769 template<
typename _Tp,
typename _Class,
typename... _BoundArgs>
770 struct _Bind_check_arity<_Tp _Class::*, _BoundArgs...>
772 using _Arity =
typename _Mem_fn<_Tp _Class::*>::_Arity;
773 using _Varargs =
typename _Mem_fn<_Tp _Class::*>::_Varargs;
774 static_assert(_Varargs::value
775 ?
sizeof...(_BoundArgs) >= _Arity::value + 1
776 :
sizeof...(_BoundArgs) == _Arity::value + 1,
777 "Wrong number of arguments for pointer-to-member");
783 template<typename _Tp, typename _Tp2 = typename decay<_Tp>::type>
784 using __is_socketlike = __or_<is_integral<_Tp2>, is_enum<_Tp2>>;
786 template<
bool _SocketLike,
typename _Func,
typename... _BoundArgs>
788 : _Bind_check_arity<typename decay<_Func>::type, _BoundArgs...>
790 typedef typename decay<_Func>::type __func_type;
791 typedef _Bind<__func_type(typename decay<_BoundArgs>::type...)> type;
797 template<
typename _Func,
typename... _BoundArgs>
798 struct _Bind_helper<true, _Func, _BoundArgs...>
805 template<
typename _Func,
typename... _BoundArgs>
807 _Bind_helper<__is_socketlike<_Func>::value, _Func, _BoundArgs...>::type
808 bind(_Func&& __f, _BoundArgs&&... __args)
810 typedef _Bind_helper<
false, _Func, _BoundArgs...> __helper_type;
811 return typename __helper_type::type(std::forward<_Func>(__f),
812 std::forward<_BoundArgs>(__args)...);
815 template<
typename _Result,
typename _Func,
typename... _BoundArgs>
816 struct _Bindres_helper
817 : _Bind_check_arity<typename decay<_Func>::type, _BoundArgs...>
819 typedef typename decay<_Func>::type __functor_type;
820 typedef _Bind_result<_Result,
821 __functor_type(
typename decay<_BoundArgs>::type...)>
829 template<
typename _Result,
typename _Func,
typename... _BoundArgs>
831 typename _Bindres_helper<_Result, _Func, _BoundArgs...>::type
832 bind(_Func&& __f, _BoundArgs&&... __args)
834 typedef _Bindres_helper<_Result, _Func, _BoundArgs...> __helper_type;
835 return typename __helper_type::type(std::forward<_Func>(__f),
836 std::forward<_BoundArgs>(__args)...);
839 #if __cplusplus >= 201402L
841 template<
typename _Fn>
844 template<
typename _Fn2,
typename... _Args>
845 using __inv_res_t =
typename __invoke_result<_Fn2, _Args...>::type;
847 template<
typename _Tp>
848 static decltype(!std::declval<_Tp>())
852 template<
typename _Fn2>
854 : _M_fn(std::forward<_Fn2>(__fn)) { }
863 #define _GLIBCXX_NOT_FN_CALL_OP( _QUALS ) \
864 template<typename... _Args> \
865 decltype(_S_not<__inv_res_t<_Fn _QUALS, _Args...>>()) \
866 operator()(_Args&&... __args) _QUALS \
867 noexcept(__is_nothrow_invocable<_Fn _QUALS, _Args...>::value \
868 && noexcept(_S_not<__inv_res_t<_Fn _QUALS, _Args...>>())) \
870 return !std::__invoke(std::forward< _Fn _QUALS >(_M_fn), \
871 std::forward<_Args>(__args)...); \
873 _GLIBCXX_NOT_FN_CALL_OP( & )
874 _GLIBCXX_NOT_FN_CALL_OP(
const & )
875 _GLIBCXX_NOT_FN_CALL_OP( && )
876 _GLIBCXX_NOT_FN_CALL_OP(
const && )
877 #undef _GLIBCXX_NOT_FN_CALL
883 template<
typename _Tp,
typename _Pred>
886 template<
typename _Tp>
887 struct __is_byte_like<_Tp, equal_to<_Tp>>
888 : __bool_constant<sizeof(_Tp) == 1 && is_integral<_Tp>::value> { };
890 template<
typename _Tp>
891 struct __is_byte_like<_Tp, equal_to<void>>
892 : __bool_constant<sizeof(_Tp) == 1 && is_integral<_Tp>::value> { };
894 #if __cplusplus >= 201703L
896 enum class byte : unsigned char;
899 struct __is_byte_like<byte, equal_to<byte>>
903 struct __is_byte_like<byte, equal_to<void>>
906 #define __cpp_lib_not_fn 201603
908 template<
typename _Fn>
911 noexcept(std::is_nothrow_constructible<std::
decay_t<_Fn>, _Fn&&>::value)
913 return _Not_fn<std::decay_t<_Fn>>{std::forward<_Fn>(__fn), 0};
917 #define __cpp_lib_boyer_moore_searcher 201603
919 template<
typename _ForwardIterator1,
typename _BinaryPredicate = equal_to<>>
920 class default_searcher
923 default_searcher(_ForwardIterator1 __pat_first,
924 _ForwardIterator1 __pat_last,
925 _BinaryPredicate __pred = _BinaryPredicate())
926 : _M_m(__pat_first, __pat_last, std::move(__pred))
929 template<
typename _ForwardIterator2>
930 pair<_ForwardIterator2, _ForwardIterator2>
931 operator()(_ForwardIterator2 __first, _ForwardIterator2 __last)
const
933 _ForwardIterator2 __first_ret =
934 std::search(__first, __last, std::get<0>(_M_m), std::get<1>(_M_m),
937 if (__ret.first != __last)
944 tuple<_ForwardIterator1, _ForwardIterator1, _BinaryPredicate> _M_m;
947 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Pred>
948 struct __boyer_moore_map_base
950 template<
typename _RAIter>
951 __boyer_moore_map_base(_RAIter __pat,
size_t __patlen,
952 _Hash&& __hf, _Pred&& __pred)
953 : _M_bad_char{ __patlen, std::move(__hf), std::move(__pred) }
956 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
957 _M_bad_char[__pat[__i]] = __patlen - 1 - __i;
960 using __diff_type = _Tp;
963 _M_lookup(_Key __key, __diff_type __not_found)
const
965 auto __iter = _M_bad_char.find(__key);
966 if (__iter == _M_bad_char.end())
968 return __iter->second;
972 _M_pred()
const {
return _M_bad_char.key_eq(); }
974 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
977 template<
typename _Tp,
size_t _Len,
typename _Pred>
978 struct __boyer_moore_array_base
980 template<
typename _RAIter,
typename _Unused>
981 __boyer_moore_array_base(_RAIter __pat,
size_t __patlen,
982 _Unused&&, _Pred&& __pred)
983 : _M_bad_char{ _GLIBCXX_STD_C::array<_Tp, _Len>{}, std::move(__pred) }
985 std::get<0>(_M_bad_char).fill(__patlen);
987 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
989 auto __ch = __pat[__i];
990 using _UCh = make_unsigned_t<decltype(__ch)>;
991 auto __uch =
static_cast<_UCh
>(__ch);
992 std::get<0>(_M_bad_char)[__uch] = __patlen - 1 - __i;
996 using __diff_type = _Tp;
998 template<
typename _Key>
1000 _M_lookup(_Key __key, __diff_type __not_found)
const
1002 auto __ukey =
static_cast<make_unsigned_t<_Key>
>(__key);
1005 return std::get<0>(_M_bad_char)[__ukey];
1009 _M_pred()
const {
return std::get<1>(_M_bad_char); }
1011 tuple<_GLIBCXX_STD_C::array<_Tp, _Len>, _Pred> _M_bad_char;
1016 template<
typename _RAIter,
typename _Hash,
typename _Pred,
1017 typename _Val =
typename iterator_traits<_RAIter>::value_type,
1018 typename _Diff =
typename iterator_traits<_RAIter>::difference_type>
1019 using __boyer_moore_base_t
1020 = conditional_t<__is_byte_like<_Val, _Pred>::value,
1021 __boyer_moore_array_base<_Diff, 256, _Pred>,
1022 __boyer_moore_map_base<_Val, _Diff, _Hash, _Pred>>;
1024 template<
typename _RAIter,
typename _Hash
1025 = hash<typename iterator_traits<_RAIter>::value_type>,
1026 typename _BinaryPredicate = equal_to<>>
1027 class boyer_moore_searcher
1028 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
1030 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
1031 using typename _Base::__diff_type;
1034 boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,
1035 _Hash __hf = _Hash(),
1036 _BinaryPredicate __pred = _BinaryPredicate());
1038 template<
typename _RandomAccessIterator2>
1039 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1040 operator()(_RandomAccessIterator2 __first,
1041 _RandomAccessIterator2 __last)
const;
1045 _M_is_prefix(_RAIter __word, __diff_type __len,
1048 const auto& __pred = this->_M_pred();
1049 __diff_type __suffixlen = __len - __pos;
1050 for (__diff_type __i = 0; __i < __suffixlen; ++__i)
1051 if (!__pred(__word[__i], __word[__pos + __i]))
1057 _M_suffix_length(_RAIter __word, __diff_type __len,
1060 const auto& __pred = this->_M_pred();
1061 __diff_type __i = 0;
1062 while (__pred(__word[__pos - __i], __word[__len - 1 - __i])
1070 template<
typename _Tp>
1072 _M_bad_char_shift(_Tp __c)
const
1073 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
1077 _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;
1080 template<
typename _RAIter,
typename _Hash
1081 = hash<typename iterator_traits<_RAIter>::value_type>,
1082 typename _BinaryPredicate = equal_to<>>
1083 class boyer_moore_horspool_searcher
1084 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
1086 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
1087 using typename _Base::__diff_type;
1090 boyer_moore_horspool_searcher(_RAIter __pat,
1092 _Hash __hf = _Hash(),
1093 _BinaryPredicate __pred
1094 = _BinaryPredicate())
1095 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
1096 _M_pat(__pat), _M_pat_end(__pat_end)
1099 template<
typename _RandomAccessIterator2>
1100 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1101 operator()(_RandomAccessIterator2 __first,
1102 _RandomAccessIterator2 __last)
const
1104 const auto& __pred = this->_M_pred();
1105 auto __patlen = _M_pat_end - _M_pat;
1108 auto __len = __last - __first;
1109 while (__len >= __patlen)
1111 for (
auto __scan = __patlen - 1;
1112 __pred(__first[__scan], _M_pat[__scan]); --__scan)
1115 auto __shift = _M_bad_char_shift(__first[__patlen - 1]);
1123 template<
typename _Tp>
1125 _M_bad_char_shift(_Tp __c)
const
1126 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
1132 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
1133 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
1134 boyer_moore_searcher(_RAIter __pat, _RAIter __pat_end,
1135 _Hash __hf, _BinaryPredicate __pred)
1136 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
1137 _M_pat(__pat), _M_pat_end(__pat_end), _M_good_suffix(__pat_end - __pat)
1139 auto __patlen = __pat_end - __pat;
1142 __diff_type __last_prefix = __patlen - 1;
1143 for (__diff_type __p = __patlen - 1; __p >= 0; --__p)
1145 if (_M_is_prefix(__pat, __patlen, __p + 1))
1146 __last_prefix = __p + 1;
1147 _M_good_suffix[__p] = __last_prefix + (__patlen - 1 - __p);
1149 for (__diff_type __p = 0; __p < __patlen - 1; ++__p)
1151 auto __slen = _M_suffix_length(__pat, __patlen, __p);
1152 auto __pos = __patlen - 1 - __slen;
1153 if (!__pred(__pat[__p - __slen], __pat[__pos]))
1154 _M_good_suffix[__pos] = __patlen - 1 - __p + __slen;
1158 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
1159 template<
typename _RandomAccessIterator2>
1160 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1161 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
1162 operator()(_RandomAccessIterator2 __first,
1163 _RandomAccessIterator2 __last)
const
1165 auto __patlen = _M_pat_end - _M_pat;
1168 const auto& __pred = this->_M_pred();
1169 __diff_type __i = __patlen - 1;
1170 auto __stringlen = __last - __first;
1171 while (__i < __stringlen)
1173 __diff_type __j = __patlen - 1;
1174 while (__j >= 0 && __pred(__first[__i], _M_pat[__j]))
1181 const auto __match = __first + __i + 1;
1184 __i +=
std::max(_M_bad_char_shift(__first[__i]),
1185 _M_good_suffix[__j]);
1193 _GLIBCXX_END_NAMESPACE_VERSION
1198 #endif // _GLIBCXX_FUNCTIONAL
_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
Determines if the given type _Tp is a function object that should be treated as a subexpression when ...
Primary class template for reference_wrapper.
_Mem_fn< _Tp _Class::* > mem_fn(_Tp _Class::*__pm) noexcept
Returns a function object that forwards to the member pointer pm.
_Bind_helper< __is_socketlike< _Func >::value, _Func, _BoundArgs...>::type bind(_Func &&__f, _BoundArgs &&...__args)
Function template for std::bind.
enable_if< ::__array_traits< _Tp, _Nm >::_Is_swappable::value >::type noexcept(noexcept(__one.swap(__two)))
swap
_ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate)
Search a sequence for a matching sub-sequence using a predicate.
constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)
A convenience wrapper for creating a pair from two objects.
integral_constant< bool, false > false_type
The type used as a compile-time boolean with false value.
_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
Define a member typedef type only if a boolean constant is true.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
The type of placeholder objects defined by libstdc++.
integral_constant< bool, true > true_type
The type used as a compile-time boolean with true value.
typename decay< _Tp >::type decay_t
Alias template for decay.
_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
Type of the function object returned from bind<R>().
Primary class template, tuple.
Type of the function object returned from bind().
Determines if the given type _Tp is a placeholder in a bind() expression and, if so, which placeholder it is.