sort.h File Reference

#include <algorithm>
#include <functional>
#include <iterator>

Go to the source code of this file.

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.

Typedefs
template<class Iterator >
using	operations_research::value_type_t = typename std::iterator_traits<Iterator>::value_type

Functions
template<class Iterator , class Compare = std::less<value_type_t<Iterator>>>
void	operations_research::IncrementalSort (int max_comparisons, Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false)
template<class Iterator , class Compare = std::less<value_type_t<Iterator>>>
void	operations_research::InsertionSort (Iterator begin, Iterator end, Compare comp=Compare{})
template<class Iterator , class Compare = std::less<value_type_t<Iterator>>>
void	operations_research::IncrementalSort (Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false)