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>(
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>(
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>(
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>(
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>(
655 template<
typename... _Args>
657 operator()(_Args&&... __args)
const
659 return this->__call<_Result>(
665 template<
typename... _Args>
668 operator()(_Args&&... __args)
volatile
670 return this->__call<_Result>(
676 template<
typename... _Args>
679 operator()(_Args&&... __args)
const volatile
681 return this->__call<_Result>(
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 > 201703L
840 #define __cpp_lib_bind_front 201902L
842 template<
typename _Fd,
typename... _BoundArgs>
845 static_assert(is_move_constructible_v<_Fd>);
846 static_assert((is_move_constructible_v<_BoundArgs> && ...));
850 template<
typename _Fn,
typename... _Args>
852 _Bind_front(
int, _Fn&& __fn, _Args&&... __args)
853 noexcept(__and_<is_nothrow_constructible<_Fd, _Fn>,
854 is_nothrow_constructible<_BoundArgs, _Args>...>::value)
855 : _M_fd(std::
forward<_Fn>(__fn)),
856 _M_bound_args(std::
forward<_Args>(__args)...)
857 { static_assert(
sizeof...(_Args) ==
sizeof...(_BoundArgs)); }
859 _Bind_front(
const _Bind_front&) =
default;
860 _Bind_front(_Bind_front&&) =
default;
861 _Bind_front& operator=(
const _Bind_front&) =
default;
862 _Bind_front& operator=(_Bind_front&&) =
default;
863 ~_Bind_front() =
default;
865 template<
typename... _CallArgs>
867 invoke_result_t<_Fd&, _BoundArgs&..., _CallArgs...>
868 operator()(_CallArgs&&... __call_args) &
869 noexcept(is_nothrow_invocable_v<_Fd&, _BoundArgs&..., _CallArgs...>)
871 return _S_call(*
this, _BoundIndices(),
872 std::forward<_CallArgs>(__call_args)...);
875 template<
typename... _CallArgs>
877 invoke_result_t<
const _Fd&,
const _BoundArgs&..., _CallArgs...>
878 operator()(_CallArgs&&... __call_args) const &
879 noexcept(is_nothrow_invocable_v<const _Fd&, const _BoundArgs&...,
882 return _S_call(*
this, _BoundIndices(),
883 std::forward<_CallArgs>(__call_args)...);
886 template<
typename... _CallArgs>
888 invoke_result_t<_Fd, _BoundArgs..., _CallArgs...>
889 operator()(_CallArgs&&... __call_args) &&
890 noexcept(is_nothrow_invocable_v<_Fd, _BoundArgs..., _CallArgs...>)
892 return _S_call(std::move(*
this), _BoundIndices(),
893 std::forward<_CallArgs>(__call_args)...);
896 template<
typename... _CallArgs>
898 invoke_result_t<
const _Fd,
const _BoundArgs..., _CallArgs...>
899 operator()(_CallArgs&&... __call_args) const &&
900 noexcept(is_nothrow_invocable_v<const _Fd, const _BoundArgs...,
903 return _S_call(std::move(*
this), _BoundIndices(),
904 std::forward<_CallArgs>(__call_args)...);
910 template<
typename _Tp,
size_t... _Ind,
typename... _CallArgs>
913 _S_call(_Tp&& __g,
index_sequence<_Ind...>, _CallArgs&&... __call_args)
915 return std::invoke(std::forward<_Tp>(__g)._M_fd,
916 std::get<_Ind>(std::forward<_Tp>(__g)._M_bound_args)...,
917 std::forward<_CallArgs>(__call_args)...);
924 template<
typename _Fn,
typename... _Args>
926 = _Bind_front<decay_t<_Fn>, unwrap_ref_decay_t<_Args>...>;
928 template<
typename _Fn,
typename... _Args>
929 _Bind_front_t<_Fn, _Args...>
930 bind_front(_Fn&& __fn, _Args&&... __args)
931 noexcept(is_nothrow_constructible_v<
int, _Bind_front_t<_Fn, _Args...>,
934 return _Bind_front_t<_Fn, _Args...>(0, std::forward<_Fn>(__fn),
935 std::forward<_Args>(__args)...);
939 #if __cplusplus >= 201402L
941 template<
typename _Fn>
944 template<
typename _Fn2,
typename... _Args>
945 using __inv_res_t =
typename __invoke_result<_Fn2, _Args...>::type;
947 template<
typename _Tp>
948 static decltype(!std::declval<_Tp>())
952 template<
typename _Fn2>
954 : _M_fn(std::forward<_Fn2>(__fn)) { }
963 #define _GLIBCXX_NOT_FN_CALL_OP( _QUALS ) \
964 template<typename... _Args> \
965 decltype(_S_not<__inv_res_t<_Fn _QUALS, _Args...>>()) \
966 operator()(_Args&&... __args) _QUALS \
967 noexcept(__is_nothrow_invocable<_Fn _QUALS, _Args...>::value \
968 && noexcept(_S_not<__inv_res_t<_Fn _QUALS, _Args...>>())) \
970 return !std::__invoke(std::forward< _Fn _QUALS >(_M_fn), \
971 std::forward<_Args>(__args)...); \
973 _GLIBCXX_NOT_FN_CALL_OP( & )
974 _GLIBCXX_NOT_FN_CALL_OP(
const & )
975 _GLIBCXX_NOT_FN_CALL_OP( && )
976 _GLIBCXX_NOT_FN_CALL_OP(
const && )
977 #undef _GLIBCXX_NOT_FN_CALL
983 template<
typename _Tp,
typename _Pred>
986 template<
typename _Tp>
987 struct __is_byte_like<_Tp, equal_to<_Tp>>
988 : __bool_constant<sizeof(_Tp) == 1 && is_integral<_Tp>::value> { };
990 template<
typename _Tp>
991 struct __is_byte_like<_Tp, equal_to<void>>
992 : __bool_constant<sizeof(_Tp) == 1 && is_integral<_Tp>::value> { };
994 #if __cplusplus >= 201703L
996 enum class byte : unsigned char;
999 struct __is_byte_like<byte, equal_to<byte>>
1003 struct __is_byte_like<byte, equal_to<void>>
1006 #define __cpp_lib_not_fn 201603
1008 template<
typename _Fn>
1011 noexcept(std::is_nothrow_constructible<std::
decay_t<_Fn>, _Fn&&>::value)
1013 return _Not_fn<std::decay_t<_Fn>>{std::forward<_Fn>(__fn), 0};
1017 #define __cpp_lib_boyer_moore_searcher 201603
1019 template<
typename _ForwardIterator1,
typename _BinaryPredicate = equal_to<>>
1020 class default_searcher
1023 default_searcher(_ForwardIterator1 __pat_first,
1024 _ForwardIterator1 __pat_last,
1025 _BinaryPredicate __pred = _BinaryPredicate())
1026 : _M_m(__pat_first, __pat_last, std::move(__pred))
1029 template<
typename _ForwardIterator2>
1030 pair<_ForwardIterator2, _ForwardIterator2>
1031 operator()(_ForwardIterator2 __first, _ForwardIterator2 __last)
const
1033 _ForwardIterator2 __first_ret =
1034 std::search(__first, __last, std::get<0>(_M_m), std::get<1>(_M_m),
1037 if (__ret.first != __last)
1039 std::get<1>(_M_m)));
1044 tuple<_ForwardIterator1, _ForwardIterator1, _BinaryPredicate> _M_m;
1047 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Pred>
1048 struct __boyer_moore_map_base
1050 template<
typename _RAIter>
1051 __boyer_moore_map_base(_RAIter __pat,
size_t __patlen,
1052 _Hash&& __hf, _Pred&& __pred)
1053 : _M_bad_char{ __patlen, std::move(__hf), std::move(__pred) }
1056 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
1057 _M_bad_char[__pat[__i]] = __patlen - 1 - __i;
1060 using __diff_type = _Tp;
1063 _M_lookup(_Key __key, __diff_type __not_found)
const
1065 auto __iter = _M_bad_char.find(__key);
1066 if (__iter == _M_bad_char.end())
1068 return __iter->second;
1072 _M_pred()
const {
return _M_bad_char.key_eq(); }
1074 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
1077 template<
typename _Tp,
size_t _Len,
typename _Pred>
1078 struct __boyer_moore_array_base
1080 template<
typename _RAIter,
typename _Unused>
1081 __boyer_moore_array_base(_RAIter __pat,
size_t __patlen,
1082 _Unused&&, _Pred&& __pred)
1083 : _M_bad_char{ _GLIBCXX_STD_C::array<_Tp, _Len>{}, std::move(__pred) }
1085 std::get<0>(_M_bad_char).fill(__patlen);
1087 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
1089 auto __ch = __pat[__i];
1090 using _UCh = make_unsigned_t<decltype(__ch)>;
1091 auto __uch =
static_cast<_UCh
>(__ch);
1092 std::get<0>(_M_bad_char)[__uch] = __patlen - 1 - __i;
1096 using __diff_type = _Tp;
1098 template<
typename _Key>
1100 _M_lookup(_Key __key, __diff_type __not_found)
const
1102 auto __ukey =
static_cast<make_unsigned_t<_Key>
>(__key);
1105 return std::get<0>(_M_bad_char)[__ukey];
1109 _M_pred()
const {
return std::get<1>(_M_bad_char); }
1111 tuple<_GLIBCXX_STD_C::array<_Tp, _Len>, _Pred> _M_bad_char;
1116 template<
typename _RAIter,
typename _Hash,
typename _Pred,
1117 typename _Val =
typename iterator_traits<_RAIter>::value_type,
1118 typename _Diff =
typename iterator_traits<_RAIter>::difference_type>
1119 using __boyer_moore_base_t
1120 = conditional_t<__is_byte_like<_Val, _Pred>::value,
1121 __boyer_moore_array_base<_Diff, 256, _Pred>,
1122 __boyer_moore_map_base<_Val, _Diff, _Hash, _Pred>>;
1124 template<
typename _RAIter,
typename _Hash
1125 = hash<typename iterator_traits<_RAIter>::value_type>,
1126 typename _BinaryPredicate = equal_to<>>
1127 class boyer_moore_searcher
1128 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
1130 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
1131 using typename _Base::__diff_type;
1134 boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,
1135 _Hash __hf = _Hash(),
1136 _BinaryPredicate __pred = _BinaryPredicate());
1138 template<
typename _RandomAccessIterator2>
1139 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1140 operator()(_RandomAccessIterator2 __first,
1141 _RandomAccessIterator2 __last)
const;
1145 _M_is_prefix(_RAIter __word, __diff_type __len,
1148 const auto& __pred = this->_M_pred();
1149 __diff_type __suffixlen = __len - __pos;
1150 for (__diff_type __i = 0; __i < __suffixlen; ++__i)
1151 if (!__pred(__word[__i], __word[__pos + __i]))
1157 _M_suffix_length(_RAIter __word, __diff_type __len,
1160 const auto& __pred = this->_M_pred();
1161 __diff_type __i = 0;
1162 while (__pred(__word[__pos - __i], __word[__len - 1 - __i])
1170 template<
typename _Tp>
1172 _M_bad_char_shift(_Tp __c)
const
1173 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
1177 _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;
1180 template<
typename _RAIter,
typename _Hash
1181 = hash<typename iterator_traits<_RAIter>::value_type>,
1182 typename _BinaryPredicate = equal_to<>>
1183 class boyer_moore_horspool_searcher
1184 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
1186 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
1187 using typename _Base::__diff_type;
1190 boyer_moore_horspool_searcher(_RAIter __pat,
1192 _Hash __hf = _Hash(),
1193 _BinaryPredicate __pred
1194 = _BinaryPredicate())
1195 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
1196 _M_pat(__pat), _M_pat_end(__pat_end)
1199 template<
typename _RandomAccessIterator2>
1200 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1201 operator()(_RandomAccessIterator2 __first,
1202 _RandomAccessIterator2 __last)
const
1204 const auto& __pred = this->_M_pred();
1205 auto __patlen = _M_pat_end - _M_pat;
1208 auto __len = __last - __first;
1209 while (__len >= __patlen)
1211 for (
auto __scan = __patlen - 1;
1212 __pred(__first[__scan], _M_pat[__scan]); --__scan)
1215 auto __shift = _M_bad_char_shift(__first[__patlen - 1]);
1223 template<
typename _Tp>
1225 _M_bad_char_shift(_Tp __c)
const
1226 {
return this->_M_lookup(__c, _M_pat_end - _M_pat); }
1232 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
1233 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
1234 boyer_moore_searcher(_RAIter __pat, _RAIter __pat_end,
1235 _Hash __hf, _BinaryPredicate __pred)
1236 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
1237 _M_pat(__pat), _M_pat_end(__pat_end), _M_good_suffix(__pat_end - __pat)
1239 auto __patlen = __pat_end - __pat;
1242 __diff_type __last_prefix = __patlen - 1;
1243 for (__diff_type __p = __patlen - 1; __p >= 0; --__p)
1245 if (_M_is_prefix(__pat, __patlen, __p + 1))
1246 __last_prefix = __p + 1;
1247 _M_good_suffix[__p] = __last_prefix + (__patlen - 1 - __p);
1249 for (__diff_type __p = 0; __p < __patlen - 1; ++__p)
1251 auto __slen = _M_suffix_length(__pat, __patlen, __p);
1252 auto __pos = __patlen - 1 - __slen;
1253 if (!__pred(__pat[__p - __slen], __pat[__pos]))
1254 _M_good_suffix[__pos] = __patlen - 1 - __p + __slen;
1258 template<
typename _RAIter,
typename _Hash,
typename _BinaryPredicate>
1259 template<
typename _RandomAccessIterator2>
1260 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1261 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
1262 operator()(_RandomAccessIterator2 __first,
1263 _RandomAccessIterator2 __last)
const
1265 auto __patlen = _M_pat_end - _M_pat;
1268 const auto& __pred = this->_M_pred();
1269 __diff_type __i = __patlen - 1;
1270 auto __stringlen = __last - __first;
1271 while (__i < __stringlen)
1273 __diff_type __j = __patlen - 1;
1274 while (__j >= 0 && __pred(__first[__i], _M_pat[__j]))
1281 const auto __match = __first + __i + 1;
1284 __i +=
std::max(_M_bad_char_shift(__first[__i]),
1285 _M_good_suffix[__j]);
1293 _GLIBCXX_END_NAMESPACE_VERSION
1298 #endif // _GLIBCXX_FUNCTIONAL
_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
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.
integer_sequence< size_t, _Idx...> index_sequence
Alias template index_sequence.
_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
Determines if the given type _Tp is a function object that should be treated as a subexpression when ...
integral_constant< bool, false > false_type
The type used as a compile-time boolean with false value.
make_index_sequence< sizeof...(_Types)> index_sequence_for
Alias template index_sequence_for.
Primary class template for reference_wrapper.
enable_if< ::__array_traits< _Tp, _Nm >::_Is_swappable::value >::type noexcept(noexcept(__one.swap(__two)))
swap
Define a member typedef type only if a boolean constant is true.
_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
The type of placeholder objects defined by libstdc++.
typename decay< _Tp >::type decay_t
Alias template for decay.
constexpr tuple< _Elements &&...> forward_as_tuple(_Elements &&...__args) noexcept
std::forward_as_tuple
_Bind_helper< __is_socketlike< _Func >::value, _Func, _BoundArgs...>::type bind(_Func &&__f, _BoundArgs &&...__args)
Function template for std::bind.
Type of the function object returned from bind<R>().
integral_constant< bool, true > true_type
The type used as a compile-time boolean with true value.
_ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate)
Search a sequence for a matching sub-sequence using a predicate.
Primary class template, tuple.
Type of the function object returned from bind().
_Mem_fn< _Tp _Class::* > mem_fn(_Tp _Class::*__pm) noexcept
Returns a function object that forwards to the member pointer pm.
Determines if the given type _Tp is a placeholder in a bind() expression and, if so, which placeholder it is.