Linux Manuals session 3

std::_Fwd_list_const_iterator< _Tp > – Synopsis Public Types typedef const _Fwd_list_node< _Tp > _Node typedef _Fwd_list_const_iterator< _Tp > _Self" typedef ptrdiff_t difference_type typedef _Fwd_list_iterator< _Tp > iterator typedef std::forward_iterator_tag iterator_category typedef const _Tp * pointer typedef const _Tp & reference typedef _Tp value_type Public Member Functions _Fwd_list_const_iterator (const _Fwd_list_node_base *__n) _Fwd_list_const_iterator (const iterator &__iter) _Self _M_next…

std::_Fwd_list_base< _Tp, _Alloc > – Synopsis Inherited by std::forward_list< _Tp, _Alloc > [private]. Public Types typedef _Fwd_list_node< _Tp > _Node typedef _Fwd_list_const_iterator< _Tp > const_iterator" typedef _Fwd_list_iterator< _Tp > iterator Public Member Functions _Fwd_list_base (const _Node_alloc_type &__a) _Fwd_list_base (_Fwd_list_base &&__lst, const _Node_alloc_type &__a) _Fwd_list_base (_Fwd_list_base &&__lst) _Node_alloc_type & _M_get_Node_allocator () noexcept const _Node_alloc_type & _M_get_Node_allocator…

std::_Function_base – Synopsis Inherited by std::function< _Res(_ArgTypes…)> [private]. Public Types typedef bool(* _Manager_type )(_Any_data &, const _Any_data &, _Manager_operation) Public Member Functions bool _M_empty () const Public Attributes _Any_data _M_functor _Manager_type _M_manager Static Public Attributes static const std::size_t _M_max_align static const std::size_t _M_max_size Detailed Description Base class of all polymorphic function object wrappers. Definition at…

std::_Exit – std::_Exit Synopsis Defined in header <cstdlib> [[noreturn]] void _Exit( int exit_code ) noexcept; (since C++11) Causes normal program termination to occur without completely cleaning the resources. Destructors of variables with automatic, thread local and static storage durations are not called. Functions passed to std::at_quick_exit() or std::atexit() are not called. Whether open resources such…

std::_Derives_from_unary_function< _Tp > – Synopsis Inherits std::__sfinae_types. Public Types typedef char __one Static Public Attributes static const bool value Detailed Description template<typename _Tp>struct std::_Derives_from_unary_function< _Tp > Determines if the type _Tp derives from unary_function. Definition at line 190 of file functional. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::_Derives_from_binary_function< _Tp > – Synopsis Inherits std::__sfinae_types. Public Types typedef char __one Static Public Attributes static const bool value Detailed Description template<typename _Tp>struct std::_Derives_from_binary_function< _Tp > Determines if the type _Tp derives from binary_function. Definition at line 206 of file functional. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::_Deque_iterator< _Tp, _Ref, _Ptr > – Synopsis Public Types typedef _Tp ** _Map_pointer typedef _Deque_iterator _Self typedef _Deque_iterator< _Tp, const _Tp &, const _Tp * > const_iterator" typedef ptrdiff_t difference_type typedef _Deque_iterator< _Tp, _Tp &, _Tp * > iterator" typedef std::random_access_iterator_tag iterator_category" typedef _Ptr pointer typedef _Ref reference typedef size_t size_type typedef _Tp value_type Public…

std::_Deque_base< _Tp, _Alloc > – Synopsis Inherited by std::deque< _Tp, _Alloc > [protected]. Public Types typedef _Alloc allocator_type typedef _Deque_iterator< _Tp, const _Tp &, const _Tp * > const_iterator" typedef _Deque_iterator< _Tp, _Tp &, _Tp * > iterator" Public Member Functions _Deque_base (size_t __num_elements) _Deque_base (const allocator_type &__a, size_t __num_elements) _Deque_base (const allocator_type &__a) _Deque_base…

std::_Bind_result< _Result, _Signature > – Synopsis Detailed Description template<typename _Result, typename _Signature>struct std::_Bind_result< _Result, _Signature > Type of the function object returned from bind<R>(). Definition at line 1403 of file functional. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::_Bind< _Ind, _Tp > – Synopsis Detailed Description template<std::size_t _Ind, typename… _Tp>struct std::_Bind< _Ind, _Tp > Type of the function object returned from bind(). Definition at line 1277 of file functional. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::_Base_bitset< _Nw > – Synopsis Public Types typedef unsigned long _WordT Public Member Functions constexpr _Base_bitset (unsigned long long __val) noexcept template<size_t _Nb> bool _M_are_all () const noexcept void _M_do_and (const _Base_bitset< _Nw > &__x) noexcept size_t _M_do_count () const noexcept size_t _M_do_find_first (size_t) const noexcept size_t _M_do_find_next (size_t, size_t) const noexcept void _M_do_flip ()…

