1 // -*- C++ -*- 2 //===------------------------ functional ----------------------------------===// 3 // 4 // The LLVM Compiler Infrastructure 5 // 6 // This file is dual licensed under the MIT and the University of Illinois Open 7 // Source Licenses. See LICENSE.TXT for details. 8 // 9 //===----------------------------------------------------------------------===// 10 11 #ifndef _LIBCPP_FUNCTIONAL 12 #define _LIBCPP_FUNCTIONAL 13 14 /* 15 functional synopsis 16 17 namespace std 18 { 19 20 template <class Arg, class Result> 21 struct unary_function 22 { 23 typedef Arg argument_type; 24 typedef Result result_type; 25 }; 26 27 template <class Arg1, class Arg2, class Result> 28 struct binary_function 29 { 30 typedef Arg1 first_argument_type; 31 typedef Arg2 second_argument_type; 32 typedef Result result_type; 33 }; 34 35 template <class T> 36 class reference_wrapper 37 : public unary_function<T1, R> // if wrapping a unary functor 38 : public binary_function<T1, T2, R> // if wraping a binary functor 39 { 40 public: 41 // types 42 typedef T type; 43 typedef see below result_type; // Not always defined 44 45 // construct/copy/destroy 46 reference_wrapper(T&) noexcept; 47 reference_wrapper(T&&) = delete; // do not bind to temps 48 reference_wrapper(const reference_wrapper<T>& x) noexcept; 49 50 // assignment 51 reference_wrapper& operator=(const reference_wrapper<T>& x) noexcept; 52 53 // access 54 operator T& () const noexcept; 55 T& get() const noexcept; 56 57 // invoke 58 template <class... ArgTypes> 59 typename result_of<T&(ArgTypes&&...)>::type 60 operator() (ArgTypes&&...) const; 61 }; 62 63 template <class T> reference_wrapper<T> ref(T& t) noexcept; 64 template <class T> void ref(const T&& t) = delete; 65 template <class T> reference_wrapper<T> ref(reference_wrapper<T>t) noexcept; 66 67 template <class T> reference_wrapper<const T> cref(const T& t) noexcept; 68 template <class T> void cref(const T&& t) = delete; 69 template <class T> reference_wrapper<const T> cref(reference_wrapper<T> t) noexcept; 70 71 template <class T> // <class T=void> in C++14 72 struct plus : binary_function<T, T, T> 73 { 74 T operator()(const T& x, const T& y) const; 75 }; 76 77 template <class T> // <class T=void> in C++14 78 struct minus : binary_function<T, T, T> 79 { 80 T operator()(const T& x, const T& y) const; 81 }; 82 83 template <class T> // <class T=void> in C++14 84 struct multiplies : binary_function<T, T, T> 85 { 86 T operator()(const T& x, const T& y) const; 87 }; 88 89 template <class T> // <class T=void> in C++14 90 struct divides : binary_function<T, T, T> 91 { 92 T operator()(const T& x, const T& y) const; 93 }; 94 95 template <class T> // <class T=void> in C++14 96 struct modulus : binary_function<T, T, T> 97 { 98 T operator()(const T& x, const T& y) const; 99 }; 100 101 template <class T> // <class T=void> in C++14 102 struct negate : unary_function<T, T> 103 { 104 T operator()(const T& x) const; 105 }; 106 107 template <class T> // <class T=void> in C++14 108 struct equal_to : binary_function<T, T, bool> 109 { 110 bool operator()(const T& x, const T& y) const; 111 }; 112 113 template <class T> // <class T=void> in C++14 114 struct not_equal_to : binary_function<T, T, bool> 115 { 116 bool operator()(const T& x, const T& y) const; 117 }; 118 119 template <class T> // <class T=void> in C++14 120 struct greater : binary_function<T, T, bool> 121 { 122 bool operator()(const T& x, const T& y) const; 123 }; 124 125 template <class T> // <class T=void> in C++14 126 struct less : binary_function<T, T, bool> 127 { 128 bool operator()(const T& x, const T& y) const; 129 }; 130 131 template <class T> // <class T=void> in C++14 132 struct greater_equal : binary_function<T, T, bool> 133 { 134 bool operator()(const T& x, const T& y) const; 135 }; 136 137 template <class T> // <class T=void> in C++14 138 struct less_equal : binary_function<T, T, bool> 139 { 140 bool operator()(const T& x, const T& y) const; 141 }; 142 143 template <class T> // <class T=void> in C++14 144 struct logical_and : binary_function<T, T, bool> 145 { 146 bool operator()(const T& x, const T& y) const; 147 }; 148 149 template <class T> // <class T=void> in C++14 150 struct logical_or : binary_function<T, T, bool> 151 { 152 bool operator()(const T& x, const T& y) const; 153 }; 154 155 template <class T> // <class T=void> in C++14 156 struct logical_not : unary_function<T, bool> 157 { 158 bool operator()(const T& x) const; 159 }; 160 161 template <class T> // <class T=void> in C++14 162 struct bit_and : unary_function<T, bool> 163 { 164 bool operator()(const T& x, const T& y) const; 165 }; 166 167 template <class T> // <class T=void> in C++14 168 struct bit_or : unary_function<T, bool> 169 { 170 bool operator()(const T& x, const T& y) const; 171 }; 172 173 template <class T> // <class T=void> in C++14 174 struct bit_xor : unary_function<T, bool> 175 { 176 bool operator()(const T& x, const T& y) const; 177 }; 178 179 template <class T=void> // C++14 180 struct bit_xor : unary_function<T, bool> 181 { 182 bool operator()(const T& x) const; 183 }; 184 185 template <class Predicate> 186 class unary_negate 187 : public unary_function<typename Predicate::argument_type, bool> 188 { 189 public: 190 explicit unary_negate(const Predicate& pred); 191 bool operator()(const typename Predicate::argument_type& x) const; 192 }; 193 194 template <class Predicate> unary_negate<Predicate> not1(const Predicate& pred); 195 196 template <class Predicate> 197 class binary_negate 198 : public binary_function<typename Predicate::first_argument_type, 199 typename Predicate::second_argument_type, 200 bool> 201 { 202 public: 203 explicit binary_negate(const Predicate& pred); 204 bool operator()(const typename Predicate::first_argument_type& x, 205 const typename Predicate::second_argument_type& y) const; 206 }; 207 208 template <class Predicate> binary_negate<Predicate> not2(const Predicate& pred); 209 210 template<class T> struct is_bind_expression; 211 template<class T> struct is_placeholder; 212 213 template<class Fn, class... BoundArgs> 214 unspecified bind(Fn&&, BoundArgs&&...); 215 template<class R, class Fn, class... BoundArgs> 216 unspecified bind(Fn&&, BoundArgs&&...); 217 218 namespace placeholders { 219 // M is the implementation-defined number of placeholders 220 extern unspecified _1; 221 extern unspecified _2; 222 . 223 . 224 . 225 extern unspecified _Mp; 226 } 227 228 template <class Operation> 229 class binder1st 230 : public unary_function<typename Operation::second_argument_type, 231 typename Operation::result_type> 232 { 233 protected: 234 Operation op; 235 typename Operation::first_argument_type value; 236 public: 237 binder1st(const Operation& x, const typename Operation::first_argument_type y); 238 typename Operation::result_type operator()( typename Operation::second_argument_type& x) const; 239 typename Operation::result_type operator()(const typename Operation::second_argument_type& x) const; 240 }; 241 242 template <class Operation, class T> 243 binder1st<Operation> bind1st(const Operation& op, const T& x); 244 245 template <class Operation> 246 class binder2nd 247 : public unary_function<typename Operation::first_argument_type, 248 typename Operation::result_type> 249 { 250 protected: 251 Operation op; 252 typename Operation::second_argument_type value; 253 public: 254 binder2nd(const Operation& x, const typename Operation::second_argument_type y); 255 typename Operation::result_type operator()( typename Operation::first_argument_type& x) const; 256 typename Operation::result_type operator()(const typename Operation::first_argument_type& x) const; 257 }; 258 259 template <class Operation, class T> 260 binder2nd<Operation> bind2nd(const Operation& op, const T& x); 261 262 template <class Arg, class Result> 263 class pointer_to_unary_function : public unary_function<Arg, Result> 264 { 265 public: 266 explicit pointer_to_unary_function(Result (*f)(Arg)); 267 Result operator()(Arg x) const; 268 }; 269 270 template <class Arg, class Result> 271 pointer_to_unary_function<Arg,Result> ptr_fun(Result (*f)(Arg)); 272 273 template <class Arg1, class Arg2, class Result> 274 class pointer_to_binary_function : public binary_function<Arg1, Arg2, Result> 275 { 276 public: 277 explicit pointer_to_binary_function(Result (*f)(Arg1, Arg2)); 278 Result operator()(Arg1 x, Arg2 y) const; 279 }; 280 281 template <class Arg1, class Arg2, class Result> 282 pointer_to_binary_function<Arg1,Arg2,Result> ptr_fun(Result (*f)(Arg1,Arg2)); 283 284 template<class S, class T> 285 class mem_fun_t : public unary_function<T*, S> 286 { 287 public: 288 explicit mem_fun_t(S (T::*p)()); 289 S operator()(T* p) const; 290 }; 291 292 template<class S, class T, class A> 293 class mem_fun1_t : public binary_function<T*, A, S> 294 { 295 public: 296 explicit mem_fun1_t(S (T::*p)(A)); 297 S operator()(T* p, A x) const; 298 }; 299 300 template<class S, class T> mem_fun_t<S,T> mem_fun(S (T::*f)()); 301 template<class S, class T, class A> mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A)); 302 303 template<class S, class T> 304 class mem_fun_ref_t : public unary_function<T, S> 305 { 306 public: 307 explicit mem_fun_ref_t(S (T::*p)()); 308 S operator()(T& p) const; 309 }; 310 311 template<class S, class T, class A> 312 class mem_fun1_ref_t : public binary_function<T, A, S> 313 { 314 public: 315 explicit mem_fun1_ref_t(S (T::*p)(A)); 316 S operator()(T& p, A x) const; 317 }; 318 319 template<class S, class T> mem_fun_ref_t<S,T> mem_fun_ref(S (T::*f)()); 320 template<class S, class T, class A> mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A)); 321 322 template <class S, class T> 323 class const_mem_fun_t : public unary_function<const T*, S> 324 { 325 public: 326 explicit const_mem_fun_t(S (T::*p)() const); 327 S operator()(const T* p) const; 328 }; 329 330 template <class S, class T, class A> 331 class const_mem_fun1_t : public binary_function<const T*, A, S> 332 { 333 public: 334 explicit const_mem_fun1_t(S (T::*p)(A) const); 335 S operator()(const T* p, A x) const; 336 }; 337 338 template <class S, class T> const_mem_fun_t<S,T> mem_fun(S (T::*f)() const); 339 template <class S, class T, class A> const_mem_fun1_t<S,T,A> mem_fun(S (T::*f)(A) const); 340 341 template <class S, class T> 342 class const_mem_fun_ref_t : public unary_function<T, S> 343 { 344 public: 345 explicit const_mem_fun_ref_t(S (T::*p)() const); 346 S operator()(const T& p) const; 347 }; 348 349 template <class S, class T, class A> 350 class const_mem_fun1_ref_t : public binary_function<T, A, S> 351 { 352 public: 353 explicit const_mem_fun1_ref_t(S (T::*p)(A) const); 354 S operator()(const T& p, A x) const; 355 }; 356 357 template <class S, class T> const_mem_fun_ref_t<S,T> mem_fun_ref(S (T::*f)() const); 358 template <class S, class T, class A> const_mem_fun1_ref_t<S,T,A> mem_fun_ref(S (T::*f)(A) const); 359 360 template<class R, class T> unspecified mem_fn(R T::*); 361 362 class bad_function_call 363 : public exception 364 { 365 }; 366 367 template<class> class function; // undefined 368 369 template<class R, class... ArgTypes> 370 class function<R(ArgTypes...)> 371 : public unary_function<T1, R> // iff sizeof...(ArgTypes) == 1 and 372 // ArgTypes contains T1 373 : public binary_function<T1, T2, R> // iff sizeof...(ArgTypes) == 2 and 374 // ArgTypes contains T1 and T2 375 { 376 public: 377 typedef R result_type; 378 379 // construct/copy/destroy: 380 function() noexcept; 381 function(nullptr_t) noexcept; 382 function(const function&); 383 function(function&&) noexcept; 384 template<class F> 385 function(F); 386 template<Allocator Alloc> 387 function(allocator_arg_t, const Alloc&) noexcept; 388 template<Allocator Alloc> 389 function(allocator_arg_t, const Alloc&, nullptr_t) noexcept; 390 template<Allocator Alloc> 391 function(allocator_arg_t, const Alloc&, const function&); 392 template<Allocator Alloc> 393 function(allocator_arg_t, const Alloc&, function&&); 394 template<class F, Allocator Alloc> 395 function(allocator_arg_t, const Alloc&, F); 396 397 function& operator=(const function&); 398 function& operator=(function&&) noexcept; 399 function& operator=(nullptr_t) noexcept; 400 template<class F> 401 function& operator=(F&&); 402 template<class F> 403 function& operator=(reference_wrapper<F>) noexcept; 404 405 ~function(); 406 407 // function modifiers: 408 void swap(function&) noexcept; 409 template<class F, class Alloc> 410 void assign(F&&, const Alloc&); 411 412 // function capacity: 413 explicit operator bool() const noexcept; 414 415 // function invocation: 416 R operator()(ArgTypes...) const; 417 418 // function target access: 419 const std::type_info& target_type() const noexcept; 420 template <typename T> T* target() noexcept; 421 template <typename T> const T* target() const noexcept; 422 }; 423 424 // Null pointer comparisons: 425 template <class R, class ... ArgTypes> 426 bool operator==(const function<R(ArgTypes...)>&, nullptr_t) noexcept; 427 428 template <class R, class ... ArgTypes> 429 bool operator==(nullptr_t, const function<R(ArgTypes...)>&) noexcept; 430 431 template <class R, class ... ArgTypes> 432 bool operator!=(const function<R(ArgTypes...)>&, nullptr_t) noexcept; 433 434 template <class R, class ... ArgTypes> 435 bool operator!=(nullptr_t, const function<R(ArgTypes...)>&) noexcept; 436 437 // specialized algorithms: 438 template <class R, class ... ArgTypes> 439 void swap(function<R(ArgTypes...)>&, function<R(ArgTypes...)>&) noexcept; 440 441 template <class T> struct hash; 442 443 template <> struct hash<bool>; 444 template <> struct hash<char>; 445 template <> struct hash<signed char>; 446 template <> struct hash<unsigned char>; 447 template <> struct hash<char16_t>; 448 template <> struct hash<char32_t>; 449 template <> struct hash<wchar_t>; 450 template <> struct hash<short>; 451 template <> struct hash<unsigned short>; 452 template <> struct hash<int>; 453 template <> struct hash<unsigned int>; 454 template <> struct hash<long>; 455 template <> struct hash<long long>; 456 template <> struct hash<unsigned long>; 457 template <> struct hash<unsigned long long>; 458 459 template <> struct hash<float>; 460 template <> struct hash<double>; 461 template <> struct hash<long double>; 462 463 template<class T> struct hash<T*>; 464 465 } // std 466 467 POLICY: For non-variadic implementations, the number of arguments is limited 468 to 3. It is hoped that the need for non-variadic implementations 469 will be minimal. 470 471 */ 472 473 #include <__config> 474 #include <type_traits> 475 #include <typeinfo> 476 #include <exception> 477 #include <memory> 478 #include <tuple> 479 480 #include <__functional_base> 481 482 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 483 #pragma GCC system_header 484 #endif 485 486 _LIBCPP_BEGIN_NAMESPACE_STD 487 488 #if _LIBCPP_STD_VER > 11 489 template <class _Tp = void> 490 #else 491 template <class _Tp> 492 #endif 493 struct _LIBCPP_TYPE_VIS_ONLY plus : binary_function<_Tp, _Tp, _Tp> 494 { 495 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 496 _Tp operator()(const _Tp& __x, const _Tp& __y) const 497 {return __x + __y;} 498 }; 499 500 #if _LIBCPP_STD_VER > 11 501 template <> 502 struct _LIBCPP_TYPE_VIS_ONLY plus<void> 503 { 504 template <class _T1, class _T2> 505 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 506 auto operator()(_T1&& __t, _T2&& __u) const 507 { return _VSTD::forward<_T1>(__t) + _VSTD::forward<_T2>(__u); } 508 typedef void is_transparent; 509 }; 510 #endif 511 512 513 #if _LIBCPP_STD_VER > 11 514 template <class _Tp = void> 515 #else 516 template <class _Tp> 517 #endif 518 struct _LIBCPP_TYPE_VIS_ONLY minus : binary_function<_Tp, _Tp, _Tp> 519 { 520 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 521 _Tp operator()(const _Tp& __x, const _Tp& __y) const 522 {return __x - __y;} 523 }; 524 525 #if _LIBCPP_STD_VER > 11 526 template <> 527 struct _LIBCPP_TYPE_VIS_ONLY minus<void> 528 { 529 template <class _T1, class _T2> 530 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 531 auto operator()(_T1&& __t, _T2&& __u) const 532 { return _VSTD::forward<_T1>(__t) - _VSTD::forward<_T2>(__u); } 533 typedef void is_transparent; 534 }; 535 #endif 536 537 538 #if _LIBCPP_STD_VER > 11 539 template <class _Tp = void> 540 #else 541 template <class _Tp> 542 #endif 543 struct _LIBCPP_TYPE_VIS_ONLY multiplies : binary_function<_Tp, _Tp, _Tp> 544 { 545 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 546 _Tp operator()(const _Tp& __x, const _Tp& __y) const 547 {return __x * __y;} 548 }; 549 550 #if _LIBCPP_STD_VER > 11 551 template <> 552 struct _LIBCPP_TYPE_VIS_ONLY multiplies<void> 553 { 554 template <class _T1, class _T2> 555 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 556 auto operator()(_T1&& __t, _T2&& __u) const 557 { return _VSTD::forward<_T1>(__t) * _VSTD::forward<_T2>(__u); } 558 typedef void is_transparent; 559 }; 560 #endif 561 562 563 #if _LIBCPP_STD_VER > 11 564 template <class _Tp = void> 565 #else 566 template <class _Tp> 567 #endif 568 struct _LIBCPP_TYPE_VIS_ONLY divides : binary_function<_Tp, _Tp, _Tp> 569 { 570 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 571 _Tp operator()(const _Tp& __x, const _Tp& __y) const 572 {return __x / __y;} 573 }; 574 575 #if _LIBCPP_STD_VER > 11 576 template <> 577 struct _LIBCPP_TYPE_VIS_ONLY divides<void> 578 { 579 template <class _T1, class _T2> 580 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 581 auto operator()(_T1&& __t, _T2&& __u) const 582 { return _VSTD::forward<_T1>(__t) / _VSTD::forward<_T2>(__u); } 583 typedef void is_transparent; 584 }; 585 #endif 586 587 588 #if _LIBCPP_STD_VER > 11 589 template <class _Tp = void> 590 #else 591 template <class _Tp> 592 #endif 593 struct _LIBCPP_TYPE_VIS_ONLY modulus : binary_function<_Tp, _Tp, _Tp> 594 { 595 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 596 _Tp operator()(const _Tp& __x, const _Tp& __y) const 597 {return __x % __y;} 598 }; 599 600 #if _LIBCPP_STD_VER > 11 601 template <> 602 struct _LIBCPP_TYPE_VIS_ONLY modulus<void> 603 { 604 template <class _T1, class _T2> 605 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 606 auto operator()(_T1&& __t, _T2&& __u) const 607 { return _VSTD::forward<_T1>(__t) % _VSTD::forward<_T2>(__u); } 608 typedef void is_transparent; 609 }; 610 #endif 611 612 613 #if _LIBCPP_STD_VER > 11 614 template <class _Tp = void> 615 #else 616 template <class _Tp> 617 #endif 618 struct _LIBCPP_TYPE_VIS_ONLY negate : unary_function<_Tp, _Tp> 619 { 620 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 621 _Tp operator()(const _Tp& __x) const 622 {return -__x;} 623 }; 624 625 #if _LIBCPP_STD_VER > 11 626 template <> 627 struct _LIBCPP_TYPE_VIS_ONLY negate<void> 628 { 629 template <class _Tp> 630 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 631 auto operator()(_Tp&& __x) const 632 { return -_VSTD::forward<_Tp>(__x); } 633 typedef void is_transparent; 634 }; 635 #endif 636 637 638 #if _LIBCPP_STD_VER > 11 639 template <class _Tp = void> 640 #else 641 template <class _Tp> 642 #endif 643 struct _LIBCPP_TYPE_VIS_ONLY equal_to : binary_function<_Tp, _Tp, bool> 644 { 645 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 646 bool operator()(const _Tp& __x, const _Tp& __y) const 647 {return __x == __y;} 648 }; 649 650 #if _LIBCPP_STD_VER > 11 651 template <> 652 struct _LIBCPP_TYPE_VIS_ONLY equal_to<void> 653 { 654 template <class _T1, class _T2> 655 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 656 auto operator()(_T1&& __t, _T2&& __u) const 657 { return _VSTD::forward<_T1>(__t) == _VSTD::forward<_T2>(__u); } 658 typedef void is_transparent; 659 }; 660 #endif 661 662 663 #if _LIBCPP_STD_VER > 11 664 template <class _Tp = void> 665 #else 666 template <class _Tp> 667 #endif 668 struct _LIBCPP_TYPE_VIS_ONLY not_equal_to : binary_function<_Tp, _Tp, bool> 669 { 670 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 671 bool operator()(const _Tp& __x, const _Tp& __y) const 672 {return __x != __y;} 673 }; 674 675 #if _LIBCPP_STD_VER > 11 676 template <> 677 struct _LIBCPP_TYPE_VIS_ONLY not_equal_to<void> 678 { 679 template <class _T1, class _T2> 680 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 681 auto operator()(_T1&& __t, _T2&& __u) const 682 { return _VSTD::forward<_T1>(__t) != _VSTD::forward<_T2>(__u); } 683 typedef void is_transparent; 684 }; 685 #endif 686 687 688 #if _LIBCPP_STD_VER > 11 689 template <class _Tp = void> 690 #else 691 template <class _Tp> 692 #endif 693 struct _LIBCPP_TYPE_VIS_ONLY greater : binary_function<_Tp, _Tp, bool> 694 { 695 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 696 bool operator()(const _Tp& __x, const _Tp& __y) const 697 {return __x > __y;} 698 }; 699 700 #if _LIBCPP_STD_VER > 11 701 template <> 702 struct _LIBCPP_TYPE_VIS_ONLY greater<void> 703 { 704 template <class _T1, class _T2> 705 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 706 auto operator()(_T1&& __t, _T2&& __u) const 707 { return _VSTD::forward<_T1>(__t) > _VSTD::forward<_T2>(__u); } 708 typedef void is_transparent; 709 }; 710 #endif 711 712 713 // less in <__functional_base> 714 715 #if _LIBCPP_STD_VER > 11 716 template <class _Tp = void> 717 #else 718 template <class _Tp> 719 #endif 720 struct _LIBCPP_TYPE_VIS_ONLY greater_equal : binary_function<_Tp, _Tp, bool> 721 { 722 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 723 bool operator()(const _Tp& __x, const _Tp& __y) const 724 {return __x >= __y;} 725 }; 726 727 #if _LIBCPP_STD_VER > 11 728 template <> 729 struct _LIBCPP_TYPE_VIS_ONLY greater_equal<void> 730 { 731 template <class _T1, class _T2> 732 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 733 auto operator()(_T1&& __t, _T2&& __u) const 734 { return _VSTD::forward<_T1>(__t) >= _VSTD::forward<_T2>(__u); } 735 typedef void is_transparent; 736 }; 737 #endif 738 739 740 #if _LIBCPP_STD_VER > 11 741 template <class _Tp = void> 742 #else 743 template <class _Tp> 744 #endif 745 struct _LIBCPP_TYPE_VIS_ONLY less_equal : binary_function<_Tp, _Tp, bool> 746 { 747 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 748 bool operator()(const _Tp& __x, const _Tp& __y) const 749 {return __x <= __y;} 750 }; 751 752 #if _LIBCPP_STD_VER > 11 753 template <> 754 struct _LIBCPP_TYPE_VIS_ONLY less_equal<void> 755 { 756 template <class _T1, class _T2> 757 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 758 auto operator()(_T1&& __t, _T2&& __u) const 759 { return _VSTD::forward<_T1>(__t) <= _VSTD::forward<_T2>(__u); } 760 typedef void is_transparent; 761 }; 762 #endif 763 764 765 #if _LIBCPP_STD_VER > 11 766 template <class _Tp = void> 767 #else 768 template <class _Tp> 769 #endif 770 struct _LIBCPP_TYPE_VIS_ONLY logical_and : binary_function<_Tp, _Tp, bool> 771 { 772 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 773 bool operator()(const _Tp& __x, const _Tp& __y) const 774 {return __x && __y;} 775 }; 776 777 #if _LIBCPP_STD_VER > 11 778 template <> 779 struct _LIBCPP_TYPE_VIS_ONLY logical_and<void> 780 { 781 template <class _T1, class _T2> 782 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 783 auto operator()(_T1&& __t, _T2&& __u) const 784 { return _VSTD::forward<_T1>(__t) && _VSTD::forward<_T2>(__u); } 785 typedef void is_transparent; 786 }; 787 #endif 788 789 790 #if _LIBCPP_STD_VER > 11 791 template <class _Tp = void> 792 #else 793 template <class _Tp> 794 #endif 795 struct _LIBCPP_TYPE_VIS_ONLY logical_or : binary_function<_Tp, _Tp, bool> 796 { 797 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 798 bool operator()(const _Tp& __x, const _Tp& __y) const 799 {return __x || __y;} 800 }; 801 802 #if _LIBCPP_STD_VER > 11 803 template <> 804 struct _LIBCPP_TYPE_VIS_ONLY logical_or<void> 805 { 806 template <class _T1, class _T2> 807 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 808 auto operator()(_T1&& __t, _T2&& __u) const 809 { return _VSTD::forward<_T1>(__t) || _VSTD::forward<_T2>(__u); } 810 typedef void is_transparent; 811 }; 812 #endif 813 814 815 #if _LIBCPP_STD_VER > 11 816 template <class _Tp = void> 817 #else 818 template <class _Tp> 819 #endif 820 struct _LIBCPP_TYPE_VIS_ONLY logical_not : unary_function<_Tp, bool> 821 { 822 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 823 bool operator()(const _Tp& __x) const 824 {return !__x;} 825 }; 826 827 #if _LIBCPP_STD_VER > 11 828 template <> 829 struct _LIBCPP_TYPE_VIS_ONLY logical_not<void> 830 { 831 template <class _Tp> 832 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 833 auto operator()(_Tp&& __x) const 834 { return !_VSTD::forward<_Tp>(__x); } 835 typedef void is_transparent; 836 }; 837 #endif 838 839 840 #if _LIBCPP_STD_VER > 11 841 template <class _Tp = void> 842 #else 843 template <class _Tp> 844 #endif 845 struct _LIBCPP_TYPE_VIS_ONLY bit_and : binary_function<_Tp, _Tp, _Tp> 846 { 847 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 848 _Tp operator()(const _Tp& __x, const _Tp& __y) const 849 {return __x & __y;} 850 }; 851 852 #if _LIBCPP_STD_VER > 11 853 template <> 854 struct _LIBCPP_TYPE_VIS_ONLY bit_and<void> 855 { 856 template <class _T1, class _T2> 857 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 858 auto operator()(_T1&& __t, _T2&& __u) const 859 { return _VSTD::forward<_T1>(__t) & _VSTD::forward<_T2>(__u); } 860 typedef void is_transparent; 861 }; 862 #endif 863 864 865 #if _LIBCPP_STD_VER > 11 866 template <class _Tp = void> 867 #else 868 template <class _Tp> 869 #endif 870 struct _LIBCPP_TYPE_VIS_ONLY bit_or : binary_function<_Tp, _Tp, _Tp> 871 { 872 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 873 _Tp operator()(const _Tp& __x, const _Tp& __y) const 874 {return __x | __y;} 875 }; 876 877 #if _LIBCPP_STD_VER > 11 878 template <> 879 struct _LIBCPP_TYPE_VIS_ONLY bit_or<void> 880 { 881 template <class _T1, class _T2> 882 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 883 auto operator()(_T1&& __t, _T2&& __u) const 884 { return _VSTD::forward<_T1>(__t) | _VSTD::forward<_T2>(__u); } 885 typedef void is_transparent; 886 }; 887 #endif 888 889 890 #if _LIBCPP_STD_VER > 11 891 template <class _Tp = void> 892 #else 893 template <class _Tp> 894 #endif 895 struct _LIBCPP_TYPE_VIS_ONLY bit_xor : binary_function<_Tp, _Tp, _Tp> 896 { 897 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 898 _Tp operator()(const _Tp& __x, const _Tp& __y) const 899 {return __x ^ __y;} 900 }; 901 902 #if _LIBCPP_STD_VER > 11 903 template <> 904 struct _LIBCPP_TYPE_VIS_ONLY bit_xor<void> 905 { 906 template <class _T1, class _T2> 907 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 908 auto operator()(_T1&& __t, _T2&& __u) const 909 { return _VSTD::forward<_T1>(__t) ^ _VSTD::forward<_T2>(__u); } 910 typedef void is_transparent; 911 }; 912 #endif 913 914 915 #if _LIBCPP_STD_VER > 11 916 template <class _Tp = void> 917 struct _LIBCPP_TYPE_VIS_ONLY bit_not : unary_function<_Tp, _Tp> 918 { 919 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 920 _Tp operator()(const _Tp& __x) const 921 {return ~__x;} 922 }; 923 924 template <> 925 struct _LIBCPP_TYPE_VIS_ONLY bit_not<void> 926 { 927 template <class _Tp> 928 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 929 auto operator()(_Tp&& __x) const 930 { return ~_VSTD::forward<_Tp>(__x); } 931 typedef void is_transparent; 932 }; 933 #endif 934 935 template <class _Predicate> 936 class _LIBCPP_TYPE_VIS_ONLY unary_negate 937 : public unary_function<typename _Predicate::argument_type, bool> 938 { 939 _Predicate __pred_; 940 public: 941 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 942 explicit unary_negate(const _Predicate& __pred) 943 : __pred_(__pred) {} 944 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 945 bool operator()(const typename _Predicate::argument_type& __x) const 946 {return !__pred_(__x);} 947 }; 948 949 template <class _Predicate> 950 inline _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 951 unary_negate<_Predicate> 952 not1(const _Predicate& __pred) {return unary_negate<_Predicate>(__pred);} 953 954 template <class _Predicate> 955 class _LIBCPP_TYPE_VIS_ONLY binary_negate 956 : public binary_function<typename _Predicate::first_argument_type, 957 typename _Predicate::second_argument_type, 958 bool> 959 { 960 _Predicate __pred_; 961 public: 962 _LIBCPP_INLINE_VISIBILITY explicit _LIBCPP_CONSTEXPR_AFTER_CXX11 963 binary_negate(const _Predicate& __pred) : __pred_(__pred) {} 964 965 _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 966 bool operator()(const typename _Predicate::first_argument_type& __x, 967 const typename _Predicate::second_argument_type& __y) const 968 {return !__pred_(__x, __y);} 969 }; 970 971 template <class _Predicate> 972 inline _LIBCPP_CONSTEXPR_AFTER_CXX11 _LIBCPP_INLINE_VISIBILITY 973 binary_negate<_Predicate> 974 not2(const _Predicate& __pred) {return binary_negate<_Predicate>(__pred);} 975 976 template <class __Operation> 977 class _LIBCPP_TYPE_VIS_ONLY binder1st 978 : public unary_function<typename __Operation::second_argument_type, 979 typename __Operation::result_type> 980 { 981 protected: 982 __Operation op; 983 typename __Operation::first_argument_type value; 984 public: 985 _LIBCPP_INLINE_VISIBILITY binder1st(const __Operation& __x, 986 const typename __Operation::first_argument_type __y) 987 : op(__x), value(__y) {} 988 _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator() 989 (typename __Operation::second_argument_type& __x) const 990 {return op(value, __x);} 991 _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator() 992 (const typename __Operation::second_argument_type& __x) const 993 {return op(value, __x);} 994 }; 995 996 template <class __Operation, class _Tp> 997 inline _LIBCPP_INLINE_VISIBILITY 998 binder1st<__Operation> 999 bind1st(const __Operation& __op, const _Tp& __x) 1000 {return binder1st<__Operation>(__op, __x);} 1001 1002 template <class __Operation> 1003 class _LIBCPP_TYPE_VIS_ONLY binder2nd 1004 : public unary_function<typename __Operation::first_argument_type, 1005 typename __Operation::result_type> 1006 { 1007 protected: 1008 __Operation op; 1009 typename __Operation::second_argument_type value; 1010 public: 1011 _LIBCPP_INLINE_VISIBILITY 1012 binder2nd(const __Operation& __x, const typename __Operation::second_argument_type __y) 1013 : op(__x), value(__y) {} 1014 _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator() 1015 ( typename __Operation::first_argument_type& __x) const 1016 {return op(__x, value);} 1017 _LIBCPP_INLINE_VISIBILITY typename __Operation::result_type operator() 1018 (const typename __Operation::first_argument_type& __x) const 1019 {return op(__x, value);} 1020 }; 1021 1022 template <class __Operation, class _Tp> 1023 inline _LIBCPP_INLINE_VISIBILITY 1024 binder2nd<__Operation> 1025 bind2nd(const __Operation& __op, const _Tp& __x) 1026 {return binder2nd<__Operation>(__op, __x);} 1027 1028 template <class _Arg, class _Result> 1029 class _LIBCPP_TYPE_VIS_ONLY pointer_to_unary_function 1030 : public unary_function<_Arg, _Result> 1031 { 1032 _Result (*__f_)(_Arg); 1033 public: 1034 _LIBCPP_INLINE_VISIBILITY explicit pointer_to_unary_function(_Result (*__f)(_Arg)) 1035 : __f_(__f) {} 1036 _LIBCPP_INLINE_VISIBILITY _Result operator()(_Arg __x) const 1037 {return __f_(__x);} 1038 }; 1039 1040 template <class _Arg, class _Result> 1041 inline _LIBCPP_INLINE_VISIBILITY 1042 pointer_to_unary_function<_Arg,_Result> 1043 ptr_fun(_Result (*__f)(_Arg)) 1044 {return pointer_to_unary_function<_Arg,_Result>(__f);} 1045 1046 template <class _Arg1, class _Arg2, class _Result> 1047 class _LIBCPP_TYPE_VIS_ONLY pointer_to_binary_function 1048 : public binary_function<_Arg1, _Arg2, _Result> 1049 { 1050 _Result (*__f_)(_Arg1, _Arg2); 1051 public: 1052 _LIBCPP_INLINE_VISIBILITY explicit pointer_to_binary_function(_Result (*__f)(_Arg1, _Arg2)) 1053 : __f_(__f) {} 1054 _LIBCPP_INLINE_VISIBILITY _Result operator()(_Arg1 __x, _Arg2 __y) const 1055 {return __f_(__x, __y);} 1056 }; 1057 1058 template <class _Arg1, class _Arg2, class _Result> 1059 inline _LIBCPP_INLINE_VISIBILITY 1060 pointer_to_binary_function<_Arg1,_Arg2,_Result> 1061 ptr_fun(_Result (*__f)(_Arg1,_Arg2)) 1062 {return pointer_to_binary_function<_Arg1,_Arg2,_Result>(__f);} 1063 1064 template<class _Sp, class _Tp> 1065 class _LIBCPP_TYPE_VIS_ONLY mem_fun_t : public unary_function<_Tp*, _Sp> 1066 { 1067 _Sp (_Tp::*__p_)(); 1068 public: 1069 _LIBCPP_INLINE_VISIBILITY explicit mem_fun_t(_Sp (_Tp::*__p)()) 1070 : __p_(__p) {} 1071 _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp* __p) const 1072 {return (__p->*__p_)();} 1073 }; 1074 1075 template<class _Sp, class _Tp, class _Ap> 1076 class _LIBCPP_TYPE_VIS_ONLY mem_fun1_t : public binary_function<_Tp*, _Ap, _Sp> 1077 { 1078 _Sp (_Tp::*__p_)(_Ap); 1079 public: 1080 _LIBCPP_INLINE_VISIBILITY explicit mem_fun1_t(_Sp (_Tp::*__p)(_Ap)) 1081 : __p_(__p) {} 1082 _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp* __p, _Ap __x) const 1083 {return (__p->*__p_)(__x);} 1084 }; 1085 1086 template<class _Sp, class _Tp> 1087 inline _LIBCPP_INLINE_VISIBILITY 1088 mem_fun_t<_Sp,_Tp> 1089 mem_fun(_Sp (_Tp::*__f)()) 1090 {return mem_fun_t<_Sp,_Tp>(__f);} 1091 1092 template<class _Sp, class _Tp, class _Ap> 1093 inline _LIBCPP_INLINE_VISIBILITY 1094 mem_fun1_t<_Sp,_Tp,_Ap> 1095 mem_fun(_Sp (_Tp::*__f)(_Ap)) 1096 {return mem_fun1_t<_Sp,_Tp,_Ap>(__f);} 1097 1098 template<class _Sp, class _Tp> 1099 class _LIBCPP_TYPE_VIS_ONLY mem_fun_ref_t : public unary_function<_Tp, _Sp> 1100 { 1101 _Sp (_Tp::*__p_)(); 1102 public: 1103 _LIBCPP_INLINE_VISIBILITY explicit mem_fun_ref_t(_Sp (_Tp::*__p)()) 1104 : __p_(__p) {} 1105 _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp& __p) const 1106 {return (__p.*__p_)();} 1107 }; 1108 1109 template<class _Sp, class _Tp, class _Ap> 1110 class _LIBCPP_TYPE_VIS_ONLY mem_fun1_ref_t : public binary_function<_Tp, _Ap, _Sp> 1111 { 1112 _Sp (_Tp::*__p_)(_Ap); 1113 public: 1114 _LIBCPP_INLINE_VISIBILITY explicit mem_fun1_ref_t(_Sp (_Tp::*__p)(_Ap)) 1115 : __p_(__p) {} 1116 _LIBCPP_INLINE_VISIBILITY _Sp operator()(_Tp& __p, _Ap __x) const 1117 {return (__p.*__p_)(__x);} 1118 }; 1119 1120 template<class _Sp, class _Tp> 1121 inline _LIBCPP_INLINE_VISIBILITY 1122 mem_fun_ref_t<_Sp,_Tp> 1123 mem_fun_ref(_Sp (_Tp::*__f)()) 1124 {return mem_fun_ref_t<_Sp,_Tp>(__f);} 1125 1126 template<class _Sp, class _Tp, class _Ap> 1127 inline _LIBCPP_INLINE_VISIBILITY 1128 mem_fun1_ref_t<_Sp,_Tp,_Ap> 1129 mem_fun_ref(_Sp (_Tp::*__f)(_Ap)) 1130 {return mem_fun1_ref_t<_Sp,_Tp,_Ap>(__f);} 1131 1132 template <class _Sp, class _Tp> 1133 class _LIBCPP_TYPE_VIS_ONLY const_mem_fun_t : public unary_function<const _Tp*, _Sp> 1134 { 1135 _Sp (_Tp::*__p_)() const; 1136 public: 1137 _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun_t(_Sp (_Tp::*__p)() const) 1138 : __p_(__p) {} 1139 _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp* __p) const 1140 {return (__p->*__p_)();} 1141 }; 1142 1143 template <class _Sp, class _Tp, class _Ap> 1144 class _LIBCPP_TYPE_VIS_ONLY const_mem_fun1_t : public binary_function<const _Tp*, _Ap, _Sp> 1145 { 1146 _Sp (_Tp::*__p_)(_Ap) const; 1147 public: 1148 _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun1_t(_Sp (_Tp::*__p)(_Ap) const) 1149 : __p_(__p) {} 1150 _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp* __p, _Ap __x) const 1151 {return (__p->*__p_)(__x);} 1152 }; 1153 1154 template <class _Sp, class _Tp> 1155 inline _LIBCPP_INLINE_VISIBILITY 1156 const_mem_fun_t<_Sp,_Tp> 1157 mem_fun(_Sp (_Tp::*__f)() const) 1158 {return const_mem_fun_t<_Sp,_Tp>(__f);} 1159 1160 template <class _Sp, class _Tp, class _Ap> 1161 inline _LIBCPP_INLINE_VISIBILITY 1162 const_mem_fun1_t<_Sp,_Tp,_Ap> 1163 mem_fun(_Sp (_Tp::*__f)(_Ap) const) 1164 {return const_mem_fun1_t<_Sp,_Tp,_Ap>(__f);} 1165 1166 template <class _Sp, class _Tp> 1167 class _LIBCPP_TYPE_VIS_ONLY const_mem_fun_ref_t : public unary_function<_Tp, _Sp> 1168 { 1169 _Sp (_Tp::*__p_)() const; 1170 public: 1171 _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun_ref_t(_Sp (_Tp::*__p)() const) 1172 : __p_(__p) {} 1173 _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp& __p) const 1174 {return (__p.*__p_)();} 1175 }; 1176 1177 template <class _Sp, class _Tp, class _Ap> 1178 class _LIBCPP_TYPE_VIS_ONLY const_mem_fun1_ref_t 1179 : public binary_function<_Tp, _Ap, _Sp> 1180 { 1181 _Sp (_Tp::*__p_)(_Ap) const; 1182 public: 1183 _LIBCPP_INLINE_VISIBILITY explicit const_mem_fun1_ref_t(_Sp (_Tp::*__p)(_Ap) const) 1184 : __p_(__p) {} 1185 _LIBCPP_INLINE_VISIBILITY _Sp operator()(const _Tp& __p, _Ap __x) const 1186 {return (__p.*__p_)(__x);} 1187 }; 1188 1189 template <class _Sp, class _Tp> 1190 inline _LIBCPP_INLINE_VISIBILITY 1191 const_mem_fun_ref_t<_Sp,_Tp> 1192 mem_fun_ref(_Sp (_Tp::*__f)() const) 1193 {return const_mem_fun_ref_t<_Sp,_Tp>(__f);} 1194 1195 template <class _Sp, class _Tp, class _Ap> 1196 inline _LIBCPP_INLINE_VISIBILITY 1197 const_mem_fun1_ref_t<_Sp,_Tp,_Ap> 1198 mem_fun_ref(_Sp (_Tp::*__f)(_Ap) const) 1199 {return const_mem_fun1_ref_t<_Sp,_Tp,_Ap>(__f);} 1200 1201 #ifdef _LIBCPP_HAS_NO_VARIADICS 1202 1203 #include <__functional_03> 1204 1205 #else // _LIBCPP_HAS_NO_VARIADICS 1206 1207 template <class _Tp> 1208 class __mem_fn 1209 : public __weak_result_type<_Tp> 1210 { 1211 public: 1212 // types 1213 typedef _Tp type; 1214 private: 1215 type __f_; 1216 1217 public: 1218 _LIBCPP_INLINE_VISIBILITY __mem_fn(type __f) : __f_(__f) {} 1219 1220 // invoke 1221 template <class... _ArgTypes> 1222 _LIBCPP_INLINE_VISIBILITY 1223 typename __invoke_return<type, _ArgTypes...>::type 1224 operator() (_ArgTypes&&... __args) const 1225 { 1226 return __invoke(__f_, _VSTD::forward<_ArgTypes>(__args)...); 1227 } 1228 }; 1229 1230 template<class _Rp, class _Tp> 1231 inline _LIBCPP_INLINE_VISIBILITY 1232 __mem_fn<_Rp _Tp::*> 1233 mem_fn(_Rp _Tp::* __pm) 1234 { 1235 return __mem_fn<_Rp _Tp::*>(__pm); 1236 } 1237 1238 // bad_function_call 1239 1240 class _LIBCPP_EXCEPTION_ABI bad_function_call 1241 : public exception 1242 { 1243 }; 1244 1245 template<class _Fp> class _LIBCPP_TYPE_VIS_ONLY function; // undefined 1246 1247 namespace __function 1248 { 1249 1250 template<class _Rp, class ..._ArgTypes> 1251 struct __maybe_derive_from_unary_function 1252 { 1253 }; 1254 1255 template<class _Rp, class _A1> 1256 struct __maybe_derive_from_unary_function<_Rp(_A1)> 1257 : public unary_function<_A1, _Rp> 1258 { 1259 }; 1260 1261 template<class _Rp, class ..._ArgTypes> 1262 struct __maybe_derive_from_binary_function 1263 { 1264 }; 1265 1266 template<class _Rp, class _A1, class _A2> 1267 struct __maybe_derive_from_binary_function<_Rp(_A1, _A2)> 1268 : public binary_function<_A1, _A2, _Rp> 1269 { 1270 }; 1271 1272 template<class _Fp> class __base; 1273 1274 template<class _Rp, class ..._ArgTypes> 1275 class __base<_Rp(_ArgTypes...)> 1276 { 1277 __base(const __base&); 1278 __base& operator=(const __base&); 1279 public: 1280 _LIBCPP_INLINE_VISIBILITY __base() {} 1281 _LIBCPP_INLINE_VISIBILITY virtual ~__base() {} 1282 virtual __base* __clone() const = 0; 1283 virtual void __clone(__base*) const = 0; 1284 virtual void destroy() _NOEXCEPT = 0; 1285 virtual void destroy_deallocate() _NOEXCEPT = 0; 1286 virtual _Rp operator()(_ArgTypes&& ...) = 0; 1287 #ifndef _LIBCPP_NO_RTTI 1288 virtual const void* target(const type_info&) const _NOEXCEPT = 0; 1289 virtual const std::type_info& target_type() const _NOEXCEPT = 0; 1290 #endif // _LIBCPP_NO_RTTI 1291 }; 1292 1293 template<class _FD, class _Alloc, class _FB> class __func; 1294 1295 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1296 class __func<_Fp, _Alloc, _Rp(_ArgTypes...)> 1297 : public __base<_Rp(_ArgTypes...)> 1298 { 1299 __compressed_pair<_Fp, _Alloc> __f_; 1300 public: 1301 _LIBCPP_INLINE_VISIBILITY 1302 explicit __func(_Fp&& __f) 1303 : __f_(piecewise_construct, _VSTD::forward_as_tuple(_VSTD::move(__f)), 1304 _VSTD::forward_as_tuple()) {} 1305 _LIBCPP_INLINE_VISIBILITY 1306 explicit __func(const _Fp& __f, const _Alloc& __a) 1307 : __f_(piecewise_construct, _VSTD::forward_as_tuple(__f), 1308 _VSTD::forward_as_tuple(__a)) {} 1309 1310 _LIBCPP_INLINE_VISIBILITY 1311 explicit __func(const _Fp& __f, _Alloc&& __a) 1312 : __f_(piecewise_construct, _VSTD::forward_as_tuple(__f), 1313 _VSTD::forward_as_tuple(_VSTD::move(__a))) {} 1314 1315 _LIBCPP_INLINE_VISIBILITY 1316 explicit __func(_Fp&& __f, _Alloc&& __a) 1317 : __f_(piecewise_construct, _VSTD::forward_as_tuple(_VSTD::move(__f)), 1318 _VSTD::forward_as_tuple(_VSTD::move(__a))) {} 1319 virtual __base<_Rp(_ArgTypes...)>* __clone() const; 1320 virtual void __clone(__base<_Rp(_ArgTypes...)>*) const; 1321 virtual void destroy() _NOEXCEPT; 1322 virtual void destroy_deallocate() _NOEXCEPT; 1323 virtual _Rp operator()(_ArgTypes&& ... __arg); 1324 #ifndef _LIBCPP_NO_RTTI 1325 virtual const void* target(const type_info&) const _NOEXCEPT; 1326 virtual const std::type_info& target_type() const _NOEXCEPT; 1327 #endif // _LIBCPP_NO_RTTI 1328 }; 1329 1330 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1331 __base<_Rp(_ArgTypes...)>* 1332 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::__clone() const 1333 { 1334 typedef typename _Alloc::template rebind<__func>::other _Ap; 1335 _Ap __a(__f_.second()); 1336 typedef __allocator_destructor<_Ap> _Dp; 1337 unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1)); 1338 ::new (__hold.get()) __func(__f_.first(), _Alloc(__a)); 1339 return __hold.release(); 1340 } 1341 1342 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1343 void 1344 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::__clone(__base<_Rp(_ArgTypes...)>* __p) const 1345 { 1346 ::new (__p) __func(__f_.first(), __f_.second()); 1347 } 1348 1349 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1350 void 1351 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::destroy() _NOEXCEPT 1352 { 1353 __f_.~__compressed_pair<_Fp, _Alloc>(); 1354 } 1355 1356 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1357 void 1358 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::destroy_deallocate() _NOEXCEPT 1359 { 1360 typedef typename _Alloc::template rebind<__func>::other _Ap; 1361 _Ap __a(__f_.second()); 1362 __f_.~__compressed_pair<_Fp, _Alloc>(); 1363 __a.deallocate(this, 1); 1364 } 1365 1366 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1367 _Rp 1368 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::operator()(_ArgTypes&& ... __arg) 1369 { 1370 return __invoke(__f_.first(), _VSTD::forward<_ArgTypes>(__arg)...); 1371 } 1372 1373 #ifndef _LIBCPP_NO_RTTI 1374 1375 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1376 const void* 1377 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::target(const type_info& __ti) const _NOEXCEPT 1378 { 1379 if (__ti == typeid(_Fp)) 1380 return &__f_.first(); 1381 return (const void*)0; 1382 } 1383 1384 template<class _Fp, class _Alloc, class _Rp, class ..._ArgTypes> 1385 const std::type_info& 1386 __func<_Fp, _Alloc, _Rp(_ArgTypes...)>::target_type() const _NOEXCEPT 1387 { 1388 return typeid(_Fp); 1389 } 1390 1391 #endif // _LIBCPP_NO_RTTI 1392 1393 } // __function 1394 1395 template<class _Rp, class ..._ArgTypes> 1396 class _LIBCPP_TYPE_VIS_ONLY function<_Rp(_ArgTypes...)> 1397 : public __function::__maybe_derive_from_unary_function<_Rp(_ArgTypes...)>, 1398 public __function::__maybe_derive_from_binary_function<_Rp(_ArgTypes...)> 1399 { 1400 typedef __function::__base<_Rp(_ArgTypes...)> __base; 1401 typename aligned_storage<3*sizeof(void*)>::type __buf_; 1402 __base* __f_; 1403 1404 template <class _Fp> 1405 _LIBCPP_INLINE_VISIBILITY 1406 static bool __not_null(const _Fp&) {return true;} 1407 template <class _R2, class ..._Ap> 1408 _LIBCPP_INLINE_VISIBILITY 1409 static bool __not_null(_R2 (*__p)(_Ap...)) {return __p;} 1410 template <class _R2, class _Cp, class ..._Ap> 1411 _LIBCPP_INLINE_VISIBILITY 1412 static bool __not_null(_R2 (_Cp::*__p)(_Ap...)) {return __p;} 1413 template <class _R2, class _Cp, class ..._Ap> 1414 _LIBCPP_INLINE_VISIBILITY 1415 static bool __not_null(_R2 (_Cp::*__p)(_Ap...) const) {return __p;} 1416 template <class _R2, class _Cp, class ..._Ap> 1417 _LIBCPP_INLINE_VISIBILITY 1418 static bool __not_null(_R2 (_Cp::*__p)(_Ap...) volatile) {return __p;} 1419 template <class _R2, class _Cp, class ..._Ap> 1420 _LIBCPP_INLINE_VISIBILITY 1421 static bool __not_null(_R2 (_Cp::*__p)(_Ap...) const volatile) {return __p;} 1422 template <class _R2, class ..._Ap> 1423 _LIBCPP_INLINE_VISIBILITY 1424 static bool __not_null(const function<_Rp(_Ap...)>& __p) {return __p;} 1425 1426 template <class _Fp, bool = !is_same<_Fp, function>::value && 1427 __invokable<_Fp&, _ArgTypes...>::value> 1428 struct __callable; 1429 template <class _Fp> 1430 struct __callable<_Fp, true> 1431 { 1432 static const bool value = 1433 is_convertible<typename __invoke_of<_Fp&, _ArgTypes...>::type, 1434 _Rp>::value; 1435 }; 1436 template <class _Fp> 1437 struct __callable<_Fp, false> 1438 { 1439 static const bool value = false; 1440 }; 1441 public: 1442 typedef _Rp result_type; 1443 1444 // construct/copy/destroy: 1445 _LIBCPP_INLINE_VISIBILITY 1446 function() _NOEXCEPT : __f_(0) {} 1447 _LIBCPP_INLINE_VISIBILITY 1448 function(nullptr_t) _NOEXCEPT : __f_(0) {} 1449 function(const function&); 1450 function(function&&) _NOEXCEPT; 1451 template<class _Fp> 1452 function(_Fp, typename enable_if 1453 < 1454 __callable<_Fp>::value && 1455 !is_same<_Fp, function>::value 1456 >::type* = 0); 1457 1458 template<class _Alloc> 1459 _LIBCPP_INLINE_VISIBILITY 1460 function(allocator_arg_t, const _Alloc&) _NOEXCEPT : __f_(0) {} 1461 template<class _Alloc> 1462 _LIBCPP_INLINE_VISIBILITY 1463 function(allocator_arg_t, const _Alloc&, nullptr_t) _NOEXCEPT : __f_(0) {} 1464 template<class _Alloc> 1465 function(allocator_arg_t, const _Alloc&, const function&); 1466 template<class _Alloc> 1467 function(allocator_arg_t, const _Alloc&, function&&); 1468 template<class _Fp, class _Alloc> 1469 function(allocator_arg_t, const _Alloc& __a, _Fp __f, 1470 typename enable_if<__callable<_Fp>::value>::type* = 0); 1471 1472 function& operator=(const function&); 1473 function& operator=(function&&) _NOEXCEPT; 1474 function& operator=(nullptr_t) _NOEXCEPT; 1475 template<class _Fp> 1476 typename enable_if 1477 < 1478 __callable<typename decay<_Fp>::type>::value && 1479 !is_same<typename remove_reference<_Fp>::type, function>::value, 1480 function& 1481 >::type 1482 operator=(_Fp&&); 1483 1484 ~function(); 1485 1486 // function modifiers: 1487 void swap(function&) _NOEXCEPT; 1488 template<class _Fp, class _Alloc> 1489 _LIBCPP_INLINE_VISIBILITY 1490 void assign(_Fp&& __f, const _Alloc& __a) 1491 {function(allocator_arg, __a, _VSTD::forward<_Fp>(__f)).swap(*this);} 1492 1493 // function capacity: 1494 _LIBCPP_INLINE_VISIBILITY 1495 _LIBCPP_EXPLICIT operator bool() const _NOEXCEPT {return __f_;} 1496 1497 // deleted overloads close possible hole in the type system 1498 template<class _R2, class... _ArgTypes2> 1499 bool operator==(const function<_R2(_ArgTypes2...)>&) const = delete; 1500 template<class _R2, class... _ArgTypes2> 1501 bool operator!=(const function<_R2(_ArgTypes2...)>&) const = delete; 1502 public: 1503 // function invocation: 1504 _Rp operator()(_ArgTypes...) const; 1505 1506 #ifndef _LIBCPP_NO_RTTI 1507 // function target access: 1508 const std::type_info& target_type() const _NOEXCEPT; 1509 template <typename _Tp> _Tp* target() _NOEXCEPT; 1510 template <typename _Tp> const _Tp* target() const _NOEXCEPT; 1511 #endif // _LIBCPP_NO_RTTI 1512 }; 1513 1514 template<class _Rp, class ..._ArgTypes> 1515 function<_Rp(_ArgTypes...)>::function(const function& __f) 1516 { 1517 if (__f.__f_ == 0) 1518 __f_ = 0; 1519 else if (__f.__f_ == (const __base*)&__f.__buf_) 1520 { 1521 __f_ = (__base*)&__buf_; 1522 __f.__f_->__clone(__f_); 1523 } 1524 else 1525 __f_ = __f.__f_->__clone(); 1526 } 1527 1528 template<class _Rp, class ..._ArgTypes> 1529 template <class _Alloc> 1530 function<_Rp(_ArgTypes...)>::function(allocator_arg_t, const _Alloc&, 1531 const function& __f) 1532 { 1533 if (__f.__f_ == 0) 1534 __f_ = 0; 1535 else if (__f.__f_ == (const __base*)&__f.__buf_) 1536 { 1537 __f_ = (__base*)&__buf_; 1538 __f.__f_->__clone(__f_); 1539 } 1540 else 1541 __f_ = __f.__f_->__clone(); 1542 } 1543 1544 template<class _Rp, class ..._ArgTypes> 1545 function<_Rp(_ArgTypes...)>::function(function&& __f) _NOEXCEPT 1546 { 1547 if (__f.__f_ == 0) 1548 __f_ = 0; 1549 else if (__f.__f_ == (__base*)&__f.__buf_) 1550 { 1551 __f_ = (__base*)&__buf_; 1552 __f.__f_->__clone(__f_); 1553 } 1554 else 1555 { 1556 __f_ = __f.__f_; 1557 __f.__f_ = 0; 1558 } 1559 } 1560 1561 template<class _Rp, class ..._ArgTypes> 1562 template <class _Alloc> 1563 function<_Rp(_ArgTypes...)>::function(allocator_arg_t, const _Alloc&, 1564 function&& __f) 1565 { 1566 if (__f.__f_ == 0) 1567 __f_ = 0; 1568 else if (__f.__f_ == (__base*)&__f.__buf_) 1569 { 1570 __f_ = (__base*)&__buf_; 1571 __f.__f_->__clone(__f_); 1572 } 1573 else 1574 { 1575 __f_ = __f.__f_; 1576 __f.__f_ = 0; 1577 } 1578 } 1579 1580 template<class _Rp, class ..._ArgTypes> 1581 template <class _Fp> 1582 function<_Rp(_ArgTypes...)>::function(_Fp __f, 1583 typename enable_if 1584 < 1585 __callable<_Fp>::value && 1586 !is_same<_Fp, function>::value 1587 >::type*) 1588 : __f_(0) 1589 { 1590 if (__not_null(__f)) 1591 { 1592 typedef __function::__func<_Fp, allocator<_Fp>, _Rp(_ArgTypes...)> _FF; 1593 if (sizeof(_FF) <= sizeof(__buf_) && is_nothrow_copy_constructible<_Fp>::value) 1594 { 1595 __f_ = (__base*)&__buf_; 1596 ::new (__f_) _FF(_VSTD::move(__f)); 1597 } 1598 else 1599 { 1600 typedef allocator<_FF> _Ap; 1601 _Ap __a; 1602 typedef __allocator_destructor<_Ap> _Dp; 1603 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1)); 1604 ::new (__hold.get()) _FF(_VSTD::move(__f), allocator<_Fp>(__a)); 1605 __f_ = __hold.release(); 1606 } 1607 } 1608 } 1609 1610 template<class _Rp, class ..._ArgTypes> 1611 template <class _Fp, class _Alloc> 1612 function<_Rp(_ArgTypes...)>::function(allocator_arg_t, const _Alloc& __a0, _Fp __f, 1613 typename enable_if<__callable<_Fp>::value>::type*) 1614 : __f_(0) 1615 { 1616 typedef allocator_traits<_Alloc> __alloc_traits; 1617 if (__not_null(__f)) 1618 { 1619 typedef __function::__func<_Fp, _Alloc, _Rp(_ArgTypes...)> _FF; 1620 if (sizeof(_FF) <= sizeof(__buf_) && is_nothrow_copy_constructible<_Fp>::value) 1621 { 1622 __f_ = (__base*)&__buf_; 1623 ::new (__f_) _FF(_VSTD::move(__f)); 1624 } 1625 else 1626 { 1627 typedef typename __alloc_traits::template 1628 #ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES 1629 rebind_alloc<_FF> 1630 #else 1631 rebind_alloc<_FF>::other 1632 #endif 1633 _Ap; 1634 _Ap __a(__a0); 1635 typedef __allocator_destructor<_Ap> _Dp; 1636 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1)); 1637 ::new (__hold.get()) _FF(_VSTD::move(__f), _Alloc(__a)); 1638 __f_ = __hold.release(); 1639 } 1640 } 1641 } 1642 1643 template<class _Rp, class ..._ArgTypes> 1644 function<_Rp(_ArgTypes...)>& 1645 function<_Rp(_ArgTypes...)>::operator=(const function& __f) 1646 { 1647 function(__f).swap(*this); 1648 return *this; 1649 } 1650 1651 template<class _Rp, class ..._ArgTypes> 1652 function<_Rp(_ArgTypes...)>& 1653 function<_Rp(_ArgTypes...)>::operator=(function&& __f) _NOEXCEPT 1654 { 1655 if (__f_ == (__base*)&__buf_) 1656 __f_->destroy(); 1657 else if (__f_) 1658 __f_->destroy_deallocate(); 1659 __f_ = 0; 1660 if (__f.__f_ == 0) 1661 __f_ = 0; 1662 else if (__f.__f_ == (__base*)&__f.__buf_) 1663 { 1664 __f_ = (__base*)&__buf_; 1665 __f.__f_->__clone(__f_); 1666 } 1667 else 1668 { 1669 __f_ = __f.__f_; 1670 __f.__f_ = 0; 1671 } 1672 return *this; 1673 } 1674 1675 template<class _Rp, class ..._ArgTypes> 1676 function<_Rp(_ArgTypes...)>& 1677 function<_Rp(_ArgTypes...)>::operator=(nullptr_t) _NOEXCEPT 1678 { 1679 if (__f_ == (__base*)&__buf_) 1680 __f_->destroy(); 1681 else if (__f_) 1682 __f_->destroy_deallocate(); 1683 __f_ = 0; 1684 return *this; 1685 } 1686 1687 template<class _Rp, class ..._ArgTypes> 1688 template <class _Fp> 1689 typename enable_if 1690 < 1691 function<_Rp(_ArgTypes...)>::template __callable<typename decay<_Fp>::type>::value && 1692 !is_same<typename remove_reference<_Fp>::type, function<_Rp(_ArgTypes...)>>::value, 1693 function<_Rp(_ArgTypes...)>& 1694 >::type 1695 function<_Rp(_ArgTypes...)>::operator=(_Fp&& __f) 1696 { 1697 function(_VSTD::forward<_Fp>(__f)).swap(*this); 1698 return *this; 1699 } 1700 1701 template<class _Rp, class ..._ArgTypes> 1702 function<_Rp(_ArgTypes...)>::~function() 1703 { 1704 if (__f_ == (__base*)&__buf_) 1705 __f_->destroy(); 1706 else if (__f_) 1707 __f_->destroy_deallocate(); 1708 } 1709 1710 template<class _Rp, class ..._ArgTypes> 1711 void 1712 function<_Rp(_ArgTypes...)>::swap(function& __f) _NOEXCEPT 1713 { 1714 if (__f_ == (__base*)&__buf_ && __f.__f_ == (__base*)&__f.__buf_) 1715 { 1716 typename aligned_storage<sizeof(__buf_)>::type __tempbuf; 1717 __base* __t = (__base*)&__tempbuf; 1718 __f_->__clone(__t); 1719 __f_->destroy(); 1720 __f_ = 0; 1721 __f.__f_->__clone((__base*)&__buf_); 1722 __f.__f_->destroy(); 1723 __f.__f_ = 0; 1724 __f_ = (__base*)&__buf_; 1725 __t->__clone((__base*)&__f.__buf_); 1726 __t->destroy(); 1727 __f.__f_ = (__base*)&__f.__buf_; 1728 } 1729 else if (__f_ == (__base*)&__buf_) 1730 { 1731 __f_->__clone((__base*)&__f.__buf_); 1732 __f_->destroy(); 1733 __f_ = __f.__f_; 1734 __f.__f_ = (__base*)&__f.__buf_; 1735 } 1736 else if (__f.__f_ == (__base*)&__f.__buf_) 1737 { 1738 __f.__f_->__clone((__base*)&__buf_); 1739 __f.__f_->destroy(); 1740 __f.__f_ = __f_; 1741 __f_ = (__base*)&__buf_; 1742 } 1743 else 1744 _VSTD::swap(__f_, __f.__f_); 1745 } 1746 1747 template<class _Rp, class ..._ArgTypes> 1748 _Rp 1749 function<_Rp(_ArgTypes...)>::operator()(_ArgTypes... __arg) const 1750 { 1751 #ifndef _LIBCPP_NO_EXCEPTIONS 1752 if (__f_ == 0) 1753 throw bad_function_call(); 1754 #endif // _LIBCPP_NO_EXCEPTIONS 1755 return (*__f_)(_VSTD::forward<_ArgTypes>(__arg)...); 1756 } 1757 1758 #ifndef _LIBCPP_NO_RTTI 1759 1760 template<class _Rp, class ..._ArgTypes> 1761 const std::type_info& 1762 function<_Rp(_ArgTypes...)>::target_type() const _NOEXCEPT 1763 { 1764 if (__f_ == 0) 1765 return typeid(void); 1766 return __f_->target_type(); 1767 } 1768 1769 template<class _Rp, class ..._ArgTypes> 1770 template <typename _Tp> 1771 _Tp* 1772 function<_Rp(_ArgTypes...)>::target() _NOEXCEPT 1773 { 1774 if (__f_ == 0) 1775 return (_Tp*)0; 1776 return (_Tp*)__f_->target(typeid(_Tp)); 1777 } 1778 1779 template<class _Rp, class ..._ArgTypes> 1780 template <typename _Tp> 1781 const _Tp* 1782 function<_Rp(_ArgTypes...)>::target() const _NOEXCEPT 1783 { 1784 if (__f_ == 0) 1785 return (const _Tp*)0; 1786 return (const _Tp*)__f_->target(typeid(_Tp)); 1787 } 1788 1789 #endif // _LIBCPP_NO_RTTI 1790 1791 template <class _Rp, class... _ArgTypes> 1792 inline _LIBCPP_INLINE_VISIBILITY 1793 bool 1794 operator==(const function<_Rp(_ArgTypes...)>& __f, nullptr_t) _NOEXCEPT {return !__f;} 1795 1796 template <class _Rp, class... _ArgTypes> 1797 inline _LIBCPP_INLINE_VISIBILITY 1798 bool 1799 operator==(nullptr_t, const function<_Rp(_ArgTypes...)>& __f) _NOEXCEPT {return !__f;} 1800 1801 template <class _Rp, class... _ArgTypes> 1802 inline _LIBCPP_INLINE_VISIBILITY 1803 bool 1804 operator!=(const function<_Rp(_ArgTypes...)>& __f, nullptr_t) _NOEXCEPT {return (bool)__f;} 1805 1806 template <class _Rp, class... _ArgTypes> 1807 inline _LIBCPP_INLINE_VISIBILITY 1808 bool 1809 operator!=(nullptr_t, const function<_Rp(_ArgTypes...)>& __f) _NOEXCEPT {return (bool)__f;} 1810 1811 template <class _Rp, class... _ArgTypes> 1812 inline _LIBCPP_INLINE_VISIBILITY 1813 void 1814 swap(function<_Rp(_ArgTypes...)>& __x, function<_Rp(_ArgTypes...)>& __y) _NOEXCEPT 1815 {return __x.swap(__y);} 1816 1817 template<class _Tp> struct __is_bind_expression : public false_type {}; 1818 template<class _Tp> struct _LIBCPP_TYPE_VIS_ONLY is_bind_expression 1819 : public __is_bind_expression<typename remove_cv<_Tp>::type> {}; 1820 1821 template<class _Tp> struct __is_placeholder : public integral_constant<int, 0> {}; 1822 template<class _Tp> struct _LIBCPP_TYPE_VIS_ONLY is_placeholder 1823 : public __is_placeholder<typename remove_cv<_Tp>::type> {}; 1824 1825 namespace placeholders 1826 { 1827 1828 template <int _Np> struct __ph {}; 1829 1830 _LIBCPP_FUNC_VIS extern __ph<1> _1; 1831 _LIBCPP_FUNC_VIS extern __ph<2> _2; 1832 _LIBCPP_FUNC_VIS extern __ph<3> _3; 1833 _LIBCPP_FUNC_VIS extern __ph<4> _4; 1834 _LIBCPP_FUNC_VIS extern __ph<5> _5; 1835 _LIBCPP_FUNC_VIS extern __ph<6> _6; 1836 _LIBCPP_FUNC_VIS extern __ph<7> _7; 1837 _LIBCPP_FUNC_VIS extern __ph<8> _8; 1838 _LIBCPP_FUNC_VIS extern __ph<9> _9; 1839 _LIBCPP_FUNC_VIS extern __ph<10> _10; 1840 1841 } // placeholders 1842 1843 template<int _Np> 1844 struct __is_placeholder<placeholders::__ph<_Np> > 1845 : public integral_constant<int, _Np> {}; 1846 1847 template <class _Tp, class _Uj> 1848 inline _LIBCPP_INLINE_VISIBILITY 1849 _Tp& 1850 __mu(reference_wrapper<_Tp> __t, _Uj&) 1851 { 1852 return __t.get(); 1853 } 1854 1855 template <class _Ti, class ..._Uj, size_t ..._Indx> 1856 inline _LIBCPP_INLINE_VISIBILITY 1857 typename __invoke_of<_Ti&, _Uj...>::type 1858 __mu_expand(_Ti& __ti, tuple<_Uj...>& __uj, __tuple_indices<_Indx...>) 1859 { 1860 return __ti(_VSTD::forward<_Uj>(get<_Indx>(__uj))...); 1861 } 1862 1863 template <class _Ti, class ..._Uj> 1864 inline _LIBCPP_INLINE_VISIBILITY 1865 typename enable_if 1866 < 1867 is_bind_expression<_Ti>::value, 1868 typename __invoke_of<_Ti&, _Uj...>::type 1869 >::type 1870 __mu(_Ti& __ti, tuple<_Uj...>& __uj) 1871 { 1872 typedef typename __make_tuple_indices<sizeof...(_Uj)>::type __indices; 1873 return __mu_expand(__ti, __uj, __indices()); 1874 } 1875 1876 template <bool IsPh, class _Ti, class _Uj> 1877 struct __mu_return2 {}; 1878 1879 template <class _Ti, class _Uj> 1880 struct __mu_return2<true, _Ti, _Uj> 1881 { 1882 typedef typename tuple_element<is_placeholder<_Ti>::value - 1, _Uj>::type type; 1883 }; 1884 1885 template <class _Ti, class _Uj> 1886 inline _LIBCPP_INLINE_VISIBILITY 1887 typename enable_if 1888 < 1889 0 < is_placeholder<_Ti>::value, 1890 typename __mu_return2<0 < is_placeholder<_Ti>::value, _Ti, _Uj>::type 1891 >::type 1892 __mu(_Ti&, _Uj& __uj) 1893 { 1894 const size_t _Indx = is_placeholder<_Ti>::value - 1; 1895 return _VSTD::forward<typename tuple_element<_Indx, _Uj>::type>(get<_Indx>(__uj)); 1896 } 1897 1898 template <class _Ti, class _Uj> 1899 inline _LIBCPP_INLINE_VISIBILITY 1900 typename enable_if 1901 < 1902 !is_bind_expression<_Ti>::value && 1903 is_placeholder<_Ti>::value == 0 && 1904 !__is_reference_wrapper<_Ti>::value, 1905 _Ti& 1906 >::type 1907 __mu(_Ti& __ti, _Uj&) 1908 { 1909 return __ti; 1910 } 1911 1912 template <class _Ti, bool IsReferenceWrapper, bool IsBindEx, bool IsPh, 1913 class _TupleUj> 1914 struct ____mu_return; 1915 1916 template <bool _Invokable, class _Ti, class ..._Uj> 1917 struct ____mu_return_invokable // false 1918 { 1919 typedef __nat type; 1920 }; 1921 1922 template <class _Ti, class ..._Uj> 1923 struct ____mu_return_invokable<true, _Ti, _Uj...> 1924 { 1925 typedef typename __invoke_of<_Ti&, _Uj...>::type type; 1926 }; 1927 1928 template <class _Ti, class ..._Uj> 1929 struct ____mu_return<_Ti, false, true, false, tuple<_Uj...> > 1930 : public ____mu_return_invokable<__invokable<_Ti&, _Uj...>::value, _Ti, _Uj...> 1931 { 1932 }; 1933 1934 template <class _Ti, class _TupleUj> 1935 struct ____mu_return<_Ti, false, false, true, _TupleUj> 1936 { 1937 typedef typename tuple_element<is_placeholder<_Ti>::value - 1, 1938 _TupleUj>::type&& type; 1939 }; 1940 1941 template <class _Ti, class _TupleUj> 1942 struct ____mu_return<_Ti, true, false, false, _TupleUj> 1943 { 1944 typedef typename _Ti::type& type; 1945 }; 1946 1947 template <class _Ti, class _TupleUj> 1948 struct ____mu_return<_Ti, false, false, false, _TupleUj> 1949 { 1950 typedef _Ti& type; 1951 }; 1952 1953 template <class _Ti, class _TupleUj> 1954 struct __mu_return 1955 : public ____mu_return<_Ti, 1956 __is_reference_wrapper<_Ti>::value, 1957 is_bind_expression<_Ti>::value, 1958 0 < is_placeholder<_Ti>::value && 1959 is_placeholder<_Ti>::value <= tuple_size<_TupleUj>::value, 1960 _TupleUj> 1961 { 1962 }; 1963 1964 template <class _Fp, class _BoundArgs, class _TupleUj> 1965 struct _is_valid_bind_return 1966 { 1967 static const bool value = false; 1968 }; 1969 1970 template <class _Fp, class ..._BoundArgs, class _TupleUj> 1971 struct _is_valid_bind_return<_Fp, tuple<_BoundArgs...>, _TupleUj> 1972 { 1973 static const bool value = __invokable<_Fp, 1974 typename __mu_return<_BoundArgs, _TupleUj>::type...>::value; 1975 }; 1976 1977 template <class _Fp, class ..._BoundArgs, class _TupleUj> 1978 struct _is_valid_bind_return<_Fp, const tuple<_BoundArgs...>, _TupleUj> 1979 { 1980 static const bool value = __invokable<_Fp, 1981 typename __mu_return<const _BoundArgs, _TupleUj>::type...>::value; 1982 }; 1983 1984 template <class _Fp, class _BoundArgs, class _TupleUj, 1985 bool = _is_valid_bind_return<_Fp, _BoundArgs, _TupleUj>::value> 1986 struct __bind_return; 1987 1988 template <class _Fp, class ..._BoundArgs, class _TupleUj> 1989 struct __bind_return<_Fp, tuple<_BoundArgs...>, _TupleUj, true> 1990 { 1991 typedef typename __invoke_of 1992 < 1993 _Fp&, 1994 typename __mu_return 1995 < 1996 _BoundArgs, 1997 _TupleUj 1998 >::type... 1999 >::type type; 2000 }; 2001 2002 template <class _Fp, class ..._BoundArgs, class _TupleUj> 2003 struct __bind_return<_Fp, const tuple<_BoundArgs...>, _TupleUj, true> 2004 { 2005 typedef typename __invoke_of 2006 < 2007 _Fp&, 2008 typename __mu_return 2009 < 2010 const _BoundArgs, 2011 _TupleUj 2012 >::type... 2013 >::type type; 2014 }; 2015 2016 template <class _Fp, class _BoundArgs, size_t ..._Indx, class _Args> 2017 inline _LIBCPP_INLINE_VISIBILITY 2018 typename __bind_return<_Fp, _BoundArgs, _Args>::type 2019 __apply_functor(_Fp& __f, _BoundArgs& __bound_args, __tuple_indices<_Indx...>, 2020 _Args&& __args) 2021 { 2022 return __invoke(__f, __mu(get<_Indx>(__bound_args), __args)...); 2023 } 2024 2025 template<class _Fp, class ..._BoundArgs> 2026 class __bind 2027 : public __weak_result_type<typename decay<_Fp>::type> 2028 { 2029 protected: 2030 typedef typename decay<_Fp>::type _Fd; 2031 typedef tuple<typename decay<_BoundArgs>::type...> _Td; 2032 private: 2033 _Fd __f_; 2034 _Td __bound_args_; 2035 2036 typedef typename __make_tuple_indices<sizeof...(_BoundArgs)>::type __indices; 2037 public: 2038 #ifdef _LIBCPP_HAS_NO_DEFAULTED_FUNCTIONS 2039 2040 _LIBCPP_INLINE_VISIBILITY 2041 __bind(const __bind& __b) 2042 : __f_(__b.__f_), 2043 __bound_args_(__b.__bound_args_) {} 2044 2045 _LIBCPP_INLINE_VISIBILITY 2046 __bind& operator=(const __bind& __b) 2047 { 2048 __f_ = __b.__f_; 2049 __bound_args_ = __b.__bound_args_; 2050 return *this; 2051 } 2052 2053 _LIBCPP_INLINE_VISIBILITY 2054 __bind(__bind&& __b) 2055 : __f_(_VSTD::move(__b.__f_)), 2056 __bound_args_(_VSTD::move(__b.__bound_args_)) {} 2057 2058 _LIBCPP_INLINE_VISIBILITY 2059 __bind& operator=(__bind&& __b) 2060 { 2061 __f_ = _VSTD::move(__b.__f_); 2062 __bound_args_ = _VSTD::move(__b.__bound_args_); 2063 return *this; 2064 } 2065 2066 #endif // _LIBCPP_HAS_NO_DEFAULTED_FUNCTIONS 2067 2068 template <class _Gp, class ..._BA, 2069 class = typename enable_if 2070 < 2071 is_constructible<_Fd, _Gp>::value && 2072 !is_same<typename remove_reference<_Gp>::type, 2073 __bind>::value 2074 >::type> 2075 _LIBCPP_INLINE_VISIBILITY 2076 explicit __bind(_Gp&& __f, _BA&& ...__bound_args) 2077 : __f_(_VSTD::forward<_Gp>(__f)), 2078 __bound_args_(_VSTD::forward<_BA>(__bound_args)...) {} 2079 2080 template <class ..._Args> 2081 _LIBCPP_INLINE_VISIBILITY 2082 typename __bind_return<_Fd, _Td, tuple<_Args&&...> >::type 2083 operator()(_Args&& ...__args) 2084 { 2085 return __apply_functor(__f_, __bound_args_, __indices(), 2086 tuple<_Args&&...>(_VSTD::forward<_Args>(__args)...)); 2087 } 2088 2089 template <class ..._Args> 2090 _LIBCPP_INLINE_VISIBILITY 2091 typename __bind_return<const _Fd, const _Td, tuple<_Args&&...> >::type 2092 operator()(_Args&& ...__args) const 2093 { 2094 return __apply_functor(__f_, __bound_args_, __indices(), 2095 tuple<_Args&&...>(_VSTD::forward<_Args>(__args)...)); 2096 } 2097 }; 2098 2099 template<class _Fp, class ..._BoundArgs> 2100 struct __is_bind_expression<__bind<_Fp, _BoundArgs...> > : public true_type {}; 2101 2102 template<class _Rp, class _Fp, class ..._BoundArgs> 2103 class __bind_r 2104 : public __bind<_Fp, _BoundArgs...> 2105 { 2106 typedef __bind<_Fp, _BoundArgs...> base; 2107 typedef typename base::_Fd _Fd; 2108 typedef typename base::_Td _Td; 2109 public: 2110 typedef _Rp result_type; 2111 2112 #ifdef _LIBCPP_HAS_NO_DEFAULTED_FUNCTIONS 2113 2114 _LIBCPP_INLINE_VISIBILITY 2115 __bind_r(const __bind_r& __b) 2116 : base(_VSTD::forward<const base&>(__b)) {} 2117 2118 _LIBCPP_INLINE_VISIBILITY 2119 __bind_r& operator=(const __bind_r& __b) 2120 { 2121 base::operator=(_VSTD::forward<const base&>(__b)); 2122 return *this; 2123 } 2124 2125 _LIBCPP_INLINE_VISIBILITY 2126 __bind_r(__bind_r&& __b) 2127 : base(_VSTD::forward<base>(__b)) {} 2128 2129 _LIBCPP_INLINE_VISIBILITY 2130 __bind_r& operator=(__bind_r&& __b) 2131 { 2132 base::operator=(_VSTD::forward<base>(__b)); 2133 return *this; 2134 } 2135 2136 #endif // _LIBCPP_HAS_NO_DEFAULTED_FUNCTIONS 2137 2138 template <class _Gp, class ..._BA, 2139 class = typename enable_if 2140 < 2141 is_constructible<_Fd, _Gp>::value && 2142 !is_same<typename remove_reference<_Gp>::type, 2143 __bind_r>::value 2144 >::type> 2145 _LIBCPP_INLINE_VISIBILITY 2146 explicit __bind_r(_Gp&& __f, _BA&& ...__bound_args) 2147 : base(_VSTD::forward<_Gp>(__f), 2148 _VSTD::forward<_BA>(__bound_args)...) {} 2149 2150 template <class ..._Args> 2151 _LIBCPP_INLINE_VISIBILITY 2152 typename enable_if 2153 < 2154 is_convertible<typename __bind_return<_Fd, _Td, tuple<_Args&&...> >::type, 2155 result_type>::value, 2156 result_type 2157 >::type 2158 operator()(_Args&& ...__args) 2159 { 2160 return base::operator()(_VSTD::forward<_Args>(__args)...); 2161 } 2162 2163 template <class ..._Args> 2164 _LIBCPP_INLINE_VISIBILITY 2165 typename enable_if 2166 < 2167 is_convertible<typename __bind_return<const _Fd, const _Td, tuple<_Args&&...> >::type, 2168 result_type>::value, 2169 result_type 2170 >::type 2171 operator()(_Args&& ...__args) const 2172 { 2173 return base::operator()(_VSTD::forward<_Args>(__args)...); 2174 } 2175 }; 2176 2177 template<class _Rp, class _Fp, class ..._BoundArgs> 2178 struct __is_bind_expression<__bind_r<_Rp, _Fp, _BoundArgs...> > : public true_type {}; 2179 2180 template<class _Fp, class ..._BoundArgs> 2181 inline _LIBCPP_INLINE_VISIBILITY 2182 __bind<_Fp, _BoundArgs...> 2183 bind(_Fp&& __f, _BoundArgs&&... __bound_args) 2184 { 2185 typedef __bind<_Fp, _BoundArgs...> type; 2186 return type(_VSTD::forward<_Fp>(__f), _VSTD::forward<_BoundArgs>(__bound_args)...); 2187 } 2188 2189 template<class _Rp, class _Fp, class ..._BoundArgs> 2190 inline _LIBCPP_INLINE_VISIBILITY 2191 __bind_r<_Rp, _Fp, _BoundArgs...> 2192 bind(_Fp&& __f, _BoundArgs&&... __bound_args) 2193 { 2194 typedef __bind_r<_Rp, _Fp, _BoundArgs...> type; 2195 return type(_VSTD::forward<_Fp>(__f), _VSTD::forward<_BoundArgs>(__bound_args)...); 2196 } 2197 2198 #endif // _LIBCPP_HAS_NO_VARIADICS 2199 2200 template <> 2201 struct _LIBCPP_TYPE_VIS_ONLY hash<bool> 2202 : public unary_function<bool, size_t> 2203 { 2204 _LIBCPP_INLINE_VISIBILITY 2205 size_t operator()(bool __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2206 }; 2207 2208 template <> 2209 struct _LIBCPP_TYPE_VIS_ONLY hash<char> 2210 : public unary_function<char, size_t> 2211 { 2212 _LIBCPP_INLINE_VISIBILITY 2213 size_t operator()(char __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2214 }; 2215 2216 template <> 2217 struct _LIBCPP_TYPE_VIS_ONLY hash<signed char> 2218 : public unary_function<signed char, size_t> 2219 { 2220 _LIBCPP_INLINE_VISIBILITY 2221 size_t operator()(signed char __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2222 }; 2223 2224 template <> 2225 struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned char> 2226 : public unary_function<unsigned char, size_t> 2227 { 2228 _LIBCPP_INLINE_VISIBILITY 2229 size_t operator()(unsigned char __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2230 }; 2231 2232 #ifndef _LIBCPP_HAS_NO_UNICODE_CHARS 2233 2234 template <> 2235 struct _LIBCPP_TYPE_VIS_ONLY hash<char16_t> 2236 : public unary_function<char16_t, size_t> 2237 { 2238 _LIBCPP_INLINE_VISIBILITY 2239 size_t operator()(char16_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2240 }; 2241 2242 template <> 2243 struct _LIBCPP_TYPE_VIS_ONLY hash<char32_t> 2244 : public unary_function<char32_t, size_t> 2245 { 2246 _LIBCPP_INLINE_VISIBILITY 2247 size_t operator()(char32_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2248 }; 2249 2250 #endif // _LIBCPP_HAS_NO_UNICODE_CHARS 2251 2252 template <> 2253 struct _LIBCPP_TYPE_VIS_ONLY hash<wchar_t> 2254 : public unary_function<wchar_t, size_t> 2255 { 2256 _LIBCPP_INLINE_VISIBILITY 2257 size_t operator()(wchar_t __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2258 }; 2259 2260 template <> 2261 struct _LIBCPP_TYPE_VIS_ONLY hash<short> 2262 : public unary_function<short, size_t> 2263 { 2264 _LIBCPP_INLINE_VISIBILITY 2265 size_t operator()(short __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2266 }; 2267 2268 template <> 2269 struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned short> 2270 : public unary_function<unsigned short, size_t> 2271 { 2272 _LIBCPP_INLINE_VISIBILITY 2273 size_t operator()(unsigned short __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2274 }; 2275 2276 template <> 2277 struct _LIBCPP_TYPE_VIS_ONLY hash<int> 2278 : public unary_function<int, size_t> 2279 { 2280 _LIBCPP_INLINE_VISIBILITY 2281 size_t operator()(int __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2282 }; 2283 2284 template <> 2285 struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned int> 2286 : public unary_function<unsigned int, size_t> 2287 { 2288 _LIBCPP_INLINE_VISIBILITY 2289 size_t operator()(unsigned int __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2290 }; 2291 2292 template <> 2293 struct _LIBCPP_TYPE_VIS_ONLY hash<long> 2294 : public unary_function<long, size_t> 2295 { 2296 _LIBCPP_INLINE_VISIBILITY 2297 size_t operator()(long __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2298 }; 2299 2300 template <> 2301 struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned long> 2302 : public unary_function<unsigned long, size_t> 2303 { 2304 _LIBCPP_INLINE_VISIBILITY 2305 size_t operator()(unsigned long __v) const _NOEXCEPT {return static_cast<size_t>(__v);} 2306 }; 2307 2308 template <> 2309 struct _LIBCPP_TYPE_VIS_ONLY hash<long long> 2310 : public __scalar_hash<long long> 2311 { 2312 }; 2313 2314 template <> 2315 struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned long long> 2316 : public __scalar_hash<unsigned long long> 2317 { 2318 }; 2319 2320 template <> 2321 struct _LIBCPP_TYPE_VIS_ONLY hash<float> 2322 : public __scalar_hash<float> 2323 { 2324 _LIBCPP_INLINE_VISIBILITY 2325 size_t operator()(float __v) const _NOEXCEPT 2326 { 2327 // -0.0 and 0.0 should return same hash 2328 if (__v == 0) 2329 return 0; 2330 return __scalar_hash<float>::operator()(__v); 2331 } 2332 }; 2333 2334 template <> 2335 struct _LIBCPP_TYPE_VIS_ONLY hash<double> 2336 : public __scalar_hash<double> 2337 { 2338 _LIBCPP_INLINE_VISIBILITY 2339 size_t operator()(double __v) const _NOEXCEPT 2340 { 2341 // -0.0 and 0.0 should return same hash 2342 if (__v == 0) 2343 return 0; 2344 return __scalar_hash<double>::operator()(__v); 2345 } 2346 }; 2347 2348 template <> 2349 struct _LIBCPP_TYPE_VIS_ONLY hash<long double> 2350 : public __scalar_hash<long double> 2351 { 2352 _LIBCPP_INLINE_VISIBILITY 2353 size_t operator()(long double __v) const _NOEXCEPT 2354 { 2355 // -0.0 and 0.0 should return same hash 2356 if (__v == 0) 2357 return 0; 2358 #if defined(__i386__) 2359 // Zero out padding bits 2360 union 2361 { 2362 long double __t; 2363 struct 2364 { 2365 size_t __a; 2366 size_t __b; 2367 size_t __c; 2368 size_t __d; 2369 }; 2370 } __u; 2371 __u.__a = 0; 2372 __u.__b = 0; 2373 __u.__c = 0; 2374 __u.__d = 0; 2375 __u.__t = __v; 2376 return __u.__a ^ __u.__b ^ __u.__c ^ __u.__d; 2377 #elif defined(__x86_64__) 2378 // Zero out padding bits 2379 union 2380 { 2381 long double __t; 2382 struct 2383 { 2384 size_t __a; 2385 size_t __b; 2386 }; 2387 } __u; 2388 __u.__a = 0; 2389 __u.__b = 0; 2390 __u.__t = __v; 2391 return __u.__a ^ __u.__b; 2392 #else 2393 return __scalar_hash<long double>::operator()(__v); 2394 #endif 2395 } 2396 }; 2397 2398 #if _LIBCPP_STD_VER > 11 2399 template <class _Tp> 2400 struct _LIBCPP_TYPE_VIS_ONLY hash 2401 : public unary_function<_Tp, size_t> 2402 { 2403 static_assert(is_enum<_Tp>::value, "This hash only works for enumeration types"); 2404 2405 _LIBCPP_INLINE_VISIBILITY 2406 size_t operator()(_Tp __v) const _NOEXCEPT 2407 { 2408 typedef typename underlying_type<_Tp>::type type; 2409 return hash<type>{}(static_cast<type>(__v)); 2410 } 2411 }; 2412 #endif 2413 2414 // struct hash<T*> in <memory> 2415 2416 _LIBCPP_END_NAMESPACE_STD 2417 2418 #endif // _LIBCPP_FUNCTIONAL 2419
