algorithm.h File Reference

#include "fl/type_traits.h"
#include "fl/move.h"
#include "fl/random.h"

Include dependency graph for algorithm.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	fl
	IMPORTANT!
namespace	fl::detail

Functions
template<typename Iterator1, typename Iterator2>
bool	fl::equal (Iterator1 first1, Iterator1 last1, Iterator2 first2)
template<typename Iterator1, typename Iterator2, typename BinaryPredicate>
bool	fl::equal (Iterator1 first1, Iterator1 last1, Iterator2 first2, BinaryPredicate pred)
template<typename Iterator1, typename Iterator2>
bool	fl::equal (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2)
template<typename Iterator1, typename Iterator2, typename BinaryPredicate>
bool	fl::equal (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2, BinaryPredicate pred)
template<typename Container1, typename Container2>
bool	fl::equal_container (const Container1 &c1, const Container2 &c2)
template<typename Container1, typename Container2, typename BinaryPredicate>
bool	fl::equal_container (const Container1 &c1, const Container2 &c2, BinaryPredicate pred)
template<typename Iterator, typename T>
void	fl::fill (Iterator first, Iterator last, const T &value)
template<typename Iterator, typename T>
Iterator	fl::find (Iterator first, Iterator last, const T &value)
template<typename Iterator, typename UnaryPredicate>
Iterator	fl::find_if (Iterator first, Iterator last, UnaryPredicate pred)
template<typename Iterator, typename UnaryPredicate>
Iterator	fl::find_if_not (Iterator first, Iterator last, UnaryPredicate pred)
template<typename Iterator, typename Compare>
void	fl::detail::heap_sort (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
void	fl::detail::heapify (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
void	fl::detail::insertion_sort (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename T, typename Compare>
Iterator	fl::detail::lower_bound_impl (Iterator first, Iterator last, const T &value, Compare comp)
template<typename Iterator>
Iterator	fl::max_element (Iterator first, Iterator last)
template<typename Iterator, typename Compare>
Iterator	fl::max_element (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
Iterator	fl::detail::median_of_three (Iterator first, Iterator middle, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
void	fl::detail::merge_inplace (Iterator first, Iterator middle, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
void	fl::detail::mergesort_impl (Iterator first, Iterator last, Compare comp)
template<typename Iterator>
Iterator	fl::min_element (Iterator first, Iterator last)
template<typename Iterator, typename Compare>
Iterator	fl::min_element (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
Iterator	fl::detail::partition (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename Compare>
void	fl::detail::quicksort_impl (Iterator first, Iterator last, Compare comp)
template<typename Iterator, typename T>
Iterator	fl::remove (Iterator first, Iterator last, const T &value)
template<typename Iterator, typename UnaryPredicate>
Iterator	fl::remove_if (Iterator first, Iterator last, UnaryPredicate pred)
template<typename Iterator>
void	fl::reverse (Iterator first, Iterator last)
template<typename Iterator>
void	fl::detail::rotate_impl (Iterator first, Iterator middle, Iterator last)
template<typename Iterator>
void	fl::shuffle (Iterator first, Iterator last)
template<typename Iterator>
void	fl::shuffle (Iterator first, Iterator last, fl_random &rng)
template<typename Iterator, typename RandomGenerator>
void	fl::shuffle (Iterator first, Iterator last, RandomGenerator &g)
template<typename Iterator, typename Compare>
void	fl::detail::sift_down (Iterator first, Iterator start, Iterator end, Compare comp)
template<typename Iterator>
void	fl::sort (Iterator first, Iterator last)
template<typename Iterator, typename Compare>
void	fl::sort (Iterator first, Iterator last, Compare comp)
template<typename Iterator>
void	fl::stable_sort (Iterator first, Iterator last)
template<typename Iterator, typename Compare>
void	fl::stable_sort (Iterator first, Iterator last, Compare comp)