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::experimental::ranges::Movable – std::experimental::ranges::Movable Synopsis Defined in header <experimental/ranges/concepts> template < class T > concept bool Movable = std::is_object<T>::value && (ranges TS) MoveConstructible<T> && Assignable<T&, T> && Swappable<T>; The concept Movable<T> specifies that T is an object type that can moved (that is, it can be move constructed, move assigned, and lvalues of type T can…
std::experimental::ranges::Mergeable – std::experimental::ranges::Mergeable Synopsis template < class I1, class I2, class Out, class R = ranges::less<>, class P1 = ranges::identity, class P2 = ranges::identity > concept bool Mergeable = InputIterator<I1> && InputIterator<I2> && (ranges TS) WeaklyIncrementable<Out> && IndirectlyCopyable<I1, Out> && IndirectlyCopyable<I2, Out> && IndirectStrictWeakOrder<R, ranges::projected<I1, P1>, ranges::projected<I2, P2>>; The Mergeable concept specifies the common requirements…
std::experimental::ranges::Iterator – std::experimental::ranges::Iterator Synopsis Defined in header <experimental/ranges/iterator> template <class I> concept bool Iterator = requires(I i) { (ranges TS) { *i } -> auto&&; // Requires: i is dereferenceable } && WeaklyIncrementable<I>; The Iterator concept forms the basis of the iterator concept taxonomy; every iterator satisfies the Iterator requirements. Equality preservation An expression is…
std::experimental::ranges::Invocable,std::experimental::ranges::RegularInvocable – std::experimental::ranges::Invocable,std::experimental::ranges::RegularInvocable Synopsis Defined in header <experimental/ranges/concepts> template < class F, class… Args > concept bool Invocable = requires(F&& f, Args&&… args) { (ranges TS) ranges::invoke(std::forward<F>(f), std::forward<Args>(args)…); /* not required to be equality preserving */ }; template < class F, class… Args > (ranges TS) concept bool RegularInvocable = Invocable<F, Args…>; The Invocable concept…
std::experimental::ranges::Integral – std::experimental::ranges::Integral Synopsis Defined in header <experimental/ranges/concepts> template < class T > (ranges TS) concept bool Integral = std::is_integral<T>::value; The concept Integral<T> is satisfied if and only if T is an integral type. There need not be any subsumption relationship between Integral<T> and std::is_integral<T>::value. See also is_integral checks if a type is an integral…
std::experimental::ranges::InputRange – std::experimental::ranges::InputRange Synopsis Defined in header <experimental/ranges/range> template <class T> concept bool InputRange = (ranges TS) Range<T> && InputIterator<ranges::iterator_t<T>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::InputIterator – std::experimental::ranges::InputIterator Synopsis Defined in header <experimental/ranges/iterator> template < class I > concept bool InputIterator = Iterator<I> && Readable<I> && (ranges TS) requires { typename ranges::iterator_category_t<I>; } && DerivedFrom<ranges::iterator_category_t<I>, ranges::input_iterator_tag>; The InputIterator concept is a refinement of Iterator, adding the requirement that the referenced values can be read (via Readable) and the requirement that…
std::experimental::ranges::IndirectlySwappable – std::experimental::ranges::IndirectlySwappable Synopsis Defined in header <experimental/ranges/iterator> template <class I1, class I2 = I1> concept bool IndirectlySwappable = Readable<I1> && Readable<I2> && requires(I1&& i1, I2&& i2) { ranges::iter_swap(std::forward<I1>(i1), std::forward<I2>(i2)); (ranges TS) ranges::iter_swap(std::forward<I2>(i2), std::forward<I1>(i1)); ranges::iter_swap(std::forward<I1>(i1), std::forward<I1>(i1)); ranges::iter_swap(std::forward<I2>(i2), std::forward<I2>(i2)); }; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectlyMovableStorable – std::experimental::ranges::IndirectlyMovableStorable Synopsis Defined in header <experimental/ranges/iterator> template < class In, class Out > concept bool IndirectlyMovableStorable = IndirectlyMovable<In, Out> && Writable<Out, ranges::value_type_t<In>> && (ranges TS) Movable<ranges::value_type_t<In>> && Constructible<ranges::value_type_t<In>, ranges::rvalue_reference_t<In>> && Assignable<ranges::value_type_t<In>&, ranges::rvalue_reference_t<In>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectlyMovable – std::experimental::ranges::IndirectlyMovable Synopsis Defined in header <experimental/ranges/iterator> template <class In, class Out> concept bool IndirectlyMovable = (ranges TS) Readable<In> && Writable<Out, ranges::rvalue_reference_t<In>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectlyCopyableStorable – std::experimental::ranges::IndirectlyCopyableStorable Synopsis Defined in header<experimental / ranges / iterator> template <class In, class Out> concept bool IndirectlyCopyableStorable = IndirectlyCopyable<In, Out> && Writable<Out, const ranges::value_type_t<In> &> && (ranges TS) Copyable<ranges::value_type_t<In>> && Constructible<ranges::value_type_t<In>, ranges::reference_t<In>> && Assignable<ranges::value_type_t<In> &, ranges::reference_t<In>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectlyCopyable – std::experimental::ranges::IndirectlyCopyable Synopsis Defined in header <experimental/ranges/iterator> template < class In, class Out > concept bool IndirectlyCopyable = (ranges TS) Readable<In> && Writable<Out, ranges::reference_t<In>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectlyComparable – std::experimental::ranges::IndirectlyComparable Synopsis Defined in header <experimental/ranges/iterator> template < class I1, class I2, class R = ranges::equal_to<>, class P1 = ranges::identity, class P2 = ranges::identity > (ranges TS) concept bool IndirectlyComparable = IndirectRelation<R, ranges::projected<I1, P1>, ranges::projected<I2, P2>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectUnaryPredicate – std::experimental::ranges::IndirectUnaryPredicate Synopsis Defined in header <experimental/ranges/iterator> template <class F, class I> concept bool IndirectUnaryPredicate = Readable<I> && CopyConstructible<F> && (ranges TS) Predicate<F&, ranges::value_type_t<I>&> && Predicate<F&, ranges::reference_t<I>> && Predicate<F&, ranges::iter_common_reference_t<I>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::IndirectUnaryInvocable,std::experimental::ranges::IndirectRegularUnaryInvocable – std::experimental::ranges::IndirectUnaryInvocable,std::experimental::ranges::IndirectRegularUnaryInvocable Synopsis Defined in header <experimental/ranges/iterator> template <class F, class I> concept bool IndirectUnaryInvocable = Readable<I> && CopyConstructible<F> && Invocable<F&, ranges::value_type_t<I>&> && Invocable<F&, ranges::reference_t<I>> && (ranges TS) Invocable<F&, ranges::iter_common_reference_t<I>> && CommonReference< std::result_of_t<F&(ranges::value_type_t<I>&)>, std::result_of_t<F&(ranges::reference_t<I>&&)>>; template <class F, class I> concept bool IndirectRegularUnaryInvocable = Readable<I> && CopyConstructible<F> && RegularInvocable<F&, ranges::value_type_t<I>&> && RegularInvocable<F&, ranges::reference_t<I>> && (ranges…
std::experimental::ranges::IndirectStrictWeakOrder – std::experimental::ranges::IndirectStrictWeakOrder Synopsis Defined in header <experimental/ranges/iterator> template < class F, class I1, class I2 = I1 > concept bool IndirectStrictWeakOrder = Readable<I1> && Readable<I2> && CopyConstructible<F> && StrictWeakOrder<F&, ranges::value_type_t<I1>&, ranges::value_type_t<I2>&> && (ranges TS) StrictWeakOrder<F&, ranges::value_type_t<I1>&, ranges::reference_t<I2>> && StrictWeakOrder<F&, ranges::reference_t<I1>, ranges::value_type_t<I2>&> && StrictWeakOrder<F&, ranges::reference_t<I1>, ranges::reference_t<I2>> && StrictWeakOrder<F&, ranges::iter_common_reference_t<I1>, ranges::iter_common_reference_t<I2>>; This section is incomplete Reason:…
std::experimental::ranges::IndirectRelation – std::experimental::ranges::IndirectRelation Synopsis Defined in header <experimental/ranges/iterator> template < class F, class I1, class I2 = I1 > concept bool IndirectRelation = Readable<I1> && Readable<I2> && CopyConstructible<F> && Relation<F&, ranges::value_type_t<I1>&, ranges::value_type_t<I2>&> && (ranges TS) Relation<F&, ranges::value_type_t<I1>&, ranges::reference_t<I2>> && Relation<F&, ranges::reference_t<I1>, ranges::value_type_t<I2>&> && Relation<F&, ranges::reference_t<I1>, ranges::reference_t<I2>> && Relation<F&, ranges::iter_common_reference_t<I1>, ranges::iter_common_reference_t<I2>>; This section is incomplete Reason:…
std::experimental::ranges::Incrementable – std::experimental::ranges::Incrementable Synopsis Defined in header <experimental/ranges/iterator> template <class I> concept bool Incrementable = Regular<I> && WeaklyIncrementable<I> && (ranges TS) requires(I i) { { i++ } -> Same<I>&&; }; The concept Incrementable<I> specifies the requirements on a type that can be incremented (with the pre- and post-increment operators). The increment operations (including those required…
std::experimental::ranges::ForwardRange – std::experimental::ranges::ForwardRange Synopsis Defined in header <experimental/ranges/range> template <class T> concept bool ForwardRange = (ranges TS) InputRange<T> && ForwardIterator<ranges::iterator_t<T>>; This section is incomplete Reason: add description and extra caveats
std::experimental::ranges::ForwardIterator – std::experimental::ranges::ForwardIterator Synopsis Defined in header <experimental/ranges/iterator> template < class I > concept bool ForwardIterator = InputIterator<I> && (ranges TS) DerivedFrom<ranges::iterator_category_t<I>, ranges::forward_iterator_tag> && Incrementable<I> && Sentinel<I, I>; The concept ForwardIterator<I> refines InputIterator by adding equality comparison and the multi-pass guarantee. The domain of == for forward iterators is that of iterators over the same…