Generated on Wed Nov 1 15:05:25 2006 for Gecode by doxygen 1.4.5
Gecode::Support

Gecode::Support Namespace Reference

Detailed Description

Support algorithms and datastructures


Classes

class  BlockAllocator
 Manage memory organized into block lists (allocator). More...
class  BlockClient
 Client for block allocator of type T. More...
class  DynamicArray
 Array with arbitrary number of elements. More...
class  DynamicStack
 Stack with arbitrary number of elements. More...
class  LinearCongruentialGenerator
 Template for linear congruential generators. More...
class  SharedArray
 Shared array with arbitrary number of elements. More...
class  QuickSortStack
 Static stack for quicksort. More...
class  PQueue
 Simple fixed-size priority queue. More...
class  StaticStack
 Stack with fixed number of elements. More...

Typedefs

typedef LinearCongruentialGenerator< 2147483647, 48271, 44488, 3399 > RandomGenerator
 Default choice of values for the linear congruential generator.

Functions

template<class Type, class LessThan>
void exchange (Type &a, Type &b, LessThan &lt)
 Exchange elements according to order.
template<class Type, class LessThan>
void insertion (Type *l, Type *r, LessThan &lt)
 Standard insertion sort.
template<class Type, class LessThan>
Type * partition (Type *l, Type *r, LessThan &lt)
 Standard partioning.
template<class Type, class LessThan>
void quicksort (Type *l, Type *r, LessThan &lt)
 Standard quick sort.
template<class Type, class LessThan>
void insertion (Type *x, int n, LessThan &lt)
 Insertion sort.
template<class Type, class LessThan>
void quicksort (Type *x, int n, LessThan &lt)
 Quicksort.

Variables

int const QuickSortCutoff = 20
 Perform quicksort only for more elements.

Function Documentation

template<class Type, class LessThan>
void Gecode::Support::exchange (  Type &  a,
Type &  b,
LessThan &  lt
)  [inline]
 

Exchange elements according to order.

Definition at line 32 of file sort.hh.

template<class Type, class LessThan>
void Gecode::Support::insertion (  Type *  l,
Type *  r,
LessThan &  lt
)  [inline]
 

Standard insertion sort.

Definition at line 82 of file sort.hh.

template<class Type, class LessThan>
Type* Gecode::Support::partition (  Type *  l,
Type *  r,
LessThan &  lt
)  [inline]
 

Standard partioning.

Definition at line 98 of file sort.hh.

template<class Type, class LessThan>
void Gecode::Support::quicksort (  Type *  l,
Type *  r,
LessThan &  lt
)  [inline]
 

Standard quick sort.

Definition at line 115 of file sort.hh.

Variable Documentation

int const Gecode::Support::QuickSortCutoff = 20
 

Perform quicksort only for more elements.

Definition at line 37 of file sort.hh.