The Linux Manuals (man pages) document is an important part of Linux documents. Linux Manuals are organized as several sections. Each section has a group of commands for a specific area in Linux usage, administration or development.
std::ranges::less_equal – std::ranges::less_equal Synopsis Defined in header <functional> struct less_equal; (since C++20) Function object for performing comparisons. Deduces the parameter types of the function call operator from the arguments (but not the return type). Member types Member type Definition is_transparent /* unspecified */ Member functions checks if the first argument is less than or equal…
std::ranges::less – std::ranges::less Synopsis Defined in header <functional> struct less; (since C++20) Function object for performing comparisons. Deduces the parameter types of the function call operator from the arguments (but not the return type). Member types Member type Definition is_transparent /* unspecified */ Member functions checks if the first argument is less than the second…
std::ranges::iterator_t,std::ranges::sentinel_t – std::ranges::iterator_t,std::ranges::sentinel_t Synopsis Defined in header <ranges> template <class T> (1) (since C++20) using iterator_t = decltype(ranges::begin(declval<T&>())); template <class T> (2) (since C++20) using sentinel_t = decltype(ranges::end(declval<T&>())); 1) Used to obtain the iterator type of the type T. 2) Used to obtain the sentinel type of the type T.
std::ranges::greater_equal – std::ranges::greater_equal Synopsis Defined in header <functional> struct greater_equal; (since C++20) Function object for performing comparisons. Deduces the parameter types of the function call operator from the arguments (but not the return type). Member types Member type Definition is_transparent /* unspecified */ Member functions checks if the first argument is greater than or equal…
std::ranges::greater – std::ranges::greater Synopsis Defined in header <functional> struct greater; (since C++20) Function object for performing comparisons. Deduces the parameter types of the function call operator from the arguments (but not the return type). Member types Member type Definition is_transparent /* unspecified */ Member functions checks if the first argument is greater than the second…
std::ranges::equal_to – std::ranges::equal_to Synopsis Defined in header <functional> struct equal_to; (since C++20) Function object for performing comparisons. Deduces the parameter types of the function call operator from the arguments (but not the return type). Member types Member type Definition is_transparent /* unspecified */ Member functions checks if the arguments are equal operator() (public member function)…
std::ranges::dangling – std::ranges::dangling Synopsis Defined in header <ranges> struct dangling; (since C++20) dangling is a placeholder type and an empty class type, used together with the template aliases ranges::safe_iterator_t and ranges::safe_subrange_t. When some constrain_algorithms that usually return an iterator or a subrange of a Range take a particular rvalue Range argument that does not models…
std::ranges::begin,std::ranges::cbegin – std::ranges::begin,std::ranges::cbegin Synopsis Defined in header <ranges> Defined in header <iterator> inline constexpr /*unspecified*/ begin = /*unspecified*/; (1) (since C++20) inline constexpr /*unspecified*/ cbegin = /*unspecified*/; (2) (since C++20)
std::ranges::all_of,std::ranges::any_of,std::ranges::none_of – std::ranges::all_of,std::ranges::any_of,std::ranges::none_of Synopsis Defined in header <algorithm> Call signature template< InputIterator I, Sentinel<I> S, class Proj = std::identity, IndirectUnaryPredicate<projected<I, Proj>> Pred > (1) (since C++20) bool all_of( I first, S last, Pred pred, Proj proj = {} ); template< InputRange R, class Proj = std::identity, IndirectUnaryPredicate<projected<ranges::iterator_t<R>, Proj>> Pred > (2) (since C++20) bool all_of(…
std::ranges::ViewableRange – std::ranges::ViewableRange Synopsis Defined in header <ranges> template<class T> concept ViewableRange = Range<T> && (__ForwardingRange<T> || View<std::decay_t<T>>); The ViewableRange concept is a refinement of Range that describes a range that can be safely converted into a View. (note __ForwardingRange is the exposition-only concept defined in Range)
std::ranges::View,std::ranges::enable_view,std::ranges::view_base – std::ranges::View,std::ranges::enable_view,std::ranges::view_base Synopsis Defined in header<ranges> template <class T> (1) concept View = Range<T> && Semiregular<T> && enable_view<T>; template <class T> (2) inline constexpr bool enable_view = /*see description*/; struct view_base { }; (3) 1) The View concept specifies the requirements of a Range type that has constant time copy, move, and assignment operations…
std::ranges::SizedRange,std::ranges::disable_sized_range – std::ranges::SizedRange,std::ranges::disable_sized_range Synopsis Defined in header <ranges> template< class T > concept SizedRange = Range<T> && ! disable_sized_range<std::remove_cvref_t<T>> && (1) requires(T& t) { ranges::size(t); }; template<class> (2) inline constexpr bool disable_sized_range = false; 1) The SizedRange concept specifies the requirements of a Range type that knows its size in constant time with the size…
std::ranges::Range – std::ranges::Range Synopsis Defined in header<ranges> template <class T> (1) concept Range = __RangeImpl<T &>; // exposition-only definition // exposition-only helper concept template <class T> concept __RangeImpl = requires(T &&t) { (2) ranges::begin(std::forward<T>(t)); // equality-preserving for forward iterators ranges::end(std::forward<T>(t)); }; // exposition-only helper concept template <class T> (3) concept __ForwardingRange = Range<T> && __RangeImpl<T>;…
std::ranges::RandomAccessRange – std::ranges::RandomAccessRange Synopsis Defined in header <ranges> template<class T> concept RandomAccessRange = BidirectionalRange<T> && RandomAccessIterator<iterator_t<T>>; The RandomAccessRange concept is a refinement of Range for which ranges::begin returns a model of RandomAccessIterator.
std::ranges::OutputRange – std::ranges::OutputRange Synopsis Defined in header <ranges> template<class R, class T> concept OutputRange = Range<R> && OutputIterator<iterator_t<R>, T>; The OutputRange concept is a refinement of Range for which ranges::begin returns a model of OutputIterator.
std::ranges::InputRange – std::ranges::InputRange Synopsis Defined in header <ranges> template<class T> concept InputRange = Range<T> && InputIterator<iterator_t<T>>; The InputRange concept is a refinement of Range for which ranges::begin returns a model of InputIterator.
std::ranges::ForwardRange – std::ranges::ForwardRange Synopsis Defined in header <ranges> template<class T> concept ForwardRange = InputRange<T> && ForwardIterator<iterator_t<T>>; The ForwardRange concept is a refinement of Range for which ranges::begin returns a model of ForwardIterator.
std::ranges::ContiguousRange – std::ranges::ContiguousRange Synopsis Defined in header <ranges> template<class T> concept ContiguousRange = RandomAccessRange<T> && ContiguousIterator<iterator_t<T>> && requires(T& t) { { ranges::data(t) } -> Same<std::add_pointer_t<iter_reference_t<iterator_t<T>>>>; }; The ContiguousRange concept is a refinement of Range for which ranges::begin returns a model of ContiguousIterator and the customization point ranges::data is usable.
std::ranges::CommonRange – std::ranges::CommonRange Synopsis Defined in header <ranges> template<class T> concept CommonRange = Range<T> && Same<iterator_t<T>, sentinel_t<T>>; The CommonRange concept is a refinement of Range for which ranges::begin and ranges::end return the same type (e.g. all standard library containers).
std::ranges::BidirectionalRange – std::ranges::BidirectionalRange Synopsis Defined in header <ranges> template<class T> concept BidirectionalRange = ForwardRange<T> && BidirectionalIterator<iterator_t<T>>; The BidirectionalRange concept is a refinement of Range for which ranges::begin returns a model of BidirectionalIterator.