|
| template<typename Sequence > |
| constexpr auto | cpp::constexp::begin (const Sequence &sequence) |
| | Returns an iterator pointing to the beginning of a sequence. More...
|
| |
| template<typename T , std::size_t N> |
| constexpr auto | cpp::constexp::begin (const T(&array)[N]) |
| | Returns an iterator pointing to the beginning of an array. More...
|
| |
| template<typename Sequence > |
| constexpr auto | cpp::constexp::end (const Sequence &sequence) |
| | Returns an iterator pointing to the end of a sequence. More...
|
| |
| template<typename T , std::size_t N> |
| constexpr auto | cpp::constexp::end (const T(&array)[N]) |
| | Returns an iterator pointing to the end of an array. More...
|
| |
|
template<typename Begin , typename End > |
| constexpr auto | cpp::constexp::distance (Begin begin, End end) |
| | Returns the distance between two iterators.
|
| |
| template<typename Begin1 , typename End1 , typename Begin2 , typename End2 , typename Compare > |
| constexpr bool | cpp::constexp::equal (Begin1 begin1, End1 end1, Begin2 begin2, End2 end2, Compare compare) |
| | Compares if two sequences are equal. More...
|
| |
| template<typename Begin1 , typename End1 , typename Begin2 , typename End2 > |
| constexpr bool | cpp::constexp::equal (Begin1 begin1, End1 end1, Begin2 begin2, End2 end2) |
| | Compares if two sequences are equal. More...
|
| |
| template<typename Lhs , typename Rhs > |
| constexpr bool | cpp::constexp::equal (const Lhs &lhs, const Rhs &rhs) |
| | Compares if two sequences are equal. More...
|
| |
| template<typename T > |
| constexpr const T & | cpp::constexp::max (const T &lhs, const T &rhs) |
| | Returns the greatest value of the two given. More...
|
| |
| template<typename T , typename U > |
| constexpr std::common_type_t< T, U > | cpp::constexp::max (const T &lhs, const U &rhs) |
| | Returns the greatest value of the two given. More...
|
| |
|
template<typename First , typename Second , typename Third , typename... Tail> |
| decltype(auto) constexpr | cpp::constexp::max (const First &first, const Second &second, const Third &third, const Tail &... tail) |
| | Returns the greatest value of the set of values given.
|
| |
| template<typename T > |
| constexpr const T & | cpp::constexp::min (const T &lhs, const T &rhs) |
| | Returns the smallest value of the two given. More...
|
| |
| template<typename T , typename U > |
| constexpr std::common_type_t< T, U > | cpp::constexp::min (const T &lhs, const U &rhs) |
| | Returns the smallest value of the two given. More...
|
| |
|
template<typename First , typename Second , typename Third , typename... Tail> |
| decltype(auto) constexpr | cpp::constexp::min (const First &first, const Second &second, const Third &third, const Tail &... tail) |
| | Returns the smallest value of the set of values given.
|
| |
|
template<typename Begin1 , typename End1 , typename Begin2 , typename End2 > |
| constexpr std::size_t | cpp::constexp::levenshteinDistance (Begin1 begin1, End1 end1, Begin2 begin2, End2 end2) |
| | Computes the distance between two sequences using the Levenshtein distance algorithm.
|
| |
|
template<typename Lhs , typename Rhs > |
| constexpr std::size_t | cpp::constexp::levenshteinDistance (const Lhs &lhs, const Rhs &rhs) |
| | Computes the distance between two sequences using the Levenshtein distance algorithm.
|
| |
| template<typename Iterator , typename T > |
| constexpr Iterator | cpp::constexp::find (Iterator begin, Iterator end, const T &value) |
| | Finds a value in a sequence. More...
|
| |
Constexpr counterparts of some standard algorithms.