Gecode::Support Namespace Reference
Support algorithms and datastructures More...
Classes | |
class | BitSetData |
Date item for bitsets. More... | |
class | BitSetBase |
Basic bitset support. More... | |
class | BitSet |
Simple bitsets. More... | |
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 | DynamicQueue |
Queue with arbitrary number of elements. More... | |
class | DynamicStack |
Stack with arbitrary number of elements. More... | |
class | IntTypeTraits |
Traits to for information about integer types. More... | |
class | IntTypeTraits< signed char > |
Traits for signed char. More... | |
class | IntTypeTraits< unsigned char > |
Traits for unsigned char. More... | |
class | IntTypeTraits< signed short int > |
Traits for signed short int. More... | |
class | IntTypeTraits< unsigned short int > |
Traits for unsigned short int. More... | |
class | IntTypeTraits< signed int > |
Traits for signed integer. More... | |
class | IntTypeTraits< unsigned int > |
Traits for unsigned integer. More... | |
class | LinearCongruentialGenerator |
Template for linear congruential generators. More... | |
class | QuickSortStack |
Static stack for quicksort. More... | |
class | Less |
Comparison class for sorting using <. More... | |
class | StaticStack |
Stack with fixed number of elements. More... | |
class | Mutex |
A mutex for mutual exclausion among several threads. More... | |
class | Lock |
A lock as a scoped frontend for a mutex. More... | |
class | Event |
An event for synchronization. More... | |
class | Runnable |
An interface for objects that can be run by a thread. More... | |
class | Thread |
Simple threads. More... | |
class | Timer |
Timer More... | |
Typedefs | |
typedef LinearCongruentialGenerator< 2147483647, 48271, 44488, 3399 > | RandomGenerator |
Default values for linear congruential generator. | |
Enumerations | |
enum | BitSetStatus { BSS_NONE, BSS_ALL, BSS_SOME } |
Status of a bitset. More... | |
enum | IntType { IT_CHAR = 0, IT_SHRT = 1, IT_INT = 2 } |
Description of integer types. More... | |
Functions | |
template<class T > | |
T | ptr_cast (void *p) |
Cast p into pointer of type T. | |
IntType | u_type (unsigned int n) |
Return type required to represent n. | |
IntType | s_type (signed int n) |
Return type required to represent n. | |
IntType | s_type (int n) |
bool | marked (void *p) |
Check whether p is marked. | |
void * | mark (void *p) |
Return marked pointer for p. | |
void * | unmark (void *p) |
Return unmarked pointer for a marked pointer p. | |
void * | fmark (void *p) |
Return marked pointer for p (possibly already marked). | |
void * | funmark (void *p) |
Return unmarked pointer for a possibly marked pointer p. | |
template<class Type , class Less > | |
void | exchange (Type &a, Type &b, Less &less) |
Exchange elements according to order. | |
template<class Type , class Less > | |
void | insertion (Type *l, Type *r, Less &less) |
Standard insertion sort. | |
template<class Type , class Less > | |
Type * | partition (Type *l, Type *r, Less &less) |
Standard partioning. | |
template<class Type , class Less > | |
void | quicksort (Type *l, Type *r, Less &less) |
Standard quick sort. | |
template<class Type , class Less > | |
void | insertion (Type *x, int n, Less &l) |
Insertion sort. | |
template<class Type > | |
void | insertion (Type *x, int n) |
Insertion sort. | |
template<class Type , class Less > | |
void | quicksort (Type *x, int n, Less &l) |
Quicksort. | |
template<class Type > | |
void | quicksort (Type *x, int n) |
Quicksort. | |
void * | bootstrap (void *p) |
Function to start execution. | |
Variables | |
int const | QuickSortCutoff = 20 |
Perform quicksort only for more elements. |
Detailed Description
Support algorithms and datastructures
Enumeration Type Documentation
Status of a bitset.
Definition at line 106 of file bitset-base.hpp.
Description of integer types.
Definition at line 43 of file int-type.hpp.
Function Documentation
T Gecode::Support::ptr_cast | ( | void * | p | ) | [inline] |
IntType Gecode::Support::u_type | ( | unsigned int | n | ) | [inline] |
Return type required to represent n.
Definition at line 151 of file int-type.hpp.
IntType Gecode::Support::s_type | ( | signed int | n | ) |
Return type required to represent n.
IntType Gecode::Support::s_type | ( | int | n | ) | [inline] |
Definition at line 161 of file int-type.hpp.
bool Gecode::Support::marked | ( | void * | p | ) | [inline] |
Check whether p is marked.
Definition at line 54 of file marked-pointer.hpp.
void * Gecode::Support::mark | ( | void * | p | ) | [inline] |
Return marked pointer for p.
Definition at line 58 of file marked-pointer.hpp.
void * Gecode::Support::unmark | ( | void * | p | ) | [inline] |
Return unmarked pointer for a marked pointer p.
Definition at line 63 of file marked-pointer.hpp.
void * Gecode::Support::fmark | ( | void * | p | ) | [inline] |
Return marked pointer for p (possibly already marked).
Definition at line 68 of file marked-pointer.hpp.
void * Gecode::Support::funmark | ( | void * | p | ) | [inline] |
Return unmarked pointer for a possibly marked pointer p.
Definition at line 72 of file marked-pointer.hpp.
void Gecode::Support::exchange | ( | Type & | a, | |
Type & | b, | |||
Less & | less | |||
) | [inline] |
void Gecode::Support::insertion | ( | Type * | l, | |
Type * | r, | |||
Less & | less | |||
) | [inline] |
Type* Gecode::Support::partition | ( | Type * | l, | |
Type * | r, | |||
Less & | less | |||
) | [inline] |
void Gecode::Support::quicksort | ( | Type * | l, | |
Type * | r, | |||
Less & | less | |||
) | [inline] |
void* Gecode::Support::bootstrap | ( | void * | p | ) |
Function to start execution.
Definition at line 46 of file pthreads.cpp.
Variable Documentation
int const Gecode::Support::QuickSortCutoff = 20 |