Support algorithms and datastructures
[Common functionality]
Collaboration diagram for Support algorithms and datastructures:
Detailed Description
These are some common datastructures used in the implementation of Gecode. Maybe they can be also useful to others.In order to use them, one needs to include the appropriate headerfile as described in the class and function documentation.
Classes  
class  Gecode::Support::BlockAllocator< T > 
Manage memory organized into block lists (allocator). More...  
class  Gecode::Support::BlockClient< T > 
Client for block allocator of type T. More...  
class  Gecode::Support::DynamicArray< T > 
Array with arbitrary number of elements. More...  
class  Gecode::Support::DynamicStack< T > 
Stack with arbitrary number of elements. More...  
class  Gecode::Support::LinearCongruentialGenerator< m, a, q, r > 
Template for linear congruential generators. More...  
class  Gecode::Support::SharedArray< T, fd > 
Shared array with arbitrary number of elements. More...  
class  Gecode::Support::PQueue< T, Less > 
Simple fixedsize priority queue. More...  
class  Gecode::Support::StaticStack< T > 
Stack with fixed number of elements. More...  
Typedefs  
typedef LinearCongruentialGenerator< 2147483647, 48271, 44488, 3399 >  Gecode::Support::RandomGenerator 
Default choice of values for the linear congruential generator.  
Functions  
template<class Type, class LessThan>  
void  Gecode::Support::insertion (Type *x, int n, LessThan <) 
Insertion sort.  
template<class Type, class LessThan>  
void  Gecode::Support::quicksort (Type *x, int n, LessThan <) 
Quicksort. 
Typedef Documentation

Default choice of values for the linear congruential generator. While this pseudorandom number generator is not a good source of randomness, it is still an acceptable choice for many applications. The choice of values is taken from D. E. Knuth, The Art of Computer Programming, Vol 2, Seminumerical Algorithms, 3rd edition. Requires #include "gecode/support/random.hh"

Function Documentation

Insertion sort. Sorts by insertion the n first elements of array x according to the order lt as instance of class LessThan. The class LessThan must implement the single member function bool operator()(const Type&, const Type&) The algorithm is largely based on the following book: Robert Sedgewick, Algorithms in C++, 3rd edition, 1998, Addison Wesley. Requires #include "gecode/support/sort.hh"


Quicksort. Sorts with quicksort the n first elements of array x according to the order lt as instance of class LessThan. The class LessThan must implement the single member function bool operator()(const Type&, const Type&) The algorithm is largely based on the following book: Robert Sedgewick, Algorithms in C++, 3rd edition, 1998, Addison Wesley. Requires #include "gecode/support/sort.hh"
