1// <functional> -*- C++ -*-
3// Copyright (C) 2001-2024 Free Software Foundation, Inc.
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)
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.
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.
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// <http://www.gnu.org/licenses/>.
27 * Silicon Graphics Computer Systems, Inc.
29 * Permission to use, copy, modify, distribute and sell this software
30 * and its documentation for any purpose is hereby granted without fee,
31 * provided that the above copyright notice appear in all copies and
32 * that both that copyright notice and this permission notice appear
33 * in supporting documentation. Silicon Graphics makes no
34 * representations about the suitability of this software for any
35 * purpose. It is provided "as is" without express or implied warranty.
39/** @file include/functional
40 * This is a Standard C++ Library header.
43#ifndef _GLIBCXX_FUNCTIONAL
44#define _GLIBCXX_FUNCTIONAL 1
47#pragma GCC system_header
50#include <bits/c++config.h>
51#include <bits/stl_function.h> // std::equal_to, std::unary_function etc.
53#if __cplusplus >= 201103L
57#include <bits/functional_hash.h>
58#include <bits/invoke.h>
59#include <bits/refwrap.h> // std::reference_wrapper and _Mem_fn_traits
61# include <bits/std_function.h> // std::function
63#if __cplusplus >= 201703L
65# include <unordered_map>
69# include <bits/stl_algobase.h> // std::search
71#if __cplusplus >= 202002L
72# include <bits/ranges_cmp.h> // std::identity, ranges::equal_to etc.
75#if __cplusplus > 202002L && _GLIBCXX_HOSTED
76# include <bits/move_only_function.h>
79#define __glibcxx_want_boyer_moore_searcher
80#define __glibcxx_want_bind_front
81#define __glibcxx_want_bind_back
82#define __glibcxx_want_constexpr_functional
83#define __glibcxx_want_invoke
84#define __glibcxx_want_invoke_r
85#define __glibcxx_want_move_only_function
86#define __glibcxx_want_not_fn
87#define __glibcxx_want_ranges
88#define __glibcxx_want_reference_wrapper
89#define __glibcxx_want_transparent_operators
90#include <bits/version.h>
94namespace std _GLIBCXX_VISIBILITY(default)
96_GLIBCXX_BEGIN_NAMESPACE_VERSION
98 /** @brief The type of placeholder objects defined by libstdc++.
102 template<int _Num> struct _Placeholder { };
104#ifdef __cpp_lib_invoke // C++ >= 17
106 /** Invoke a callable object.
108 * `std::invoke` takes a callable object as its first argument and calls it
109 * with the remaining arguments. The callable object can be a pointer or
110 * reference to a function, a lambda closure, a class with `operator()`,
111 * or even a pointer-to-member. For a pointer-to-member the first argument
112 * must be a reference or pointer to the object that the pointer-to-member
113 * will be applied to.
117 template<typename _Callable, typename... _Args>
118 inline _GLIBCXX20_CONSTEXPR invoke_result_t<_Callable, _Args...>
119 invoke(_Callable&& __fn, _Args&&... __args)
120 noexcept(is_nothrow_invocable_v<_Callable, _Args...>)
122 return std::__invoke(std::forward<_Callable>(__fn),
123 std::forward<_Args>(__args)...);
127#ifdef __cpp_lib_invoke_r // C++ >= 23
129 /** Invoke a callable object and convert the result to `_Res`.
131 * `std::invoke_r<R>(f, args...)` is equivalent to `std::invoke(f, args...)`
132 * with the result implicitly converted to `R`.
136 template<typename _Res, typename _Callable, typename... _Args>
137 requires is_invocable_r_v<_Res, _Callable, _Args...>
139 invoke_r(_Callable&& __fn, _Args&&... __args)
140 noexcept(is_nothrow_invocable_r_v<_Res, _Callable, _Args...>)
142 return std::__invoke_r<_Res>(std::forward<_Callable>(__fn),
143 std::forward<_Args>(__args)...);
145#endif // __cpp_lib_invoke_r
147 /// @cond undocumented
149#if __cplusplus >= 201103L
150 template<typename _MemFunPtr,
151 bool __is_mem_fn = is_member_function_pointer<_MemFunPtr>::value>
153 : public _Mem_fn_traits<_MemFunPtr>::__maybe_type
155 using _Traits = _Mem_fn_traits<_MemFunPtr>;
157 using _Arity = typename _Traits::__arity;
158 using _Varargs = typename _Traits::__vararg;
160 template<typename _Func, typename... _BoundArgs>
161 friend struct _Bind_check_arity;
167 using result_type = typename _Traits::__result_type;
170 _Mem_fn_base(_MemFunPtr __pmf) noexcept : _M_pmf(__pmf) { }
172 template<typename... _Args>
175 operator()(_Args&&... __args) const
177 std::__invoke(_M_pmf, std::forward<_Args>(__args)...)))
178 -> decltype(std::__invoke(_M_pmf, std::forward<_Args>(__args)...))
179 { return std::__invoke(_M_pmf, std::forward<_Args>(__args)...); }
182 // Partial specialization for member object pointers.
183 template<typename _MemObjPtr>
184 class _Mem_fn_base<_MemObjPtr, false>
186 using _Arity = integral_constant<size_t, 0>;
187 using _Varargs = false_type;
189 template<typename _Func, typename... _BoundArgs>
190 friend struct _Bind_check_arity;
196 _Mem_fn_base(_MemObjPtr __pm) noexcept : _M_pm(__pm) { }
198 template<typename _Tp>
201 operator()(_Tp&& __obj) const
202 noexcept(noexcept(std::__invoke(_M_pm, std::forward<_Tp>(__obj))))
203 -> decltype(std::__invoke(_M_pm, std::forward<_Tp>(__obj)))
204 { return std::__invoke(_M_pm, std::forward<_Tp>(__obj)); }
207 template<typename _MemberPointer>
208 struct _Mem_fn; // undefined
210 template<typename _Res, typename _Class>
211 struct _Mem_fn<_Res _Class::*>
212 : _Mem_fn_base<_Res _Class::*>
214 using _Mem_fn_base<_Res _Class::*>::_Mem_fn_base;
218 // _GLIBCXX_RESOLVE_LIB_DEFECTS
219 // 2048. Unnecessary mem_fn overloads
221 * @brief Returns a function object that forwards to the member pointer
224 * This allows a pointer-to-member to be transformed into a function object
225 * that can be called with an object expression as its first argument.
227 * For a pointer-to-data-member the result must be called with exactly one
228 * argument, the object expression that would be used as the first operand
229 * in a `obj.*memptr` or `objp->*memptr` expression.
231 * For a pointer-to-member-function the result must be called with an object
232 * expression and any additional arguments to pass to the member function,
233 * as in an expression like `(obj.*memfun)(args...)` or
234 * `(objp->*memfun)(args...)`.
236 * The object expression can be a pointer, reference, `reference_wrapper`,
237 * or smart pointer, and the call wrapper will dereference it as needed
238 * to apply the pointer-to-member.
243 template<typename _Tp, typename _Class>
245 inline _Mem_fn<_Tp _Class::*>
246 mem_fn(_Tp _Class::* __pm) noexcept
248 return _Mem_fn<_Tp _Class::*>(__pm);
252 * @brief Trait that identifies a bind expression.
254 * Determines if the given type `_Tp` is a function object that
255 * should be treated as a subexpression when evaluating calls to
256 * function objects returned by `std::bind`.
258 * C++11 [func.bind.isbind].
262 template<typename _Tp>
263 struct is_bind_expression
264 : public false_type { };
267 * @brief Determines if the given type _Tp is a placeholder in a
268 * bind() expression and, if so, which placeholder it is.
270 * C++11 [func.bind.isplace].
274 template<typename _Tp>
275 struct is_placeholder
276 : public integral_constant<int, 0>
279#if __cplusplus > 201402L
280 template <typename _Tp> inline constexpr bool is_bind_expression_v
281 = is_bind_expression<_Tp>::value;
282 template <typename _Tp> inline constexpr int is_placeholder_v
283 = is_placeholder<_Tp>::value;
286 /** @namespace std::placeholders
287 * @brief ISO C++ 2011 namespace for std::bind placeholders.
291 namespace placeholders
293 /* Define a large number of placeholders. There is no way to
294 * simplify this with variadic templates, because we're introducing
295 * unique names for each.
297#if __cpp_inline_variables
298# define _GLIBCXX_PLACEHOLDER inline
300# define _GLIBCXX_PLACEHOLDER extern
303 _GLIBCXX_PLACEHOLDER const _Placeholder<1> _1;
304 _GLIBCXX_PLACEHOLDER const _Placeholder<2> _2;
305 _GLIBCXX_PLACEHOLDER const _Placeholder<3> _3;
306 _GLIBCXX_PLACEHOLDER const _Placeholder<4> _4;
307 _GLIBCXX_PLACEHOLDER const _Placeholder<5> _5;
308 _GLIBCXX_PLACEHOLDER const _Placeholder<6> _6;
309 _GLIBCXX_PLACEHOLDER const _Placeholder<7> _7;
310 _GLIBCXX_PLACEHOLDER const _Placeholder<8> _8;
311 _GLIBCXX_PLACEHOLDER const _Placeholder<9> _9;
312 _GLIBCXX_PLACEHOLDER const _Placeholder<10> _10;
313 _GLIBCXX_PLACEHOLDER const _Placeholder<11> _11;
314 _GLIBCXX_PLACEHOLDER const _Placeholder<12> _12;
315 _GLIBCXX_PLACEHOLDER const _Placeholder<13> _13;
316 _GLIBCXX_PLACEHOLDER const _Placeholder<14> _14;
317 _GLIBCXX_PLACEHOLDER const _Placeholder<15> _15;
318 _GLIBCXX_PLACEHOLDER const _Placeholder<16> _16;
319 _GLIBCXX_PLACEHOLDER const _Placeholder<17> _17;
320 _GLIBCXX_PLACEHOLDER const _Placeholder<18> _18;
321 _GLIBCXX_PLACEHOLDER const _Placeholder<19> _19;
322 _GLIBCXX_PLACEHOLDER const _Placeholder<20> _20;
323 _GLIBCXX_PLACEHOLDER const _Placeholder<21> _21;
324 _GLIBCXX_PLACEHOLDER const _Placeholder<22> _22;
325 _GLIBCXX_PLACEHOLDER const _Placeholder<23> _23;
326 _GLIBCXX_PLACEHOLDER const _Placeholder<24> _24;
327 _GLIBCXX_PLACEHOLDER const _Placeholder<25> _25;
328 _GLIBCXX_PLACEHOLDER const _Placeholder<26> _26;
329 _GLIBCXX_PLACEHOLDER const _Placeholder<27> _27;
330 _GLIBCXX_PLACEHOLDER const _Placeholder<28> _28;
331 _GLIBCXX_PLACEHOLDER const _Placeholder<29> _29;
333#undef _GLIBCXX_PLACEHOLDER
337 * Partial specialization of is_placeholder that provides the placeholder
338 * number for the placeholder objects defined by libstdc++.
343 struct is_placeholder<_Placeholder<_Num> >
344 : public integral_constant<int, _Num>
348 struct is_placeholder<const _Placeholder<_Num> >
349 : public integral_constant<int, _Num>
352 /// @cond undocumented
354 // Like tuple_element_t but SFINAE-friendly.
355 template<std::size_t __i, typename _Tuple>
356 using _Safe_tuple_element_t
357 = typename enable_if<(__i < tuple_size<_Tuple>::value),
358 tuple_element<__i, _Tuple>>::type::type;
361 * Maps an argument to bind() into an actual argument to the bound
362 * function object [func.bind.bind]/10. Only the first parameter should
363 * be specified: the rest are used to determine among the various
364 * implementations. Note that, although this class is a function
365 * object, it isn't entirely normal because it takes only two
366 * parameters regardless of the number of parameters passed to the
367 * bind expression. The first parameter is the bound argument and
368 * the second parameter is a tuple containing references to the
369 * rest of the arguments.
371 template<typename _Arg,
372 bool _IsBindExp = is_bind_expression<_Arg>::value,
373 bool _IsPlaceholder = (is_placeholder<_Arg>::value > 0)>
377 * If the argument is reference_wrapper<_Tp>, returns the
378 * underlying reference.
379 * C++11 [func.bind.bind] p10 bullet 1.
381 template<typename _Tp>
382 class _Mu<reference_wrapper<_Tp>, false, false>
385 /* Note: This won't actually work for const volatile
386 * reference_wrappers, because reference_wrapper::get() is const
387 * but not volatile-qualified. This might be a defect in the TR.
389 template<typename _CVRef, typename _Tuple>
392 operator()(_CVRef& __arg, _Tuple&) const volatile
393 { return __arg.get(); }
397 * If the argument is a bind expression, we invoke the underlying
398 * function object with the same cv-qualifiers as we are given and
399 * pass along all of our arguments (unwrapped).
400 * C++11 [func.bind.bind] p10 bullet 2.
402 template<typename _Arg>
403 class _Mu<_Arg, true, false>
406 template<typename _CVArg, typename... _Args>
409 operator()(_CVArg& __arg,
410 tuple<_Args...>& __tuple) const volatile
411 -> decltype(__arg(declval<_Args>()...))
413 // Construct an index tuple and forward to __call
414 typedef typename _Build_index_tuple<sizeof...(_Args)>::__type
416 return this->__call(__arg, __tuple, _Indexes());
420 // Invokes the underlying function object __arg by unpacking all
421 // of the arguments in the tuple.
422 template<typename _CVArg, typename... _Args, std::size_t... _Indexes>
425 __call(_CVArg& __arg, tuple<_Args...>& __tuple,
426 const _Index_tuple<_Indexes...>&) const volatile
427 -> decltype(__arg(declval<_Args>()...))
429 return __arg(std::get<_Indexes>(std::move(__tuple))...);
434 * If the argument is a placeholder for the Nth argument, returns
435 * a reference to the Nth argument to the bind function object.
436 * C++11 [func.bind.bind] p10 bullet 3.
438 template<typename _Arg>
439 class _Mu<_Arg, false, true>
442 template<typename _Tuple>
444 _Safe_tuple_element_t<(is_placeholder<_Arg>::value - 1), _Tuple>&&
445 operator()(const volatile _Arg&, _Tuple& __tuple) const volatile
448 ::std::get<(is_placeholder<_Arg>::value - 1)>(std::move(__tuple));
453 * If the argument is just a value, returns a reference to that
454 * value. The cv-qualifiers on the reference are determined by the caller.
455 * C++11 [func.bind.bind] p10 bullet 4.
457 template<typename _Arg>
458 class _Mu<_Arg, false, false>
461 template<typename _CVArg, typename _Tuple>
464 operator()(_CVArg&& __arg, _Tuple&) const volatile
465 { return std::forward<_CVArg>(__arg); }
468 // std::get<I> for volatile-qualified tuples
469 template<std::size_t _Ind, typename... _Tp>
471 __volget(volatile tuple<_Tp...>& __tuple)
472 -> __tuple_element_t<_Ind, tuple<_Tp...>> volatile&
473 { return std::get<_Ind>(const_cast<tuple<_Tp...>&>(__tuple)); }
475 // std::get<I> for const-volatile-qualified tuples
476 template<std::size_t _Ind, typename... _Tp>
478 __volget(const volatile tuple<_Tp...>& __tuple)
479 -> __tuple_element_t<_Ind, tuple<_Tp...>> const volatile&
480 { return std::get<_Ind>(const_cast<const tuple<_Tp...>&>(__tuple)); }
484#if __cplusplus == 201703L && _GLIBCXX_USE_DEPRECATED
485# define _GLIBCXX_VOLATILE_BIND
486// _GLIBCXX_RESOLVE_LIB_DEFECTS
487// 2487. bind() should be const-overloaded, not cv-overloaded
488# define _GLIBCXX_DEPR_BIND \
489 [[deprecated("std::bind does not support volatile in C++17")]]
490#elif __cplusplus < 201703L
491# define _GLIBCXX_VOLATILE_BIND
492# define _GLIBCXX_DEPR_BIND
495 /// Type of the function object returned from bind().
496 template<typename _Signature>
499 template<typename _Functor, typename... _Bound_args>
500 class _Bind<_Functor(_Bound_args...)>
501 : public _Weak_result_type<_Functor>
503 typedef typename _Build_index_tuple<sizeof...(_Bound_args)>::__type
507 tuple<_Bound_args...> _M_bound_args;
510 template<typename _Result, typename... _Args, std::size_t... _Indexes>
513 __call(tuple<_Args...>&& __args, _Index_tuple<_Indexes...>)
515 return std::__invoke(_M_f,
516 _Mu<_Bound_args>()(std::get<_Indexes>(_M_bound_args), __args)...
521 template<typename _Result, typename... _Args, std::size_t... _Indexes>
524 __call_c(tuple<_Args...>&& __args, _Index_tuple<_Indexes...>) const
526 return std::__invoke(_M_f,
527 _Mu<_Bound_args>()(std::get<_Indexes>(_M_bound_args), __args)...
531#ifdef _GLIBCXX_VOLATILE_BIND
533 template<typename _Result, typename... _Args, std::size_t... _Indexes>
535 __call_v(tuple<_Args...>&& __args,
536 _Index_tuple<_Indexes...>) volatile
538 return std::__invoke(_M_f,
539 _Mu<_Bound_args>()(__volget<_Indexes>(_M_bound_args), __args)...
543 // Call as const volatile
544 template<typename _Result, typename... _Args, std::size_t... _Indexes>
546 __call_c_v(tuple<_Args...>&& __args,
547 _Index_tuple<_Indexes...>) const volatile
549 return std::__invoke(_M_f,
550 _Mu<_Bound_args>()(__volget<_Indexes>(_M_bound_args), __args)...
555 template<typename _BoundArg, typename _CallArgs>
556 using _Mu_type = decltype(
557 _Mu<typename remove_cv<_BoundArg>::type>()(
558 std::declval<_BoundArg&>(), std::declval<_CallArgs&>()) );
560 template<typename _Fn, typename _CallArgs, typename... _BArgs>
562 = __invoke_result_t<_Fn&, _Mu_type<_BArgs, _CallArgs>&&...>;
564 template<typename _CallArgs>
565 using _Res_type = _Res_type_impl<_Functor, _CallArgs, _Bound_args...>;
567 template<typename _CallArgs>
568 using __dependent = typename
569 enable_if<bool(tuple_size<_CallArgs>::value+1), _Functor>::type;
571 template<typename _CallArgs, template<class> class __cv_quals>
572 using _Res_type_cv = _Res_type_impl<
573 typename __cv_quals<__dependent<_CallArgs>>::type,
575 typename __cv_quals<_Bound_args>::type...>;
578 template<typename... _Args>
579 explicit _GLIBCXX20_CONSTEXPR
580 _Bind(const _Functor& __f, _Args&&... __args)
581 : _M_f(__f), _M_bound_args(std::forward<_Args>(__args)...)
584 template<typename... _Args>
585 explicit _GLIBCXX20_CONSTEXPR
586 _Bind(_Functor&& __f, _Args&&... __args)
587 : _M_f(std::move(__f)), _M_bound_args(std::forward<_Args>(__args)...)
590 _Bind(const _Bind&) = default;
591 _Bind(_Bind&&) = default;
594 template<typename... _Args,
595 typename _Result = _Res_type<tuple<_Args...>>>
598 operator()(_Args&&... __args)
600 return this->__call<_Result>(
601 std::forward_as_tuple(std::forward<_Args>(__args)...),
606 template<typename... _Args,
607 typename _Result = _Res_type_cv<tuple<_Args...>, add_const>>
610 operator()(_Args&&... __args) const
612 return this->__call_c<_Result>(
613 std::forward_as_tuple(std::forward<_Args>(__args)...),
617#ifdef _GLIBCXX_VOLATILE_BIND
619 template<typename... _Args,
620 typename _Result = _Res_type_cv<tuple<_Args...>, add_volatile>>
623 operator()(_Args&&... __args) volatile
625 return this->__call_v<_Result>(
626 std::forward_as_tuple(std::forward<_Args>(__args)...),
630 // Call as const volatile
631 template<typename... _Args,
632 typename _Result = _Res_type_cv<tuple<_Args...>, add_cv>>
635 operator()(_Args&&... __args) const volatile
637 return this->__call_c_v<_Result>(
638 std::forward_as_tuple(std::forward<_Args>(__args)...),
644 /// Type of the function object returned from bind<R>().
645 template<typename _Result, typename _Signature>
648 template<typename _Result, typename _Functor, typename... _Bound_args>
649 class _Bind_result<_Result, _Functor(_Bound_args...)>
651 typedef typename _Build_index_tuple<sizeof...(_Bound_args)>::__type
655 tuple<_Bound_args...> _M_bound_args;
658 template<typename _Res, typename... _Args, std::size_t... _Indexes>
661 __call(tuple<_Args...>&& __args, _Index_tuple<_Indexes...>)
663 return std::__invoke_r<_Res>(_M_f, _Mu<_Bound_args>()
664 (std::get<_Indexes>(_M_bound_args), __args)...);
668 template<typename _Res, typename... _Args, std::size_t... _Indexes>
671 __call(tuple<_Args...>&& __args, _Index_tuple<_Indexes...>) const
673 return std::__invoke_r<_Res>(_M_f, _Mu<_Bound_args>()
674 (std::get<_Indexes>(_M_bound_args), __args)...);
677#ifdef _GLIBCXX_VOLATILE_BIND
679 template<typename _Res, typename... _Args, std::size_t... _Indexes>
681 __call(tuple<_Args...>&& __args, _Index_tuple<_Indexes...>) volatile
683 return std::__invoke_r<_Res>(_M_f, _Mu<_Bound_args>()
684 (__volget<_Indexes>(_M_bound_args), __args)...);
687 // Call as const volatile
688 template<typename _Res, typename... _Args, std::size_t... _Indexes>
690 __call(tuple<_Args...>&& __args,
691 _Index_tuple<_Indexes...>) const volatile
693 return std::__invoke_r<_Res>(_M_f, _Mu<_Bound_args>()
694 (__volget<_Indexes>(_M_bound_args), __args)...);
699 typedef _Result result_type;
701 template<typename... _Args>
702 explicit _GLIBCXX20_CONSTEXPR
703 _Bind_result(const _Functor& __f, _Args&&... __args)
704 : _M_f(__f), _M_bound_args(std::forward<_Args>(__args)...)
707 template<typename... _Args>
708 explicit _GLIBCXX20_CONSTEXPR
709 _Bind_result(_Functor&& __f, _Args&&... __args)
710 : _M_f(std::move(__f)), _M_bound_args(std::forward<_Args>(__args)...)
713 _Bind_result(const _Bind_result&) = default;
714 _Bind_result(_Bind_result&&) = default;
717 template<typename... _Args>
720 operator()(_Args&&... __args)
722 return this->__call<_Result>(
723 std::forward_as_tuple(std::forward<_Args>(__args)...),
728 template<typename... _Args>
731 operator()(_Args&&... __args) const
733 return this->__call<_Result>(
734 std::forward_as_tuple(std::forward<_Args>(__args)...),
738#ifdef _GLIBCXX_VOLATILE_BIND
740 template<typename... _Args>
743 operator()(_Args&&... __args) volatile
745 return this->__call<_Result>(
746 std::forward_as_tuple(std::forward<_Args>(__args)...),
750 // Call as const volatile
751 template<typename... _Args>
754 operator()(_Args&&... __args) const volatile
756 return this->__call<_Result>(
757 std::forward_as_tuple(std::forward<_Args>(__args)...),
761 template<typename... _Args>
762 void operator()(_Args&&...) const volatile = delete;
766#undef _GLIBCXX_VOLATILE_BIND
767#undef _GLIBCXX_DEPR_BIND
770 * @brief Class template _Bind is always a bind expression.
773 template<typename _Signature>
774 struct is_bind_expression<_Bind<_Signature> >
775 : public true_type { };
778 * @brief Class template _Bind is always a bind expression.
781 template<typename _Signature>
782 struct is_bind_expression<const _Bind<_Signature> >
783 : public true_type { };
786 * @brief Class template _Bind is always a bind expression.
789 template<typename _Signature>
790 struct is_bind_expression<volatile _Bind<_Signature> >
791 : public true_type { };
794 * @brief Class template _Bind is always a bind expression.
797 template<typename _Signature>
798 struct is_bind_expression<const volatile _Bind<_Signature>>
799 : public true_type { };
802 * @brief Class template _Bind_result is always a bind expression.
805 template<typename _Result, typename _Signature>
806 struct is_bind_expression<_Bind_result<_Result, _Signature>>
807 : public true_type { };
810 * @brief Class template _Bind_result is always a bind expression.
813 template<typename _Result, typename _Signature>
814 struct is_bind_expression<const _Bind_result<_Result, _Signature>>
815 : public true_type { };
818 * @brief Class template _Bind_result is always a bind expression.
821 template<typename _Result, typename _Signature>
822 struct is_bind_expression<volatile _Bind_result<_Result, _Signature>>
823 : public true_type { };
826 * @brief Class template _Bind_result is always a bind expression.
829 template<typename _Result, typename _Signature>
830 struct is_bind_expression<const volatile _Bind_result<_Result, _Signature>>
831 : public true_type { };
833 template<typename _Func, typename... _BoundArgs>
834 struct _Bind_check_arity { };
836 template<typename _Ret, typename... _Args, typename... _BoundArgs>
837 struct _Bind_check_arity<_Ret (*)(_Args...), _BoundArgs...>
839 static_assert(sizeof...(_BoundArgs) == sizeof...(_Args),
840 "Wrong number of arguments for function");
843 template<typename _Ret, typename... _Args, typename... _BoundArgs>
844 struct _Bind_check_arity<_Ret (*)(_Args..., ...), _BoundArgs...>
846 static_assert(sizeof...(_BoundArgs) >= sizeof...(_Args),
847 "Wrong number of arguments for function");
850 template<typename _Tp, typename _Class, typename... _BoundArgs>
851 struct _Bind_check_arity<_Tp _Class::*, _BoundArgs...>
853 using _Arity = typename _Mem_fn<_Tp _Class::*>::_Arity;
854 using _Varargs = typename _Mem_fn<_Tp _Class::*>::_Varargs;
855 static_assert(_Varargs::value
856 ? sizeof...(_BoundArgs) >= _Arity::value + 1
857 : sizeof...(_BoundArgs) == _Arity::value + 1,
858 "Wrong number of arguments for pointer-to-member");
861 // Trait type used to remove std::bind() from overload set via SFINAE
862 // when first argument has integer type, so that std::bind() will
863 // not be a better match than ::bind() from the BSD Sockets API.
864 template<typename _Tp, typename _Tp2 = typename decay<_Tp>::type>
865 using __is_socketlike = __or_<is_integral<_Tp2>, is_enum<_Tp2>>;
867 template<bool _SocketLike, typename _Func, typename... _BoundArgs>
869 : _Bind_check_arity<typename decay<_Func>::type, _BoundArgs...>
871 typedef typename decay<_Func>::type __func_type;
872 typedef _Bind<__func_type(typename decay<_BoundArgs>::type...)> type;
875 // Partial specialization for is_socketlike == true, does not define
876 // nested type so std::bind() will not participate in overload resolution
877 // when the first argument might be a socket file descriptor.
878 template<typename _Func, typename... _BoundArgs>
879 struct _Bind_helper<true, _Func, _BoundArgs...>
883 * @brief Function template for std::bind.
887 template<typename _Func, typename... _BoundArgs>
888 inline _GLIBCXX20_CONSTEXPR typename
889 _Bind_helper<__is_socketlike<_Func>::value, _Func, _BoundArgs...>::type
890 bind(_Func&& __f, _BoundArgs&&... __args)
892 typedef _Bind_helper<false, _Func, _BoundArgs...> __helper_type;
893 return typename __helper_type::type(std::forward<_Func>(__f),
894 std::forward<_BoundArgs>(__args)...);
897 template<typename _Result, typename _Func, typename... _BoundArgs>
898 struct _Bindres_helper
899 : _Bind_check_arity<typename decay<_Func>::type, _BoundArgs...>
901 typedef typename decay<_Func>::type __functor_type;
902 typedef _Bind_result<_Result,
903 __functor_type(typename decay<_BoundArgs>::type...)>
908 * @brief Function template for std::bind<R>.
912 template<typename _Result, typename _Func, typename... _BoundArgs>
913 inline _GLIBCXX20_CONSTEXPR
914 typename _Bindres_helper<_Result, _Func, _BoundArgs...>::type
915 bind(_Func&& __f, _BoundArgs&&... __args)
917 typedef _Bindres_helper<_Result, _Func, _BoundArgs...> __helper_type;
918 return typename __helper_type::type(std::forward<_Func>(__f),
919 std::forward<_BoundArgs>(__args)...);
922#ifdef __cpp_lib_bind_front // C++ >= 20
924 template<typename _Fd, typename... _BoundArgs>
927 static_assert(is_move_constructible_v<_Fd>);
928 static_assert((is_move_constructible_v<_BoundArgs> && ...));
930 // First parameter is to ensure this constructor is never used
931 // instead of the copy/move constructor.
932 template<typename _Fn, typename... _Args>
934 _Bind_front(int, _Fn&& __fn, _Args&&... __args)
935 noexcept(__and_<is_nothrow_constructible<_Fd, _Fn>,
936 is_nothrow_constructible<_BoundArgs, _Args>...>::value)
937 : _M_fd(std::forward<_Fn>(__fn)),
938 _M_bound_args(std::forward<_Args>(__args)...)
939 { static_assert(sizeof...(_Args) == sizeof...(_BoundArgs)); }
941#if __cpp_explicit_this_parameter
942 template<typename _Self, typename... _CallArgs>
944 invoke_result_t<__like_t<_Self, _Fd>, __like_t<_Self, _BoundArgs>..., _CallArgs...>
945 operator()(this _Self&& __self, _CallArgs&&... __call_args)
946 noexcept(is_nothrow_invocable_v<__like_t<_Self, _Fd>,
947 __like_t<_Self, _BoundArgs>..., _CallArgs...>)
949 return _S_call(__like_t<_Self, _Bind_front>(__self), _BoundIndices(),
950 std::forward<_CallArgs>(__call_args)...);
953 template<typename... _CallArgs>
956 invoke_result_t<_Fd&, _BoundArgs&..., _CallArgs...>
957 operator()(_CallArgs&&... __call_args) &
958 noexcept(is_nothrow_invocable_v<_Fd&, _BoundArgs&..., _CallArgs...>)
960 return _S_call(*this, _BoundIndices(),
961 std::forward<_CallArgs>(__call_args)...);
964 template<typename... _CallArgs>
967 invoke_result_t<const _Fd&, const _BoundArgs&..., _CallArgs...>
968 operator()(_CallArgs&&... __call_args) const &
969 noexcept(is_nothrow_invocable_v<const _Fd&, const _BoundArgs&...,
972 return _S_call(*this, _BoundIndices(),
973 std::forward<_CallArgs>(__call_args)...);
976 template<typename... _CallArgs>
979 invoke_result_t<_Fd, _BoundArgs..., _CallArgs...>
980 operator()(_CallArgs&&... __call_args) &&
981 noexcept(is_nothrow_invocable_v<_Fd, _BoundArgs..., _CallArgs...>)
983 return _S_call(std::move(*this), _BoundIndices(),
984 std::forward<_CallArgs>(__call_args)...);
987 template<typename... _CallArgs>
990 invoke_result_t<const _Fd, const _BoundArgs..., _CallArgs...>
991 operator()(_CallArgs&&... __call_args) const &&
992 noexcept(is_nothrow_invocable_v<const _Fd, const _BoundArgs...,
995 return _S_call(std::move(*this), _BoundIndices(),
996 std::forward<_CallArgs>(__call_args)...);
999 template<typename... _CallArgs>
1000 void operator()(_CallArgs&&...) & = delete;
1002 template<typename... _CallArgs>
1003 void operator()(_CallArgs&&...) const & = delete;
1005 template<typename... _CallArgs>
1006 void operator()(_CallArgs&&...) && = delete;
1008 template<typename... _CallArgs>
1009 void operator()(_CallArgs&&...) const && = delete;
1013 using _BoundIndices = index_sequence_for<_BoundArgs...>;
1015 template<typename _Tp, size_t... _Ind, typename... _CallArgs>
1018 _S_call(_Tp&& __g, index_sequence<_Ind...>, _CallArgs&&... __call_args)
1020 return std::invoke(std::forward<_Tp>(__g)._M_fd,
1021 std::get<_Ind>(std::forward<_Tp>(__g)._M_bound_args)...,
1022 std::forward<_CallArgs>(__call_args)...);
1025 [[no_unique_address]] _Fd _M_fd;
1026 [[no_unique_address]] std::tuple<_BoundArgs...> _M_bound_args;
1029 template<typename _Fn, typename... _Args>
1030 using _Bind_front_t = _Bind_front<decay_t<_Fn>, decay_t<_Args>...>;
1032 /** Create call wrapper by partial application of arguments to function.
1034 * The result of `std::bind_front(f, args...)` is a function object that
1035 * stores `f` and the bound arguments, `args...`. When that function
1036 * object is invoked with `call_args...` it returns the result of calling
1037 * `f(args..., call_args...)`.
1041 template<typename _Fn, typename... _Args>
1042 constexpr _Bind_front_t<_Fn, _Args...>
1043 bind_front(_Fn&& __fn, _Args&&... __args)
1044 noexcept(is_nothrow_constructible_v<_Bind_front_t<_Fn, _Args...>,
1045 int, _Fn, _Args...>)
1047 return _Bind_front_t<_Fn, _Args...>(0, std::forward<_Fn>(__fn),
1048 std::forward<_Args>(__args)...);
1050#endif // __cpp_lib_bind_front
1052#ifdef __cpp_lib_bind_back // C++ >= 23
1053 template<typename _Fd, typename... _BoundArgs>
1056 static_assert(is_move_constructible_v<_Fd>);
1057 static_assert((is_move_constructible_v<_BoundArgs> && ...));
1059 // First parameter is to ensure this constructor is never used
1060 // instead of the copy/move constructor.
1061 template<typename _Fn, typename... _Args>
1063 _Bind_back(int, _Fn&& __fn, _Args&&... __args)
1064 noexcept(__and_<is_nothrow_constructible<_Fd, _Fn>,
1065 is_nothrow_constructible<_BoundArgs, _Args>...>::value)
1066 : _M_fd(std::forward<_Fn>(__fn)),
1067 _M_bound_args(std::forward<_Args>(__args)...)
1068 { static_assert(sizeof...(_Args) == sizeof...(_BoundArgs)); }
1070 template<typename _Self, typename... _CallArgs>
1072 invoke_result_t<__like_t<_Self, _Fd>, _CallArgs..., __like_t<_Self, _BoundArgs>...>
1073 operator()(this _Self&& __self, _CallArgs&&... __call_args)
1074 noexcept(is_nothrow_invocable_v<__like_t<_Self, _Fd>,
1075 _CallArgs..., __like_t<_Self, _BoundArgs>...>)
1077 return _S_call(__like_t<_Self, _Bind_back>(__self), _BoundIndices(),
1078 std::forward<_CallArgs>(__call_args)...);
1082 using _BoundIndices = index_sequence_for<_BoundArgs...>;
1084 template<typename _Tp, size_t... _Ind, typename... _CallArgs>
1087 _S_call(_Tp&& __g, index_sequence<_Ind...>, _CallArgs&&... __call_args)
1089 return std::invoke(std::forward<_Tp>(__g)._M_fd,
1090 std::forward<_CallArgs>(__call_args)...,
1091 std::get<_Ind>(std::forward<_Tp>(__g)._M_bound_args)...);
1094 [[no_unique_address]] _Fd _M_fd;
1095 [[no_unique_address]] std::tuple<_BoundArgs...> _M_bound_args;
1098 template<typename _Fn, typename... _Args>
1099 using _Bind_back_t = _Bind_back<decay_t<_Fn>, decay_t<_Args>...>;
1101 /** Create call wrapper by partial application of arguments to function.
1103 * The result of `std::bind_back(f, args...)` is a function object that
1104 * stores `f` and the bound arguments, `args...`. When that function
1105 * object is invoked with `call_args...` it returns the result of calling
1106 * `f(call_args..., args...)`.
1110 template<typename _Fn, typename... _Args>
1111 constexpr _Bind_back_t<_Fn, _Args...>
1112 bind_back(_Fn&& __fn, _Args&&... __args)
1113 noexcept(is_nothrow_constructible_v<_Bind_back_t<_Fn, _Args...>,
1114 int, _Fn, _Args...>)
1116 return _Bind_back_t<_Fn, _Args...>(0, std::forward<_Fn>(__fn),
1117 std::forward<_Args>(__args)...);
1119#endif // __cpp_lib_bind_back
1121#if __cplusplus >= 201402L
1122 /// Generalized negator.
1123 template<typename _Fn>
1126 template<typename _Fn2, typename... _Args>
1127 using __inv_res_t = typename __invoke_result<_Fn2, _Args...>::type;
1129 template<typename _Tp>
1130 static decltype(!std::declval<_Tp>())
1131 _S_not() noexcept(noexcept(!std::declval<_Tp>()));
1134 template<typename _Fn2>
1136 _Not_fn(_Fn2&& __fn, int)
1137 : _M_fn(std::forward<_Fn2>(__fn)) { }
1139 _Not_fn(const _Not_fn& __fn) = default;
1140 _Not_fn(_Not_fn&& __fn) = default;
1141 ~_Not_fn() = default;
1143 // Macro to define operator() with given cv-qualifiers ref-qualifiers,
1144 // forwarding _M_fn and the function arguments with the same qualifiers,
1145 // and deducing the return type and exception-specification.
1146#define _GLIBCXX_NOT_FN_CALL_OP( _QUALS ) \
1147 template<typename... _Args, \
1148 typename = enable_if_t<__is_invocable<_Fn _QUALS, _Args...>::value>> \
1149 _GLIBCXX20_CONSTEXPR \
1150 decltype(_S_not<__inv_res_t<_Fn _QUALS, _Args...>>()) \
1151 operator()(_Args&&... __args) _QUALS \
1152 noexcept(__is_nothrow_invocable<_Fn _QUALS, _Args...>::value \
1153 && noexcept(_S_not<__inv_res_t<_Fn _QUALS, _Args...>>())) \
1155 return !std::__invoke(std::forward< _Fn _QUALS >(_M_fn), \
1156 std::forward<_Args>(__args)...); \
1159 template<typename... _Args, \
1160 typename = enable_if_t<!__is_invocable<_Fn _QUALS, _Args...>::value>> \
1161 void operator()(_Args&&... __args) _QUALS = delete;
1163 _GLIBCXX_NOT_FN_CALL_OP( & )
1164 _GLIBCXX_NOT_FN_CALL_OP( const & )
1165 _GLIBCXX_NOT_FN_CALL_OP( && )
1166 _GLIBCXX_NOT_FN_CALL_OP( const && )
1167#undef _GLIBCXX_NOT_FN_CALL_OP
1173 template<typename _Tp, typename _Pred>
1174 struct __is_byte_like : false_type { };
1176 template<typename _Tp>
1177 struct __is_byte_like<_Tp, equal_to<_Tp>>
1178 : __bool_constant<sizeof(_Tp) == 1 && is_integral<_Tp>::value> { };
1180 template<typename _Tp>
1181 struct __is_byte_like<_Tp, equal_to<void>>
1182 : __bool_constant<sizeof(_Tp) == 1 && is_integral<_Tp>::value> { };
1184#if __cplusplus >= 201703L
1185 // Declare std::byte (full definition is in <cstddef>).
1186 enum class byte : unsigned char;
1189 struct __is_byte_like<byte, equal_to<byte>>
1193 struct __is_byte_like<byte, equal_to<void>>
1197 // [func.not_fn] Function template not_fn
1198#ifdef __cpp_lib_not_fn // C++ >= 17
1199 /** Wrap a function object to create one that negates its result.
1201 * The function template `std::not_fn` creates a "forwarding call wrapper",
1202 * which is a function object that wraps another function object and
1203 * when called, forwards its arguments to the wrapped function object.
1205 * The result of invoking the wrapper is the negation (using `!`) of
1206 * the wrapped function object.
1211 template<typename _Fn>
1212 _GLIBCXX20_CONSTEXPR
1215 noexcept(std::is_nothrow_constructible<std::decay_t<_Fn>, _Fn&&>::value)
1217 return _Not_fn<std::decay_t<_Fn>>{std::forward<_Fn>(__fn), 0};
1221#if __cplusplus >= 201703L
1224 template<typename _ForwardIterator1, typename _BinaryPredicate = equal_to<>>
1225 class default_searcher
1228 _GLIBCXX20_CONSTEXPR
1229 default_searcher(_ForwardIterator1 __pat_first,
1230 _ForwardIterator1 __pat_last,
1231 _BinaryPredicate __pred = _BinaryPredicate())
1232 : _M_m(__pat_first, __pat_last, std::move(__pred))
1235 template<typename _ForwardIterator2>
1236 _GLIBCXX20_CONSTEXPR
1237 pair<_ForwardIterator2, _ForwardIterator2>
1238 operator()(_ForwardIterator2 __first, _ForwardIterator2 __last) const
1240 _ForwardIterator2 __first_ret =
1241 std::search(__first, __last, std::get<0>(_M_m), std::get<1>(_M_m),
1243 auto __ret = std::make_pair(__first_ret, __first_ret);
1244 if (__ret.first != __last)
1245 std::advance(__ret.second, std::distance(std::get<0>(_M_m),
1246 std::get<1>(_M_m)));
1251 tuple<_ForwardIterator1, _ForwardIterator1, _BinaryPredicate> _M_m;
1254#ifdef __cpp_lib_boyer_moore_searcher // C++ >= 17 && HOSTED
1256 template<typename _Key, typename _Tp, typename _Hash, typename _Pred>
1257 struct __boyer_moore_map_base
1259 template<typename _RAIter>
1260 __boyer_moore_map_base(_RAIter __pat, size_t __patlen,
1261 _Hash&& __hf, _Pred&& __pred)
1262 : _M_bad_char{ __patlen, std::move(__hf), std::move(__pred) }
1265 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
1266 _M_bad_char[__pat[__i]] = __patlen - 1 - __i;
1269 using __diff_type = _Tp;
1272 _M_lookup(_Key __key, __diff_type __not_found) const
1274 auto __iter = _M_bad_char.find(__key);
1275 if (__iter == _M_bad_char.end())
1277 return __iter->second;
1281 _M_pred() const { return _M_bad_char.key_eq(); }
1283 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _Pred> _M_bad_char;
1286 template<typename _Tp, size_t _Len, typename _Pred>
1287 struct __boyer_moore_array_base
1289 template<typename _RAIter, typename _Unused>
1290 __boyer_moore_array_base(_RAIter __pat, size_t __patlen,
1291 _Unused&&, _Pred&& __pred)
1292 : _M_bad_char{ array<_Tp, _Len>{}, std::move(__pred) }
1294 std::get<0>(_M_bad_char).fill(__patlen);
1296 for (__diff_type __i = 0; __i < __patlen - 1; ++__i)
1298 auto __ch = __pat[__i];
1299 using _UCh = make_unsigned_t<decltype(__ch)>;
1300 auto __uch = static_cast<_UCh>(__ch);
1301 std::get<0>(_M_bad_char)[__uch] = __patlen - 1 - __i;
1305 using __diff_type = _Tp;
1307 template<typename _Key>
1309 _M_lookup(_Key __key, __diff_type __not_found) const
1311 auto __ukey = static_cast<make_unsigned_t<_Key>>(__key);
1314 return std::get<0>(_M_bad_char)[__ukey];
1318 _M_pred() const { return std::get<1>(_M_bad_char); }
1320 tuple<array<_Tp, _Len>, _Pred> _M_bad_char;
1323 // Use __boyer_moore_array_base when pattern consists of narrow characters
1324 // (or std::byte) and uses std::equal_to as the predicate.
1325 template<typename _RAIter, typename _Hash, typename _Pred,
1326 typename _Val = typename iterator_traits<_RAIter>::value_type,
1327 typename _Diff = typename iterator_traits<_RAIter>::difference_type>
1328 using __boyer_moore_base_t
1329 = __conditional_t<__is_byte_like<_Val, _Pred>::value,
1330 __boyer_moore_array_base<_Diff, 256, _Pred>,
1331 __boyer_moore_map_base<_Val, _Diff, _Hash, _Pred>>;
1333 template<typename _RAIter, typename _Hash
1334 = hash<typename iterator_traits<_RAIter>::value_type>,
1335 typename _BinaryPredicate = equal_to<>>
1336 class boyer_moore_searcher
1337 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
1339 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
1340 using typename _Base::__diff_type;
1343 boyer_moore_searcher(_RAIter __pat_first, _RAIter __pat_last,
1344 _Hash __hf = _Hash(),
1345 _BinaryPredicate __pred = _BinaryPredicate());
1347 template<typename _RandomAccessIterator2>
1348 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1349 operator()(_RandomAccessIterator2 __first,
1350 _RandomAccessIterator2 __last) const;
1354 _M_is_prefix(_RAIter __word, __diff_type __len,
1357 const auto& __pred = this->_M_pred();
1358 __diff_type __suffixlen = __len - __pos;
1359 for (__diff_type __i = 0; __i < __suffixlen; ++__i)
1360 if (!__pred(__word[__i], __word[__pos + __i]))
1366 _M_suffix_length(_RAIter __word, __diff_type __len,
1369 const auto& __pred = this->_M_pred();
1370 __diff_type __i = 0;
1371 while (__pred(__word[__pos - __i], __word[__len - 1 - __i])
1379 template<typename _Tp>
1381 _M_bad_char_shift(_Tp __c) const
1382 { return this->_M_lookup(__c, _M_pat_end - _M_pat); }
1386 _GLIBCXX_STD_C::vector<__diff_type> _M_good_suffix;
1389 template<typename _RAIter, typename _Hash
1390 = hash<typename iterator_traits<_RAIter>::value_type>,
1391 typename _BinaryPredicate = equal_to<>>
1392 class boyer_moore_horspool_searcher
1393 : __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>
1395 using _Base = __boyer_moore_base_t<_RAIter, _Hash, _BinaryPredicate>;
1396 using typename _Base::__diff_type;
1399 boyer_moore_horspool_searcher(_RAIter __pat,
1401 _Hash __hf = _Hash(),
1402 _BinaryPredicate __pred
1403 = _BinaryPredicate())
1404 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
1405 _M_pat(__pat), _M_pat_end(__pat_end)
1408 template<typename _RandomAccessIterator2>
1409 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1410 operator()(_RandomAccessIterator2 __first,
1411 _RandomAccessIterator2 __last) const
1413 const auto& __pred = this->_M_pred();
1414 auto __patlen = _M_pat_end - _M_pat;
1416 return std::make_pair(__first, __first);
1417 auto __len = __last - __first;
1418 while (__len >= __patlen)
1420 for (auto __scan = __patlen - 1;
1421 __pred(__first[__scan], _M_pat[__scan]); --__scan)
1423 return std::make_pair(__first, __first + __patlen);
1424 auto __shift = _M_bad_char_shift(__first[__patlen - 1]);
1428 return std::make_pair(__last, __last);
1432 template<typename _Tp>
1434 _M_bad_char_shift(_Tp __c) const
1435 { return this->_M_lookup(__c, _M_pat_end - _M_pat); }
1441 template<typename _RAIter, typename _Hash, typename _BinaryPredicate>
1442 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
1443 boyer_moore_searcher(_RAIter __pat, _RAIter __pat_end,
1444 _Hash __hf, _BinaryPredicate __pred)
1445 : _Base(__pat, __pat_end - __pat, std::move(__hf), std::move(__pred)),
1446 _M_pat(__pat), _M_pat_end(__pat_end), _M_good_suffix(__pat_end - __pat)
1448 auto __patlen = __pat_end - __pat;
1451 __diff_type __last_prefix = __patlen - 1;
1452 for (__diff_type __p = __patlen - 1; __p >= 0; --__p)
1454 if (_M_is_prefix(__pat, __patlen, __p + 1))
1455 __last_prefix = __p + 1;
1456 _M_good_suffix[__p] = __last_prefix + (__patlen - 1 - __p);
1458 for (__diff_type __p = 0; __p < __patlen - 1; ++__p)
1460 auto __slen = _M_suffix_length(__pat, __patlen, __p);
1461 auto __pos = __patlen - 1 - __slen;
1462 if (!__pred(__pat[__p - __slen], __pat[__pos]))
1463 _M_good_suffix[__pos] = __patlen - 1 - __p + __slen;
1467 template<typename _RAIter, typename _Hash, typename _BinaryPredicate>
1468 template<typename _RandomAccessIterator2>
1469 pair<_RandomAccessIterator2, _RandomAccessIterator2>
1470 boyer_moore_searcher<_RAIter, _Hash, _BinaryPredicate>::
1471 operator()(_RandomAccessIterator2 __first,
1472 _RandomAccessIterator2 __last) const
1474 auto __patlen = _M_pat_end - _M_pat;
1476 return std::make_pair(__first, __first);
1477 const auto& __pred = this->_M_pred();
1478 __diff_type __i = __patlen - 1;
1479 auto __stringlen = __last - __first;
1480 while (__i < __stringlen)
1482 __diff_type __j = __patlen - 1;
1483 while (__j >= 0 && __pred(__first[__i], _M_pat[__j]))
1490 const auto __match = __first + __i + 1;
1491 return std::make_pair(__match, __match + __patlen);
1493 __i += std::max(_M_bad_char_shift(__first[__i]),
1494 _M_good_suffix[__j]);
1496 return std::make_pair(__last, __last);
1498#endif // __cpp_lib_boyer_moore_searcher
1504_GLIBCXX_END_NAMESPACE_VERSION
1507#endif // _GLIBCXX_FUNCTIONAL