std::__profile(3cxx)

πŸ“¦
version 9.5.0 Β· 3 versions
, in ubuntu noble

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 around std::bitset with performance instrumentation, none at the moment. πŸ’€
  • class deque β€” a wrapper around std::deque with performance instrumentation. ✨
  • class forward_list β€” a wrapper around std::forward_list with performance instrumentation. πŸ¦‹
  • class list β€” a list wrapper with performance instrumentation. πŸŽ€
  • class map β€” a wrapper around std::map with performance instrumentation. 🌸
  • class multimap β€” a wrapper around std::multimap with performance instrumentation. πŸ’–
  • class multiset β€” a wrapper around std::multiset with performance instrumentation. 🌈
  • class set β€” a wrapper around std::set with performance instrumentation. ⭐
  • class unordered_map β€” a wrapper around std::unordered_map with performance instrumentation. πŸ”₯
  • class unordered_multimap β€” a wrapper around std::unordered_multimap with performance instrumentation. πŸ‘‘
  • class unordered_multiset β€” an unordered_multiset wrapper with performance instrumentation. πŸ’œ
  • class unordered_set β€” an unordered_set wrapper 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_node inside 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's noexcept πŸ’…. template<typename _Iterator , typename _Sequence > bool operator!= (const __iterator_tracker< _Iterator, _Sequence > &__lhs, const __iterator_tracker< _Iterator, _Sequence > &__rhs) noexcept
  • operator!= (iterator_tracker, mixed) β€” same energy but the two sides can be different iterator types. noexcept again, icon behaviour. template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator!= (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexcept
  • operator!= (deque) β€” not-equal for two deques. template<typename _Tp , typename _Alloc > bool operator!= (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)
  • operator!= (forward_list) β€” not-equal for two forward_lists (note the __lx / __ly naming, 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 two lists. template<typename _Tp , typename _Alloc > bool operator!= (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)
  • operator!= (map) β€” not-equal for two maps. 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 two multimaps. 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 two multisets. 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 two sets. 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 two unordered_maps (yep, __x and __y this 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 two unordered_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 two unordered_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 two unordered_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 two vectors. template<typename _Tp , typename _Alloc > bool operator!= (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)

  • operator& (bitset) β€” bitwise AND for two same-sized bitsets, and it's noexcept because of course she is 🌈. template<size_t _Nb> bitset< _Nb > operator& (const bitset< _Nb > &__x, const bitset< _Nb > &__y) noexcept
  • operator+ (iterator_tracker) β€” advances an __iterator_tracker by a difference_type from 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) noexcept
  • operator- (iterator_tracker, same type) β€” distance between two __iterator_trackers, returns a difference_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) noexcept
  • operator- (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) noexcept
  • operator< (iterator_tracker, mixed) β€” less-than with two different iterator types, still noexcept. template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator< (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexcept
  • operator< (deque) β€” less-than for two deques. template<typename _Tp , typename _Alloc > bool operator< (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)
  • operator< (forward_list) β€” less-than for two forward_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 two lists. template<typename _Tp , typename _Alloc > bool operator< (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)
  • operator< (map) β€” less-than for two maps. 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 two multimaps. 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 two multisets. 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 two sets. 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 two vectors. template<typename _Tp , typename _Alloc > bool operator< (const vector< _Tp, _Alloc > &__lhs, const vector< _Tp, _Alloc > &__rhs)

  • operator<< (bitset) β€” streams a bitset out to a basic_ostream and 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) noexcept
  • operator<= (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) noexcept
  • operator<= (deque) β€” less-than-or-equal for two deques. 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 two forward_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 two lists. template<typename _Tp , typename _Alloc > bool operator<= (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)
  • operator<= (map) β€” less-than-or-equal for two maps. 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 two multimaps. 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 two multisets. 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 two sets. 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 two vectors. 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) noexcept
  • operator== (iterator_tracker, mixed) β€” equality with two different iterator types, still noexcept. template<typename _IteratorL , typename _IteratorR , typename _Sequence > bool operator== (const __iterator_tracker< _IteratorL, _Sequence > &__lhs, const __iterator_tracker< _IteratorR, _Sequence > &__rhs) noexcept
  • operator== (deque) β€” equality for two deques. template<typename _Tp , typename _Alloc > bool operator== (const deque< _Tp, _Alloc > &__lhs, const deque< _Tp, _Alloc > &__rhs)
  • operator== (forward_list) β€” equality for two forward_lists. template<typename _Tp , typename _Alloc > bool operator== (const forward_list< _Tp, _Alloc > &__lx, const forward_list< _Tp, _Alloc > &__ly)
  • operator== (list) β€” equality for two lists. template<typename _Tp , typename _Alloc > bool operator== (const list< _Tp, _Alloc > &__lhs, const list< _Tp, _Alloc > &__rhs)
  • operator== (map) β€” equality for two maps. 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 two multimaps. 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 two multisets. 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 two sets. 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 two unordered_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 two unordered_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 two unordered_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 two unordered_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 two vectors. 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 file profile/vector.
  • template<size_t _Nb> bitset< _Nb > std::__profile::operator& (const bitset< _Nb > & __x, const bitset< _Nb > & __y) [noexcept] β€” Definition at line 205 of file profile/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 file iterator_tracker.h. yes the __n comes 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 file iterator_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 file iterator_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 file iterator_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 file iterator_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 file profile/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 file profile/forward_list. Note the args are __lx and __ly here, 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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file iterator_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 file iterator_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 file profile/deque.
  • 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 201 of file profile/forward_list. fr fr it just says "Based on operator<", so that's the whole story, no extra lore
  • template<typename _Tp , typename _Alloc > bool std::__profile::operator<= (const list< _Tp, _Alloc > & __lhs, const list< _Tp, _Alloc > & __rhs) [inline] β€” Definition at line 624 of file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file iterator_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 file iterator_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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/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 file profile/unordered_map. unordered gang rise up and yes the args are __x and __y over 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 file profile/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 file profile/unordered_set. Careful, this one's template param is _Value, not _Key πŸ’€ don't get caught slipping
  • 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 287 of file profile/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 file profile/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 file iterator_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> 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 175 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]

Based on operator<.

Definition at line 188 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 637 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 690 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 648 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 633 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 614 of file profile/set.h.

  • operator> for vector πŸ”₯ β€” 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>= 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 169 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]

Based on operator<.

Definition at line 195 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 631 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 683 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 641 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 627 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 608 of file profile/set.h.

  • operator>= for vector πŸ’– β€” 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 for bitset 🧚 β€” 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 for bitset ✨ β€” 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 for bitset 🌈 β€” 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.


  • swap for deque πŸ’… β€” 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.

  • swap for forward_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.

  • swap for list πŸ“ β€” 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.

  • swap for map πŸ’œ β€” 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.

  • swap for multimap 🌸 β€” 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.

  • swap for multiset πŸ¦‹ β€” 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.

  • swap for set πŸ‘‘ β€” 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.

  • swap for unordered_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.

  • swap for unordered_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.

  • swap for unordered_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.

  • swap for unordered_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.

  • swap for vector 🧚 β€” 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