std::__profile(3cxx)
std::__profile(3cxx)
β¨ NAME β¨
std::__profile β GNU profile code, and it replaces standard behavior with profile behavior. no cap, bestie. π
β¨ SYNOPSIS β¨
πΈ Classes πΈ
class bitsetβ a wrapper aroundstd::bitsetwith performance instrumentation, none at the moment. πclass dequeβ a wrapper aroundstd::dequewith performance instrumentation. β¨class forward_listβ a wrapper aroundstd::forward_listwith performance instrumentation. π¦class listβ alistwrapper with performance instrumentation. πclass mapβ a wrapper aroundstd::mapwith performance instrumentation. πΈclass multimapβ a wrapper aroundstd::multimapwith performance instrumentation. πclass multisetβ a wrapper aroundstd::multisetwith performance instrumentation. πclass setβ a wrapper aroundstd::setwith performance instrumentation. βclass unordered_mapβ a wrapper aroundstd::unordered_mapwith performance instrumentation. π₯class unordered_multimapβ a wrapper aroundstd::unordered_multimapwith performance instrumentation. πclass unordered_multisetβ anunordered_multisetwrapper with performance instrumentation. πclass unordered_setβ anunordered_setwrapper with performance instrumentation. π§
π¦ Functions π¦
okay bestie, deep breath β this is the big beautiful list of every free function and operator this header blesses you with. it's a lot. it's giving β¨ overload set β¨. we go in order, no skipping, no cap. π«Ά
__are_equalβ internal helper that checks whether two_Hash_nodes are equal, with the unordered container passing along its own rules.template<typename _UnorderedCont , typename _Value , bool _Cache_hash_code> bool __are_equal (const _UnorderedCont &__uc, const __detail::_Hash_node< _Value, _Cache_hash_code > *__lhs, const __detail::_Hash_node< _Value, _Cache_hash_code > *__rhs)__get_bucket_indexβ internal helper that gets the bucket index of a given_Hash_nodeinside an unordered container.template<typename _UnorderedCont , typename _Value , bool _Cache_hash_code> std::size_t __get_bucket_index (const _UnorderedCont &__uc, const __detail::_Hash_node< _Value, _Cache_hash_code > *__node)operator!=(iterator_tracker) β the not-equal check for two__iterator_trackers, and yeah it'snoexceptπ .template<typename _Iterator , typename _Sequence > bool operator!= (const __iterator_tracker< _Iterator, _Sequence > &__lhs, const __iterator_tracker< _Iterator, _Sequence > &__rhs) noexceptoperator!=(iterator_tracker, mixed) β same energy but the two sides can be different iterator types.noexceptagain, icon behaviour.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator!= (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexceptoperator!=(deque) β not-equal for twodeques.template<typename _Tp , typename _Alloc > bool operator!= (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)operator!=(forward_list) β not-equal for twoforward_lists (note the__lx/__lynaming, she's different π).template<typename _Tp , typename _Alloc > bool operator!= (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly)operator!=(list) β not-equal for twolists.template<typename _Tp , typename _Alloc > bool operator!= (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)operator!=(map) β not-equal for twomaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator!= (const map< _Key, _Tp, _Compare, _Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator > &__rhs)operator!=(multimap) β not-equal for twomultimaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator!= (const multimap< _Key, _Tp, _Compare, _Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator > &__rhs)operator!=(multiset) β not-equal for twomultisets.template<typename _Key , typename _Compare , typename _Allocator > bool operator!= (const multiset< _Key, _Compare, _Allocator > &__lhs, const multiset< _Key, _Compare, _Allocator > &__rhs)operator!=(set) β not-equal for twosets.template<typename _Key , typename _Compare , typename _Allocator > bool operator!= (const set< _Key, _Compare, _Allocator > &__lhs, const set< _Key, _Compare, _Allocator > &__rhs)operator!=(unordered_map) β not-equal for twounordered_maps (yep,__xand__ythis time).template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > bool operator!= (const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)operator!=(unordered_multimap) β not-equal for twounordered_multimaps.template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > bool operator!= (const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)operator!=(unordered_multiset) β not-equal for twounordered_multisets.template<typename _Value , typename _Hash , typename _Pred , typename _Alloc > bool operator!= (const unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__x, const unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__y)operator!=(unordered_set) β not-equal for twounordered_sets.template<typename _Key , typename _Hash , typename _Pred , typename _Alloc > bool operator!= (const unordered_set< _Key, _Hash, _Pred, _Alloc > &__x, const unordered_set< _Key, _Hash, _Pred, _Alloc > &__y)operator!=(vector) β not-equal for twovectors.template<typename _Tp , typename _Alloc > bool operator!= (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)
operator&(bitset) β bitwise AND for two same-sizedbitsets, and it'snoexceptbecause of course she is π.template<size_t _Nb> bitset< _Nb > operator& (const bitset< _Nb > &__x, const bitset< _Nb > &__y) noexceptoperator+(iterator_tracker) β advances an__iterator_trackerby adifference_typefrom the left side.noexcept, periodt.template<typename _Iterator , typename _Sequence > __iterator_tracker< _Iterator, _Sequence > operator+ (typename __iterator_tracker< _Iterator, _Sequence >::difference_type __n, const __iterator_tracker< _Iterator, _Sequence > &__i) noexceptoperator-(iterator_tracker, same type) β distance between two__iterator_trackers, returns adifference_type.noexceptπ .template<typename _Iterator , typename _Sequence > __iterator_tracker< _Iterator, _Sequence >::difference_type operator- (const __iterator_tracker< _Iterator, _Sequence > &__lhs, const __iterator_tracker< _Iterator, _Sequence > &__rhs) noexceptoperator-(iterator_tracker, mixed) β same distance deal but the two trackers can be different iterator types.noexcept.template<typename _IteratorL , typename _IteratorR , typename _Sequence > __iterator_tracker< _IteratorL, _Sequence >::difference_type operator- (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexcept
operator<(iterator_tracker) β less-than for two__iterator_trackers,noexcept.template<typename _Iterator , typename _Sequence > bool operator< (const __iterator_tracker< _Iterator, _Sequence > &__lhs, const __iterator_tracker< _Iterator, _Sequence > &__rhs) noexceptoperator<(iterator_tracker, mixed) β less-than with two different iterator types, stillnoexcept.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator< (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexceptoperator<(deque) β less-than for twodeques.template<typename _Tp , typename _Alloc > bool operator< (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)operator<(forward_list) β less-than for twoforward_lists.template<typename _Tp , typename _Alloc > bool operator< (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly)operator<(list) β less-than for twolists.template<typename _Tp , typename _Alloc > bool operator< (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)operator<(map) β less-than for twomaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator< (const map< _Key, _Tp, _Compare, _Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator > &__rhs)operator<(multimap) β less-than for twomultimaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator< (const multimap< _Key, _Tp, _Compare, _Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator > &__rhs)operator<(multiset) β less-than for twomultisets.template<typename _Key , typename _Compare , typename _Allocator > bool operator< (const multiset< _Key, _Compare, _Allocator > &__lhs, const multiset< _Key, _Compare, _Allocator > &__rhs)operator<(set) β less-than for twosets.template<typename _Key , typename _Compare , typename _Allocator > bool operator< (const set< _Key, _Compare, _Allocator > &__lhs, const set< _Key, _Compare, _Allocator > &__rhs)operator<(vector) β less-than for twovectors.template<typename _Tp , typename _Alloc > bool operator< (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)
operator<<(bitset) β streams abitsetout to abasic_ostreamand hands the stream back.template<typename _CharT , typename _Traits , size_t _Nb> std::basic_ostream< _CharT, _Traits > & operator<< (std::basic_ostream< _CharT, _Traits > &__os, const bitset< _Nb > &__x)
operator<=(iterator_tracker) β less-than-or-equal for two__iterator_trackers,noexcept.template<typename _Iterator , typename _Sequence > bool operator<= (const __iterator_tracker< _Iterator, _Sequence > &__lhs, const __iterator_tracker< _Iterator, _Sequence > &__rhs) noexceptoperator<=(iterator_tracker, mixed) β less-than-or-equal with two different iterator types,noexcept.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator<= (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexceptoperator<=(deque) β less-than-or-equal for twodeques.template<typename _Tp , typename _Alloc > bool operator<= (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)operator<=(forward_list) β less-than-or-equal for twoforward_lists.template<typename _Tp , typename _Alloc > bool operator<= (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly)
Based on operator<.
operator<=(list) β less-than-or-equal for twolists.template<typename _Tp , typename _Alloc > bool operator<= (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)operator<=(map) β less-than-or-equal for twomaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator<= (const map< _Key, _Tp, _Compare, _Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator > &__rhs)operator<=(multimap) β less-than-or-equal for twomultimaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator<= (const multimap< _Key, _Tp, _Compare, _Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator > &__rhs)operator<=(multiset) β less-than-or-equal for twomultisets.template<typename _Key , typename _Compare , typename _Allocator > bool operator<= (const multiset< _Key, _Compare, _Allocator > &__lhs, const multiset< _Key, _Compare, _Allocator > &__rhs)operator<=(set) β less-than-or-equal for twosets.template<typename _Key , typename _Compare , typename _Allocator > bool operator<= (const set< _Key, _Compare, _Allocator > &__lhs, const set< _Key, _Compare, _Allocator > &__rhs)operator<=(vector) β less-than-or-equal for twovectors.template<typename _Tp , typename _Alloc > bool operator<= (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)
operator==(iterator_tracker) β the equality check for two__iterator_trackers,noexcept.template<typename _Iterator , typename _Sequence > bool operator== (const __iterator_tracker< _Iterator, _Sequence > &__lhs, const __iterator_tracker< _Iterator, _Sequence > &__rhs) noexceptoperator==(iterator_tracker, mixed) β equality with two different iterator types, stillnoexcept.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator== (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexceptoperator==(deque) β equality for twodeques.template<typename _Tp , typename _Alloc > bool operator== (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)operator==(forward_list) β equality for twoforward_lists.template<typename _Tp , typename _Alloc > bool operator== (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly)operator==(list) β equality for twolists.template<typename _Tp , typename _Alloc > bool operator== (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)operator==(map) β equality for twomaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator== (const map< _Key, _Tp, _Compare, _Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator > &__rhs)operator==(multimap) β equality for twomultimaps.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool operator== (const multimap< _Key, _Tp, _Compare, _Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator > &__rhs)operator==(multiset) β equality for twomultisets.template<typename _Key , typename _Compare , typename _Allocator > bool operator== (const multiset< _Key, _Compare, _Allocator > &__lhs, const multiset< _Key, _Compare, _Allocator > &__rhs)operator==(set) β equality for twosets.template<typename _Key , typename _Compare , typename _Allocator > bool operator== (const set< _Key, _Compare, _Allocator > &__lhs, const set< _Key, _Compare, _Allocator > &__rhs)operator==(unordered_map) β equality for twounordered_maps.template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > bool operator== (const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)operator==(unordered_multimap) β equality for twounordered_multimaps.template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > bool operator== (const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__x, const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > &__y)operator==(unordered_multiset) β equality for twounordered_multisets.template<typename _Value , typename _Hash , typename _Pred , typename _Alloc > bool operator== (const unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__x, const unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__y)operator==(unordered_set) β equality for twounordered_sets.template<typename _Key , typename _Hash , typename _Pred , typename _Alloc > bool operator== (const unordered_set< _Key, _Hash, _Pred, _Alloc > &__x, const unordered_set< _Key, _Hash, _Pred, _Alloc > &__y)operator==(vector) β equality for twovectors.template<typename _Tp , typename _Alloc > bool operator== (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)
okay bestie, so the SYNOPSIS is still going and it's giving encyclopedia. here's the rest of the operator overloads β every single >, >=, bitset thing, and swap, no cap. π
β¨
template<typename _Iterator , typename _Sequence > bool operator> (const
__iterator_tracker< _Iterator, _Sequence > &__lhs, const
__iterator_tracker< _Iterator, _Sequence > &__rhs) noexcept
template<typename _IteratorL , typename _IteratorR , typename _Sequence
> bool operator> (const __iterator_tracker< _IteratorL, _Sequence >
&__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs)
noexcept
template<typename _Tp , typename _Alloc > bool operator> (const deque<
_Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)
template<typename _Tp , typename _Alloc > bool operator> (const
forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc >
&__ly)
Based on operator<.
template<typename _Tp , typename _Alloc > bool operator> (const list<
_Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > bool operator> (const map< _Key, _Tp, _Compare,
_Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator >
&__rhs)
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > bool operator> (const multimap< _Key, _Tp, _Compare,
_Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator
> &__rhs)
template<typename _Key , typename _Compare , typename _Allocator > bool
operator> (const multiset< _Key, _Compare, _Allocator > &__lhs,
const multiset< _Key, _Compare, _Allocator > &__rhs)
template<typename _Key , typename _Compare , typename _Allocator > bool
operator> (const set< _Key, _Compare, _Allocator > &__lhs, const
set< _Key, _Compare, _Allocator > &__rhs)
template<typename _Tp , typename _Alloc > bool operator> (const vector<
_Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)
template<typename _Iterator , typename _Sequence > bool operator>=
(const __iterator_tracker< _Iterator, _Sequence > &__lhs, const
__iterator_tracker< _Iterator, _Sequence > &__rhs) noexcept
template<typename _IteratorL , typename _IteratorR , typename _Sequence
> bool operator>= (const __iterator_tracker< _IteratorL, _Sequence >
&__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs)
noexcept
template<typename _Tp , typename _Alloc > bool operator>= (const deque<
_Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)
template<typename _Tp , typename _Alloc > bool operator>= (const
forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc >
&__ly)
Based on operator<.
template<typename _Tp , typename _Alloc > bool operator>= (const list<
_Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > bool operator>= (const map< _Key, _Tp, _Compare,
_Allocator > &__lhs, const map< _Key, _Tp, _Compare, _Allocator >
&__rhs)
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > bool operator>= (const multimap< _Key, _Tp, _Compare,
_Allocator > &__lhs, const multimap< _Key, _Tp, _Compare, _Allocator
> &__rhs)
template<typename _Key , typename _Compare , typename _Allocator > bool
operator>= (const multiset< _Key, _Compare, _Allocator > &__lhs,
const multiset< _Key, _Compare, _Allocator > &__rhs)
template<typename _Key , typename _Compare , typename _Allocator > bool
operator>= (const set< _Key, _Compare, _Allocator > &__lhs, const
set< _Key, _Compare, _Allocator > &__rhs)
template<typename _Tp , typename _Alloc > bool operator>= (const vector<
_Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)
template<typename _CharT , typename _Traits , size_t _Nb>
std::basic_istream< _CharT, _Traits > & operator>>
(std::basic_istream< _CharT, _Traits > &__is, bitset< _Nb > &__x)
template<size_t _Nb> bitset< _Nb > operator^ (const bitset< _Nb > &__x,
const bitset< _Nb > &__y) noexcept
template<size_t _Nb> bitset< _Nb > operator| (const bitset< _Nb > &__x,
const bitset< _Nb > &__y) noexcept
template<typename _Tp , typename _Alloc > void swap (deque< _Tp, _Alloc
> &__lhs, deque< _Tp, _Alloc > &__rhs) noexcept(/*conditional */)
template<typename _Tp , typename _Alloc > void swap (forward_list< _Tp,
_Alloc > &__lx, forward_list< _Tp, _Alloc > &__ly)
noexcept(noexcept(__lx.swap(__ly)))
See std::forward_list::swap().
template<typename _Tp , typename _Alloc > void swap (list< _Tp, _Alloc >
&__lhs, list< _Tp, _Alloc > &__rhs) noexcept(/*conditional */)
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > void swap (map< _Key, _Tp, _Compare, _Allocator >
&__lhs, map< _Key, _Tp, _Compare, _Allocator > &__rhs)
noexcept(/*conditional */)
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > void swap (multimap< _Key, _Tp, _Compare, _Allocator >
&__lhs, multimap< _Key, _Tp, _Compare, _Allocator > &__rhs)
noexcept(/*conditional */)
template<typename _Key , typename _Compare , typename _Allocator > void
swap (multiset< _Key, _Compare, _Allocator > &__x, multiset< _Key,
_Compare, _Allocator > &__y) noexcept(/*conditional */)
template<typename _Key , typename _Compare , typename _Allocator > void
swap (set< _Key, _Compare, _Allocator > &__x, set< _Key, _Compare,
_Allocator > &__y) noexcept(/*conditional */)
template<typename _Key , typename _Tp , typename _Hash , typename _Pred
, typename _Alloc > void swap (unordered_map< _Key, _Tp, _Hash,
_Pred, _Alloc > &__x, unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc
> &__y) noexcept(noexcept(__x.swap(__y)))
template<typename _Key , typename _Tp , typename _Hash , typename _Pred
, typename _Alloc > void swap (unordered_multimap< _Key, _Tp, _Hash,
_Pred, _Alloc > &__x, unordered_multimap< _Key, _Tp, _Hash, _Pred,
_Alloc > &__y) noexcept(noexcept(__x.swap(__y)))
template<typename _Value , typename _Hash , typename _Pred , typename
_Alloc > void swap (unordered_multiset< _Value, _Hash, _Pred, _Alloc
> &__x, unordered_multiset< _Value, _Hash, _Pred, _Alloc > &__y)
noexcept(noexcept(__x.swap(__y)))
template<typename _Key , typename _Hash , typename _Pred , typename
_Alloc > void swap (unordered_set< _Key, _Hash, _Pred, _Alloc >
&__x, unordered_set< _Key, _Hash, _Pred, _Alloc > &__y)
noexcept(noexcept(__x.swap(__y)))
template<typename _Tp , typename _Alloc > void swap (vector< _Tp, _Alloc
> &__lhs, vector< _Tp, _Alloc > &__rhs) noexcept(/*conditional */)
π Detailed Description π¦
GNU profile code, replaces standard behavior with profile behavior. that's the whole vibe, bestie β it's giving "we swapped the normal stuff for the profile stuff," periodt. π
π Function Documentation β¨
__are_equal
template<typename _UnorderedCont , typename _Value , bool _Cache_hash_code>
bool std::__profile::__are_equal (const _UnorderedCont & __uc, const
__detail::_Hash_node< _Value, _Cache_hash_code > * __lhs, const
__detail::_Hash_node< _Value, _Cache_hash_code > * __rhs)
Definition at line 138 of file unordered_base.h.
__get_bucket_index
template<typename _UnorderedCont , typename _Value , bool _Cache_hash_code>
std::size_t std::__profile::__get_bucket_index (const _UnorderedCont &
__uc, const __detail::_Hash_node< _Value, _Cache_hash_code > * __node)
Definition at line 71 of file unordered_base.h.
operator!= for __iterator_tracker (two params)
template<typename _Iterator , typename _Sequence > bool
std::__profile::operator!= (const __iterator_tracker< _Iterator,
_Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > &
__rhs) [inline], [noexcept]
Definition at line 197 of file iterator_tracker.h.
operator!= for __iterator_tracker (three params)
template<typename _IteratorL , typename _IteratorR , typename _Sequence >
bool std::__profile::operator!= (const __iterator_tracker< _IteratorL,
_Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > &
__rhs) [inline], [noexcept]
Definition at line 190 of file iterator_tracker.h.
operator!= for deque
template<typename _Tp , typename _Alloc > bool std::__profile::operator!=
(const deque< _Tp, _Alloc > & __lhs, const deque< _Tp, _Alloc > & __rhs)
[inline]
Definition at line 151 of file profile/deque.
operator!= for forward_list
template<typename _Tp , typename _Alloc > bool std::__profile::operator!=
(const forward_list< _Tp, _Alloc > & __lx, const forward_list< _Tp,
_Alloc > & __ly) [inline]
Definition at line 181 of file profile/forward_list.
operator!= for list
template<typename _Tp , typename _Alloc > bool std::__profile::operator!=
(const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs)
[inline]
Definition at line 613 of file profile/list.
operator!= for map
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > bool std::__profile::operator!= (const map< _Key, _Tp,
_Compare, _Allocator > & __lhs, const map< _Key, _Tp, _Compare,
_Allocator > & __rhs) [inline]
Definition at line 669 of file profile/map.h.
operator!= for multimap
template<typename _Key , typename _Tp , typename _Compare , typename
_Allocator > bool std::__profile::operator!= (const multimap< _Key, _Tp,
_Compare, _Allocator > & __lhs, const multimap< _Key, _Tp, _Compare,
_Allocator > & __rhs) [inline]
Definition at line 627 of file profile/multimap.h.
operator!= for multiset
template<typename _Key , typename _Compare , typename _Allocator > bool
std::__profile::operator!= (const multiset< _Key, _Compare, _Allocator >
& __lhs, const multiset< _Key, _Compare, _Allocator > & __rhs) [inline]
Definition at line 615 of file profile/multiset.h.
operator!= for set
template<typename _Key , typename _Compare , typename _Allocator > bool
std::__profile::operator!= (const set< _Key, _Compare, _Allocator > &
__lhs, const set< _Key, _Compare, _Allocator > & __rhs) [inline]
Definition at line 596 of file profile/set.h.
operator!= for unordered_map
template<typename _Key , typename _Tp , typename _Hash , typename _Pred ,
typename _Alloc > bool std::__profile::operator!= (const unordered_map<
_Key, _Tp, _Hash, _Pred, _Alloc > & __x, const unordered_map< _Key, _Tp,
_Hash, _Pred, _Alloc > & __y) [inline]
Definition at line 315 of file profile/unordered_map.
operator!= for unordered_multimap
template<typename _Key , typename _Tp , typename _Hash , typename _Pred ,
typename _Alloc > bool std::__profile::operator!= (const
unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, const
unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __y) [inline]
Definition at line 574 of file profile/unordered_map.
operator!= for unordered_multiset
template<typename _Value , typename _Hash , typename _Pred , typename _Alloc
> bool std::__profile::operator!= (const unordered_multiset< _Value,
_Hash, _Pred, _Alloc > & __x, const unordered_multiset< _Value, _Hash,
_Pred, _Alloc > & __y) [inline]
Definition at line 549 of file profile/unordered_set.
operator!= for unordered_set
template<typename _Key , typename _Hash , typename _Pred , typename _Alloc >
bool std::__profile::operator!= (const unordered_set< _Key, _Hash,
_Pred, _Alloc > & __x, const unordered_set< _Key, _Hash, _Pred, _Alloc >
& __y) [inline]
Definition at line 293 of file profile/unordered_set.
okay bestie we're still in the same section, no new heading, just vibes and a LOT of operators π buckle up, there's like forty of them and every single one is getting its moment β¨
template<typename _Tp , typename _Alloc > bool std::__profile::operator!= (const vector< _Tp, _Alloc > & __lhs, const vector< _Tp, _Alloc > & __rhs) [inline]β Definition at line 519 of fileprofile/vector.template<size_t _Nb> bitset< _Nb > std::__profile::operator& (const bitset< _Nb > & __x, const bitset< _Nb > & __y) [noexcept]β Definition at line 205 of fileprofile/bitset. bitwise AND, but make it profiled π₯template<typename _Iterator , typename _Sequence > __iterator_tracker< _Iterator, _Sequence > std::__profile::operator+ (typename __iterator_tracker< _Iterator, _Sequence >::difference_type __n, const __iterator_tracker< _Iterator, _Sequence > & __i) [inline], [noexcept]β Definition at line 278 of fileiterator_tracker.h. yes the__ncomes first, iterator on the right, that's just how it is, no notes πtemplate<typename _Iterator , typename _Sequence > __iterator_tracker< _Iterator, _Sequence >::difference_type std::__profile::operator- (const __iterator_tracker< _Iterator, _Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 271 of fileiterator_tracker.h. Same-type iterator subtraction, iconic β¨template<typename _IteratorL , typename _IteratorR , typename _Sequence > __iterator_tracker< _IteratorL, _Sequence >::difference_type std::__profile::operator- (const __iterator_tracker< _IteratorL, _Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 264 of fileiterator_tracker.h. Two different iterator types walk into a bar and the result is still an__iterator_tracker< _IteratorL, _Sequence >::difference_typeπ«Άtemplate<typename _Iterator , typename _Sequence > bool std::__profile::operator< (const __iterator_tracker< _Iterator, _Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 210 of fileiterator_tracker.h.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool std::__profile::operator< (const __iterator_tracker< _IteratorL, _Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 203 of fileiterator_tracker.h. The mixed-type twin, lowkey the same energy πtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator< (const deque< _Tp, _Alloc > & __lhs, const deque< _Tp, _Alloc > & __rhs) [inline]β Definition at line 156 of fileprofile/deque.template<typename _Tp , typename _Alloc > bool std::__profile::operator< (const forward_list< _Tp, _Alloc > & __lx, const forward_list< _Tp, _Alloc > & __ly) [inline]β Definition at line 174 of fileprofile/forward_list. Note the args are__lxand__lyhere, not__lhs/__rhs, and we do not question it πΈtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator< (const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs) [inline]β Definition at line 618 of fileprofile/list.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator< (const map< _Key, _Tp, _Compare, _Allocator > & __lhs, const map< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]β Definition at line 657 of fileprofile/map.h.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator< (const multimap< _Key, _Tp, _Compare, _Allocator > & __lhs, const multimap< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]β Definition at line 615 of fileprofile/multimap.h.template<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator< (const multiset< _Key, _Compare, _Allocator > & __lhs, const multiset< _Key, _Compare, _Allocator > & __rhs) [inline]β Definition at line 604 of fileprofile/multiset.h.template<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator< (const set< _Key, _Compare, _Allocator > & __lhs, const set< _Key, _Compare, _Allocator > & __rhs) [inline]β Definition at line 585 of fileprofile/set.h.template<typename _Tp , typename _Alloc > bool std::__profile::operator< (const vector< _Tp, _Alloc > & __lhs, const vector< _Tp, _Alloc > & __rhs) [inline]β Definition at line 524 of fileprofile/vector.template<typename _CharT , typename _Traits , size_t _Nb> std::basic_ostream< _CharT, _Traits > & std::__profile::operator<< (std::basic_ostream< _CharT, _Traits > & __os, const bitset< _Nb > & __x)β Definition at line 220 of fileprofile/bitset. the streaming one!! the one that lets you actually print a bitset, we love to see it π
okay now the <= girlies, same lineup, same energy β¨
template<typename _Iterator , typename _Sequence > bool std::__profile::operator<= (const __iterator_tracker< _Iterator, _Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 224 of fileiterator_tracker.h.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool std::__profile::operator<= (const __iterator_tracker< _IteratorL, _Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 217 of fileiterator_tracker.h.template<typename _Tp , typename _Alloc > bool std::__profile::operator<= (const deque< _Tp, _Alloc > & __lhs, const deque< _Tp, _Alloc > & __rhs) [inline]β Definition at line 162 of fileprofile/deque.template<typename _Tp , typename _Alloc > bool std::__profile::operator<= (const forward_list< _Tp, _Alloc > & __lx, const forward_list< _Tp, _Alloc > & __ly) [inline]β Based onoperator<. Definition at line 201 of fileprofile/forward_list. fr fr it just says "Based on operator<", so that's the whole story, no extra loretemplate<typename _Tp , typename _Alloc > bool std::__profile::operator<= (const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs) [inline]β Definition at line 624 of fileprofile/list.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator<= (const map< _Key, _Tp, _Compare, _Allocator > & __lhs, const map< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]β Definition at line 675 of fileprofile/map.h.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator<= (const multimap< _Key, _Tp, _Compare, _Allocator > & __lhs, const multimap< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]β Definition at line 633 of fileprofile/multimap.h.template<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator<= (const multiset< _Key, _Compare, _Allocator > & __lhs, const multiset< _Key, _Compare, _Allocator > & __rhs) [inline]β Definition at line 620 of fileprofile/multiset.h.template<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator<= (const set< _Key, _Compare, _Allocator > & __lhs, const set< _Key, _Compare, _Allocator > & __rhs) [inline]β Definition at line 601 of fileprofile/set.h.template<typename _Tp , typename _Alloc > bool std::__profile::operator<= (const vector< _Tp, _Alloc > & __lhs, const vector< _Tp, _Alloc > & __rhs) [inline]β Definition at line 530 of fileprofile/vector.
and now the == squad, aka the ones you'll actually use every day bestie π«Ά
template<typename _Iterator , typename _Sequence > bool std::__profile::operator== (const __iterator_tracker< _Iterator, _Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 183 of fileiterator_tracker.h.template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool std::__profile::operator== (const __iterator_tracker< _IteratorL, _Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 176 of fileiterator_tracker.h.template<typename _Tp , typename _Alloc > bool std::__profile::operator== (const deque< _Tp, _Alloc > & __lhs, const deque< _Tp, _Alloc > & __rhs) [inline]β Definition at line 145 of fileprofile/deque.template<typename _Tp , typename _Alloc > bool std::__profile::operator== (const forward_list< _Tp, _Alloc > & __lx, const forward_list< _Tp, _Alloc > & __ly) [inline]β Definition at line 169 of fileprofile/forward_list. Still__lx/__ly. Still not sorry πtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator== (const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs) [inline]β Definition at line 607 of fileprofile/list.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator== (const map< _Key, _Tp, _Compare, _Allocator > & __lhs, const map< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]β Definition at line 647 of fileprofile/map.h.template<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator== (const multimap< _Key, _Tp, _Compare, _Allocator > & __lhs, const multimap< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]β Definition at line 605 of fileprofile/multimap.h.template<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator== (const multiset< _Key, _Compare, _Allocator > & __lhs, const multiset< _Key, _Compare, _Allocator > & __rhs) [inline]β Definition at line 595 of fileprofile/multiset.h.template<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator== (const set< _Key, _Compare, _Allocator > & __lhs, const set< _Key, _Compare, _Allocator > & __rhs) [inline]β Definition at line 576 of fileprofile/set.h.template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > bool std::__profile::operator== (const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, const unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > & __y) [inline]β Definition at line 308 of fileprofile/unordered_map. unordered gang rise up and yes the args are__xand__yover here, different house rules π₯template<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > bool std::__profile::operator== (const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, const unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __y) [inline]β Definition at line 567 of fileprofile/unordered_map.template<typename _Value , typename _Hash , typename _Pred , typename _Alloc > bool std::__profile::operator== (const unordered_multiset< _Value, _Hash, _Pred, _Alloc > & __x, const unordered_multiset< _Value, _Hash, _Pred, _Alloc > & __y) [inline]β Definition at line 543 of fileprofile/unordered_set. Careful, this one's template param is_Value, not_Keyπ don't get caught slippingtemplate<typename _Key , typename _Hash , typename _Pred , typename _Alloc > bool std::__profile::operator== (const unordered_set< _Key, _Hash, _Pred, _Alloc > & __x, const unordered_set< _Key, _Hash, _Pred, _Alloc > & __y) [inline]β Definition at line 287 of fileprofile/unordered_set.template<typename _Tp , typename _Alloc > bool std::__profile::operator== (const vector< _Tp, _Alloc > & __lhs, const vector< _Tp, _Alloc > & __rhs) [inline]β Definition at line 513 of fileprofile/vector.template<typename _Iterator , typename _Sequence > bool std::__profile::operator> (const __iterator_tracker< _Iterator, _Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > & __rhs) [inline], [noexcept]β Definition at line 239 of fileiterator_tracker.h. and we close out on the greater-than, the main character of comparison operators πoperator>for__iterator_tracker(the mixed-iterator flavor) π βtemplate<typename _IteratorL , typename _IteratorR , typename _Sequence > bool std::__profile::operator> (const __iterator_tracker< _IteratorL, _Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > & __rhs) [inline], [noexcept]
Definition at line 232 of file iterator_tracker.h.
operator>fordequeπ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator> (const deque< _Tp, _Alloc > & __lhs, const deque< _Tp, _Alloc > & __rhs) [inline]
Definition at line 175 of file profile/deque.
operator>forforward_listβ¨ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator> (const forward_list< _Tp, _Alloc > & __lx, const forward_list< _Tp, _Alloc > & __ly) [inline]
Based on operator<.
Definition at line 188 of file profile/forward_list.
operator>forlistπ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator> (const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs) [inline]
Definition at line 637 of file profile/list.
operator>formapπ βtemplate<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator> (const map< _Key, _Tp, _Compare, _Allocator > & __lhs, const map< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]
Definition at line 690 of file profile/map.h.
operator>formultimapπΈ βtemplate<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator> (const multimap< _Key, _Tp, _Compare, _Allocator > & __lhs, const multimap< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]
Definition at line 648 of file profile/multimap.h.
operator>formultisetπ¦ βtemplate<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator> (const multiset< _Key, _Compare, _Allocator > & __lhs, const multiset< _Key, _Compare, _Allocator > & __rhs) [inline]
Definition at line 633 of file profile/multiset.h.
operator>forsetπ βtemplate<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator> (const set< _Key, _Compare, _Allocator > & __lhs, const set< _Key, _Compare, _Allocator > & __rhs) [inline]
Definition at line 614 of file profile/set.h.
operator>forvectorπ₯ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator> (const vector< _Tp, _Alloc > & __lhs, const vector< _Tp, _Alloc > & __rhs) [inline]
Definition at line 543 of file profile/vector.
operator>=for__iterator_tracker(same iterator type) π βtemplate<typename _Iterator , typename _Sequence > bool std::__profile::operator>= (const __iterator_tracker< _Iterator, _Sequence > & __lhs, const __iterator_tracker< _Iterator, _Sequence > & __rhs) [inline], [noexcept]
Definition at line 253 of file iterator_tracker.h.
operator>=for__iterator_tracker(mixed iterator types) β¨ βtemplate<typename _IteratorL , typename _IteratorR , typename _Sequence > bool std::__profile::operator>= (const __iterator_tracker< _IteratorL, _Sequence > & __lhs, const __iterator_tracker< _IteratorR, _Sequence > & __rhs) [inline], [noexcept]
Definition at line 246 of file iterator_tracker.h.
operator>=fordequeπ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator>= (const deque< _Tp, _Alloc > & __lhs, const deque< _Tp, _Alloc > & __rhs) [inline]
Definition at line 169 of file profile/deque.
operator>=forforward_listπ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator>= (const forward_list< _Tp, _Alloc > & __lx, const forward_list< _Tp, _Alloc > & __ly) [inline]
Based on operator<.
Definition at line 195 of file profile/forward_list.
operator>=forlistπ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator>= (const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs) [inline]
Definition at line 631 of file profile/list.
operator>=formapπΈ βtemplate<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator>= (const map< _Key, _Tp, _Compare, _Allocator > & __lhs, const map< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]
Definition at line 683 of file profile/map.h.
operator>=formultimapπ¦ βtemplate<typename _Key , typename _Tp , typename _Compare , typename _Allocator > bool std::__profile::operator>= (const multimap< _Key, _Tp, _Compare, _Allocator > & __lhs, const multimap< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline]
Definition at line 641 of file profile/multimap.h.
operator>=formultisetπ βtemplate<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator>= (const multiset< _Key, _Compare, _Allocator > & __lhs, const multiset< _Key, _Compare, _Allocator > & __rhs) [inline]
Definition at line 627 of file profile/multiset.h.
operator>=forsetπ₯ βtemplate<typename _Key , typename _Compare , typename _Allocator > bool std::__profile::operator>= (const set< _Key, _Compare, _Allocator > & __lhs, const set< _Key, _Compare, _Allocator > & __rhs) [inline]
Definition at line 608 of file profile/set.h.
operator>=forvectorπ βtemplate<typename _Tp , typename _Alloc > bool std::__profile::operator>= (const vector< _Tp, _Alloc > & __lhs, const vector< _Tp, _Alloc > & __rhs) [inline]
Definition at line 537 of file profile/vector.
operator>>β the stream-extraction bestie forbitsetπ§ βtemplate<typename _CharT , typename _Traits , size_t _Nb> std::basic_istream< _CharT, _Traits > & std::__profile::operator>> (std::basic_istream< _CharT, _Traits > & __is, bitset< _Nb > & __x)
Definition at line 220 of file profile/bitset.
operator^β XOR forbitsetβ¨ βtemplate<size_t _Nb> bitset< _Nb > std::__profile::operator^ (const bitset< _Nb > & __x, const bitset< _Nb > & __y) [noexcept]
Definition at line 215 of file profile/bitset.
operator|β OR forbitsetπ βtemplate<size_t _Nb> bitset< _Nb > std::__profile::operator| (const bitset< _Nb > & __x, const bitset< _Nb > & __y) [noexcept]
Definition at line 210 of file profile/bitset.
swapfordequeπ βtemplate<typename _Tp , typename _Alloc > void std::__profile::swap (deque< _Tp, _Alloc > & __lhs, deque< _Tp, _Alloc > & __rhs) [inline], [noexcept]
Definition at line 181 of file profile/deque.
swapforforward_listπ βtemplate<typename _Tp , typename _Alloc > void std::__profile::swap (forward_list< _Tp, _Alloc > & __lx, forward_list< _Tp, _Alloc > & __ly) [inline], [noexcept]
See std::forward_list::swap().
Definition at line 209 of file profile/forward_list.
swapforlistπ βtemplate<typename _Tp , typename _Alloc > void std::__profile::swap (list< _Tp, _Alloc > & __lhs, list< _Tp, _Alloc > & __rhs) [inline], [noexcept]
Definition at line 643 of file profile/list.
swapformapπ βtemplate<typename _Key , typename _Tp , typename _Compare , typename _Allocator > void std::__profile::swap (map< _Key, _Tp, _Compare, _Allocator > & __lhs, map< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline], [noexcept]
Definition at line 697 of file profile/map.h.
swapformultimapπΈ βtemplate<typename _Key , typename _Tp , typename _Compare , typename _Allocator > void std::__profile::swap (multimap< _Key, _Tp, _Compare, _Allocator > & __lhs, multimap< _Key, _Tp, _Compare, _Allocator > & __rhs) [inline], [noexcept]
Definition at line 655 of file profile/multimap.h.
swapformultisetπ¦ βtemplate<typename _Key , typename _Compare , typename _Allocator > void std::__profile::swap (multiset< _Key, _Compare, _Allocator > & __x, multiset< _Key, _Compare, _Allocator > & __y) [noexcept]
Definition at line 639 of file profile/multiset.h.
swapforsetπ βtemplate<typename _Key , typename _Compare , typename _Allocator > void std::__profile::swap (set< _Key, _Compare, _Allocator > & __x, set< _Key, _Compare, _Allocator > & __y) [noexcept]
Definition at line 620 of file profile/set.h.
swapforunordered_mapπ₯ βtemplate<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > void std::__profile::swap (unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > & __y) [inline], [noexcept]
Definition at line 300 of file profile/unordered_map.
swapforunordered_multimapπ βtemplate<typename _Key , typename _Tp , typename _Hash , typename _Pred , typename _Alloc > void std::__profile::swap (unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __x, unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > & __y) [inline], [noexcept]
Definition at line 559 of file profile/unordered_map.
swapforunordered_multisetβ¨ βtemplate<typename _Value , typename _Hash , typename _Pred , typename _Alloc > void std::__profile::swap (unordered_multiset< _Value, _Hash, _Pred, _Alloc > & __x, unordered_multiset< _Value, _Hash, _Pred, _Alloc > & __y) [inline], [noexcept]
Definition at line 536 of file profile/unordered_set.
swapforunordered_setπ βtemplate<typename _Key , typename _Hash , typename _Pred , typename _Alloc > void std::__profile::swap (unordered_set< _Key, _Hash, _Pred, _Alloc > & __x, unordered_set< _Key, _Hash, _Pred, _Alloc > & __y) [inline], [noexcept]
Definition at line 280 of file profile/unordered_set.
swapforvectorπ§ βtemplate<typename _Tp , typename _Alloc > void std::__profile::swap (vector< _Tp, _Alloc > & __lhs, vector< _Tp, _Alloc > & __rhs) [inline], [noexcept]
Definition at line 549 of file profile/vector.
β¨ Author β¨
Generated automatically by Doxygen for libstdc++ from the source code.
and that's the whole page bestie!! you made it to the end, iconic behavior fr fr π«Ά
signing off from the libstdc++ corner of the world, where this little std::__profile(3cxx) page lives β no cap, she was born straight out of the source code and she's serving main character energy. go be great with your profiling. mwah π
π
π¦ where this page comes from
- ubuntu noble: libstdc++-9-doc 9.5.0-6ubuntu2
- ubuntu noble: libstdc++-9-doc 9.5.0-6ubuntu2.1
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms