Generated on Thu Jan 16 2025 00:00:00 for Gecode by doxygen 1.14.0
task.hh File Reference

Go to the source code of this file.

Classes

class  Gecode::Int::ManToOptTask< ManTask >
 Class to define an optional from a mandatory task. More...
class  Gecode::Int::FwdToBwd< TaskView >
 Task mapper: turns a task view into its dual. More...
class  Gecode::Int::TaskViewTraits< TaskView >
 Traits class for mapping task views to tasks. More...
class  Gecode::Int::TaskTraits< Task >
 Traits class for mapping tasks to task views. More...
class  Gecode::Int::TaskArray< Task >
 Task array. More...
class  Gecode::Int::TaskViewArray< TaskView >
 Task view array. More...
class  Gecode::Int::TaskViewIter< TaskView, sto, inc >
 Allows to iterate over task views according to a specified order. More...
class  Gecode::Int::ManTaskViewIter< OptTaskView, sto, inc >
 Allows to iterate over mandatory task views according to a specified order. More...
class  Gecode::Int::TaskTree< TaskView, Node >
 Task trees for task views with node type Node. More...
class  Gecode::Int::TaskProp< Task, PL >
 Propagator for tasks More...
class  Gecode::Int::PLB
 Class for defining basic propagation level. More...
class  Gecode::Int::PLA
 Class for defining advanced propagation level. More...
class  Gecode::Int::PLBA
 Class for defining basic and advanced propagation level. More...
class  Gecode::Int::Event
 Time-tabling event for task. More...

Namespaces

namespace  Gecode
 Gecode toplevel namespace
namespace  Gecode::Int
 Finite domain integers.

Enumerations

enum  Gecode::Int::SortTaskOrder { Gecode::Int::STO_EST , Gecode::Int::STO_ECT , Gecode::Int::STO_LST , Gecode::Int::STO_LCT }
 How to sort tasks. More...

Functions

template<class TaskView, SortTaskOrder sto, bool inc>
void Gecode::Int::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 Gecode::Int::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 Gecode::Int::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 Gecode::Int::plus (int x, int y)
 Safe addition in case x is -Int::Limits::infinity.
long long int Gecode::Int::plus (long long int x, long long int y)
 Safe addition in case x is -Int::Limits::llinfinity.
double Gecode::Int::plus (double x, double y)
 Safe addition in case x is -Int::Limits::double_infinity.
template<class OptTask, class PL>
ExecStatus Gecode::Int::purge (Space &home, Propagator &p, TaskArray< OptTask > &t)
 Purge optional tasks that are excluded and possibly rewrite propagator.
template<class OptTask, class PL, class Cap>
ExecStatus Gecode::Int::purge (Space &home, Propagator &p, TaskArray< OptTask > &t, Cap c)
 Purge optional tasks that are excluded and possibly rewrite propagator.
template<class Char, class Traits>
std::basic_ostream< Char, Traits > & Gecode::Int::operator<< (std::basic_ostream< Char, Traits > &os, const Event &e)
 Print event e on stream os.