Generated on Mon Nov 30 23:53:54 2009 for Gecode by doxygen 1.6.1

Gecode::Scheduling Namespace Reference

Scheduling constraints and branchers. More...

Namespaces

namespace  Cumulatives
 

Cumulatives propagators


namespace  Unary
 

Scheduling for unary resources.


Classes

class  StoEst
 Sort by earliest start times. More...
class  StoEct
 Sort by earliest completion times. More...
class  StoLst
 Sort by latest start times. More...
class  StoLct
 Sort by latest completion times. More...
class  SortMap
 Sorting maps rather than tasks. More...
class  ManToOptTask
 Class to define an optional from a mandatory task. More...
class  FwdToBwd
 Task mapper: turns a task view into its dual. More...
class  TaskViewTraits
 Traits class for mapping task views to tasks. More...
class  TaskTraits
 Traits class for mapping tasks to task views. More...
class  TaskArray
 Task array. More...
class  TaskViewArray
 Task view array. More...
class  TaskViewIter
 Allows to iterate over task views according to a specified order. More...
class  ManTaskViewIter
 Allows to iterate over mandatory task views according to a specified order. More...
class  TaskTree
 Task trees for task views with node type Node. More...
class  TaskProp
 Propagator for tasks. More...
class  TaskViewTraits< Unary::ManFixTaskFwd >
 Task view traits for forward task views. More...
class  TaskViewTraits< Unary::ManFixTaskBwd >
 Task view traits for backward task views. More...
class  TaskViewTraits< Unary::OptFixTaskFwd >
 Task view traits for forward optional task views. More...
class  TaskViewTraits< Unary::OptFixTaskBwd >
 Task view traits for backward task views. More...
class  TaskTraits< Unary::ManFixTask >
 Task traits for mandatory fixed tasks. More...
class  TaskTraits< Unary::OptFixTask >
 Task traits for optional fixed tasks. More...

Enumerations

enum  SortTaskOrder { STO_EST, STO_ECT, STO_LST, STO_LCT }
 

How to sort tasks.

More...

Functions

template<class Char , class Traits , class Task >
std::basic_ostream< Char,
Traits > & 
operator<< (std::basic_ostream< Char, Traits > &os, const TaskArray< Task > &t)
template<class Char , class Traits , class TaskView >
std::basic_ostream< Char,
Traits > & 
operator<< (std::basic_ostream< Char, Traits > &os, const TaskViewArray< TaskView > &t)
template<class OptTask >
ExecStatus purge (Space &home, Propagator &p, TaskArray< OptTask > &t)
 Purge optional tasks that are excluded and possibly rewrite propagator.
template<class TaskView , SortTaskOrder sto, bool inc>
void sort (TaskViewArray< TaskView > &t)
 Sort task view array t according to sto and inc (increasing or decreasing).
template<class TaskView , SortTaskOrder sto, bool inc>
void sort (int *map, const TaskViewArray< TaskView > &t)
 Initialize and sort map for task view array t according to sto and inc (increasing or decreasing).
template<class TaskView , SortTaskOrder sto, bool inc>
void sort (int *map, int n, const TaskViewArray< TaskView > &t)
 Sort map with size n for task view array t according to sto and inc (increasing or decreasing).
int plus (int x, int y)
 Safe addition in case x is -IntLimits::infinity.

Detailed Description

Scheduling constraints and branchers.


Enumeration Type Documentation

How to sort tasks.

Enumerator:
STO_EST 

Sort by earliest start times.

STO_ECT 

Sort by earliest completion times.

STO_LST 

Sort by latest start times.

STO_LCT 

Sort by latest completion times.

Definition at line 276 of file task.hh.


Function Documentation

template<class Char , class Traits , class Task >
std::basic_ostream<Char,Traits>& Gecode::Scheduling::operator<< ( std::basic_ostream< Char, Traits > &  os,
const TaskArray< Task > &  t 
) [inline]

Definition at line 114 of file array.hpp.

template<class Char , class Traits , class TaskView >
std::basic_ostream<Char,Traits>& Gecode::Scheduling::operator<< ( std::basic_ostream< Char, Traits > &  os,
const TaskViewArray< TaskView > &  t 
) [inline]

Definition at line 162 of file array.hpp.

template<class OptTask >
ExecStatus Gecode::Scheduling::purge ( Space &  home,
Propagator &  p,
TaskArray< OptTask > &  t 
) [inline]

Purge optional tasks that are excluded and possibly rewrite propagator.

template<class TaskView , SortTaskOrder sto, bool inc>
void Gecode::Scheduling::sort ( TaskViewArray< TaskView > &  t  )  [inline]

Sort task view array t according to sto and inc (increasing or decreasing).

template<class TaskView , SortTaskOrder sto, bool inc>
void Gecode::Scheduling::sort ( int *  map,
const TaskViewArray< TaskView > &  t 
) [inline]

Initialize and sort map for task view array t according to sto and inc (increasing or decreasing).

template<class TaskView , SortTaskOrder sto, bool inc>
void Gecode::Scheduling::sort ( int *  map,
int  n,
const TaskViewArray< TaskView > &  t 
) [inline]

Sort map with size n for task view array t according to sto and inc (increasing or decreasing).

int Gecode::Scheduling::plus ( int  x,
int  y 
) [inline]

Safe addition in case x is -IntLimits::infinity.