main page modules namespaces classes files
Gecode home

search for 

sort.hh File Reference

(Revision: 3514)

#include <algorithm>

Go to the source code of this file.

Namespaces
namespace	Gecode
namespace	Gecode::Support
Classes
class	Gecode::Support::QuickSortStack< Type >
	Static stack for quicksort. More...
Functions
template<class Type, class LessThan>
void	Gecode::Support::exchange (Type &a, Type &b, LessThan &lt)
	Exchange elements according to order.
template<class Type, class LessThan>
void	Gecode::Support::insertion (Type *l, Type *r, LessThan &lt)
	Standard insertion sort.
template<class Type, class LessThan>
Type *	Gecode::Support::partition (Type *l, Type *r, LessThan &lt)
	Standard partioning.
template<class Type, class LessThan>
void	Gecode::Support::quicksort (Type *l, Type *r, LessThan &lt)
	Standard quick sort.
template<class Type, class LessThan>
void	Gecode::Support::insertion (Type *x, int n, LessThan &lt)
	Insertion sort.
template<class Type, class LessThan>
void	Gecode::Support::quicksort (Type *x, int n, LessThan &lt)
	Quicksort.
Variables
int const	Gecode::Support::QuickSortCutoff = 20
	Perform quicksort only for more elements.