Embedded Template Library  1.0
 All Classes Files Functions Variables Typedefs Friends Modules Pages
Functions
algorithm
Embedded Template Library » Utilities

Functions

template<typename TIterator , typename TCompare >
std::pair< TIterator, TIterator > etl::minmax_element (TIterator begin, TIterator end, TCompare compare)
 
template<typename TIterator >
std::pair< TIterator, TIterator > etl::minmax_element (TIterator begin, TIterator end)
 
template<typename T >
std::pair< const T &, const T & > etl::minmax (const T &a, const T &b)
 
template<typename T , typename TCompare >
std::pair< const T &, const T & > etl::minmax (const T &a, const T &b, TCompare compare)
 
template<typename TIterator >
TIterator etl::is_sorted_until (TIterator begin, TIterator end)
 
template<typename TIterator , typename TCompare >
TIterator etl::is_sorted_until (TIterator begin, TIterator end, TCompare compare)
 
template<class TIterator >
bool etl::is_sorted (TIterator begin, TIterator end)
 
template<class TIterator , class TCompare >
bool etl::is_sorted (TIterator begin, TIterator end, TCompare compare)
 
template<typename TInputIterator , typename Size , typename TOutputIterator >
TOutputIterator etl::copy_n (TInputIterator begin, Size count, TOutputIterator result)
 
template<typename TIterator , typename TOutputIterator , typename TUnaryPredicate >
TOutputIterator etl::copy_if (TIterator begin, TIterator end, TOutputIterator out, TUnaryPredicate predicate)
 
template<typename TIterator , typename TUnaryPredicate >
TIterator etl::find_if_not (TIterator begin, TIterator end, TUnaryPredicate predicate)
 
template<typename TIterator , typename TUnaryPredicate >
bool etl::all_of (TIterator begin, TIterator end, TUnaryPredicate predicate)
 
template<typename TIterator , typename TUnaryPredicate >
bool etl::any_of (TIterator begin, TIterator end, TUnaryPredicate predicate)
 
template<typename TIterator , typename TUnaryPredicate >
bool etl::none_of (TIterator begin, TIterator end, TUnaryPredicate predicate)
 
template<typename TIterator1 , typename TIterator2 >
bool etl::is_permutation (TIterator1 begin1, TIterator1 end1, TIterator2 begin2)
 
template<typename TIterator1 , typename TIterator2 >
bool etl::is_permutation (TIterator1 begin1, TIterator1 end1, TIterator2 begin2, TIterator2 end2)
 
template<typename TIterator1 , typename TIterator2 , typename TBinaryPredicate >
bool etl::is_permutation (TIterator1 begin1, TIterator1 end1, TIterator2 begin2, TBinaryPredicate predicate)
 
template<typename TIterator1 , typename TIterator2 , typename TBinaryPredicate >
bool etl::is_permutation (TIterator1 begin1, TIterator1 end1, TIterator2 begin2, TIterator2 end2, TBinaryPredicate predicate)
 
template<typename TIterator , typename TUnaryPredicate >
bool etl::is_partitioned (TIterator begin, TIterator end, TUnaryPredicate predicate)
 
template<class TIterator , class TUnaryPredicate >
TIterator etl::partition_point (TIterator begin, TIterator end, TUnaryPredicate predicate)
 
template<typename TSource , typename TDestinationTrue , typename TDestinationFalse , typename TUnaryPredicate >
std::pair< TDestinationTrue,
TDestinationFalse > 		etl::partition_copy (TSource begin, TSource end, TDestinationTrue destination_true, TDestinationFalse destination_false, TUnaryPredicate predicate)
 

Detailed Description

Reverse engineered algorithms from C++ 0x11

Function Documentation

template<typename TIterator , typename TUnaryPredicate >
bool etl::all_of ( TIterator  begin,
TIterator  end,
TUnaryPredicate  predicate 
)

all_of

a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of">

template<typename TIterator , typename TUnaryPredicate >
bool etl::any_of ( TIterator  begin,
TIterator  end,
TUnaryPredicate  predicate 
)

any_of

a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of">

template<typename TIterator , typename TOutputIterator , typename TUnaryPredicate >
TOutputIterator etl::copy_if ( TIterator  begin,
TIterator  end,
TOutputIterator  out,
TUnaryPredicate  predicate 
)

copy_if

a href="http://en.cppreference.com/w/cpp/algorithm/copy">

