Section 3: library functions
std::experimental::ranges::common_type – std::experimental::ranges::common_type Synopsis Defined in header<experimental / ranges / type_traits> template <class… T> (ranges TS) struct common_type; Determines the common type among all types T…, that is the type all T… can be implicitly converted to. If such a type exists (as determined according to the rules below), the member type names that type….
std::experimental::ranges::common_reference – std::experimental::ranges::common_reference Synopsis Defined in header<experimental / ranges / type_traits> template <class… T> (ranges TS) struct common_reference; Determines the common reference type of the types T…, that is, the type to which all the types in T… can be converted or bound. If such a type exists (as determined according to the rules below),…
std::experimental::ranges::all_of,std::experimental::ranges::any_of,std::experimental::ranges::none_of – std::experimental::ranges::all_of,std::experimental::ranges::any_of,std::experimental::ranges::none_of Synopsis Defined in header <experimental/ranges/algorithm> template< InputIterator I, Sentinel<I> S, class Proj = ranges::identity, IndirectUnaryPredicate<projected<I, Proj>> Pred > (1) (ranges TS) bool all_of( I first, S last, Pred pred, Proj proj = Proj{} ); template< InputRange R, class Proj = ranges::identity, IndirectUnaryPredicate<projected<ranges::iterator_t<R>, Proj>> Pred > (2) (ranges TS) bool all_of( R&& r,…
std::experimental::ranges::all_of,std::experimental::ranges::any_of, – std::experimental::ranges::all_of,std::experimental::ranges::any_of, Synopsis Defined in header <experimental/ranges/algorithm> template< InputIterator I, Sentinel<I> S, class Proj = ranges::identity, (1) (ranges TS) IndirectUnaryPredicate<projected<I, Proj>> Pred > bool all_of( I first, S last, Pred pred, Proj proj = Proj{} ); template< InputRange R, class Proj = ranges::identity, IndirectUnaryPredicate<projected<ranges::iterator_t<R>, Proj>> Pred (2) (ranges TS) > bool all_of( R&& r, Pred pred, Proj…
std::experimental::ranges::advance – std::experimental::ranges::advance Synopsis Defined in header<experimental / ranges / iterator> namespace { (ranges TS) constexpr /* unspecified */ advance = /* unspecified */; (customization point object) } Call signature template <Iterator I> (1) constexpr void advance(I &i, ranges::difference_type_t<I> n); template <Iterator I, Sentinel<I> S> (2) constexpr void advance(I &i, S bound); template <Iterator I,…
std::experimental::ranges::adjacent_find – std::experimental::ranges::adjacent_find Synopsis Defined in header <experimental/ranges/algorithm> template< ForwardIterator I, Sentinel<I> S, class Proj = ranges::identity, IndirectRelation<projected<I, Proj>> Pred = ranges::equal_to<> > (1) (ranges TS) I adjacent_find(I first, S last, Pred pred = Pred{}, Proj proj = Proj{}); template< ForwardRange R, class Proj = ranges::identity, IndirectRelation<projected<ranges::iterator_t<R>, Proj>> Pred = ranges::equal_to<> > (2) (ranges TS)…
std::experimental::ranges::Writable – std::experimental::ranges::Writable Synopsis Defined in header<experimental / ranges / iterator> template <class Out, class T> concept bool Writable = requires(Out && o, T &&t) { *o = std::forward<T>(t); *std::forward<Out>(o) = std::forward<T>(t); const_cast<const ranges::reference_t<Out> &&>(*o) = (ranges TS) std::forward<T>(t); const_cast<const ranges::reference_t<Out> &&>(*std::forward<Out>(o)) = std::forward<T>(t); }; /* none of the four expressions above are required to…
std::experimental::ranges::WeaklyIncrementable – std::experimental::ranges::WeaklyIncrementable Synopsis Defined in header <experimental/ranges/iterator> template <class I> concept bool WeaklyIncrementable = Semiregular<I> && requires(I i) { typename ranges::difference_type_t<I>; (ranges TS) requires SignedIntegral<ranges::difference_type_t<I>>; { ++i } -> Same<I>&; /* not required to be equality preserving */ i++; /* not required to be equality preserving */ }; The concept WeaklyIncrementable<I> specifies the requirements…
std::experimental::ranges::WeaklyEqualityComparableWith – std::experimental::ranges::WeaklyEqualityComparableWith Synopsis Defined in header<experimental / ranges / concepts> template <class T, class U> concept bool WeaklyEqualityComparableWith = requires(const std::remove_reference_t<T> &t, const std::remove_reference_t<U> &u) { { t == u } -> Boolean &&; (ranges TS) { t != u } -> Boolean &&; { u == t } -> Boolean &&; { u…
std::experimental::ranges::View – std::experimental::ranges::View Synopsis Defined in header<experimental / ranges / range> template <class T> concept bool View = Range<T> && Semiregular<T>(ranges TS) && /* view-predicate<T> */; template <class T> (ranges TS) struct enable_view { }; struct view_base { }; (ranges TS) The concept View<T> specifies the semiregular range T has constant-time copy, move, and assignment…
std::experimental::ranges::UnsignedIntegral – std::experimental::ranges::UnsignedIntegral Synopsis Defined in header <experimental/ranges/concepts> template < class T > (ranges TS) concept bool UnsignedIntegral = Integral<T> && !SignedIntegral<T>; The concept UnsignedIntegral<T> is satisfied if and only if T is an integral type and std::is_signed<T>::value is false. Notes UnsignedIntegral<T> may be satisfied by a type that is not a unsigned_integer_type, for example,…
std::experimental::ranges::UniformRandomNumberGenerator – std::experimental::ranges::UniformRandomNumberGenerator Synopsis Defined in header <experimental/ranges/random> template <class G> concept bool UniformRandomNumberGenerator = Invocable<G&> && UnsignedIntegral<std::result_of_t<G&()>> && (ranges TS) requires { { G::min() } -> Same<std::result_of_t<G&()>>&&; { G::max() } -> Same<std::result_of_t<G&()>>&&; }; The concept UniformRandomNumberGenerator<G> specifies that G is the type of a uniform random number generator, that is, objects of type G…
std::experimental::ranges::TaggedType – std::experimental::ranges::TaggedType Synopsis Defined in header <experimental/ranges/utility> template< class T > (ranges TS) concept bool TaggedType = /* implementation-defined */; The concept TaggedType<T> is satisfied if and only if T is a unary function type of the form R(A), where R is a TagSpecifier. Such types are used with the convenience alias templates tagged_tuple…
std::experimental::ranges::TagSpecifier – std::experimental::ranges::TagSpecifier Synopsis Defined in header <experimental/ranges/utility> template< class T > (ranges TS) concept bool TagSpecifier = /* implementation-defined */; The concept TagSpecifier<T> is satisfied if and only if T is a tag specifier for use with ranges::tagged. The Ranges TS provides a set of tag specifiers in <experimental/ranges/algorithm>. Users cannot define their own…
std::experimental::ranges::Swappable,std::experimental::ranges::SwappableWith – std::experimental::ranges::Swappable,std::experimental::ranges::SwappableWith Synopsis Defined in header<experimental / ranges / concepts> template <class T> concept bool Swappable = requires(T & a, T &b) { (1)(ranges TS) ranges::swap(a, b); }; template <class T, class U> concept bool SwappableWith = CommonReference< const std::remove_reference_t<T> &, const std::remove_reference_t<U> &> && requires(T &&t, U &&u) { (2)(ranges TS) ranges::swap(std::forward<T>(t), std::forward<T>(t));…
std::experimental::ranges::StrictWeakOrder – std::experimental::ranges::StrictWeakOrder Synopsis Defined in header <experimental/ranges/concepts> template < class R, class T, class U > (1) (ranges TS) concept bool StrictWeakOrder = 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 *…
std::experimental::ranges::StrictTotallyOrdered,std::experimental::ranges::StrictTotallyOrderedWith – std::experimental::ranges::StrictTotallyOrdered,std::experimental::ranges::StrictTotallyOrderedWith Synopsis Defined in header<experimental / ranges / concepts> template <class T> concept bool StrictTotallyOrdered = EqualityComparable<T> && requires(const std::remove_reference_t<T> &a, const std::remove_reference_t<T> &b) { (1)(ranges TS) { a < b } -> Boolean &&; { a > b } -> Boolean &&; { a <= b } -> Boolean &&; { a…
std::experimental::ranges::Sortable – std::experimental::ranges::Sortable Synopsis template <class I, class R = ranges::less<>, class P = ranges::identity> concept bool Sortable = (ranges TS) Permutable<I> && IndirectStrictWeakOrder<R, ranges::projected<I, P>>; The Sortable concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, ranges::sort).
std::experimental::ranges::SizedSentinel – std::experimental::ranges::SizedSentinel Synopsis Defined in header<experimental / ranges / iterator> template <class S, class I> concept bool SizedSentinel = Sentinel<S, I> && !ranges::disable_sized_sentinel<std::remove_cv_t<S>, std::remove_cv_t<I>> && (1)(ranges TS) requires(const I &i, const S &s) { { s – i } -> Same<ranges::difference_type_t<I>> &&; { i – s } -> Same<ranges::difference_type_t<I>> &&; }; template <class S,…
std::experimental::ranges::SizedRange – std::experimental::ranges::SizedRange Synopsis Defined in header <experimental/ranges/range> template <class T> concept bool SizedRange = Range<T> && !ranges::disable_sized_range<std::remove_cv_t<std::remove_reference_t<T>>> && (ranges TS) requires(T& t) { { ranges::size(t) } -> ConvertibleTo<ranges::difference_type_t<ranges::iterator_t<T>>>; }; This section is incomplete Reason: add description and extra caveats