coffee/etl
1
0
Fork 0
mirror of https://github.com/ETLCPP/etl.git synced 2026-06-16 17:06:05 +08:00
Code Issues Packages Projects Releases Wiki Activity
etl/include/etl/algorithm.h
James Wang 6770774f69
Delete the superfluous ; (#366)
2021-04-14 21:00:01 +01:00

3673 lines
116 KiB
C++
Raw Blame History

///\file
/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
Copyright(c) 2014 jwellbelove
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
******************************************************************************/
#ifndef ETL_ALGORITHM_INCLUDED
#define ETL_ALGORITHM_INCLUDED
///\defgroup algorithm algorithm
/// Including reverse engineered algorithms from C++ 0x11, 0x14, 0x17
/// Additional new variants of certain algorithms.
///\ingroup utilities
#include <stdint.h>
#include <string.h>
#include "platform.h"
#include "type_traits.h"
#include "container.h"
#include "iterator.h"
#include "functional.h"
#include "utility.h"
#if ETL_USING_STL
#include <algorithm>
#include <utility>
#include <iterator>
#include <functional>
#include <numeric>
#endif
#include "private/minmax_push.h"
namespace etl
{
// Declare prototypes of the ETL's sort functions
template <typename TIterator>
void shell_sort(TIterator first, TIterator last);
template <typename TIterator, typename TCompare>
void shell_sort(TIterator first, TIterator last, TCompare compare);
template <typename TIterator>
void insertion_sort(TIterator first, TIterator last);
template <typename TIterator, typename TCompare>
void insertion_sort(TIterator first, TIterator last, TCompare compare);
}
//*****************************************************************************
// Algorithms defined by the ETL
//*****************************************************************************
namespace etl
{
#if ETL_NOT_USING_STL
//***************************************************************************
// iter_swap
template <typename TIterator1, typename TIterator2>
void iter_swap(TIterator1 a, TIterator2 b)
{
using ETL_OR_STD::swap; // Allow ADL
swap(*a, *b);
}
#else
//***************************************************************************
// iter_swap
template <typename TIterator1, typename TIterator2>
void iter_swap(TIterator1 a, TIterator2 b)
{
std::iter_swap(a, b);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// swap_ranges
template <typename T1terator1, typename TIterator2>
TIterator2 swap_ranges(T1terator1 first1,
T1terator1 last1,
TIterator2 first2)
{
while (first1 != last1)
{
iter_swap(first1++, first2++);
}
return first2;
}
#else
//***************************************************************************
// swap_ranges
template <typename T1terator1, typename TIterator2>
TIterator2 swap_ranges(T1terator1 first1,
T1terator1 last1,
TIterator2 first2)
{
return std::swap_ranges(first1, last1, first2);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// copy
// Pointer
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<etl::is_pointer<TIterator1>::value &&
etl::is_pointer<TIterator2>::value &&
etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
copy(TIterator1 sb, TIterator1 se, TIterator2 db)
{
typedef typename etl::iterator_traits<TIterator1>::value_type value_t;
typedef typename etl::iterator_traits<TIterator1>::difference_type difference_t;
difference_t count = (se - sb);
return TIterator2(memmove(db, sb, sizeof(value_t) * count)) + count;
}
// Other iterator
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<!etl::is_pointer<TIterator1>::value ||
!etl::is_pointer<TIterator2>::value ||
!etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
copy(TIterator1 sb, TIterator1 se, TIterator2 db)
{
while (sb != se)
{
*db++ = *sb++;
}
return db;
}
#else
//***************************************************************************
// copy
template <typename TIterator1, typename TIterator2>
TIterator2 copy(TIterator1 sb, TIterator1 se, TIterator2 db)
{
return std::copy(sb, se, db);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// reverse_copy
template <typename TIterator1, typename TIterator2>
TIterator2 reverse_copy(TIterator1 sb, TIterator1 se, TIterator2 db)
{
while (sb != se)
{
*(db++) = *(--se);
}
return db;
}
#else
//***************************************************************************
// reverse_copy
template <typename TIterator1, typename TIterator2>
TIterator2 reverse_copy(TIterator1 sb, TIterator1 se, TIterator2 db)
{
return std::reverse_copy(sb, se, db);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
// copy_n
// Pointer
template <typename TIterator1, typename TSize, typename TIterator2>
typename etl::enable_if<etl::is_pointer<TIterator1>::value &&
etl::is_pointer<TIterator2>::value &&
etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
copy_n(TIterator1 sb, TSize count, TIterator2 db)
{
typedef typename etl::iterator_traits<TIterator1>::value_type value_t;
return TIterator2(memmove(db, sb, sizeof(value_t) * count)) + count;
}
// Other iterator
template <typename TIterator1, typename TSize, typename TIterator2>
typename etl::enable_if<!etl::is_pointer<TIterator1>::value ||
!etl::is_pointer<TIterator2>::value ||
!etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
copy_n(TIterator1 sb, TSize count, TIterator2 db)
{
while (count != 0)
{
*db++ = *sb++;
--count;
}
return db;
}
#else
//***************************************************************************
/// copy_n
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/copy_n"></a>
//***************************************************************************
template <typename TInputIterator, typename TSize, typename TOutputIterator>
TOutputIterator copy_n(TInputIterator i_begin,
TSize n,
TOutputIterator o_begin)
{
return std::copy_n(i_begin, n, o_begin);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// copy_backward
// Pointer
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<etl::is_pointer<TIterator1>::value &&
etl::is_pointer<TIterator2>::value &&
etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
copy_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
typedef typename etl::iterator_traits<TIterator1>::value_type value_t;
const size_t length = (se - sb);
return TIterator2(memmove(de - length, sb, sizeof(value_t) * length));
}
// Other iterator
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<!etl::is_pointer<TIterator1>::value ||
!etl::is_pointer<TIterator2>::value ||
!etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
copy_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
while (se != sb)
{
*(--de) = *(--se);
}
return de;
}
#else
//***************************************************************************
// copy_backward
template <typename TIterator1, typename TIterator2>
TIterator2 copy_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
return std::copy_backward(sb, se, de);
}
#endif
#if ETL_CPP11_SUPPORTED
#if ETL_NOT_USING_STL
//***************************************************************************
// move
// non-pointer or not trivially copyable
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<!etl::is_pointer<TIterator1>::value ||
!etl::is_pointer<TIterator2>::value ||
!etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
move(TIterator1 sb, TIterator1 se, TIterator2 db)
{
while (sb != se)
{
*db++ = etl::move(*sb++);
}
return db;
}
// pointer and trivially copyable
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<etl::is_pointer<TIterator1>::value &&
etl::is_pointer<TIterator2>::value &&
etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
move(TIterator1 sb, TIterator1 se, TIterator2 db)
{
typedef typename etl::iterator_traits<TIterator1>::value_type value_t;
typedef typename etl::iterator_traits<TIterator1>::difference_type difference_t;
difference_t count = (se - sb);
return TIterator2(memmove(db, sb, sizeof(value_t) * count)) + count;
}
#else
//***************************************************************************
// move
template <typename TIterator1, typename TIterator2>
TIterator2 move(TIterator1 sb, TIterator1 se, TIterator2 db)
{
return std::move(sb, se, db);
}
#endif
#else
// C++03
//***************************************************************************
// move
template <typename TIterator1, typename TIterator2>
TIterator2 move(TIterator1 sb, TIterator1 se, TIterator2 db)
{
// Move not supported. Defer to copy.
return etl::copy(sb, se, db);
}
#endif
#if ETL_CPP11_SUPPORTED
#if ETL_NOT_USING_STL
//***************************************************************************
// move_backward
// non-pointer, non-pod
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<!etl::is_pointer<TIterator1>::value ||
!etl::is_pointer<TIterator2>::value ||
!etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
move_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
while (sb != se)
{
*(--de) = etl::move(*(--se));
}
return de;
}
// pointer and pod
template <typename TIterator1, typename TIterator2>
typename etl::enable_if<etl::is_pointer<TIterator1>::value &&
etl::is_pointer<TIterator2>::value &&
etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, TIterator2>::type
move_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
typedef typename etl::iterator_traits<TIterator1>::value_type value_t;
typedef typename etl::iterator_traits<TIterator1>::difference_type difference_t;
difference_t count = (se - sb);
TIterator2 db = de - count;
return TIterator2(memmove(db, sb, sizeof(value_t) * count)) + count;
}
#else
//***************************************************************************
// move_backward
template <typename TIterator1, typename TIterator2>
TIterator2 move_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
return std::move_backward(sb, se, de);
}
#endif
#else
//***************************************************************************
// move_backward
template <typename TIterator1, typename TIterator2>
TIterator2 move_backward(TIterator1 sb, TIterator1 se, TIterator2 de)
{
// Move not supported. Defer to copy_backward.
return ETL_OR_STD::copy_backward(sb, se, de);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// reverse
// Pointers
template <typename TIterator>
typename etl::enable_if<etl::is_pointer<TIterator>::value, void>::type
reverse(TIterator b, TIterator e)
{
if (b != e)
{
while (b < --e)
{
etl::iter_swap(b, e);
++b;
}
}
}
// Other
template <typename TIterator>
typename etl::enable_if<!etl::is_pointer<TIterator>::value, void>::type
reverse(TIterator b, TIterator e)
{
while ((b != e) && (b != --e))
{
etl::iter_swap(b++, e);
}
}
#else
//***************************************************************************
// reverse
template <typename TIterator>
void reverse(TIterator b, TIterator e)
{
std::reverse(b, e);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// lower_bound
template<typename TIterator, typename TValue, typename TCompare>
ETL_NODISCARD
TIterator lower_bound(TIterator first, TIterator last, const TValue& value, TCompare compare)
{
typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
difference_t count = etl::distance(first, last);
while (count > 0)
{
TIterator itr = first;
difference_t step = count / 2;
etl::advance(itr, step);
if (compare(*itr, value))
{
first = ++itr;
count -= step + 1;
}
else
{
count = step;
}
}
return first;
}
template<typename TIterator, typename TValue>
ETL_NODISCARD
TIterator lower_bound(TIterator first, TIterator last, const TValue& value)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
return etl::lower_bound(first, last, value, compare());
}
#else
//***************************************************************************
// lower_bound
template<typename TIterator, typename TValue, typename TCompare>
ETL_NODISCARD
TIterator lower_bound(TIterator first, TIterator last, const TValue& value, TCompare compare)
{
return std::lower_bound(first, last, value, compare);
}
template<typename TIterator, typename TValue>
ETL_NODISCARD
TIterator lower_bound(TIterator first, TIterator last, const TValue& value)
{
return std::lower_bound(first, last, value);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// upper_bound
template<typename TIterator, typename TValue, typename TCompare>
ETL_NODISCARD
TIterator upper_bound(TIterator first, TIterator last, const TValue& value, TCompare compare)
{
typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
difference_t count = etl::distance(first, last);
while (count > 0)
{
TIterator itr = first;
difference_t step = count / 2;
etl::advance(itr, step);
if (!compare(value, *itr))
{
first = ++itr;
count -= step + 1;
}
else
{
count = step;
}
}
return first;
}
template<typename TIterator, typename TValue>
ETL_NODISCARD
TIterator upper_bound(TIterator first, TIterator last, const TValue& value)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
return etl::upper_bound(first, last, value, compare());
}
#else
//***************************************************************************
// upper_bound
template<typename TIterator, typename TValue, typename TCompare>
ETL_NODISCARD
TIterator upper_bound(TIterator first, TIterator last, const TValue& value, TCompare compare)
{
return std::upper_bound(first, last, value, compare);
}
template<typename TIterator, typename TValue>
ETL_NODISCARD
TIterator upper_bound(TIterator first, TIterator last, const TValue& value)
{
return std::upper_bound(first, last, value);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// equal_range
template<typename TIterator, typename TValue, typename TCompare>
ETL_NODISCARD
ETL_OR_STD::pair<TIterator, TIterator> equal_range(TIterator first, TIterator last, const TValue& value, TCompare compare)
{
return ETL_OR_STD::make_pair(etl::lower_bound(first, last, value, compare),
etl::upper_bound(first, last, value, compare));
}
template<typename TIterator, typename TValue>
ETL_NODISCARD
ETL_OR_STD::pair<TIterator, TIterator> equal_range(TIterator first, TIterator last, const TValue& value)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
return ETL_OR_STD::make_pair(etl::lower_bound(first, last, value, compare()),
etl::upper_bound(first, last, value, compare()));
}
#else
//***************************************************************************
// equal_range
template<typename TIterator, typename TValue, typename TCompare>
ETL_NODISCARD
std::pair<TIterator, TIterator> equal_range(TIterator first, TIterator last, const TValue& value, TCompare compare)
{
return std::equal_range(first, last, value, compare);
}
template<typename TIterator, typename TValue>
ETL_NODISCARD
std::pair<TIterator, TIterator> equal_range(TIterator first, TIterator last, const TValue& value)
{
return std::equal_range(first, last, value);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// find_if
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
TIterator find_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
while (first != last)
{
if (predicate(*first))
{
return first;
}
++first;
}
return last;
}
#else
//***************************************************************************
// find_if
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
TIterator find_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
return std::find_if(first, last, predicate);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// find
template <typename TIterator, typename T>
ETL_NODISCARD
TIterator find(TIterator first, TIterator last, const T& value)
{
while (first != last)
{
if (*first == value)
{
return first;
}
++first;
}
return last;
}
#else
//***************************************************************************
// find
template <typename TIterator, typename T>
ETL_NODISCARD
TIterator find(TIterator first, TIterator last, const T& value)
{
return std::find(first, last, value);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// fill
template<typename TIterator, typename TValue>
typename etl::enable_if<!(etl::is_same<char, TValue>::value || etl::is_same<unsigned char, TValue>::value) || !etl::is_pointer<TIterator>::value, void>::type
fill(TIterator first, TIterator last, const TValue& value)
{
while (first != last)
{
*first++ = value;
}
}
template<typename TIterator, typename TValue>
typename etl::enable_if<(etl::is_same<char, TValue>::value || etl::is_same<unsigned char, TValue>::value) && etl::is_pointer<TIterator>::value, void>::type
fill(TIterator first, TIterator last, const TValue& value)
{
memset(first, value, last - first);
}
#else
//***************************************************************************
// fill
template<typename TIterator, typename TValue>
void fill(TIterator first, TIterator last, const TValue& value)
{
std::fill(first, last, value);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// fill_n
template<typename TIterator, typename TSize, typename TValue>
typename etl::enable_if<!(etl::is_same<char, TValue>::value || etl::is_same<unsigned char, TValue>::value) || !etl::is_pointer<TIterator>::value, TIterator>::type
fill_n(TIterator first, TSize count, const TValue& value)
{
for (TSize i = 0; i < count; ++i)
{
*first++ = value;
}
return first;
}
template<typename TIterator, typename TSize, typename TValue>
typename etl::enable_if<(etl::is_same<char, TValue>::value || etl::is_same<unsigned char, TValue>::value) && etl::is_pointer<TIterator>::value, void>::type
fill_n(TIterator first, TSize count, const TValue& value)
{
memset(first, value, count);
}
#else
//***************************************************************************
// fill_n
template<typename TIterator, typename TSize, typename TValue>
TIterator fill_n(TIterator first, TSize count, const TValue& value)
{
#if ETL_CPP11_SUPPORTED
return std::fill_n(first, count, value);
#else
std::fill_n(first, count, value);
std::advance(first, count);
return first;
#endif
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// count
template <typename TIterator, typename T>
ETL_NODISCARD
typename etl::iterator_traits<TIterator>::difference_type count(TIterator first, TIterator last, const T& value)
{
typename iterator_traits<TIterator>::difference_type n = 0;
while (first != last)
{
if (*first == value)
{
++n;
}
++first;
}
return n;
}
#else
//***************************************************************************
// count
template <typename TIterator, typename T>
ETL_NODISCARD
typename std::iterator_traits<TIterator>::difference_type count(TIterator first, TIterator last, const T& value)
{
return std::count(first, last, value);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// count_if
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
typename etl::iterator_traits<TIterator>::difference_type count_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
typename iterator_traits<TIterator>::difference_type n = 0;
while (first != last)
{
if (predicate(*first))
{
++n;
}
++first;
}
return n;
}
#else
//***************************************************************************
// count_if
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
typename std::iterator_traits<TIterator>::difference_type count_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
return std::count_if(first, last, predicate);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// equal
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
typename etl::enable_if<!etl::is_pointer<TIterator1>::value || !etl::is_pointer<TIterator2>::value || !etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, bool>::type
equal(TIterator1 first1, TIterator1 last1, TIterator2 first2)
{
while (first1 != last1)
{
if (*first1++ != *first2++)
{
return false;
}
}
return true;
}
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
typename etl::enable_if<etl::is_pointer<TIterator1>::value && etl::is_pointer<TIterator2>::value && etl::is_trivially_copyable<typename etl::iterator_traits<TIterator1>::value_type>::value, bool>::type
equal(TIterator1 first1, TIterator1 last1, TIterator2 first2)
{
typedef typename etl::iterator_traits<TIterator1>::value_type value_t;
return (memcmp(first1, first2, sizeof(value_t) * (last1 - first1)) == 0);
}
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool equal(TIterator1 first1, TIterator1 last1, TIterator2 first2, TIterator2 last2)
{
return (etl::distance(first1, last1) == etl::distance(first2, last2)) &&
etl::equal(first1, last1, first2);
}
#else
//***************************************************************************
// equal
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool equal(TIterator1 first1, TIterator1 last1, TIterator2 first2)
{
return std::equal(first1, last1, first2);
}
#if ETL_CPP14_SUPPORTED
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool equal(TIterator1 first1, TIterator1 last1, TIterator2 first2, TIterator2 last2)
{
return std::equal(first1, last1, first2, last2);
}
#else
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool equal(TIterator1 first1, TIterator1 last1, TIterator2 first2, TIterator2 last2)
{
return (etl::distance(first1, last1) == etl::distance(first2, last2)) &&
etl::equal(first1, last1, first2);
}
#endif
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// lexicographical_compare
template <typename TIterator1, typename TIterator2, typename TCompare>
ETL_NODISCARD
bool lexicographical_compare(TIterator1 first1, TIterator1 last1,
TIterator2 first2, TIterator2 last2,
TCompare compare)
{
while ((first1 != last1) && (first2 != last2))
{
if (compare(*first1, *first2))
{
return true;
}
if (compare(*first2, *first1))
{
return false;
}
++first1;
++first2;
}
return (first1 == last1) && (first2 != last2);
}
//***************************************************************************
// lexicographical_compare
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool lexicographical_compare(TIterator1 first1, TIterator1 last1,
TIterator2 first2, TIterator2 last2)
{
typedef etl::less<typename etl::iterator_traits<TIterator1>::value_type> compare;
return etl::lexicographical_compare(first1, last1, first2, last2, compare());
}
#else
//***************************************************************************
// lexicographical_compare
template <typename TIterator1, typename TIterator2, typename TCompare>
ETL_NODISCARD
bool lexicographical_compare(TIterator1 first1, TIterator1 last1,
TIterator2 first2, TIterator2 last2,
TCompare compare)
{
return std::lexicographical_compare(first1, last1, first2, last2, compare);
}
//***************************************************************************
// lexicographical_compare
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool lexicographical_compare(TIterator1 first1, TIterator1 last1,
TIterator2 first2, TIterator2 last2)
{
return std::lexicographical_compare(first1, last1, first2, last2);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// min
template <typename T, typename TCompare>
ETL_NODISCARD
ETL_CONSTEXPR const T& min(const T& a, const T& b, TCompare compare)
{
return (compare(a, b)) ? a : b;
}
template <typename T>
ETL_NODISCARD
ETL_CONSTEXPR const T& min(const T& a, const T& b)
{
typedef etl::less<T> compare;
return etl::min(a, b, compare());
}
#else
//***************************************************************************
// min
template <typename T, typename TCompare>
ETL_NODISCARD
ETL_CONSTEXPR const T& min(const T& a, const T& b, TCompare compare)
{
return std::min(a, b, compare);
}
template <typename T>
ETL_NODISCARD
ETL_CONSTEXPR const T& min(const T& a, const T& b)
{
return std::min(a, b);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// max
template <typename T, typename TCompare>
ETL_NODISCARD
ETL_CONSTEXPR const T& max(const T& a, const T& b, TCompare compare)
{
return (compare(a, b)) ? b : a;
}
template <typename T>
ETL_NODISCARD
ETL_CONSTEXPR const T& max(const T& a, const T& b)
{
typedef etl::less<T> compare;
return etl::max(a, b, compare());
}
#else
//***************************************************************************
// max
template <typename T, typename TCompare>
ETL_NODISCARD
ETL_CONSTEXPR const T& max(const T& a, const T& b, TCompare compare)
{
return std::max(a, b, compare);
}
template <typename T>
ETL_NODISCARD
ETL_CONSTEXPR const T& max(const T& a, const T& b)
{
return std::max(a, b);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// for_each
template <typename TIterator, typename TUnaryOperation>
ETL_CONSTEXPR14 TUnaryOperation for_each(TIterator first, TIterator last, TUnaryOperation unary_operation)
{
while (first != last)
{
unary_operation(*first++);
}
return unary_operation;
}
#else
//***************************************************************************
// for_each
template <typename TIterator, typename TUnaryOperation>
ETL_CONSTEXPR14 TUnaryOperation for_each(TIterator first, TIterator last, TUnaryOperation unary_operation)
{
return std::for_each(first, last, unary_operation);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// transform
template <typename TIteratorIn, typename TIteratorOut, typename TUnaryOperation>
TIteratorOut transform(TIteratorIn first1, TIteratorIn last1, TIteratorOut d_first, TUnaryOperation unary_operation)
{
while (first1 != last1)
{
*d_first++ = unary_operation(*first1++);
}
return d_first;
}
template <typename TIteratorIn1, typename TIteratorIn2, typename TIteratorOut, typename TBinaryOperation>
TIteratorOut transform(TIteratorIn1 first1, TIteratorIn1 last1, TIteratorIn2 first2, TIteratorOut d_first, TBinaryOperation binary_operation)
{
while (first1 != last1)
{
*d_first++ = binary_operation(*first1++, *first2++);
}
return d_first;
}
#else
//***************************************************************************
// transform
template <typename TIteratorIn, typename TIteratorOut, typename TUnaryOperation>
TIteratorOut transform(TIteratorIn first1, TIteratorIn last1, TIteratorOut d_first, TUnaryOperation unary_operation)
{
return std::transform(first1, last1, d_first, unary_operation);
}
template <typename TIteratorIn1, typename TIteratorIn2, typename TIteratorOut, typename TBinaryOperation>
TIteratorOut transform(TIteratorIn1 first1, TIteratorIn1 last1, TIteratorIn2 first2, TIteratorOut d_first, TBinaryOperation binary_operation)
{
return std::transform(first1, last1, first2, d_first, binary_operation);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// replace
template <typename TIterator, typename T>
ETL_CONSTEXPR14 void replace(TIterator first, TIterator last, const T& old_value, const T& new_value)
{
while (first != last)
{
if (*first == old_value)
{
*first = new_value;
}
++first;
}
}
//***************************************************************************
// replace_if
template <typename TIterator, typename TPredicate, typename T>
ETL_CONSTEXPR14 void replace_if(TIterator first, TIterator last, TPredicate predicate, const T& new_value)
{
while (first != last)
{
if (predicate(*first))
{
*first = new_value;
}
++first;
}
}
#else
//***************************************************************************
// replace
template <typename TIterator, typename T>
ETL_CONSTEXPR14 void replace(TIterator first, TIterator last, const T& old_value, const T& new_value)
{
std::replace(first, last, old_value, new_value);
}
//***************************************************************************
// replace_if
template <typename TIterator, typename TPredicate, typename T>
ETL_CONSTEXPR14 void replace_if(TIterator first, TIterator last, TPredicate predicate, const T& new_value)
{
std::replace_if(first, last, predicate, new_value);
}
#endif
//***************************************************************************
// Heap
namespace private_heap
{
// Push Heap Helper
template <typename TIterator, typename TDistance, typename TValue, typename TCompare>
void push_heap(TIterator first, TDistance value_index, TDistance top_index, TValue value, TCompare compare)
{
TDistance parent = (value_index - 1) / 2;
while ((value_index > top_index) && compare(first[parent], value))
{
first[value_index] = etl::move(first[parent]);
value_index = parent;
parent = (value_index - 1) / 2;
}
first[value_index] = etl::move(value);
}
// Adjust Heap Helper
template <typename TIterator, typename TDistance, typename TValue, typename TCompare>
void adjust_heap(TIterator first, TDistance value_index, TDistance length, TValue value, TCompare compare)
{
TDistance top_index = value_index;
TDistance child2nd = (2 * value_index) + 2;
while (child2nd < length)
{
if (compare(first[child2nd], first[child2nd - 1]))
{
--child2nd;
}
first[value_index] = etl::move(first[child2nd]);
value_index = child2nd;
child2nd = 2 * (child2nd + 1);
}
if (child2nd == length)
{
first[value_index] = etl::move(first[child2nd - 1]);
value_index = child2nd - 1;
}
push_heap(first, value_index, top_index, etl::move(value), compare);
}
// Is Heap Helper
template <typename TIterator, typename TDistance, typename TCompare>
bool is_heap(const TIterator first, const TDistance n, TCompare compare)
{
TDistance parent = 0;
for (TDistance child = 1; child < n; ++child)
{
if (compare(first[parent], first[child]))
{
return false;
}
if ((child & 1) == 0)
{
++parent;
}
}
return true;
}
}
#if ETL_NOT_USING_STL
// Pop Heap
template <typename TIterator, typename TCompare>
void pop_heap(TIterator first, TIterator last, TCompare compare)
{
typedef typename etl::iterator_traits<TIterator>::value_type value_t;
typedef typename etl::iterator_traits<TIterator>::difference_type distance_t;
value_t value = etl::move(last[-1]);
last[-1] = etl::move(first[0]);
private_heap::adjust_heap(first, distance_t(0), distance_t(last - first - 1), etl::move(value), compare);
}
// Pop Heap
template <typename TIterator>
void pop_heap(TIterator first, TIterator last)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
etl::pop_heap(first, last, compare());
}
// Push Heap
template <typename TIterator, typename TCompare>
void push_heap(TIterator first, TIterator last, TCompare compare)
{
typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
typedef typename etl::iterator_traits<TIterator>::value_type value_t;
private_heap::push_heap(first, difference_t(last - first - 1), difference_t(0), value_t(etl::move(*(last - 1))), compare);
}
// Push Heap
template <typename TIterator>
void push_heap(TIterator first, TIterator last)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
etl::push_heap(first, last, compare());
}
// Make Heap
template <typename TIterator, typename TCompare>
void make_heap(TIterator first, TIterator last, TCompare compare)
{
typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
if ((last - first) < 2)
{
return;
}
difference_t length = last - first;
difference_t parent = (length - 2) / 2;
while (true)
{
private_heap::adjust_heap(first, parent, length, etl::move(*(first + parent)), compare);
if (parent == 0)
{
return;
}
--parent;
}
}
// Make Heap
template <typename TIterator>
void make_heap(TIterator first, TIterator last)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
etl::make_heap(first, last, compare());
}
// Is Heap
template <typename TIterator>
ETL_NODISCARD
bool is_heap(TIterator first, TIterator last)
{
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
return private_heap::is_heap(first, last - first, compare());
}
// Is Heap
template <typename TIterator, typename TCompare>
ETL_NODISCARD
bool is_heap(TIterator first, TIterator last, TCompare compare)
{
return private_heap::is_heap(first, last - first, compare);
}
// Sort Heap
template <typename TIterator>
void sort_heap(TIterator first, TIterator last)
{
while (first != last)
{
etl::pop_heap(first, last--);
}
}
// Sort Heap
template <typename TIterator, typename TCompare>
void sort_heap(TIterator first, TIterator last, TCompare compare)
{
while (first != last)
{
etl::pop_heap(first, last--, compare);
}
}
#else
//***************************************************************************
// Heap
// Pop Heap
template <typename TIterator, typename TCompare>
void pop_heap(TIterator first, TIterator last, TCompare compare)
{
std::pop_heap(first, last, compare);
}
// Pop Heap
template <typename TIterator>
void pop_heap(TIterator first, TIterator last)
{
std::pop_heap(first, last);
}
// Push Heap
template <typename TIterator, typename TCompare>
void push_heap(TIterator first, TIterator last, TCompare compare)
{
std::push_heap(first, last, compare);
}
// Push Heap
template <typename TIterator>
void push_heap(TIterator first, TIterator last)
{
std::push_heap(first, last);
}
// Make Heap
template <typename TIterator, typename TCompare>
void make_heap(TIterator first, TIterator last, TCompare compare)
{
std::make_heap(first, last, compare);
}
// Make Heap
template <typename TIterator>
void make_heap(TIterator first, TIterator last)
{
std::make_heap(first, last);
}
// Is Heap
template <typename TIterator, typename TCompare>
ETL_NODISCARD
bool is_heap(TIterator first, TIterator last, TCompare compare)
{
#if ETL_CPP11_SUPPORTED
return std::is_heap(first, last, compare);
#else
return private_heap::is_heap(first, last - first, compare());
#endif
}
// Is Heap
template <typename TIterator>
ETL_NODISCARD
bool is_heap(TIterator first, TIterator last)
{
#if ETL_CPP11_SUPPORTED
return std::is_heap(first, last);
#else
typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
return private_heap::is_heap(first, last - first, compare());
#endif
}
// Sort Heap
template <typename TIterator, typename TCompare>
void sort_heap(TIterator first, TIterator last, TCompare compare)
{
std::sort_heap(first, last, compare);
}
// Sort Heap
template <typename TIterator>
void sort_heap(TIterator first, TIterator last)
{
std::sort_heap(first, last);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// Search
template<typename TIterator1, typename TIterator2, typename TCompare>
ETL_NODISCARD
TIterator1 search(TIterator1 first, TIterator1 last, TIterator2 search_first, TIterator2 search_last, TCompare compare)
{
while (true)
{
TIterator1 itr = first;
TIterator2 search_itr = search_first;
while (true)
{
if (search_itr == search_last)
{
return first;
}
if (itr == last)
{
return last;
}
if (!compare(*itr, *search_itr))
{
break;
}
++itr;
++search_itr;
}
++first;
}
}
// Search
template<typename TIterator1, typename TIterator2>
ETL_NODISCARD
TIterator1 search(TIterator1 first, TIterator1 last, TIterator2 search_first, TIterator2 search_last)
{
typedef etl::equal_to<typename etl::iterator_traits<TIterator1>::value_type> compare;
return etl::search(first, last, search_first, search_last, compare());
}
#else
//***************************************************************************
// Search
template<typename TIterator1, typename TIterator2, typename TCompare>
ETL_NODISCARD
TIterator1 search(TIterator1 first, TIterator1 last, TIterator2 search_first, TIterator2 search_last, TCompare compare)
{
return std::search(first, last, search_first, search_last, compare);
}
// Search
template<typename TIterator1, typename TIterator2>
ETL_NODISCARD
TIterator1 search(TIterator1 first, TIterator1 last, TIterator2 search_first, TIterator2 search_last)
{
return std::search(first, last, search_first, search_last);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// Rotate
namespace private_algorithm
{
//*********************************
template <typename TIterator>
TIterator rotate_general(TIterator first, TIterator middle, TIterator last)
{
TIterator next = middle;
while (first != next)
{
using ETL_OR_STD::swap; // Allow ADL
swap(*first++, *next++);
if (next == last)
{
next = middle;
}
else if (first == middle)
{
middle = next;
}
}
return first;
}
//*********************************
template <typename TIterator>
TIterator rotate_left_by_one(TIterator first, TIterator last)
{
typedef typename etl::iterator_traits<TIterator>::value_type value_type;
// Save the first item.
value_type temp(etl::move(*first));
// Move the rest.
TIterator result = etl::move(etl::next(first), last, first);
// Restore the first item in its rotated position.
*result = etl::move(temp);
// The new position of the first item.
return result;
}
//*********************************
template <typename TIterator>
TIterator rotate_right_by_one(TIterator first, TIterator last)
{
typedef typename etl::iterator_traits<TIterator>::value_type value_type;
// Save the last item.
TIterator previous = etl::prev(last);
value_type temp(etl::move(*previous));
// Move the rest.
TIterator result = etl::move_backward(first, previous, last);
// Restore the last item in its rotated position.
*first = etl::move(temp);
// The new position of the first item.
return result;
}
}
//*********************************
template<typename TIterator>
TIterator rotate(TIterator first, TIterator middle, TIterator last)
{
if (etl::next(first) == middle)
{
return private_algorithm::rotate_left_by_one(first, last);
}
if (etl::next(middle) == last)
{
return private_algorithm::rotate_right_by_one(first, last);
}
return private_algorithm::rotate_general(first, middle, last);
}
#else
//***************************************************************************
// Rotate
template<typename TIterator>
TIterator rotate(TIterator first, TIterator middle, TIterator last)
{
return std::rotate(first, middle, last);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
// find_end
// Predicate
template <typename TIterator1, typename TIterator2, typename TPredicate>
ETL_NODISCARD
TIterator1 find_end(TIterator1 b, TIterator1 e,
TIterator2 sb, TIterator2 se,
TPredicate predicate)
{
if (sb == se)
{
return e;
}
TIterator1 result = e;
while (true)
{
TIterator1 new_result = etl::search(b, e, sb, se, predicate);
if (new_result == e)
{
break;
}
else
{
result = new_result;
b = result;
++b;
}
}
return result;
}
// Default
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
TIterator1 find_end(TIterator1 b, TIterator1 e,
TIterator2 sb, TIterator2 se)
{
typedef etl::equal_to<typename etl::iterator_traits<TIterator1>::value_type> predicate;
return find_end(b, e, sb, se, predicate());
}
#else
//***************************************************************************
// find_end
// Predicate
template <typename TIterator1, typename TIterator2, typename TPredicate>
ETL_NODISCARD
TIterator1 find_end(TIterator1 b, TIterator1 e,
TIterator2 sb, TIterator2 se,
TPredicate predicate)
{
return std::find_end(b, e, sb, se, predicate);
}
// Default
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
TIterator1 find_end(TIterator1 b, TIterator1 e,
TIterator2 sb, TIterator2 se)
{
return std::find_end(b, e, sb, se);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
/// Finds the iterator to the smallest element in the range (begin, end).<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/min_element"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
TIterator min_element(TIterator begin,
TIterator end,
TCompare compare)
{
TIterator minimum = begin;
while (begin != end)
{
if (compare(*begin, *minimum))
{
minimum = begin;
}
++begin;
}
return minimum;
}
//***************************************************************************
/// min_element
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/min_element"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
TIterator min_element(TIterator begin,
TIterator end)
{
typedef typename etl::iterator_traits<TIterator>::value_type value_t;
return etl::min_element(begin, end, etl::less<value_t>());
}
#else
//***************************************************************************
/// Finds the iterator to the smallest element in the range (begin, end).<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/min_element"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
TIterator min_element(TIterator begin,
TIterator end,
TCompare compare)
{
return std::min_element(begin, end, compare);
}
//***************************************************************************
/// min_element
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/min_element"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
TIterator min_element(TIterator begin,
TIterator end)
{
return std::min_element(begin, end);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
/// Finds the iterator to the largest element in the range (begin, end).<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/max_element"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
TIterator max_element(TIterator begin,
TIterator end,
TCompare compare)
{
TIterator maximum = begin;
while (begin != end)
{
if (!compare(*begin, *maximum))
{
maximum = begin;
}
++begin;
}
return maximum;
}
//***************************************************************************
/// max_element
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/max_element"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
TIterator max_element(TIterator begin,
TIterator end)
{
typedef typename etl::iterator_traits<TIterator>::value_type value_t;
return etl::max_element(begin, end, etl::less<value_t>());
}
#else
//***************************************************************************
/// Finds the iterator to the largest element in the range (begin, end).<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/max_element"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
TIterator max_element(TIterator begin,
TIterator end,
TCompare compare)
{
return std::max_element(begin, end, compare);
}
//***************************************************************************
/// max_element
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/max_element"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
TIterator max_element(TIterator begin,
TIterator end)
{
return std::max_element(begin, end);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// Finds the greatest and the smallest element in the range (begin, end).<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax_element"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
ETL_OR_STD::pair<TIterator, TIterator> minmax_element(TIterator begin,
TIterator end,
TCompare compare)
{
TIterator minimum = begin;
TIterator maximum = begin;
while (begin != end)
{
if (compare(*begin, *minimum))
{
minimum = begin;
}
if (compare(*maximum, *begin))
{
maximum = begin;
}
++begin;
}
return ETL_OR_STD::pair<TIterator, TIterator>(minimum, maximum);
}
//***************************************************************************
/// minmax_element
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax_element"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
ETL_OR_STD::pair<TIterator, TIterator> minmax_element(TIterator begin,
TIterator end)
{
typedef typename etl::iterator_traits<TIterator>::value_type value_t;
return etl::minmax_element(begin, end, etl::less<value_t>());
}
#else
//***************************************************************************
/// Finds the greatest and the smallest element in the range (begin, end).<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax_element"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
std::pair<TIterator, TIterator> minmax_element(TIterator begin,
TIterator end,
TCompare compare)
{
return std::minmax_element(begin, end, compare);
}
//***************************************************************************
/// minmax_element
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax_element"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
std::pair<TIterator, TIterator> minmax_element(TIterator begin,
TIterator end)
{
return std::minmax_element(begin, end);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// minmax
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax"></a>
//***************************************************************************
template <typename T>
ETL_NODISCARD
ETL_OR_STD::pair<const T&, const T&> minmax(const T& a,
const T& b)
{
return (b < a) ? ETL_OR_STD::pair<const T&, const T&>(b, a) : ETL_OR_STD::pair<const T&, const T&>(a, b);
}
//***************************************************************************
/// minmax
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax"></a>
//***************************************************************************
template <typename T, typename TCompare>
ETL_NODISCARD
ETL_OR_STD::pair<const T&, const T&> minmax(const T& a,
const T& b,
TCompare compare)
{
return compare(b, a) ? ETL_OR_STD::pair<const T&, const T&>(b, a) : ETL_OR_STD::pair<const T&, const T&>(a, b);
}
#else
//***************************************************************************
/// minmax
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax"></a>
//***************************************************************************
template <typename T>
ETL_NODISCARD
std::pair<const T&, const T&> minmax(const T& a,
const T& b)
{
return std::minmax(a, b);
}
//***************************************************************************
/// minmax
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/minmax"></a>
//***************************************************************************
template <typename T, typename TCompare>
ETL_NODISCARD
std::pair<const T&, const T&> minmax(const T& a,
const T& b,
TCompare compare)
{
return std::minmax(a, b, compare);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// is_sorted_until
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
TIterator is_sorted_until(TIterator begin,
TIterator end)
{
if (begin != end)
{
TIterator next = begin;
while (++next != end)
{
if (*next < *begin)
{
return next;
}
++begin;
}
}
return end;
}
//***************************************************************************
/// is_sorted_until
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until"></a>
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
TIterator is_sorted_until(TIterator begin,
TIterator end,
TCompare compare)
{
if (begin != end)
{
TIterator next = begin;
while (++next != end)
{
if (compare(*next, *begin))
{
return next;
}
++begin;
}
}
return end;
}
#else
//***************************************************************************
/// is_sorted_until
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until"></a>
//***************************************************************************
template <typename TIterator>
ETL_NODISCARD
TIterator is_sorted_until(TIterator begin,
TIterator end)
{
return std::is_sorted_until(begin, end);
}
//***************************************************************************
/// is_sorted_until
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until"></a>
//***************************************************************************
template <typename TIterator, typename TCompare>
ETL_NODISCARD
TIterator is_sorted_until(TIterator begin,
TIterator end,
TCompare compare)
{
return std::is_sorted_until(begin, end, compare);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// is_sorted
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted"></a>
//***************************************************************************
template<typename TIterator>
ETL_NODISCARD
bool is_sorted(TIterator begin,
TIterator end)
{
return etl::is_sorted_until(begin, end) == end;
}
//***************************************************************************
/// is_sorted
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted"></a>
//***************************************************************************
template<typename TIterator, typename TCompare>
ETL_NODISCARD
bool is_sorted(TIterator begin,
TIterator end,
TCompare compare)
{
return etl::is_sorted_until(begin, end, compare) == end;
}
#else
//***************************************************************************
/// is_sorted
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted"></a>
//***************************************************************************
template<typename TIterator>
ETL_NODISCARD
bool is_sorted(TIterator begin,
TIterator end)
{
return std::is_sorted(begin, end);
}
//***************************************************************************
/// is_sorted
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted"></a>
//***************************************************************************
template<typename TIterator, typename TCompare>
ETL_NODISCARD
bool is_sorted(TIterator begin,
TIterator end,
TCompare compare)
{
return std::is_sorted(begin, end, compare);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// find_if_not
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/find"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
TIterator find_if_not(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (!predicate(*begin))
{
return begin;
}
++begin;
}
return end;
}
#else
//***************************************************************************
/// find_if_not
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/find"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
TIterator find_if_not(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return std::find_if_not(begin, end, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2)
{
if (begin1 != end1)
{
TIterator2 end2 = begin2;
etl::advance(end2, etl::distance(begin1, end1));
for (TIterator1 i = begin1; i != end1; ++i)
{
if (i == etl::find(begin1, i, *i))
{
size_t n = etl::count(begin2, end2, *i);
if (n == 0 || size_t(etl::count(i, end1, *i)) != n)
{
return false;
}
}
}
}
return true;
}
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2, typename TBinaryPredicate>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2,
TBinaryPredicate predicate)
{
if (begin1 != end1)
{
TIterator2 end2 = begin2;
etl::advance(end2, etl::distance(begin1, end1));
for (TIterator1 i = begin1; i != end1; ++i)
{
if (i == etl::find_if(begin1, i, etl::bind1st(predicate, *i)))
{
size_t n = etl::count(begin2, end2, *i);
if (n == 0 || size_t(etl::count(i, end1, *i)) != n)
{
return false;
}
}
}
}
return true;
}
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2,
TIterator2 end2)
{
if (begin1 != end1)
{
for (TIterator1 i = begin1; i != end1; ++i)
{
if (i == etl::find(begin1, i, *i))
{
size_t n = etl::count(begin2, end2, *i);
if (n == 0 || size_t(etl::count(i, end1, *i)) != n)
{
return false;
}
}
}
}
return true;
}
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2, typename TBinaryPredicate>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2,
TIterator2 end2,
TBinaryPredicate predicate)
{
if (begin1 != end1)
{
for (TIterator1 i = begin1; i != end1; ++i)
{
if (i == etl::find_if(begin1, i, etl::bind1st(predicate, *i)))
{
size_t n = etl::count(begin2, end2, *i);
if (n == 0 || size_t(etl::count(i, end1, *i)) != n)
{
return false;
}
}
}
}
return true;
}
#else
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2)
{
return std::is_permutation(begin1, end1, begin2);
}
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2, typename TBinaryPredicate>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2,
TBinaryPredicate predicate)
{
return std::is_permutation(begin1, end1, begin2, predicate);
}
#if ETL_CPP14_SUPPORTED
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2,
TIterator2 end2)
{
return std::is_permutation(begin1, end1, begin2, end2);
}
//***************************************************************************
/// is_permutation
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation"></a>
//***************************************************************************
template <typename TIterator1, typename TIterator2, typename TBinaryPredicate>
ETL_NODISCARD
bool is_permutation(TIterator1 begin1,
TIterator1 end1,
TIterator2 begin2,
TIterator2 end2,
TBinaryPredicate predicate)
{
return std::is_permutation(begin1, end1, begin2, end2, predicate);
}
#endif
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// is_partitioned
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_partitioned"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool is_partitioned(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (!predicate(*begin++))
{
break;
}
}
while (begin != end)
{
if (predicate(*begin++))
{
return false;
}
}
return true;
}
#else
//***************************************************************************
/// is_partitioned
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/is_partitioned"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool is_partitioned(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return std::is_partitioned(begin, end, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// partition_point
///<a href="http://en.cppreference.com/w/cpp/algorithm/partition_point"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
TIterator partition_point(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (!predicate(*begin))
{
return begin;
}
++begin;
}
return begin;
}
#else
//***************************************************************************
/// partition_point
///<a href="http://en.cppreference.com/w/cpp/algorithm/partition_point"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
TIterator partition_point(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return std::partition_point(begin, end, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// Copies the elements from the range (begin, end) to two different ranges
/// depending on the value returned by the predicate.<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/partition_copy"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TSource, typename TDestinationTrue, typename TDestinationFalse, typename TUnaryPredicate>
ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse> partition_copy(TSource begin,
TSource end,
TDestinationTrue destination_true,
TDestinationFalse destination_false,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (predicate(*begin))
{
*destination_true++ = *begin++;
}
else
{
*destination_false++ = *begin++;
}
}
return ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse>(destination_true, destination_false);
}
#else
//***************************************************************************
/// Copies the elements from the range (begin, end) to two different ranges
/// depending on the value returned by the predicate.<br>
///<a href="http://en.cppreference.com/w/cpp/algorithm/partition_copy"></a>
///\ingroup algorithm
//***************************************************************************
template <typename TSource, typename TDestinationTrue, typename TDestinationFalse, typename TUnaryPredicate>
std::pair<TDestinationTrue, TDestinationFalse> partition_copy(TSource begin,
TSource end,
TDestinationTrue destination_true,
TDestinationFalse destination_false,
TUnaryPredicate predicate)
{
return std::partition_copy(begin, end, destination_true, destination_false, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// copy_if
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/copy"></a>
//***************************************************************************
template <typename TIterator, typename TOutputIterator, typename TUnaryPredicate>
TOutputIterator copy_if(TIterator begin,
TIterator end,
TOutputIterator out,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (predicate(*begin))
{
*out++ = *begin;
}
++begin;
}
return out;
}
#else
//***************************************************************************
/// copy_if
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/copy"></a>
//***************************************************************************
template <typename TIterator, typename TOutputIterator, typename TUnaryPredicate>
TOutputIterator copy_if(TIterator begin,
TIterator end,
TOutputIterator out,
TUnaryPredicate predicate)
{
return std::copy_if(begin, end, out, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// all_of
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool all_of(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return etl::find_if_not(begin, end, predicate) == end;
}
#else
//***************************************************************************
/// all_of
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool all_of(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return std::all_of(begin, end, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// any_of
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool any_of(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return etl::find_if(begin, end, predicate) != end;
}
#else
//***************************************************************************
/// any_of
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool any_of(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return std::any_of(begin, end, predicate);
}
#endif
#if ETL_NOT_USING_STL || ETL_CPP11_NOT_SUPPORTED
//***************************************************************************
/// none_of
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool none_of(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return etl::find_if(begin, end, predicate) == end;
}
#else
//***************************************************************************
/// none_of
///\ingroup algorithm
///<a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of"></a>
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
ETL_NODISCARD
bool none_of(TIterator begin,
TIterator end,
TUnaryPredicate predicate)
{
return std::none_of(begin, end, predicate);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
/// Sorts the elements.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void sort(TIterator first, TIterator last, TCompare compare)
{
etl::shell_sort(first, last, compare);
}
//***************************************************************************
/// Sorts the elements.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void sort(TIterator first, TIterator last)
{
etl::shell_sort(first, last, etl::less<typename etl::iterator_traits<TIterator>::value_type>());
}
//***************************************************************************
/// Sorts the elements.
/// Stable.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void stable_sort(TIterator first, TIterator last, TCompare compare)
{
etl::insertion_sort(first, last, compare);
}
//***************************************************************************
/// Sorts the elements.
/// Stable.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void stable_sort(TIterator first, TIterator last)
{
etl::insertion_sort(first, last, etl::less<typename etl::iterator_traits<TIterator>::value_type>());
}
#else
//***************************************************************************
/// Sorts the elements.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void sort(TIterator first, TIterator last, TCompare compare)
{
std::sort(first, last, compare);
}
//***************************************************************************
/// Sorts the elements.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void sort(TIterator first, TIterator last)
{
std::sort(first, last);
}
//***************************************************************************
/// Sorts the elements.
/// Stable.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void stable_sort(TIterator first, TIterator last, TCompare compare)
{
std::stable_sort(first, last, compare);
}
//***************************************************************************
/// Sorts the elements.
/// Stable.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void stable_sort(TIterator first, TIterator last)
{
std::stable_sort(first, last);
}
#endif
#if ETL_NOT_USING_STL
//***************************************************************************
/// Accumulates values.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename T>
ETL_CONSTEXPR14 T accumulate(TIterator first, TIterator last, T sum)
{
while (first != last)
{
sum = etl::move(sum) + *first++;
}
return sum;
}
//***************************************************************************
/// Accumulates values.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename T, typename TBinaryOperation>
ETL_CONSTEXPR14 T accumulate(TIterator first, TIterator last, T sum, TBinaryOperation operation)
{
while (first != last)
{
sum = operation(etl::move(sum), *first++);
}
return sum;
}
#else
//***************************************************************************
/// Accumulates values.
///\ingroup algorithm
//***************************************************************************
template<typename TIterator, typename T>
ETL_CONSTEXPR14 T accumulate(TIterator first, TIterator last, T sum)
{
return std::accumulate(first, last, sum);
}
//***************************************************************************
/// Accumulates values.
///\ingroup algorithm
//***************************************************************************
template<typename TIterator, typename T, typename TBinaryOperation>
ETL_CONSTEXPR14 T accumulate(TIterator first, TIterator last, T sum, TBinaryOperation operation)
{
return std::accumulate(first, last, sum, operation);
}
#endif
//***************************************************************************
/// Clamp values.
///\ingroup algorithm
//***************************************************************************
template<typename T, typename TCompare>
ETL_CONSTEXPR const T& clamp(const T& value, const T& low, const T& high, TCompare compare)
{
return compare(value, low) ? low : compare(high, value) ? high : value;
}
template <typename T>
ETL_CONSTEXPR const T& clamp(const T& value, const T& low, const T& high )
{
return clamp(value, low, high, etl::less<T>());
}
#if ETL_NOT_USING_STL
//***************************************************************************
/// Remove
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename T>
TIterator remove(TIterator first, TIterator last, const T& value)
{
first = etl::find(first, last, value);
if (first != last)
{
TIterator itr = first;
while (itr != last)
{
if (!(*itr == value))
{
*first++ = etl::move(*itr);
}
++itr;
}
}
return first;
}
//***************************************************************************
/// Remove If
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
TIterator remove_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
first = etl::find_if(first, last, predicate);
if (first != last)
{
TIterator itr = first;
while (itr != last)
{
if (!predicate(*itr))
{
*first++ = etl::move(*itr);
}
++itr;
}
}
return first;
}
#else
//***************************************************************************
/// Remove
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename T>
TIterator remove(TIterator first, TIterator last, const T& value)
{
return std::remove(first, last, value);
}
//***************************************************************************
/// Remove If
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TUnaryPredicate>
TIterator remove_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
return std::remove_if(first, last, predicate);
}
#endif
}
//*****************************************************************************
// ETL extensions to the STL algorithms.
//*****************************************************************************
namespace etl
{
//***************************************************************************
/// copy_s
/// A safer form of copy where the smallest of the two ranges is used.
/// There is currently no STL equivalent.
/// Specialisation for random access iterators.
///\param i_begin Beginning of the input range.
///\param i_end End of the input range.
///\param o_begin Beginning of the output range.
///\param o_end End of the output range.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TOutputIterator>
typename etl::enable_if<etl::is_random_iterator<TInputIterator>::value &&
etl::is_random_iterator<TOutputIterator>::value, TOutputIterator>::type
copy_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end)
{
size_t s_size = etl::distance(i_begin, i_end);
size_t d_size = etl::distance(o_begin, o_end);
size_t size = (s_size < d_size) ? s_size : d_size;
return etl::copy(i_begin, i_begin + size, o_begin);
}
//***************************************************************************
/// copy
/// A safer form of copy where the smallest of the two ranges is used.
/// There is currently no STL equivalent.
/// Specialisation for non random access iterators.
///\param i_begin Beginning of the input range.
///\param i_end End of the input range.
///\param o_begin Beginning of the output range.
///\param o_end End of the output range.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TOutputIterator>
typename etl::enable_if<!etl::is_random_iterator<TInputIterator>::value ||
!etl::is_random_iterator<TOutputIterator>::value, TOutputIterator>::type
copy_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end)
{
while ((i_begin != i_end) && (o_begin != o_end))
{
*o_begin++ = *i_begin++;
}
return o_begin;
}
//***************************************************************************
/// copy_n
/// A safer form of copy_n where the smallest of the two ranges is used.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TSize,
typename TOutputIterator>
TOutputIterator copy_n_s(TInputIterator i_begin,
TSize n,
TOutputIterator o_begin,
TOutputIterator o_end)
{
while ((n-- > 0) && (o_begin != o_end))
{
*o_begin++ = *i_begin++;
}
return o_begin;
}
//***************************************************************************
/// copy_n
/// A safer form of copy_n where the smallest of the two ranges is used.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TSize1,
typename TOutputIterator,
typename TSize2>
TOutputIterator copy_n_s(TInputIterator i_begin,
TSize1 n1,
TOutputIterator o_begin,
TSize2 n2)
{
while ((n1-- > 0) && (n2-- > 0))
{
*o_begin++ = *i_begin++;
}
return o_begin;
}
//***************************************************************************
/// copy_if
/// A safer form of copy_if where it terminates when the first end iterator is reached.
/// There is currently no STL equivelent.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TOutputIterator,
typename TUnaryPredicate>
TOutputIterator copy_if_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end,
TUnaryPredicate predicate)
{
while ((i_begin != i_end) && (o_begin != o_end))
{
if (predicate(*i_begin))
{
*o_begin++ = *i_begin;
}
++i_begin;
}
return o_begin;
}
//***************************************************************************
/// copy_n_if
/// Combination of copy_n and copy_if.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TSize,
typename TOutputIterator,
typename TUnaryPredicate>
TOutputIterator copy_n_if(TInputIterator i_begin,
TSize n,
TOutputIterator o_begin,
TUnaryPredicate predicate)
{
while (n-- > 0)
{
if (predicate(*i_begin))
{
*o_begin++ = *i_begin;
}
++i_begin;
}
return o_begin;
}
#if ETL_CPP11_SUPPORTED
//***************************************************************************
/// move_s
/// A safer form of move where the smallest of the two ranges is used.
/// There is currently no STL equivalent.
/// Specialisation for random access iterators.
///\param i_begin Beginning of the input range.
///\param i_end End of the input range.
///\param o_begin Beginning of the output range.
///\param o_end End of the output range.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TOutputIterator>
typename etl::enable_if<etl::is_random_iterator<TInputIterator>::value &&
etl::is_random_iterator<TOutputIterator>::value, TOutputIterator>::type
move_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end)
{
size_t s_size = etl::distance(i_begin, i_end);
size_t d_size = etl::distance(o_begin, o_end);
size_t size = (s_size < d_size) ? s_size : d_size;
return etl::move(i_begin, i_begin + size, o_begin);
}
//***************************************************************************
/// move_s
/// A safer form of move where the smallest of the two ranges is used.
/// There is currently no STL equivalent.
/// Specialisation for non random access iterators.
///\param i_begin Beginning of the input range.
///\param i_end End of the input range.
///\param o_begin Beginning of the output range.
///\param o_end End of the output range.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TOutputIterator>
typename etl::enable_if<!etl::is_random_iterator<TInputIterator>::value ||
!etl::is_random_iterator<TOutputIterator>::value, TOutputIterator>::type
move_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end)
{
while ((i_begin != i_end) && (o_begin != o_end))
{
*o_begin++ = etl::move(*i_begin++);
}
return o_begin;
}
#else
//***************************************************************************
/// move_s
/// C++03
/// A safer form of move where the smallest of the two ranges is used.
/// There is currently no STL equivalent.
/// Specialisation for non random access iterators.
///\param i_begin Beginning of the input range.
///\param i_end End of the input range.
///\param o_begin Beginning of the output range.
///\param o_end End of the output range.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator, typename TOutputIterator>
TOutputIterator move_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end)
{
// Move not supported. Defer to copy.
return etl::copy_s(i_begin, i_end, o_begin, o_end);
}
#endif
//***************************************************************************
/// binary_find
///\ingroup algorithm
/// Does a binary search and returns an iterator to the value or end if not found.
//***************************************************************************
template <typename TIterator, typename TValue>
ETL_NODISCARD
TIterator binary_find(TIterator begin,
TIterator end,
const TValue& value)
{
TIterator it = etl::lower_bound(begin, end, value);
if ((it == end) || (*it != value))
{
it = end;
}
return it;
}
//***************************************************************************
/// binary_find
///\ingroup algorithm
/// Does a binary search and returns an iterator to the value or end if not found.
//***************************************************************************
template <typename TIterator,
typename TValue,
typename TBinaryPredicate,
typename TBinaryEquality>
ETL_NODISCARD
TIterator binary_find(TIterator begin,
TIterator end,
const TValue& value,
TBinaryPredicate predicate,
TBinaryEquality equality)
{
TIterator it = etl::lower_bound(begin, end, value, predicate);
if ((it == end) || !equality(*it, value))
{
it = end;
}
return it;
}
//***************************************************************************
/// Like std::for_each but applies a predicate before calling the function.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator,
typename TUnaryFunction,
typename TUnaryPredicate>
TUnaryFunction for_each_if(TIterator begin,
const TIterator end,
TUnaryFunction function,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (predicate(*begin))
{
function(*begin);
}
++begin;
}
return function;
}
//***************************************************************************
/// Like std::for_each but for 'n' iterations.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator,
typename TSize,
typename TUnaryFunction>
TIterator for_each_n(TIterator begin,
TSize n,
TUnaryFunction function)
{
while (n-- > 0)
{
function(*begin++);
}
return begin;
}
//***************************************************************************
/// Like std::for_each but applies a predicate before calling the function, for 'n' iterations
///\ingroup algorithm
//***************************************************************************
template <typename TIterator,
typename TSize,
typename TUnaryFunction,
typename TUnaryPredicate>
TIterator for_each_n_if(TIterator begin,
TSize n,
TUnaryFunction function,
TUnaryPredicate predicate)
{
while (n-- > 0)
{
if (predicate(*begin))
{
function(*begin);
}
++begin;
}
return begin;
}
//***************************************************************************
/// A safer form of std::transform where the transform returns when the first
/// range end is reached.
/// There is currently no STL equivalent.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator, typename TOutputIterator, typename TUnaryFunction>
TOutputIterator transform_s(TInputIterator i_begin,
TInputIterator i_end,
TOutputIterator o_begin,
TOutputIterator o_end,
TUnaryFunction function)
{
while ((i_begin != i_end) && (o_begin != o_end))
{
*o_begin++ = function(*i_begin++);
}
return o_begin;
}
//***************************************************************************
/// Transform 'n' items.
/// Random iterators.
/// There is currently no STL equivalent.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TSize,
typename TOutputIterator,
typename TUnaryFunction>
void transform_n(TInputIterator i_begin,
TSize n,
TOutputIterator o_begin,
TUnaryFunction function)
{
TInputIterator i_end(i_begin);
etl::advance(i_end, n);
etl::transform(i_begin, i_end, o_begin, function);
}
//***************************************************************************
/// Transform 'n' items from two ranges.
/// Random iterators.
/// There is currently no STL equivalent.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator1,
typename TInputIterator2,
typename TSize,
typename TOutputIterator,
typename TBinaryFunction>
void transform_n(TInputIterator1 i_begin1,
TInputIterator2 i_begin2,
TSize n,
TOutputIterator o_begin,
TBinaryFunction function)
{
TInputIterator1 i_end1(i_begin1);
etl::advance(i_end1, n);
etl::transform(i_begin1, i_end1, i_begin2, o_begin, function);
}
//***************************************************************************
/// Like std::transform but applies a predicate before calling the function.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TOutputIterator,
typename TUnaryFunction,
typename TUnaryPredicate>
TOutputIterator transform_if(TInputIterator i_begin,
const TInputIterator i_end,
TOutputIterator o_begin,
TUnaryFunction function,
TUnaryPredicate predicate)
{
while (i_begin != i_end)
{
if (predicate(*i_begin))
{
*o_begin++ = function(*i_begin);
}
++i_begin;
}
return o_begin;
}
//***************************************************************************
/// Like etl::transform_if but inputs from two ranges.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator1,
typename TInputIterator2,
typename TOutputIterator,
typename TBinaryFunction,
typename TBinaryPredicate>
TOutputIterator transform_if(TInputIterator1 i_begin1,
const TInputIterator1 i_end1,
TInputIterator2 i_begin2,
TOutputIterator o_begin,
TBinaryFunction function,
TBinaryPredicate predicate)
{
while (i_begin1 != i_end1)
{
if (predicate(*i_begin1, *i_begin2))
{
*o_begin++ = function(*i_begin1, *i_begin2);
}
++i_begin1;
++i_begin2;
}
return o_begin;
}
//***************************************************************************
/// Like std::transform_if, for 'n' items.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator,
typename TSize,
typename TOutputIterator,
typename TUnaryFunction,
typename TUnaryPredicate>
TOutputIterator transform_n_if(TInputIterator i_begin,
TSize n,
TOutputIterator o_begin,
TUnaryFunction function,
TUnaryPredicate predicate)
{
while (n-- > 0)
{
if (predicate(*i_begin))
{
*o_begin++ = function(*i_begin);
}
++i_begin;
}
return o_begin;
}
//***************************************************************************
/// Like etl::transform_if but inputs from two ranges for 'n' items.
///\ingroup algorithm
//***************************************************************************
template <typename TInputIterator1,
typename TInputIterator2,
typename TSize,
typename TOutputIterator,
typename TBinaryFunction,
typename TBinaryPredicate>
TOutputIterator transform_n_if(TInputIterator1 i_begin1,
TInputIterator2 i_begin2,
TSize n,
TOutputIterator o_begin,
TBinaryFunction function,
TBinaryPredicate predicate)
{
while (n-- > 0)
{
if (predicate(*i_begin1, *i_begin2))
{
*o_begin++ = function(*i_begin1, *i_begin2);
}
++i_begin1;
++i_begin2;
}
return o_begin;
}
//***************************************************************************
/// Transforms the elements from the range (begin, end) to two different ranges
/// depending on the value returned by the predicate.<br>
///\ingroup algorithm
//***************************************************************************
template <typename TSource, typename TDestinationTrue, typename TDestinationFalse,
typename TUnaryFunctionTrue, typename TUnaryFunctionFalse,
typename TUnaryPredicate>
ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse> partition_transform(TSource begin,
TSource end,
TDestinationTrue destination_true,
TDestinationFalse destination_false,
TUnaryFunctionTrue function_true,
TUnaryFunctionFalse function_false,
TUnaryPredicate predicate)
{
while (begin != end)
{
if (predicate(*begin))
{
*destination_true++ = function_true(*begin++);
}
else
{
*destination_false++ = function_false(*begin++);
}
}
return ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse>(destination_true, destination_false);
}
//***************************************************************************
/// Transforms the elements from the ranges (begin1, end1) & (begin2)
/// to two different ranges depending on the value returned by the predicate.
///\ingroup algorithm
//***************************************************************************
template <typename TSource1,
typename TSource2,
typename TDestinationTrue,
typename TDestinationFalse,
typename TBinaryFunctionTrue,
typename TBinaryFunctionFalse,
typename TBinaryPredicate>
ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse> partition_transform(TSource1 begin1,
TSource1 end1,
TSource2 begin2,
TDestinationTrue destination_true,
TDestinationFalse destination_false,
TBinaryFunctionTrue function_true,
TBinaryFunctionFalse function_false,
TBinaryPredicate predicate)
{
while (begin1 != end1)
{
if (predicate(*begin1, *begin2))
{
*destination_true++ = function_true(*begin1++, *begin2++);
}
else
{
*destination_false++ = function_false(*begin1++, *begin2++);
}
}
return ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse>(destination_true, destination_false);
}
//***************************************************************************
/// Sorts the elements using shell sort.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void shell_sort(TIterator first, TIterator last, TCompare compare)
{
if (first == last)
{
return;
}
typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
difference_t n = etl::distance(first, last);
for (difference_t i = n / 2; i > 0; i /= 2)
{
for (difference_t j = i; j < n; ++j)
{
for (difference_t k = j - i; k >= 0; k -= i)
{
TIterator itr1 = first;
TIterator itr2 = first;
etl::advance(itr1, k);
etl::advance(itr2, k + i);
if (compare(*itr2, *itr1))
{
etl::iter_swap(itr1, itr2);
}
}
}
}
}
//***************************************************************************
/// Sorts the elements using shell sort.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void shell_sort(TIterator first, TIterator last)
{
etl::shell_sort(first, last, etl::less<typename etl::iterator_traits<TIterator>::value_type>());
}
//***************************************************************************
/// Sorts the elements using insertion sort.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void insertion_sort(TIterator first, TIterator last, TCompare compare)
{
for (TIterator itr = first; itr != last; ++itr)
{
etl::rotate(etl::upper_bound(first, itr, *itr, compare), itr, etl::next(itr));
}
}
//***************************************************************************
/// Sorts the elements using insertion sort.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void insertion_sort(TIterator first, TIterator last)
{
etl::insertion_sort(first, last, etl::less<typename etl::iterator_traits<TIterator>::value_type>());
}
//***************************************************************************
namespace private_algorithm
{
template <typename TIterator>
typename etl::enable_if<etl::is_forward_iterator<TIterator>::value, TIterator>::type
get_before_last(TIterator first_, TIterator last_)
{
TIterator last = first_;
TIterator lastplus1 = first_;
++lastplus1;
while (lastplus1 != last_)
{
++last;
++lastplus1;
}
return last;
}
template <typename TIterator>
typename etl::enable_if<etl::is_bidirectional_iterator<TIterator>::value, TIterator>::type
get_before_last(TIterator /*first_*/, TIterator last_)
{
TIterator last = last_;
--last;
return last;
}
template <typename TIterator>
typename etl::enable_if<etl::is_random_access_iterator<TIterator>::value, TIterator>::type
get_before_last(TIterator /*first_*/, TIterator last_)
{
return last_ - 1;
}
}
//***************************************************************************
/// Sorts the elements using selection sort.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare>
void selection_sort(TIterator first, TIterator last, TCompare compare)
{
TIterator min;
const TIterator ilast = private_algorithm::get_before_last(first, last);
const TIterator jlast = last;
for (TIterator i = first; i != ilast; ++i)
{
min = i;
TIterator j = i;
++j;
for (; j != jlast; ++j)
{
if (compare(*j, *min))
{
min = j;
}
}
using ETL_OR_STD::swap; // Allow ADL
swap(*i, *min);
}
}
//***************************************************************************
/// Sorts the elements using selection sort.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void selection_sort(TIterator first, TIterator last)
{
selection_sort(first, last, etl::less<typename etl::iterator_traits<TIterator>::value_type>());
}
//***************************************************************************
/// Sorts the elements using heap sort.
/// Uses user defined comparison.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator, typename TCompare >
void heap_sort(TIterator first, TIterator last, TCompare compare)
{
if (!etl::is_heap(first, last, compare))
{
etl::make_heap(first, last, compare);
}
etl::sort_heap(first, last, compare);
}
//***************************************************************************
/// Sorts the elements using heap sort.
///\ingroup algorithm
//***************************************************************************
template <typename TIterator>
void heap_sort(TIterator first, TIterator last)
{
if (!etl::is_heap(first, last))
{
etl::make_heap(first, last);
}
etl::sort_heap(first, last);
}
//***************************************************************************
/// Returns the maximum value.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename T>
ETL_NODISCARD
constexpr const T& multimax(const T& a, const T& b)
{
return a < b ? b : a;
}
template <typename T, typename... Tx>
ETL_NODISCARD
constexpr const T& multimax(const T& t, const Tx&... tx)
{
return multimax(t, multimax(tx...));
}
#endif
//***************************************************************************
/// Returns the maximum value.
/// User supplied compare function.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename TCompare, typename T>
ETL_NODISCARD
constexpr const T& multimax_compare(TCompare compare, const T& a, const T& b)
{
return compare(a, b) ? b : a;
}
template <typename TCompare, typename T, typename... Tx>
ETL_NODISCARD
constexpr const T& multimax_compare(TCompare compare, const T& t, const Tx&... tx)
{
return multimax_compare(compare, t, multimax_compare(compare, tx...));
}
#endif
//***************************************************************************
/// Returns the maximum value.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename T>
ETL_NODISCARD
constexpr const T& multimin(const T& a, const T& b)
{
return a < b ? a : b;
}
template <typename T, typename... Tx>
ETL_NODISCARD
constexpr const T& multimin(const T& t, const Tx&... tx)
{
return multimin(t, multimin(tx...));
}
#endif
//***************************************************************************
/// Returns the minimum value.
/// User supplied compare function.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename TCompare, typename T>
ETL_NODISCARD
constexpr const T& multimin_compare(TCompare compare, const T& a, const T& b)
{
return compare(a, b) ? a : b;
}
template <typename TCompare, typename T, typename... Tx>
ETL_NODISCARD
constexpr const T& multimin_compare(TCompare compare, const T& t, const Tx&... tx)
{
return multimin_compare(compare, t, multimin_compare(compare, tx...));
}
#endif
//***************************************************************************
/// Returns the iterator to the maximum value.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename TIterator>
ETL_NODISCARD
constexpr const TIterator& multimax_iter(const TIterator& a, const TIterator& b)
{
return *a < *b ? b : a;
}
template <typename TIterator, typename... TIteratorx>
ETL_NODISCARD
constexpr const TIterator& multimax_iter(const TIterator& t, const TIteratorx&... tx)
{
return multimax_iter(t, multimax_iter(tx...));
}
#endif
//***************************************************************************
/// Returns the iterator to the maximum value.
/// User supplied compare function.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename TCompare, typename TIterator>
ETL_NODISCARD
constexpr const TIterator& multimax_iter_compare(TCompare compare, const TIterator& a, const TIterator& b)
{
return compare(*a, *b) ? b : a;
}
template <typename TCompare, typename TIterator, typename... TIteratorx>
ETL_NODISCARD
constexpr const TIterator& multimax_iter_compare(TCompare compare, const TIterator& t, const TIteratorx&... tx)
{
return multimax_iter_compare(compare, t, multimax_iter_compare(compare, tx...));
}
#endif
//***************************************************************************
/// Returns the iterator to the minimum value.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename TIterator>
ETL_NODISCARD
constexpr const TIterator& multimin_iter(const TIterator& a, const TIterator& b)
{
return *a < *b ? a : b;
}
template <typename TIterator, typename... Tx>
ETL_NODISCARD
constexpr const TIterator& multimin_iter(const TIterator& t, const Tx&... tx)
{
return multimin_iter(t, multimin_iter(tx...));
}
#endif
//***************************************************************************
/// Returns the iterator to the minimum value.
/// User supplied compare function.
//***************************************************************************
#if ETL_CPP11_SUPPORTED
template <typename TCompare, typename TIterator>
ETL_NODISCARD
constexpr const TIterator& multimin_iter_compare(TCompare compare, const TIterator& a, const TIterator& b)
{
return compare(*a, *b) ? a : b;
}
template <typename TCompare, typename TIterator, typename... Tx>
ETL_NODISCARD
constexpr const TIterator& multimin_iter_compare(TCompare compare, const TIterator& t, const Tx&... tx)
{
return multimin_iter_compare(compare, t, multimin_iter_compare(compare, tx...));
}
#endif
}
#include "private/minmax_pop.h"
#endif
Reference in New Issue View Git Blame Copy Permalink