Linux Manuals

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.

std::range_error – std::range_error Synopsis Defined in header <stdexcept> class range_error; Defines a type of object to be thrown as exception. It can be used to report range errors (that is, situations where a result of a computation cannot be represented by the destination type) The only standard library components that throw this exception are std::wstring_convert::from_bytes…

std::random_shuffle,std::shuffle – std::random_shuffle,std::shuffle Synopsis Defined in header<algorithm> template <class RandomIt> (1)(deprecated in C++ 14) void random_shuffle(RandomIt first, RandomIt last); (removed in C++ 17) template <class RandomIt, class RandomFunc> (until C++ 11) void random_shuffle(RandomIt first, RandomIt last, RandomFunc &r); template <class RandomIt, class RandomFunc> (since C++ 11) void random_shuffle(RandomIt first, RandomIt last, RandomFunc &&r); (2)(deprecated in…

std::random_device::random_device – std::random_device::random_device Synopsis random_device() : random_device(/*implementation-defined*/){}(1)(since C++ 11) explicit random_device(const std::string &token); (2)(since C++ 11) random_device(const random_device &) = delete; (3)(since C++ 11) 1) Default constructs a new std::random_device object with an implementation-defined token. 2) Constructs a new std::random_device object, making use of the argument token in an implementation-defined manner. 3) The copy constructor…

std::random_device::operator() – std::random_device::operator() Synopsis result_type operator()(); (since C++11) Generates a non-deterministic uniformly-distributed random value. Parameters (none) Return value A random number uniformly distributed in [min(), max()]. Exceptions Throws an implementation-defined exception derived from std::exception if a random number could not be generated. See also min gets the smallest possible value in the output range          (public…

std::random_device::min – std::random_device::min Synopsis static constexpr result_type min(); (since C++11) Returns the minimum value potentially generated by the random-number engine. This value is equal to 0u. Parameters (none) Return value The minimum potentially generated value. Complexity Constant See also max gets the largest possible value in the output range          (public static member function) [static]

std::random_device::max – std::random_device::max Synopsis static constexpr result_type max(); (since C++11) Returns the maximum value potentially generated by the random-number engine. This value is equal to std::numeric_limits<unsigned int>::max(). Parameters (none) Return value The maximum potentially generated value. Complexity Constant See also min gets the smallest possible value in the output range          (public static member function) [static]

std::random_device::entropy – std::random_device::entropy Synopsis double entropy() const noexcept; (since C++ 11) Obtains an estimate of the random number device entropy, which is a floating-point value between 0 and log 2(max()+1) (which is equal to std::numeric_limits<unsigned int>::digits). If the device has n states whose individual probabilities are P 0,…,P n-1, the device entropy S is defined…

std::random_device – std::random_device Synopsis Defined in header <random> class random_device; (since C++11) std::random_device is a uniformly-distributed integer random number generator that produces non-deterministic random numbers. std::random_device may be implemented in terms of an implementation-defined pseudo-random number engine if a non-deterministic source (e.g. a hardware device) is not available to the implementation. In this case each…

std::random_access_iterator_tag – Synopsis Inherits std::bidirectional_iterator_tag. Detailed Description Random-access iterators support a superset of bidirectional iterator operations. Definition at line 103 of file stl_iterator_base_types.h. Author Generated automatically by Doxygen for libstdc++ from the source code.

std::rand – std::rand Synopsis Defined in header<cstdlib> int rand(); Returns a pseudo-random integral value between 0 and RAND_MAX (0 and RAND_MAX included). std::srand() seeds the pseudo-random number generator used by rand(). If rand() is used before any calls to srand(), rand() behaves as if it was seeded with srand(1). Each time rand() is seeded with…

std::raise – std::raise Synopsis Defined in header<csignal> int raise(int sig); Sends signal sig to the program. The signal handler (specified using the std::signal() function) is invoked. If the user-defined signal handling strategy is not set using std::signal() yet, it is implementation-defined whether the signal will be ignored or default handler will be invoked. Parameters       the…

std::quoted – std::quoted Synopsis Defined in header<iomanip> template <class CharT> /*unspecified*/ quoted(const CharT *s, (1)(since C++ 14) CharT delim = CharT(‘"’), CharT escape = CharT(‘\\’)); template <class CharT, class Traits, class Allocator> /*unspecified*/ quoted(const std::basic_string<CharT, Traits, Allocator> &s, (2)(since C++ 14) CharT delim = CharT(‘"’), CharT escape = CharT(‘\\’)); template <class CharT, class Traits> /*unspecified*/…