std::UnsignedIntegral – std::UnsignedIntegral Synopsis Defined in header <concepts> template < class T > (since C++20) concept UnsignedIntegral = std::Integral<T> && !std::SignedIntegral<T>; The concept UnsignedIntegral<T> is satisfied if and only if T is an integral type and std::is_signed_v<T> is false. Notes UnsignedIntegral<T> may be satisfied by a type that is not a unsigned_integer_type, for example, bool….

std::UniformRandomBitGenerator – std::UniformRandomBitGenerator Synopsis Defined in header <random> template <class G> concept UniformRandomBitGenerator = std::Invocable<G&> && std::UnsignedIntegral<std::invoke_result_t<G&>> && (since C++20) requires { G::min(); requires std::Same<decltype(G::min()), std::invoke_result_t<G&>>; G::max(); requires std::Same<decltype(G::max()), std::invoke_result_t<G&>>; }; The concept UniformRandomBitGenerator <G> specifies that G is the type of a uniform random bit generator, that is, objects of type G is a…

std::Swappable,std::SwappableWith – std::Swappable,std::SwappableWith Synopsis Defined in header<concepts> template <class T> concept Swappable = requires(T & a, T &b) { (1)(since C++ 20) ranges::swap(a, b); }; template <class T, class U> concept SwappableWith = CommonReference < const std::remove_reference_t<T> &, const std::remove_reference_t<U> & > && requires(T &&t, U &&u) { (2)(since C++ 20) ranges::swap(std::forward<T>(t), std::forward<T>(t)); ranges::swap(std::forward<U>(u), std::forward<U>(u));…

std::StrictWeakOrder – std::StrictWeakOrder Synopsis Defined in header <concepts> template < class R, class T, class U > (1) (since C++20) concept StrictWeakOrder = std::Relation<R, T, U>; The concept StrictWeakOrder<R, T, U> specifies that the Relation R imposes a strict weak ordering on its arguments. A relation r is a strict weak ordering if * it…

std::StrictTotallyOrdered,std::StrictTotallyOrderedWith – std::StrictTotallyOrdered,std::StrictTotallyOrderedWith Synopsis Defined in header<concepts> template <class T> concept StrictTotallyOrdered = std::EqualityComparable<T> && requires(const std::remove_reference_t<T> &a, const std::remove_reference_t<T> &b) { (1)(since C++ 20) a < b; requires std::Boolean<decltype(a < b)>; a > b; requires std::Boolean<decltype(a > b)>; a <= b; requires std::Boolean<decltype(a <= b)>; a >= b; requires std::Boolean<decltype(a >= b)>; }; template…

std::SignedIntegral – std::SignedIntegral Synopsis Defined in header <concepts> template < class T > (since C++20) concept SignedIntegral = std::Integral<T> && std::is_signed_v<T>; The concept SignedIntegral<T> is satisfied if and only if T is an integral type and std::is_signed_v<T> is true. Notes SignedIntegral<T> may be satisfied by a type that is not a signed_integer_type, for example, char…

std::Semiregular – std::Semiregular Synopsis Defined in header <concepts> template <class T> (since C++20) concept Semiregular = std::Copyable<T> && std::DefaultConstructible<T>; The Semiregular concept specifies that a type is both copyable and default constructible. It is satisfied by types that behave similarly to built-in types like int, except that they need not support comparison with ==.

std::Same – std::Same Synopsis Defined in header <concepts> template < class T, class U > (since C++20) concept Same = /* see below */; The concept Same<T, U> is satisfied if and only if T and U denote the same type. std::Same<T, U> subsumes std::Same<U, T> and vice versa. Possible implementation   namespace detail {       template<…

std::Relation – std::Relation Synopsis Defined in header <concepts> template <class R, class T, class U> concept Relation = (1) (since C++20) std::Predicate<R, T, T> && std::Predicate<R, U, U> && std::Predicate<R, T, U> && std::Predicate<R, U, T>; The concept Relation<R, T, U> specifies that R defines a binary relation over the set of expressions whose type…