#include <algorithm>
#include <iterator>
#include <random>
Go to the source code of this file.
|
constexpr auto | less_than (auto y) |
|
template<std::random_access_iterator I, std::sentinel_for< I > S> |
constexpr bool | check_range (I b, S e) |
|
template<std::input_iterator I, std::sentinel_for< I > S> |
constexpr bool | contains (I b, S e, I i) |
|
template<std::forward_iterator I, std::sentinel_for< I > S> |
I | rand_it (I b, S e) |
|
template<std::input_iterator I, std::sentinel_for< I > S> |
constexpr bool | is_min_element (I b, S e, const auto &x) |
|
template<std::forward_iterator I, std::sentinel_for< I > S> |
constexpr I | min_element (I b, S e) |
|
template<std::forward_iterator I, std::sentinel_for< I > S> |
I | sort_element (I b, I i, S e) |
|
|
static std::random_device | rnd |
|
◆ check_range()
template<std::random_access_iterator I, std::sentinel_for< I > S>
bool check_range |
( |
I | b, |
|
|
S | e ) |
|
constexpr |
◆ contains()
template<std::input_iterator I, std::sentinel_for< I > S>
bool contains |
( |
I | b, |
|
|
S | e, |
|
|
I | i ) |
|
constexpr |
◆ is_min_element()
template<std::input_iterator I, std::sentinel_for< I > S>
bool is_min_element |
( |
I | b, |
|
|
S | e, |
|
|
const auto & | x ) |
|
constexpr |
◆ less_than()
◆ min_element()
template<std::forward_iterator I, std::sentinel_for< I > S>
I min_element |
( |
I | b, |
|
|
S | e ) |
|
constexpr |
◆ rand_it()
template<std::forward_iterator I, std::sentinel_for< I > S>
◆ sort_element()
template<std::forward_iterator I, std::sentinel_for< I > S>
I sort_element |
( |
I | b, |
|
|
I | i, |
|
|
S | e ) |
◆ rnd