(Revision: 9692)
#include <algorithm>
#include <climits>
Go to the source code of this file.
|
| template<class Type , class Less > |
| void | Gecode::Support::exchange (Type &a, Type &b, Less &less) |
| | Exchange elements according to order. More...
|
| |
| template<class Type , class Less > |
| void | Gecode::Support::insertion (Type *l, Type *r, Less &less) |
| | Standard insertion sort. More...
|
| |
| template<class Type , class Less > |
| Type * | Gecode::Support::partition (Type *l, Type *r, Less &less) |
| | Standard partioning. More...
|
| |
| template<class Type , class Less > |
| void | Gecode::Support::quicksort (Type *l, Type *r, Less &less) |
| | Standard quick sort. More...
|
| |
| template<class Type , class Less > |
| void | Gecode::Support::insertion (Type *x, int n, Less &l) |
| | Insertion sort. More...
|
| |
| template<class Type > |
| void | Gecode::Support::insertion (Type *x, int n) |
| | Insertion sort. More...
|
| |
| template<class Type , class Less > |
| void | Gecode::Support::quicksort (Type *x, int n, Less &l) |
| | Quicksort. More...
|
| |
| template<class Type > |
| void | Gecode::Support::quicksort (Type *x, int n) |
| | Quicksort. More...
|
| |