template<typename TInputIterator , typename Size , typename TOutputIterator >
TOutputIterator etl::copy_n ( TInputIterator  begin,
Size  count,
TOutputIterator  result 
)

copy_n

a href="http://en.cppreference.com/w/cpp/algorithm/copy_n">

template<typename TIterator , typename TUnaryPredicate >
TIterator etl::find_if_not ( TIterator  begin,
TIterator  end,
TUnaryPredicate  predicate 
)

find_if_not

a href="http://en.cppreference.com/w/cpp/algorithm/find">

template<typename TIterator , typename TUnaryPredicate >
bool etl::is_partitioned ( TIterator  begin,
TIterator  end,
TUnaryPredicate  predicate 
)

is_partitioned

a href="http://en.cppreference.com/w/cpp/algorithm/is_partitioned">

template<typename TIterator1 , typename TIterator2 >
bool etl::is_permutation ( TIterator1  begin1,
TIterator1  end1,
TIterator2  begin2 
)

is_permutation

a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation">

template<typename TIterator1 , typename TIterator2 >
bool etl::is_permutation ( TIterator1  begin1,
TIterator1  end1,
TIterator2  begin2,
TIterator2  end2 
)

is_permutation

a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation">

template<typename TIterator1 , typename TIterator2 , typename TBinaryPredicate >
bool etl::is_permutation ( TIterator1  begin1,
TIterator1  end1,
TIterator2  begin2,
TBinaryPredicate  predicate 
)

is_permutation

a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation">

template<typename TIterator1 , typename TIterator2 , typename TBinaryPredicate >
bool etl::is_permutation ( TIterator1  begin1,
TIterator1  end1,
TIterator2  begin2,
TIterator2  end2,
TBinaryPredicate  predicate 
)

is_permutation

a href="http://en.cppreference.com/w/cpp/algorithm/is_permutation">

template<class TIterator >
bool etl::is_sorted ( TIterator  begin,
TIterator  end 
)

is_sorted

a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted">

template<class TIterator , class TCompare >
bool etl::is_sorted ( TIterator  begin,
TIterator  end,
TCompare  compare 
)

is_sorted

a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted">

template<typename TIterator >
TIterator etl::is_sorted_until ( TIterator  begin,
TIterator  end 
)

is_sorted_until

a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until">

template<typename TIterator , typename TCompare >
TIterator etl::is_sorted_until ( TIterator  begin,
TIterator  end,
TCompare  compare 
)

is_sorted_until

a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until">

template<typename T >
std::pair<const T&, const T&> etl::minmax ( const T &  a,
const T &  b 
)

minmax

a href="http://en.cppreference.com/w/cpp/algorithm/minmax">

template<typename T , typename TCompare >
std::pair<const T&, const T&> etl::minmax ( const T &  a,
const T &  b,
TCompare  compare 
)

minmax

a href="http://en.cppreference.com/w/cpp/algorithm/minmax">

template<typename TIterator , typename TCompare >
std::pair<TIterator, TIterator> etl::minmax_element ( TIterator  begin,
TIterator  end,
TCompare  compare 
)

Finds the greatest and the smallest element in the range (begin, end).
a href="http://en.cppreference.com/w/cpp/algorithm/minmax_element">

template<typename TIterator >
std::pair<TIterator, TIterator> etl::minmax_element ( TIterator  begin,
TIterator  end 
)

minmax_element

a href="http://en.cppreference.com/w/cpp/algorithm/minmax_element">

template<typename TIterator , typename TUnaryPredicate >
bool etl::none_of ( TIterator  begin,
TIterator  end,
TUnaryPredicate  predicate 
)

none_of

a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of">

template<typename TSource , typename TDestinationTrue , typename TDestinationFalse , typename TUnaryPredicate >
std::pair<TDestinationTrue, TDestinationFalse> etl::partition_copy ( TSource  begin,
TSource  end,
TDestinationTrue  destination_true,
TDestinationFalse  destination_false,
TUnaryPredicate  predicate 
)

Copies the elements from the range (begin, end) to two different ranges depending on the value returned by the predicate.
a href="http://en.cppreference.com/w/cpp/algorithm/partition_copy">

template<class TIterator , class TUnaryPredicate >
TIterator etl::partition_point ( TIterator  begin,
TIterator  end,
TUnaryPredicate  predicate 
)

partition_point a href="http://en.cppreference.com/w/cpp/algorithm/partition_point">