#include <gecode/int/task.hh>
#include <gecode/int/unary/task.hpp>
#include <gecode/int/unary/task-view.hpp>
#include <gecode/int/unary/tree.hpp>
#include <gecode/int/unary/overload.hpp>
#include <gecode/int/unary/time-tabling.hpp>
#include <gecode/int/unary/subsumption.hpp>
#include <gecode/int/unary/detectable.hpp>
#include <gecode/int/unary/not-first-not-last.hpp>
#include <gecode/int/unary/edge-finding.hpp>
#include <gecode/int/unary/man-prop.hpp>
#include <gecode/int/unary/opt-prop.hpp>
#include <gecode/int/unary/post.hpp>
Go to the source code of this file.
Namespaces | |
namespace | Gecode::Int::Unary |
Int for unary resources | |
namespace | Gecode |
Gecode toplevel namespace | |
namespace | Gecode::Int |
Finite domain integers. |
Typedefs | |
typedef ManFixPTask | Gecode::Int::Unary::ManFixPTaskFwd |
Forward mandatory fixed task view. | |
typedef FwdToBwd< ManFixPTaskFwd > | Gecode::Int::Unary::ManFixPTaskBwd |
Backward (dual) mandatory fixed task view. | |
typedef ManFixPSETask | Gecode::Int::Unary::ManFixPSETaskFwd |
Forward mandatory fixed task view. | |
typedef FwdToBwd< ManFixPSETaskFwd > | Gecode::Int::Unary::ManFixPSETaskBwd |
Backward (dual) mandatory fixed task view. | |
typedef OptFixPTask | Gecode::Int::Unary::OptFixPTaskFwd |
Forward optional fixed task view. | |
typedef FwdToBwd< OptFixPTaskFwd > | Gecode::Int::Unary::OptFixPTaskBwd |
Backward (dual) optional fixed task view. | |
typedef OptFixPSETask | Gecode::Int::Unary::OptFixPSETaskFwd |
Forward optional fixed task view. | |
typedef FwdToBwd< OptFixPSETaskFwd > | Gecode::Int::Unary::OptFixPSETaskBwd |
Backward (dual) optional fixed task view. | |
typedef ManFlexTask | Gecode::Int::Unary::ManFlexTaskFwd |
Forward mandatory flexible task view. | |
typedef FwdToBwd< ManFlexTaskFwd > | Gecode::Int::Unary::ManFlexTaskBwd |
Backward (dual) mandatory flexible task view. | |
typedef OptFlexTask | Gecode::Int::Unary::OptFlexTaskFwd |
Forward optional flexible task view. | |
typedef FwdToBwd< OptFlexTaskFwd > | Gecode::Int::Unary::OptFlexTaskBwd |
Backward (dual) optional flexible task view. |
Functions | |
template<class ManTask> | |
ExecStatus | Gecode::Int::Unary::overload (TaskArray< ManTask > &t) |
Check mandatory tasks t for overload. | |
template<class OptTask, class PL> | |
ExecStatus | Gecode::Int::Unary::overload (Space &home, Propagator &p, TaskArray< OptTask > &t) |
Check optional tasks t for overload. | |
template<class Task> | |
ExecStatus | Gecode::Int::Unary::timetabling (Space &home, Propagator &p, TaskArray< Task > &t) |
Perform time-tabling propagation. | |
template<class Task> | |
ExecStatus | Gecode::Int::Unary::subsumed (Space &home, Propagator &p, TaskArray< Task > &t) |
Check tasks t for subsumption. | |
template<class ManTask> | |
ExecStatus | Gecode::Int::Unary::detectable (Space &home, TaskArray< ManTask > &t) |
Propagate detectable precedences. | |
template<class OptTask, class PL> | |
ExecStatus | Gecode::Int::Unary::detectable (Space &home, Propagator &p, TaskArray< OptTask > &t) |
Propagate detectable precedences. | |
template<class ManTask> | |
ExecStatus | Gecode::Int::Unary::notfirstnotlast (Space &home, TaskArray< ManTask > &t) |
Propagate not-first and not-last. | |
template<class OptTask, class PL> | |
ExecStatus | Gecode::Int::Unary::notfirstnotlast (Space &home, Propagator &p, TaskArray< OptTask > &t) |
Propagate not-first and not-last. | |
template<class Task> | |
ExecStatus | Gecode::Int::Unary::edgefinding (Space &home, TaskArray< Task > &t) |
Propagate by edge-finding. | |
template<class ManTask> | |
ExecStatus | Gecode::Int::Unary::manpost (Home home, TaskArray< ManTask > &t, IntPropLevel ipl) |
Post mandatory task propagator according to propagation level. | |
template<class OptTask> | |
ExecStatus | Gecode::Int::Unary::optpost (Home home, TaskArray< OptTask > &t, IntPropLevel ipl) |
Post optional task propagator according to propagation level. |