std::__exception_ptr Namespace Reference

Classes
class	exception_ptr
	An opaque pointer to an arbitrary exception. More...

Functions
bool	operator!= (const exception_ptr &, const exception_ptr &) _GLIBCXX_USE_NOEXCEPT __attribute__((__pure__))
bool	operator== (const exception_ptr &, const exception_ptr &) _GLIBCXX_USE_NOEXCEPT __attribute__((__pure__))
void	swap (exception_ptr &__lhs, exception_ptr &__rhs)

Function Documentation

bool std::__exception_ptr::operator!=	(	const exception_ptr &	,
		const exception_ptr &
	)

Referenced by _GLIBCXX_VISIBILITY().

Here is the caller graph for this function:

bool std::__exception_ptr::operator==	(	const exception_ptr &	,
		const exception_ptr &
	)

Referenced by _GLIBCXX_VISIBILITY().

Here is the caller graph for this function:

void std::__exception_ptr::swap ( exception_ptr &  __lhs, exception_ptr &  __rhs  )

inline

Referenced by __gnu_parallel::_LoserTree< __stable, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTree< false, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTreePointer< __stable, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTreePointer< false, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTreeUnguarded< __stable, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTreeUnguarded< false, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTreePointerUnguarded< __stable, _Tp, _Compare >::__delete_min_insert(), __gnu_parallel::_LoserTreePointerUnguarded< false, _Tp, _Compare >::__delete_min_insert(), _GLIBCXX_VISIBILITY(), __gnu_debug::_Safe_local_iterator< _Iterator, _Sequence >::_Safe_local_iterator(), __gnu_pbds::detail::trie_policy_base< Node_CItr, Node_Itr, _ATraits, _Alloc >::common_prefix_len(), __gnu_pbds::detail::mask_based_range_hashing< Size_Type >::swap(), __gnu_pbds::detail::mod_based_range_hashing< Size_Type >::swap(), __gnu_pbds::detail::hash_load_check_resize_trigger_size_base< Size_Type, true >::swap(), __gnu_pbds::detail::hash_eq_fn< Key, Eq_Fn, _Alloc, false >::swap(), __gnu_pbds::detail::rc< _Node, _Alloc >::swap(), __gnu_pbds::detail::resize_policy< _Tp >::swap(), __gnu_pbds::detail::ranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, false >::swap(), __gnu_pbds::detail::ranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, false >::swap(), __gnu_pbds::detail::hash_eq_fn< Key, Eq_Fn, _Alloc, true >::swap(), __gnu_pbds::priority_queue< _Tv, Cmp_Fn, Tag, _Alloc >::swap(), __gnu_pbds::detail::ranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, true >::swap(), __gnu_pbds::detail::ranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, true >::swap(), __gnu_pbds::detail::ranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, false >::swap(), __gnu_pbds::detail::ranged_probe_fn< Key, null_type, _Alloc, Comb_Probe_Fn, null_type, false >::swap(), __gnu_pbds::cc_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Comb_Hash_Fn, Resize_Policy, Store_Hash, _Alloc >::swap(), __gnu_pbds::detail::ranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, true >::swap(), __gnu_pbds::gp_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Comb_Probe_Fn, Probe_Fn, Resize_Policy, Store_Hash, _Alloc >::swap(), __gnu_pbds::tree< Key, Mapped, Cmp_Fn, Tag, Node_Update, _Alloc >::swap(), __gnu_pbds::trie< Key, Mapped, _ATraits, Tag, Node_Update, _Alloc >::swap(), and __gnu_pbds::list_update< Key, Mapped, Eq_Fn, Update_Policy, _Alloc >::swap().

Here is the caller graph for this function: