Gecode Namespace Reference
Gecode toplevel namespace. More...
Namespaces | |
namespace | Support |
Support algorithms and datastructures | |
namespace | Kernel |
Kernel functionality. | |
namespace | Driver |
Script commandline driver. | |
namespace | FlatZinc |
Interpreter for the FlatZinc language. | |
namespace | Gist |
The Gecode Interactive Search Tool. | |
namespace | Graph |
Graph constraints. | |
namespace | Int |
Finite domain integers. | |
namespace | Iter |
Range and value iterators. | |
namespace | MemoryConfig |
Parameters defining memory management policy for spaces. | |
namespace | Set |
Finite integer sets. | |
namespace | MiniModel |
Minimalistic modeling support. | |
namespace | Scheduling |
Scheduling constraints and branchers. | |
namespace | Search |
Search engines | |
Classes | |
class | BaseOptions |
Base class for script options. More... | |
class | Options |
Options for scripts. More... | |
class | SizeOptions |
Options for scripts with additional size parameter. More... | |
class | ArrayTraits< IntVarArray > |
Traits of IntVarArray. More... | |
class | ArrayTraits< IntVarArgs > |
Traits of IntVarArgs. More... | |
class | ArrayTraits< IntArgs > |
Traits of IntArgs. More... | |
class | ArrayTraits< IntSetArgs > |
Traits of IntSetArgs. More... | |
class | ArrayTraits< BoolVarArray > |
Traits of BoolVarArray. More... | |
class | ArrayTraits< BoolVarArgs > |
Traits of BoolVarArgs. More... | |
class | ViewArray< Int::Linear::NoView > |
View array for no view (empty). More... | |
class | ReUnaryPropagator |
Reified unary propagator. More... | |
class | ReBinaryPropagator |
Reified binary propagator. More... | |
class | ReMixBinaryPropagator |
Reified mixed binary propagator. More... | |
class | VarImpVarTraits< Int::IntVarImp > |
Traits class for variable implementations and variables. More... | |
class | VarImpVarTraits< Int::BoolVarImp > |
Traits class for variable implementations and variables. More... | |
class | ViewVarImpTraits< Int::IntView > |
Traits class for views and variable implementations. More... | |
class | VarViewTraits< IntVar > |
Traits class mapping variables to views. More... | |
class | ViewVarImpTraits< Int::MinusView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Int::OffsetView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Int::ScaleView< Val, UnsVal > > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Int::ConstIntView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Int::ZeroIntView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Int::BoolView > |
Traits class for views and variable implementations. More... | |
class | VarViewTraits< BoolVar > |
Traits class mapping variables to views. More... | |
class | ViewVarImpTraits< Int::NegBoolView > |
Traits class for views and variable implementations. More... | |
class | IntSet |
Integer sets. More... | |
class | IntSetRanges |
Range iterator for integer sets. More... | |
class | IntSetValues |
Value iterator for integer sets. More... | |
class | IntVar |
Integer variables. More... | |
class | IntVarRanges |
Range iterator for integer variables More... | |
class | IntVarValues |
Value iterator for integer variables. More... | |
class | BoolVar |
Boolean integer variables. More... | |
class | IntVarArgs |
Passing integer variables. More... | |
class | BoolVarArgs |
Passing Boolean variables. More... | |
class | IntVarArray |
Integer variable array. More... | |
class | BoolVarArray |
Boolean variable array. More... | |
class | DFA |
Deterministic finite automaton (DFA). More... | |
class | TupleSet |
Class represeting a set of tuples. More... | |
class | ViewAdvisor |
Advisor storing a single view. More... | |
struct | space_allocator< void > |
Space allocator - specialization for void . More... | |
struct | space_allocator |
Allocator that allocates memory from a space heap. More... | |
struct | region_allocator< void > |
Region allocator - specialization for void . More... | |
struct | region_allocator |
Allocator that allocates memory from a region. More... | |
class | VarArray |
Variable arrays More... | |
class | ViewArray |
View arrays. More... | |
class | ArgArrayBase |
Base-class for argument arrays. More... | |
class | PrimArgArray |
Argument array for primtive types. More... | |
class | ArgArray |
Argument array for non-primitive types. More... | |
class | VarArgArray |
Argument array for variables. More... | |
class | ArrayTraits |
Traits of arrays in Gecode. More... | |
class | FunctionBranch |
Brancher for calling a function. More... | |
class | VarBranchOptions |
Variable branch options. More... | |
class | ValBranchOptions |
Value branch options. More... | |
class | TieBreakVarBranch |
Combine variable selection criteria for tie-breaking. More... | |
class | TieBreakVarBranchOptions |
Combine variable branch options for tie-breaking. More... | |
class | ViewSelTieBreakStatic |
View selection class for static tie breaking. More... | |
class | ChoiceVirtualBase |
Virtualized choice baseclass. More... | |
class | ViewSelVirtualBase |
Virtualized view selection base class. More... | |
class | ChoiceVirtual |
Virtualized choice. More... | |
class | ViewSelVirtual |
Virtualized view selection. More... | |
class | ViewSelTieBreakDynamic |
View selection class for dynamic tie breaking. More... | |
class | EmptyValSelChoice |
Emty value selection choice. More... | |
class | ValSelBase |
Base class for value selection. More... | |
class | EmptyViewSelChoice |
Emty view selection choice. More... | |
class | ViewSelBase |
Base class for view selection. More... | |
class | ViewSelNone |
Select first not assigned view. More... | |
class | ViewSelDegreeMin |
View selection class for view with smallest degree. More... | |
class | ViewSelDegreeMax |
View selection class for view with largest degree. More... | |
class | ViewSelAfcMin |
View selection class for view with smallest accumulated failure count. More... | |
class | ViewSelAfcMax |
View selection class for view with largest accumulated failure count. More... | |
class | ViewSelRnd |
View selection class for random selection. More... | |
class | Pos |
Position information. More... | |
class | ViewBrancher |
Generic brancher by view selection. More... | |
class | ViewValBrancher |
Generic brancher by view and value selection. More... | |
class | PosChoice |
Choices storing position More... | |
class | PosValChoice |
Choice storing position and value More... | |
class | CopiedHandle |
The copied handle. More... | |
class | SharedHandle |
The shared handle. More... | |
class | NoIdxVarImpConf |
Configuration class for variable implementations without index structure. More... | |
class | VarImpBase |
Base-class for variable implementations. More... | |
class | VarDisposerBase |
Base class for Variable type disposer. More... | |
class | VarDisposer |
Variable type disposer More... | |
class | Delta |
Generic domain change information to be supplied to advisors. More... | |
class | VarImp |
Base-class for variable implementations. More... | |
class | PropCost |
Propagation cost. More... | |
class | ActorLink |
Double-linked list for actors. More... | |
class | Actor |
Base-class for both propagators and branchers. More... | |
class | Home |
Home class for posting propagators. More... | |
class | Propagator |
Base-class for propagators. More... | |
class | Council |
Council of advisors. More... | |
class | Advisors |
Class to iterate over advisors of a council. More... | |
class | Advisor |
Base-class for advisors. More... | |
class | Choice |
Choice for path recomputation. More... | |
class | Brancher |
Base-class for branchers. More... | |
class | StatusStatistics |
Statistics for execution of status More... | |
class | CloneStatistics |
Statistics for execution of clone More... | |
class | CommitStatistics |
Statistics for execution of commit More... | |
class | Space |
Computation spaces. More... | |
class | SpaceFailed |
Exception: Operation on failed space invoked More... | |
class | SpaceNotStable |
Exception: Operation on not stable space invoked More... | |
class | SpaceNoBrancher |
Exception: Commit when no brancher present More... | |
class | SpaceIllegalAlternative |
Exception: Commit with illegal alternative More... | |
class | SpaceConstrainUndefined |
Exception: no constrain member function defined More... | |
class | TooManyBranchers |
Exception: too many branchers More... | |
class | PropInfo |
Class for propagator information. More... | |
class | GlobalPropInfo |
Globally shared object for propagator information. More... | |
class | MemoryChunk |
Memory chunk with size information. More... | |
class | HeapChunk |
Memory chunk allocated from heap with proper alignment. More... | |
class | SharedMemory |
Shared object for several memory areas. More... | |
class | FreeList |
Base-class for freelist-managed objects. More... | |
class | MemoryManager |
Manage memory for space. More... | |
class | UnaryPropagator |
Unary propagator. More... | |
class | BinaryPropagator |
Binary propagator. More... | |
class | TernaryPropagator |
Ternary propagator. More... | |
class | NaryPropagator |
n-ary propagator More... | |
class | NaryOnePropagator |
(n+1)-ary propagator More... | |
class | MixBinaryPropagator |
Mixed binary propagator. More... | |
class | MixTernaryPropagator |
Mixed ternary propagator. More... | |
class | MixNaryOnePropagator |
Mixed (n+1)-ary propagator. More... | |
class | Region |
Handle to region. More... | |
class | SharedArray |
Shared array with arbitrary number of elements. More... | |
class | VarViewTraits |
Traits class for mapping variables to views. More... | |
class | VarImpVarTraits |
Traits class for mapping variable implementations to variables. More... | |
class | ViewVarImpTraits |
Traits class for views and variable implementations. More... | |
class | AllVarConf |
Configuration for all variable implementations. More... | |
class | VarBase |
Base-class for variables. More... | |
class | ConstViewBase |
Base-class for constant views. More... | |
class | VarViewBase |
Base-class for variable views. More... | |
class | DerivedViewBase |
Base-class for derived views. More... | |
class | LinExpr |
Linear expressions. More... | |
class | LinRel |
Linear relations. More... | |
class | BoolExpr |
Boolean expressions. More... | |
class | BoolRel |
Boolean relations. More... | |
class | REG |
Regular expressions over integer values. More... | |
class | Matrix |
Matrix-interface for arrays. More... | |
class | DFS |
Depth-first search engine. More... | |
class | BAB |
Depth-first branch-and-bound search engine. More... | |
class | Restart |
Depth-first restart best solution search engine. More... | |
class | LDS |
Limited discrepancy search engine. More... | |
class | ArrayTraits< SetVarArray > |
Traits of SetVarArray. More... | |
class | ArrayTraits< SetVarArgs > |
Traits of SetVarArgs. More... | |
class | IntSetPropagator |
Set/Int connection propagator. More... | |
class | IntSetRePropagator |
Set/Int reified connection propagator. More... | |
class | VarImpVarTraits< Set::SetVarImp > |
Traits class for variable implementations and variables. More... | |
class | ViewVarImpTraits< Set::SetView > |
Traits class for views and variable implementations. More... | |
class | VarViewTraits< SetVar > |
Traits class mapping variables to views. More... | |
class | ViewVarImpTraits< Set::ConstantView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Set::EmptyView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Set::UniverseView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Set::SingletonView > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Set::ComplementView< View > > |
Traits class for views and variable implementations. More... | |
class | ViewVarImpTraits< Set::OffsetSetView< View > > |
Traits class for views and variable implementations. More... | |
class | SetVar |
Set variables More... | |
class | SetVarGlbRanges |
Iterator for the greatest lower bound ranges of a set variable. More... | |
class | SetVarLubRanges |
Iterator for the least upper bound ranges of a set variable. More... | |
class | SetVarUnknownRanges |
Iterator for the unknown ranges of a set variable. More... | |
class | SetVarGlbValues |
Iterator for the values in the greatest lower bound of a set variable. More... | |
class | SetVarLubValues |
Iterator for the values in the least upper bound of a set variable. More... | |
class | SetVarUnknownValues |
Iterator for the values in the unknown set of a set variable. More... | |
class | SetVarArgs |
Passing set variables. More... | |
class | SetVarArray |
Set variable array More... | |
class | Exception |
Exception: Base-class for exceptions More... | |
class | MemoryExhausted |
Exception: Memory exhausted More... | |
class | DynamicCastFailed |
Exception: dynamic cast failed More... | |
class | OperatingSystemError |
Exception: operating system error More... | |
class | Heap |
Heap memory management class. More... | |
Typedefs | |
typedef Driver::ScriptBase< Space > | Script |
Base-class for scripts. | |
typedef Driver::ScriptBase < MinimizeSpace > | MinimizeScript |
Base-class for scripts for finding solution of lowest cost. | |
typedef Driver::ScriptBase < MaximizeSpace > | MaximizeScript |
Base-class for scripts for finding solution of highest cost. | |
typedef PrimArgArray< int > | IntArgs |
Passing integer arguments. | |
typedef ArgArray< IntSet > | IntSetArgs |
Passing set arguments. | |
typedef SharedArray< int > | IntSharedArray |
Arrays of integers that can be shared among several element constraints. | |
typedef int | ModEvent |
Type for modification events. | |
typedef int | PropCond |
Type for propagation conditions. | |
typedef int | ModEventDelta |
Modification event deltas. | |
typedef MiniModel::OptimizeSpace < IRT_LE > | MinimizeSpace |
Class for minimizing cost. | |
typedef MiniModel::OptimizeSpace < IRT_GR > | MaximizeSpace |
Class for maximizing cost. | |
Enumerations | |
enum | ScriptMode { SM_SOLUTION, SM_TIME, SM_STAT, SM_GIST } |
Different modes for executing scripts. More... | |
enum | IntRelType { IRT_EQ, IRT_NQ, IRT_LQ, IRT_LE, IRT_GQ, IRT_GR } |
Relation types for integers. More... | |
enum | BoolOpType { BOT_AND, BOT_OR, BOT_IMP, BOT_EQV, BOT_XOR } |
Operation types for Booleans. More... | |
enum | IntConLevel { ICL_VAL, ICL_BND, ICL_DOM, ICL_DEF } |
Consistency levels for integer propagators. More... | |
enum | ExtensionalPropKind { EPK_DEF, EPK_SPEED, EPK_MEMORY } |
Extensional propagation kind. More... | |
enum | IntVarBranch { INT_VAR_NONE = 0, INT_VAR_RND, INT_VAR_DEGREE_MIN, INT_VAR_DEGREE_MAX, INT_VAR_AFC_MIN, INT_VAR_AFC_MAX, INT_VAR_MIN_MIN, INT_VAR_MIN_MAX, INT_VAR_MAX_MIN, INT_VAR_MAX_MAX, INT_VAR_SIZE_MIN, INT_VAR_SIZE_MAX, INT_VAR_SIZE_DEGREE_MIN, INT_VAR_SIZE_DEGREE_MAX, INT_VAR_SIZE_AFC_MIN, INT_VAR_SIZE_AFC_MAX, INT_VAR_REGRET_MIN_MIN, INT_VAR_REGRET_MIN_MAX, INT_VAR_REGRET_MAX_MIN, INT_VAR_REGRET_MAX_MAX } |
Which variable to select for branching. More... | |
enum | IntValBranch { INT_VAL_MIN, INT_VAL_MED, INT_VAL_MAX, INT_VAL_RND, INT_VAL_SPLIT_MIN, INT_VAL_SPLIT_MAX, INT_VAL_RANGE_MIN, INT_VAL_RANGE_MAX, INT_VALUES_MIN, INT_VALUES_MAX } |
Which values to select first for branching. More... | |
enum | IntAssign { INT_ASSIGN_MIN, INT_ASSIGN_MED, INT_ASSIGN_MAX, INT_ASSIGN_RND } |
Which value to select for assignment. More... | |
enum | ViewSelStatus { VSS_BEST, VSS_BETTER, VSS_TIE, VSS_WORSE } |
Status returned by member functions of view selection class. More... | |
enum | ExecStatus { __ES_SUBSUMED = -2, ES_FAILED = -1, ES_NOFIX = 0, ES_OK = 0, ES_FIX = 1, __ES_PARTIAL = 2 } |
enum | ActorProperty { AP_DISPOSE = (1 << 0), AP_WEAKLY = (1 << 1) } |
Actor properties. More... | |
enum | SpaceStatus { SS_FAILED, SS_SOLVED, SS_BRANCH } |
Space status More... | |
enum | SetRelType { SRT_EQ, SRT_NQ, SRT_SUB, SRT_SUP, SRT_DISJ, SRT_CMPL } |
Common relation types for sets. More... | |
enum | SetOpType { SOT_UNION, SOT_DUNION, SOT_INTER, SOT_MINUS } |
Common operations for sets. More... | |
enum | SetVarBranch { SET_VAR_NONE = 0, SET_VAR_RND, SET_VAR_DEGREE_MIN, SET_VAR_DEGREE_MAX, SET_VAR_AFC_MIN, SET_VAR_AFC_MAX, SET_VAR_MIN_MIN, SET_VAR_MIN_MAX, SET_VAR_MAX_MIN, SET_VAR_MAX_MAX, SET_VAR_SIZE_MIN, SET_VAR_SIZE_MAX, SET_VAR_SIZE_DEGREE_MIN, SET_VAR_SIZE_DEGREE_MAX, SET_VAR_SIZE_AFC_MIN, SET_VAR_SIZE_AFC_MAX } |
Which variable to select for branching. More... | |
enum | SetValBranch { SET_VAL_MIN_INC, SET_VAL_MIN_EXC, SET_VAL_MED_INC, SET_VAL_MED_EXC, SET_VAL_MAX_INC, SET_VAL_MAX_EXC, SET_VAL_RND_INC, SET_VAL_RND_EXC } |
Which values to select first for branching. More... | |
enum | SetAssign { SET_ASSIGN_MIN_INC, SET_ASSIGN_MIN_EXC, SET_ASSIGN_MED_INC, SET_ASSIGN_MED_EXC, SET_ASSIGN_MAX_INC, SET_ASSIGN_MAX_EXC, SET_ASSIGN_RND_INC, SET_ASSIGN_RND_EXC } |
Which value to select for assignment. More... | |
Functions | |
void | circuit (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Post propagator such that x forms a circuit. | |
void | circuit (Home home, const IntArgs &c, const IntVarArgs &x, const IntVarArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator such that x forms a circuit with costs y and z. | |
void | circuit (Home home, const IntArgs &c, const IntVarArgs &x, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator such that x forms a circuit with cost z. | |
void | abs (Home home, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | max (Home home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | max (Home home, const IntVarArgs &x, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | min (Home home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | min (Home home, const IntVarArgs &x, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | mult (Home home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | sqr (Home home, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | sqrt (Home home, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | divmod (Home home, IntVar x0, IntVar x1, IntVar x2, IntVar x3, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | div (Home home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | mod (Home home, IntVar x0, IntVar x1, IntVar x2, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, BoolVar x0, IntRelType r, BoolVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, BoolVar x, IntRelType r, int n, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | rel (Home home, BoolVar x0, IntRelType r, BoolVar x1, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, BoolVar x, IntRelType r, int n, BoolVar b, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | rel (Home home, const BoolVarArgs &x, IntRelType r, BoolVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() ![]() | |
void | rel (Home home, const BoolVarArgs &x, IntRelType r, int n, IntConLevel icl=ICL_DEF) |
Propagates ![]() ![]() | |
void | rel (Home home, const BoolVarArgs &x, IntRelType r, IntConLevel icl=ICL_DEF) |
Post propagator for pairwise relation on x. | |
void | rel (Home home, const BoolVarArgs &x, IntRelType r, const BoolVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for relation between x and y. | |
void | rel (Home home, BoolVar x0, BoolOpType o, BoolVar x1, BoolVar x2, IntConLevel icl=ICL_DEF) |
Post propagator for Boolean operation on x0 and x1. | |
void | rel (Home home, BoolVar x0, BoolOpType o, BoolVar x1, int n, IntConLevel icl=ICL_DEF) |
Post propagator for Boolean operation on x0 and x1. | |
void | rel (Home home, BoolOpType o, const BoolVarArgs &x, BoolVar y, IntConLevel icl=ICL_DEF) |
Post propagator for Boolean operation on x. | |
void | rel (Home home, BoolOpType o, const BoolVarArgs &x, int n, IntConLevel icl=ICL_DEF) |
Post propagator for Boolean operation on x. | |
void | clause (Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, int n, IntConLevel icl=ICL_DEF) |
Post propagator for Boolean clause with positive variables x and negative variables y. | |
void | clause (Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, BoolVar z, IntConLevel icl=ICL_DEF) |
Post propagator for Boolean clause with positive variables x and negative variables y. | |
void | branch (Home home, const BoolVarArgs &x, IntVarBranch vars, IntValBranch vals, const VarBranchOptions &o_vars=VarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with variable selection vars and value selection vals. | |
void | branch (Home home, const BoolVarArgs &x, const TieBreakVarBranch< IntVarBranch > &vars, IntValBranch vals, const TieBreakVarBranchOptions &o_vars=TieBreakVarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with tie-breaking variable selection vars and value selection vals. | |
void | branch (Home home, const IntVarArgs &x, IntVarBranch vars, IntValBranch vals, const VarBranchOptions &o_vars=VarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with variable selection vars and value selection vals. | |
void | branch (Home home, const IntVarArgs &x, const TieBreakVarBranch< IntVarBranch > &vars, IntValBranch vals, const TieBreakVarBranchOptions &o_vars=TieBreakVarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with tie-breaking variable selection vars and value selection vals. | |
void | assign (Home home, const IntVarArgs &x, IntAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Assign all x with value selection vals. | |
void | assign (Home home, const BoolVarArgs &x, IntAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Assign all x with value selection vals. | |
void | branch (Home home, IntVar x, IntValBranch vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with value selection vals. | |
void | branch (Home home, BoolVar x, IntValBranch vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with value selection vals. | |
void | assign (Home home, IntVar x, IntAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Assign x with value selection vals. | |
void | assign (Home home, BoolVar x, IntAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Assign x with value selection vals. | |
void | channel (Home home, const IntVarArgs &x, int xoff, const IntVarArgs &y, int yoff, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() ![]() | |
void | channel (Home home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() ![]() | |
void | channel (Home home, BoolVar x0, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for channeling a Boolean and an integer variable ![]() | |
void | channel (Home home, const BoolVarArgs &x, IntVar y, int o=0, IntConLevel icl=ICL_DEF) |
Post propagator for channeling Boolean and integer variables ![]() | |
void | count (Home home, const IntVarArgs &x, int n, IntRelType r, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | count (Home home, const IntVarArgs &x, IntVar y, IntRelType r, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | count (Home home, const IntVarArgs &x, const IntArgs &y, IntRelType r, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | count (Home home, const IntVarArgs &x, int n, IntRelType r, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | count (Home home, const IntVarArgs &x, IntVar y, IntRelType r, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | count (Home home, const IntVarArgs &x, const IntArgs &y, IntRelType r, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | distinct (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() ![]() | |
void | distinct (Home home, const IntArgs &n, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() ![]() | |
void | dom (Home home, IntVar x, int n, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | dom (Home home, const IntVarArgs &x, int n, IntConLevel icl=ICL_DEF) |
Propagates ![]() ![]() | |
void | dom (Home home, IntVar x, int l, int m, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | dom (Home home, const IntVarArgs &x, int l, int m, IntConLevel icl=ICL_DEF) |
Propagates ![]() ![]() | |
void | dom (Home home, IntVar x, const IntSet &s, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | dom (Home home, const IntVarArgs &x, const IntSet &s, IntConLevel icl=ICL_DEF) |
Propagates ![]() ![]() | |
void | dom (Home home, IntVar x, int n, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | dom (Home home, IntVar x, int l, int m, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | dom (Home home, IntVar x, const IntSet &s, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, IntSharedArray n, IntVar x0, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, IntSharedArray n, IntVar x0, BoolVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, IntSharedArray n, IntVar x0, int x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, const IntVarArgs &x, IntVar y0, IntVar y1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, const IntVarArgs &x, IntVar y0, int y1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, const BoolVarArgs &x, IntVar y0, BoolVar y1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, const BoolVarArgs &x, IntVar y0, int y1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, IntSharedArray a, IntVar x, int w, IntVar y, int h, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, IntSharedArray a, IntVar x, int w, IntVar y, int h, BoolVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, const IntVarArgs &a, IntVar x, int w, IntVar y, int h, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | element (Home home, const BoolVarArgs &a, IntVar x, int w, IntVar y, int h, BoolVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | wait (Home home, IntVar x, void(*c)(Space &home), IntConLevel icl=ICL_DEF) |
Execute c when x becomes assigned. | |
void | wait (Home home, BoolVar x, void(*c)(Space &home), IntConLevel icl=ICL_DEF) |
Execute c when x becomes assigned. | |
void | wait (Home home, const IntVarArgs &x, void(*c)(Space &home), IntConLevel icl=ICL_DEF) |
Execute c when all variables in x become assigned. | |
void | wait (Home home, const BoolVarArgs &x, void(*c)(Space &home), IntConLevel icl=ICL_DEF) |
Execute c when all variables in x become assigned. | |
void | when (Home home, BoolVar x, void(*t)(Space &home), void(*e)(Space &home)=NULL, IntConLevel icl=ICL_DEF) |
Execute t (then) when x is assigned one, and e (else) otherwise. | |
template<class Char , class Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const DFA &d) |
template<class Char , class Traits , class T > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const TupleSet &ts) |
void | extensional (Home home, const IntVarArgs &x, DFA d, IntConLevel icl=ICL_DEF) |
Post propagator for extensional constraint described by a DFA. | |
void | extensional (Home home, const BoolVarArgs &x, DFA d, IntConLevel icl=ICL_DEF) |
Post propagator for extensional constraint described by a DFA. | |
void | extensional (Home home, const IntVarArgs &x, const TupleSet &t, ExtensionalPropKind epk=EPK_DEF, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | extensional (Home home, const BoolVarArgs &x, const TupleSet &t, ExtensionalPropKind epk=EPK_DEF, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | count (Home home, const IntVarArgs &x, const IntVarArgs &c, const IntArgs &v, IntConLevel icl=ICL_DEF) |
Posts a global count (cardinality) constraint. | |
void | count (Home home, const IntVarArgs &x, const IntVarArgs &c, IntConLevel icl=ICL_DEF) |
Posts a global count (cardinality) constraint. | |
void | count (Home home, const IntVarArgs &x, const IntSetArgs &c, const IntArgs &v, IntConLevel icl=ICL_DEF) |
Posts a global count (cardinality) constraint. | |
void | count (Home home, const IntVarArgs &x, const IntSetArgs &c, IntConLevel icl=ICL_DEF) |
Posts a global count (cardinality) constraint. | |
void | count (Home home, const IntVarArgs &x, const IntSet &c, const IntArgs &v, IntConLevel icl=ICL_DEF) |
Posts a global count (cardinality) constraint. | |
template<class Char , class Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const IntSet &is) |
void | linear (Home home, const BoolVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const BoolVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const BoolVarArgs &x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const BoolVarArgs &x, IntRelType r, IntVar y, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const BoolVarArgs &x, IntRelType r, IntVar y, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntVarArgs &x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntVarArgs &x, IntRelType r, IntVar y, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | linear (Home home, const IntArgs &a, const IntVarArgs &x, IntRelType r, IntVar y, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, IntVar x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Propagates ![]() | |
void | rel (Home home, const IntVarArgs &x, IntRelType r, int c, IntConLevel icl=ICL_DEF) |
Propagates ![]() ![]() | |
void | rel (Home home, IntVar x0, IntRelType r, IntVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, const IntVarArgs &x, IntRelType r, IntVar y, IntConLevel icl=ICL_DEF) |
Post propagators for ![]() ![]() | |
void | rel (Home home, IntVar x0, IntRelType r, IntVar x1, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, IntVar x, IntRelType r, int c, BoolVar b, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | rel (Home home, const IntVarArgs &x, IntRelType r, IntConLevel icl=ICL_DEF) |
Post propagator for pairwise relation on x. | |
void | rel (Home home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for relation between x and y. | |
void | sorted (Home home, const IntVarArgs &x, const IntVarArgs &y, const IntVarArgs &z, IntConLevel icl=ICL_DEF) |
Post propagator that y is x sorted in increasing order. | |
void | sorted (Home home, const IntVarArgs &x, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator that y is x sorted in increasing order. | |
void | unshare (Home home, IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Replace multiple variable occurences in x by fresh variables. | |
void | unshare (Home home, BoolVarArgs &x, IntConLevel icl=ICL_DEF) |
Replace multiple variable occurences in x by fresh variables. | |
template<class Char , class Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const IntVar &x) |
template<class Char , class Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const BoolVar &x) |
bool | same (const Int::ConstIntView &x, const Int::ConstIntView &y) |
bool | same (const Int::IntView &, const Int::ConstIntView &) |
bool | same (const Int::BoolView &, const Int::ConstIntView &) |
bool | before (const Int::ConstIntView &x, const Int::ConstIntView &y) |
bool | same (const Int::MinusView &x, const Int::MinusView &y) |
bool | before (const Int::MinusView &x, const Int::MinusView &y) |
bool | same (const Int::NegBoolView &x, const Int::NegBoolView &y) |
bool | before (const Int::NegBoolView &x, const Int::NegBoolView &y) |
bool | same (const Int::OffsetView &x, const Int::OffsetView &y) |
bool | before (const Int::OffsetView &x, const Int::OffsetView &y) |
template<class Val , class UnsVal > | |
bool | same (const Int::ScaleView< Val, UnsVal > &x, const Int::ScaleView< Val, UnsVal > &y) |
template<class Val , class UnsVal > | |
bool | before (const Int::ScaleView< Val, UnsVal > &x, const Int::ScaleView< Val, UnsVal > &y) |
bool | same (const Int::ZeroIntView &, const Int::ZeroIntView &) |
bool | before (const Int::ZeroIntView &, const Int::ZeroIntView &) |
void | channel (Home home, IntVar x0, BoolVar x1, IntConLevel icl=ICL_DEF) |
Post propagator for channeling an integer and a Boolean variable ![]() | |
template<class T1 , class T2 > | |
bool | operator== (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) throw () |
Tests two space allocators for equality. | |
template<class T1 , class T2 > | |
bool | operator!= (space_allocator< T1 > const &al1, space_allocator< T2 > const &al2) throw () |
Tests two space allocators for inequality. | |
template<class T1 , class T2 > | |
bool | operator== (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) throw () |
template<class T1 , class T2 > | |
bool | operator!= (region_allocator< T1 > const &al1, region_allocator< T2 > const &al2) throw () |
template<class View > | |
bool | __before (const View &x, const View &y) |
template<class X , class Y > | |
bool | __same (const X &x, const Y &y) |
template<class X , class Y > | |
bool | __shared (const X &x, const Y &y) |
template<class Char , class Traits , class Var > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const VarArray< Var > &x) |
template<class Char , class Traits , class View > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const ViewArray< View > &x) |
template<class Char , class Traits , class T > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const ArgArrayBase< T > &x) |
void | branch (Home home, void(*f)(Space &home)) |
Call the function f (with the current space as argument) for branching. | |
template<class VarBranch > | |
TieBreakVarBranch< VarBranch > | tiebreak (VarBranch a, VarBranch b) |
Combine variable selection criteria a and b for tie-breaking. | |
template<class VarBranch > | |
TieBreakVarBranch< VarBranch > | tiebreak (VarBranch a, VarBranch b, VarBranch c) |
Combine variable selection criteria a, b, and c for tie-breaking. | |
template<class VarBranch > | |
TieBreakVarBranch< VarBranch > | tiebreak (VarBranch a, VarBranch b, VarBranch c, VarBranch d) |
Combine variable selection criteria a, b, c, and d for tie-breaking. | |
TieBreakVarBranchOptions | tiebreak (VarBranchOptions a, VarBranchOptions b) |
Combine variable branch options a and b for tie-breaking. | |
TieBreakVarBranchOptions | tiebreak (VarBranchOptions a, VarBranchOptions b, VarBranchOptions c) |
Combine variable branch options a, b, and c for tie-breaking. | |
TieBreakVarBranchOptions | tiebreak (VarBranchOptions a, VarBranchOptions b, VarBranchOptions c, VarBranchOptions d) |
Combine variable branch options a, b, c, and d for tie-breaking. | |
ExecStatus | ES_SUBSUMED (Propagator &p, size_t s) |
Propagator p is subsumed | |
ExecStatus | ES_SUBSUMED (Propagator &p, Space &home) |
Propagator p is subsumed | |
ExecStatus | ES_FIX_PARTIAL (Propagator &p, const ModEventDelta &med) |
Propagator p has computed partial fixpoint | |
ExecStatus | ES_NOFIX_PARTIAL (Propagator &p, const ModEventDelta &med) |
Propagator p has not computed partial fixpoint | |
template<class A > | |
ExecStatus | ES_SUBSUMED_FIX (A &a, Space &home, Council< A > &c) |
Advisor a is subsumed | |
template<class A > | |
ExecStatus | ES_SUBSUMED_NOFIX (A &a, Space &home, Council< A > &c) |
Advisor a is subsumed | |
bool | me_failed (ModEvent me) |
Check whether modification event me is failed. | |
bool | me_modified (ModEvent me) |
Check whether modification event me describes variable modification. | |
template<class Char , class Traits , class T > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const SharedArray< T > &x) |
bool | shared (const ConstViewBase &, const ConstViewBase &) |
Test whether views share same variable. | |
template<class VarImp > | |
bool | shared (const VarViewBase< VarImp > &, const ConstViewBase &) |
Test whether views share same variable. | |
template<class ViewA > | |
bool | shared (const DerivedViewBase< ViewA > &, const ConstViewBase &) |
Test whether views share same variable. | |
template<class VarImp > | |
bool | shared (const ConstViewBase &, const VarViewBase< VarImp > &) |
Test whether views share same variable. | |
template<class ViewA > | |
bool | shared (const ConstViewBase &, const DerivedViewBase< ViewA > &) |
Test whether views share same variable. | |
template<class VarImpA , class VarImpB > | |
bool | shared (const VarViewBase< VarImpA > &, const VarViewBase< VarImpB > &) |
Test whether views share same variable. | |
template<class VarImpA , class ViewB > | |
bool | shared (const VarViewBase< VarImpA > &, const DerivedViewBase< ViewB > &) |
Test whether views share same variable. | |
template<class ViewA , class VarImpB > | |
bool | shared (const DerivedViewBase< ViewA > &, const VarViewBase< VarImpB > &) |
Test whether views share same variable. | |
template<class ViewA , class ViewB > | |
bool | shared (const DerivedViewBase< ViewA > &, const DerivedViewBase< ViewB > &) |
Test whether views share same variable. | |
bool | same (const ConstViewBase &, const ConstViewBase &) |
Test whether two views are the same. | |
template<class VarImp > | |
bool | same (const VarViewBase< VarImp > &, const ConstViewBase &) |
Test whether two views are the same. | |
template<class ViewA > | |
bool | same (const ConstViewBase &, const DerivedViewBase< ViewA > &) |
Test whether two views are the same. | |
template<class VarImpA , class ViewB > | |
bool | same (const VarViewBase< VarImpA > &, const DerivedViewBase< ViewB > &) |
Test whether two views are the same. | |
template<class ViewA , class VarImpB > | |
bool | same (const DerivedViewBase< ViewA > &, const VarViewBase< VarImpB > &) |
Test whether two views are the same. | |
template<class ViewA , class ViewB > | |
bool | same (const DerivedViewBase< ViewA > &, const DerivedViewBase< ViewB > &) |
Test whether two views are the same. | |
template<class VarImp > | |
bool | same (const VarViewBase< VarImp > &x, const VarViewBase< VarImp > &y) |
template<class ViewA , class ViewB > | |
bool | before (const ViewA &x, const ViewB &y) |
template<class View > | |
bool | shared (const DerivedViewBase< View > &, const ConstViewBase &) |
template<class View > | |
bool | shared (const ConstViewBase &, const DerivedViewBase< View > &) |
IntVar | abs (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | min (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | min (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | max (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | max (Home home, const IntVarArgs &x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | mult (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | div (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | mod (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | sqr (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | sqrt (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | plus (Home home, IntVar x, IntVar y, IntConLevel icl=ICL_DEF) |
Return variable constrained to ![]() | |
IntVar | minus (Home home, IntVar x, IntVar y, IntConLevel icl) |
BoolExpr | operator&& (const BoolExpr &, const BoolExpr &) |
Conjunction of Boolean expressions. | |
BoolExpr | operator|| (const BoolExpr &, const BoolExpr &) |
Disjunction of Boolean expressions. | |
BoolExpr | operator^ (const BoolExpr &, const BoolExpr &) |
Exclusive-or of Boolean expressions. | |
template<class Var > | |
BoolExpr | operator~ (const LinRel< Var > &) |
Reification of linear relations. | |
BoolExpr | operator! (const BoolExpr &) |
Negated Boolean expression. | |
BoolExpr | eqv (const BoolExpr &, const BoolExpr &) |
Equivalence of Boolean expressions. | |
BoolExpr | imp (const BoolExpr &, const BoolExpr &) |
Implication of Boolean expressions. | |
BoolVar | post (Home home, const BoolExpr &e, IntConLevel icl=ICL_DEF) |
Post Boolean expression and return its value. | |
BoolVar | post (Home home, const BoolVar &b, IntConLevel icl=ICL_DEF) |
Post Boolean expression (special case for variable) and return its value. | |
BoolRel | tt (const BoolExpr &) |
State that Boolean expression must be true. | |
BoolRel | ff (const BoolExpr &) |
State that Boolean expression must be false. | |
void | post (Home home, const BoolRel &r, IntConLevel icl=ICL_DEF) |
Post Boolean relation. | |
LinExpr< IntVar > | operator+ (int, const IntVar &) |
Construct linear expression as sum of variable and integer. | |
LinExpr< IntVar > | operator+ (int, const LinExpr< IntVar > &) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr< IntVar > | operator+ (const IntVar &, int) |
Construct linear expression as sum of integer and linear expression. | |
LinExpr< IntVar > | operator+ (const LinExpr< IntVar > &, int) |
Construct linear expression as sum of integer and variable. | |
LinExpr< IntVar > | operator+ (const IntVar &, const IntVar &) |
Construct linear expression as sum of variables. | |
LinExpr< IntVar > | operator+ (const IntVar &, const LinExpr< IntVar > &) |
Construct linear expression as sum of variable and linear expression. | |
LinExpr< IntVar > | operator+ (const LinExpr< IntVar > &, const IntVar &) |
Construct linear expression as sum of linear expression and variable. | |
LinExpr< IntVar > | operator+ (const LinExpr< IntVar > &, const LinExpr< IntVar > &) |
Construct linear expression as sum of linear expressions. | |
LinExpr< IntVar > | operator- (int, const IntVar &) |
Construct linear expression as sum of variable and integer. | |
LinExpr< IntVar > | operator- (int, const LinExpr< IntVar > &) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr< IntVar > | operator- (const IntVar &, int) |
Construct linear expression as sum of integer and linear expression. | |
LinExpr< IntVar > | operator- (const LinExpr< IntVar > &, int) |
Construct linear expression as sum of integer and variable. | |
LinExpr< IntVar > | operator- (const IntVar &, const IntVar &) |
Construct linear expression as sum of variables. | |
LinExpr< IntVar > | operator- (const IntVar &, const LinExpr< IntVar > &) |
Construct linear expression as sum of variable and linear expression. | |
LinExpr< IntVar > | operator- (const LinExpr< IntVar > &, const IntVar &) |
Construct linear expression as sum of linear expression and variable. | |
LinExpr< IntVar > | operator- (const LinExpr< IntVar > &, const LinExpr< IntVar > &) |
Construct linear expression as sum of linear expressions. | |
LinExpr< IntVar > | operator- (const IntVar &) |
Construct linear expression as negative of variable. | |
LinExpr< IntVar > | operator- (const LinExpr< IntVar > &) |
Construct linear expression as negative of linear expression. | |
LinExpr< IntVar > | operator* (int, const IntVar &) |
Construct linear expression as product of integer coefficient and integer variable. | |
LinExpr< IntVar > | operator* (const IntVar &, int) |
Construct linear expression as product of integer coefficient and integer variable. | |
LinExpr< IntVar > | operator* (const LinExpr< IntVar > &, int) |
Construct linear expression as product of integer coefficient and linear expression. | |
LinExpr< IntVar > | operator* (int, const LinExpr< IntVar > &) |
Construct linear expression as product of integer coefficient and linear expression. | |
LinExpr< BoolVar > | operator+ (int, const BoolVar &) |
Construct linear expression as sum of variable and integer. | |
LinExpr< BoolVar > | operator+ (int, const LinExpr< BoolVar > &) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr< BoolVar > | operator+ (const BoolVar &, int) |
Construct linear expression as sum of integer and linear expression. | |
LinExpr< BoolVar > | operator+ (const LinExpr< BoolVar > &, int) |
Construct linear expression as sum of integer and variable. | |
LinExpr< BoolVar > | operator+ (const BoolVar &, const BoolVar &) |
Construct linear expression as sum of variables. | |
LinExpr< BoolVar > | operator+ (const BoolVar &, const LinExpr< BoolVar > &) |
Construct linear expression as sum of variable and linear expression. | |
LinExpr< BoolVar > | operator+ (const LinExpr< BoolVar > &, const BoolVar &) |
Construct linear expression as sum of linear expression and variable. | |
LinExpr< BoolVar > | operator+ (const LinExpr< BoolVar > &, const LinExpr< BoolVar > &) |
Construct linear expression as sum of linear expressions. | |
LinExpr< BoolVar > | operator- (int, const BoolVar &) |
Construct linear expression as sum of variable and integer. | |
LinExpr< BoolVar > | operator- (int, const LinExpr< BoolVar > &) |
Construct linear expression as sum of linear expression and integer. | |
LinExpr< BoolVar > | operator- (const BoolVar &, int) |
Construct linear expression as sum of integer and linear expression. | |
LinExpr< BoolVar > | operator- (const LinExpr< BoolVar > &, int) |
Construct linear expression as sum of integer and variable. | |
LinExpr< BoolVar > | operator- (const BoolVar &, const BoolVar &) |
Construct linear expression as sum of variables. | |
LinExpr< BoolVar > | operator- (const BoolVar &, const LinExpr< BoolVar > &) |
Construct linear expression as sum of variable and linear expression. | |
LinExpr< BoolVar > | operator- (const LinExpr< BoolVar > &, const BoolVar &) |
Construct linear expression as sum of linear expression and variable. | |
LinExpr< BoolVar > | operator- (const LinExpr< BoolVar > &, const LinExpr< BoolVar > &) |
Construct linear expression as sum of linear expressions. | |
LinExpr< BoolVar > | operator- (const BoolVar &) |
Construct linear expression as negative of variable. | |
LinExpr< BoolVar > | operator- (const LinExpr< BoolVar > &) |
Construct linear expression as negative of linear expression. | |
LinExpr< BoolVar > | operator* (int, const BoolVar &) |
Construct linear expression as product of integer coefficient and integer variable. | |
LinExpr< BoolVar > | operator* (const BoolVar &, int) |
Construct linear expression as product of integer coefficient and integer variable. | |
LinExpr< BoolVar > | operator* (const LinExpr< BoolVar > &, int) |
Construct linear expression as product of integer coefficient and linear expression. | |
LinExpr< BoolVar > | operator* (int, const LinExpr< BoolVar > &) |
Construct linear expression as product of integer coefficient and linear expression. | |
IntVar | post (Home home, const IntVar &x, IntConLevel icl=ICL_DEF) |
Post linear expression (special case for integer variable) and return its value. | |
IntVar | post (Home home, int n, IntConLevel icl=ICL_DEF) |
Post linear expression (special case for constant) and return its value. | |
template<class Var > | |
IntVar | post (Home home, const LinExpr< Var > &e, IntConLevel icl=ICL_DEF) |
Post linear expression and return its value. | |
LinRel< IntVar > | operator== (int l, const IntVar &r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (int l, const LinExpr< IntVar > &r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (const IntVar &l, int r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (const LinExpr< IntVar > &l, int r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (const IntVar &l, const IntVar &r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (const IntVar &l, const LinExpr< IntVar > &r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (const LinExpr< IntVar > &l, const IntVar &r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator== (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r) |
Construct linear equality relation. | |
LinRel< IntVar > | operator!= (int l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (int l, const LinExpr< IntVar > &r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (const IntVar &l, int r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (const LinExpr< IntVar > &l, int r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (const IntVar &l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (const IntVar &l, const LinExpr< IntVar > &r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (const LinExpr< IntVar > &l, const IntVar &r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator!= (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r) |
Construct linear disequality relation. | |
LinRel< IntVar > | operator< (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (int l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (const LinExpr< IntVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (const IntVar &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (const LinExpr< IntVar > &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator< (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (int l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (const LinExpr< IntVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (const IntVar &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (const LinExpr< IntVar > &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator<= (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (int l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (const LinExpr< IntVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (const IntVar &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (const LinExpr< IntVar > &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator> (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (int l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (int l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (const IntVar &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (const LinExpr< IntVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (const IntVar &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (const IntVar &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (const LinExpr< IntVar > &l, const IntVar &r) |
Construct linear inequality relation. | |
LinRel< IntVar > | operator>= (const LinExpr< IntVar > &l, const LinExpr< IntVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator== (int l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (int l, const LinExpr< BoolVar > &r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (const BoolVar &l, int r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (const LinExpr< BoolVar > &l, int r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (const BoolVar &l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (const BoolVar &l, const LinExpr< BoolVar > &r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (const LinExpr< BoolVar > &l, const BoolVar &r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator== (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r) |
Construct linear equality relation. | |
LinRel< BoolVar > | operator!= (int l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (int l, const LinExpr< BoolVar > &r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (const BoolVar &l, int r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (const LinExpr< BoolVar > &l, int r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (const BoolVar &l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (const BoolVar &l, const LinExpr< BoolVar > &r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (const LinExpr< BoolVar > &l, const BoolVar &r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator!= (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r) |
Construct linear disequality relation. | |
LinRel< BoolVar > | operator< (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (int l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (const LinExpr< BoolVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (const BoolVar &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (const LinExpr< BoolVar > &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator< (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (int l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (const LinExpr< BoolVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (const BoolVar &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (const LinExpr< BoolVar > &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator<= (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (int l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (const LinExpr< BoolVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (const BoolVar &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (const LinExpr< BoolVar > &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator> (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (int l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (int l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (const BoolVar &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (const LinExpr< BoolVar > &l, int r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (const BoolVar &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (const BoolVar &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (const LinExpr< BoolVar > &l, const BoolVar &r) |
Construct linear inequality relation. | |
LinRel< BoolVar > | operator>= (const LinExpr< BoolVar > &l, const LinExpr< BoolVar > &r) |
Construct linear inequality relation. | |
template<class Var > | |
void | post (Home home, const LinRel< Var > &r, IntConLevel icl=ICL_DEF) |
Post linear relation. | |
void | post (Home home, bool r, IntConLevel icl=ICL_DEF) |
Make it work for special integer only-case. | |
void | element (Home home, const Matrix< IntArgs > &m, IntVar x, IntVar y, IntVar z, IntConLevel icl) |
void | element (Home home, const Matrix< IntArgs > &m, IntVar x, IntVar y, BoolVar z, IntConLevel icl) |
void | element (Home home, const Matrix< IntVarArgs > &m, IntVar x, IntVar y, IntVar z, IntConLevel icl) |
void | element (Home home, const Matrix< BoolVarArgs > &m, IntVar x, IntVar y, BoolVar z, IntConLevel icl) |
void | element (Home home, const Matrix< IntSetArgs > &m, IntVar x, IntVar y, SetVar z) |
void | element (Home home, const Matrix< SetVarArgs > &m, IntVar x, IntVar y, SetVar z) |
template<class Char , class Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const REG &r) |
BoolVar | channel (Home home, IntVar x, IntConLevel icl=ICL_DEF) |
Return Boolean variable equal to ![]() | |
IntVar | channel (Home home, BoolVar b, IntConLevel icl=ICL_DEF) |
Return integer variable equal to ![]() | |
void | atmost (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atmost (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atmost (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atmost (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atmost (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atmost (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atleast (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atleast (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atleast (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atleast (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atleast (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | atleast (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | exactly (Home home, const IntVarArgs &x, int n, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | exactly (Home home, const IntVarArgs &x, IntVar y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | exactly (Home home, const IntVarArgs &x, const IntArgs &y, int m, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | exactly (Home home, const IntVarArgs &x, int n, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | exactly (Home home, const IntVarArgs &x, IntVar y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | exactly (Home home, const IntVarArgs &x, const IntArgs &y, IntVar z, IntConLevel icl=ICL_DEF) |
Post propagator for ![]() | |
void | lex (Home home, const IntVarArgs &x, IntRelType r, const IntVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for lexical order between x and y. | |
void | lex (Home home, const BoolVarArgs &x, IntRelType r, const BoolVarArgs &y, IntConLevel icl=ICL_DEF) |
Post propagator for lexical order between x and y. | |
void | cumulatives (Home home, const IntVarArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntVarArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntVarArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntVarArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntArgs &machine, const IntVarArgs &start, const IntVarArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntVarArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | cumulatives (Home home, const IntArgs &machine, const IntVarArgs &start, const IntArgs &duration, const IntVarArgs &end, const IntArgs &height, const IntArgs &limit, bool at_most, IntConLevel icl=ICL_DEF) |
Post propagators for the cumulatives constraint. | |
void | unary (Home home, const IntVarArgs &s, const IntArgs &p) |
Post propagators for scheduling tasks on unary resources. | |
void | unary (Home home, const IntVarArgs &s, const IntArgs &p, const BoolVarArgs &m) |
Post propagators for scheduling optional tasks on unary resources. | |
template<class T > | |
T * | bab (T *s, const Search::Options &o=Search::Options::def) |
Perform depth-first branch-and-bound search for subclass T of space s and options o. | |
template<class T > | |
T * | dfs (T *s, const Search::Options &o=Search::Options::def) |
Invoke depth-first search engine for subclass T of space s with options o. | |
template<class T > | |
T * | lds (T *s, const Search::Options &o=Search::Options::def) |
Invoke limited-discrepancy search for s as root node and optionso. | |
template<class T > | |
T * | restart (T *s, const Search::Options &o=Search::Options::def) |
Perform depth-first restart best solution search for subclass T of space s and options o. | |
void | branch (Home home, const SetVarArgs &x, SetVarBranch vars, SetValBranch vals, const VarBranchOptions &o_vars=VarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with variable selection vars and value selection vals. | |
void | branch (Home home, const SetVarArgs &x, const TieBreakVarBranch< SetVarBranch > &vars, SetValBranch vals, const TieBreakVarBranchOptions &o_vars=TieBreakVarBranchOptions::def, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with tie-breaking variable selection vars and value selection vals. | |
void | assign (Home home, const SetVarArgs &x, SetAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Assign all x with value selection vals. | |
void | branch (Home home, SetVar x, SetValBranch vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Branch over x with value selection vals. | |
void | assign (Home home, SetVar x, SetAssign vals, const ValBranchOptions &o_vals=ValBranchOptions::def) |
Assign x with value selection vals. | |
void | cardinality (Home home, SetVar x, unsigned int i, unsigned int j) |
Propagates ![]() | |
void | cardinality (Home home, SetVar s, IntVar x) |
Post propagator for ![]() | |
void | convex (Home home, SetVar x) |
Post propagator that propagates that x is convex. | |
void | convex (Home home, SetVar x, SetVar y) |
Post propagator that propagates that y is the convex hull of x. | |
void | atmostOne (Home home, const SetVarArgs &x, unsigned int c) |
Post propagator for ![]() ![]() | |
void | dom (Home home, SetVar x, SetRelType r, int i) |
Propagates ![]() | |
void | dom (Home home, SetVar x, SetRelType r, int i, int j) |
Propagates ![]() | |
void | dom (Home home, SetVar x, SetRelType r, const IntSet &s) |
Propagates ![]() | |
void | dom (Home home, SetVar x, SetRelType r, int i, BoolVar b) |
Post propagator for ![]() | |
void | dom (Home home, SetVar x, SetRelType r, int i, int j, BoolVar b) |
Post propagator for ![]() | |
void | dom (Home home, SetVar x, SetRelType r, const IntSet &s, BoolVar b) |
Post propagator for ![]() | |
void | element (Home home, SetOpType op, const SetVarArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max)) |
Post propagator for ![]() | |
void | element (Home home, SetOpType op, const IntSetArgs &x, SetVar y, SetVar z, const IntSet &u=IntSet(Set::Limits::min, Set::Limits::max)) |
Post propagator for ![]() | |
void | element (Home home, const SetVarArgs &x, IntVar y, SetVar z) |
Post propagator for ![]() | |
void | element (Home home, const IntSetArgs &s, IntVar y, SetVar z) |
Post propagator for ![]() | |
void | element (Home home, const IntSetArgs &a, IntVar x, int w, IntVar y, int h, SetVar z) |
Post propagator for ![]() | |
void | element (Home home, const SetVarArgs &a, IntVar x, int w, IntVar y, int h, SetVar z) |
Post propagator for ![]() | |
void | wait (Home home, SetVar x, void(*c)(Space &home)) |
Execute c when x becomes assigned. | |
void | wait (Home home, const SetVarArgs &x, void(*c)(Space &home)) |
Execute c when all variables in x become assigned. | |
void | rel (Home home, SetVar s, IntRelType r, IntVar x) |
Post propagator for ![]() | |
void | rel (Home home, IntVar x, IntRelType r, SetVar s) |
Post propagator for ![]() | |
void | min (Home home, SetVar s, IntVar x) |
Post propagator that propagates that x is the minimal element of s, and that s is not empty. | |
void | notMin (Home home, SetVar s, IntVar x) |
Post propagator that propagates that x is not the minimal element of s. | |
void | min (Home home, SetVar s, IntVar x, BoolVar b) |
Post reified propagator for b iff x is the minimal element of s. | |
void | max (Home home, SetVar s, IntVar x) |
Post propagator that propagates that x is the maximal element of s, and that s is not empty. | |
void | notMax (Home home, SetVar s, IntVar x) |
Post propagator that propagates that x is not the maximal element of s. | |
void | max (Home home, SetVar s, IntVar x, BoolVar b) |
Post reified propagator for b iff x is the maximal element of s. | |
void | channel (Home home, const IntVarArgs &x, SetVar y) |
Post propagator for ![]() ![]() | |
void | channel (Home home, const IntVarArgs &x, const SetVarArgs &y) |
Post propagator for ![]() | |
void | channel (Home home, const BoolVarArgs &x, SetVar y) |
Post propagator for ![]() | |
void | weights (Home home, const IntArgs &elements, const IntArgs &weights, SetVar x, IntVar y) |
Post propagator for ![]() | |
template<class View0 , class View1 > | |
bool | viewarrayshared (const Space &home, const ViewArray< View0 > &va, const View1 &y) |
template<> | |
bool | viewarrayshared< Set::SingletonView, Set::SetView > (const Space &, const ViewArray< Set::SingletonView > &, const Set::SetView &) |
void | rel (Home home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, const IntSet &z) |
Post propagator for ![]() | |
void | rel (Home home, const IntSet &x, SetOpType op, SetVar y, SetRelType r, SetVar z) |
Post propagator for ![]() | |
void | rel (Home home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, const IntSet &z) |
Post propagator for ![]() | |
void | rel (Home home, SetVar x, SetOpType op, const IntSet &y, SetRelType r, SetVar z) |
Post propagator for ![]() | |
void | rel (Home home, SetVar x, SetOpType op, SetVar y, SetRelType r, const IntSet &z) |
Post propagator for ![]() | |
void | rel (Home home, SetOpType op, const IntVarArgs &x, SetVar y) |
Post propagator for ![]() | |
void | rel (Home home, SetOpType op, const IntVarArgs &x, const IntSet &z, SetVar y) |
Post propagator for ![]() | |
void | rel (Home home, SetVar x, SetOpType op, SetVar y, SetRelType r, SetVar z) |
Post propagator for ![]() | |
void | rel (Home home, SetOpType op, const SetVarArgs &x, SetVar y) |
Post propagator for ![]() | |
void | rel (Home home, SetOpType op, const SetVarArgs &x, const IntSet &z, SetVar y) |
Post propagator for ![]() | |
template<class View0 , class View1 > | |
void | rel_post (Home home, View0 x0, SetRelType r, View1 x1) |
template<class View0 , class View1 > | |
void | rel_re (Home home, View0 x, SetRelType r, View1 y, BoolVar b) |
void | rel (Home home, SetVar x, SetRelType r, SetVar y) |
Post propagator for ![]() | |
void | rel (Home home, SetVar s, SetRelType r, IntVar x) |
Post propagator for ![]() | |
void | rel (Home home, IntVar x, SetRelType r, SetVar s) |
Post propagator for ![]() | |
void | rel (Home home, SetVar x, SetRelType r, SetVar y, BoolVar b) |
Post propagator for ![]() | |
void | rel (Home home, SetVar s, SetRelType r, IntVar x, BoolVar b) |
Post propagator for ![]() | |
void | rel (Home home, IntVar x, SetRelType r, SetVar s, BoolVar b) |
Post propagator for ![]() | |
void | sequence (Home home, const SetVarArgs &x) |
Post propagator for ![]() | |
void | sequence (Home home, const SetVarArgs &y, SetVar x) |
Post propagator for ![]() ![]() | |
template<class Char , class Traits > | |
std::basic_ostream< Char, Traits > & | operator<< (std::basic_ostream< Char, Traits > &os, const SetVar &x) |
template<class View > | |
bool | same (const Set::ComplementView< View > &x, const Set::ComplementView< View > &y) |
template<class View > | |
bool | before (const Set::ComplementView< View > &x, const Set::ComplementView< View > &y) |
template<class View > | |
bool | same (const Set::ComplementView< Set::ComplementView< View > > &x, const Set::ComplementView< Set::ComplementView< View > > &y) |
template<class View > | |
bool | before (const Set::ComplementView< Set::ComplementView< View > > &x, const Set::ComplementView< Set::ComplementView< View > > &y) |
bool | same (const Set::ConstantView &x, const Set::ConstantView &y) |
bool | before (const Set::ConstantView &x, const Set::ConstantView &y) |
bool | same (const Set::EmptyView &, const Set::EmptyView &) |
bool | before (const Set::EmptyView &, const Set::EmptyView &) |
bool | same (const Set::UniverseView &, const Set::UniverseView &) |
bool | before (const Set::UniverseView &, const Set::UniverseView &) |
template<class View > | |
bool | same (const Set::OffsetSetView< View > &x, const Set::OffsetSetView< View > &y) |
template<class View > | |
bool | before (const Set::OffsetSetView< View > &x, const Set::OffsetSetView< View > &y) |
bool | same (const Set::SingletonView &x, const Set::SingletonView &y) |
bool | before (const Set::SingletonView &x, const Set::SingletonView &y) |
Variables | |
const ModEvent | ME_GEN_FAILED = -1 |
Generic modification event: failed variable. | |
const ModEvent | ME_GEN_NONE = 0 |
Generic modification event: no modification. | |
const ModEvent | ME_GEN_ASSIGNED = 1 |
Generic modification event: variable is assigned a value. | |
const PropCond | PC_GEN_NONE = -1 |
Propagation condition to be ignored (convenience). | |
const PropCond | PC_GEN_ASSIGNED = 0 |
Propagation condition for an assigned variable. | |
Heap | heap |
The single global heap. |
Detailed Description
Gecode toplevel namespace.
The Gecode namespace contains nested namespaces for the various submodules (for example Int for the definition of integer propagator classes). Functionality that is used for interfacing (search engines, variables, and so on) or belongs to the Gecode Kernel is contained directly in the Gecode namespace.
Enumeration Type Documentation
enum Gecode::ExecStatus |
- Enumerator:
Function Documentation
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const DFA & | d | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const TupleSet & | ts | |||
) | [inline] |
Definition at line 165 of file tuple-set.hpp.
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const IntSet & | is | |||
) | [inline] |
Definition at line 210 of file int-set-1.hpp.
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const IntVar & | x | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const BoolVar & | x | |||
) | [inline] |
bool Gecode::same | ( | const Int::ConstIntView & | x, | |
const Int::ConstIntView & | y | |||
) | [inline] |
Definition at line 372 of file constint.hpp.
bool Gecode::same | ( | const Int::IntView & | , | |
const Int::ConstIntView & | ||||
) | [inline] |
Definition at line 376 of file constint.hpp.
bool Gecode::same | ( | const Int::BoolView & | , | |
const Int::ConstIntView & | ||||
) | [inline] |
Definition at line 380 of file constint.hpp.
bool Gecode::before | ( | const Int::ConstIntView & | x, | |
const Int::ConstIntView & | y | |||
) | [inline] |
Definition at line 384 of file constint.hpp.
bool Gecode::same | ( | const Int::MinusView & | x, | |
const Int::MinusView & | y | |||
) | [inline] |
bool Gecode::before | ( | const Int::MinusView & | x, | |
const Int::MinusView & | y | |||
) | [inline] |
bool Gecode::same | ( | const Int::NegBoolView & | x, | |
const Int::NegBoolView & | y | |||
) | [inline] |
Definition at line 254 of file neg-bool.hpp.
bool Gecode::before | ( | const Int::NegBoolView & | x, | |
const Int::NegBoolView & | y | |||
) | [inline] |
Definition at line 258 of file neg-bool.hpp.
bool Gecode::same | ( | const Int::OffsetView & | x, | |
const Int::OffsetView & | y | |||
) | [inline] |
Definition at line 333 of file offset.hpp.
bool Gecode::before | ( | const Int::OffsetView & | x, | |
const Int::OffsetView & | y | |||
) | [inline] |
Definition at line 337 of file offset.hpp.
bool Gecode::same | ( | const Int::ScaleView< Val, UnsVal > & | x, | |
const Int::ScaleView< Val, UnsVal > & | y | |||
) | [inline] |
bool Gecode::before | ( | const Int::ScaleView< Val, UnsVal > & | x, | |
const Int::ScaleView< Val, UnsVal > & | y | |||
) | [inline] |
bool Gecode::same | ( | const Int::ZeroIntView & | , | |
const Int::ZeroIntView & | ||||
) | [inline] |
bool Gecode::before | ( | const Int::ZeroIntView & | , | |
const Int::ZeroIntView & | ||||
) | [inline] |
bool Gecode::operator== | ( | space_allocator< T1 > const & | al1, | |
space_allocator< T2 > const & | al2 | |||
) | throw () [inline] |
Tests two space allocators for equality.
Two allocators are equal when each can release storage allocated from the other.
Definition at line 279 of file allocators.hpp.
bool Gecode::operator!= | ( | space_allocator< T1 > const & | al1, | |
space_allocator< T2 > const & | al2 | |||
) | throw () [inline] |
Tests two space allocators for inequality.
Two allocators are equal when each can release storage allocated from the other.
Definition at line 291 of file allocators.hpp.
bool Gecode::operator== | ( | region_allocator< T1 > const & | al1, | |
region_allocator< T2 > const & | al2 | |||
) | throw () [inline] |
Definition at line 443 of file allocators.hpp.
bool Gecode::operator!= | ( | region_allocator< T1 > const & | al1, | |
region_allocator< T2 > const & | al2 | |||
) | throw () [inline] |
Definition at line 455 of file allocators.hpp.
bool Gecode::__before | ( | const View & | x, | |
const View & | y | |||
) | [inline] |
bool Gecode::__same | ( | const X & | x, | |
const Y & | y | |||
) | [inline] |
bool Gecode::__shared | ( | const X & | x, | |
const Y & | y | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const VarArray< Var > & | x | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const ViewArray< View > & | x | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const ArgArrayBase< T > & | x | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const SharedArray< T > & | x | |||
) | [inline] |
Definition at line 227 of file shared-array.hpp.
bool Gecode::same | ( | const ConstViewBase & | , | |
const ConstViewBase & | ||||
) | [inline] |
bool Gecode::same | ( | const VarViewBase< VarImp > & | , | |
const ConstViewBase & | ||||
) | [inline] |
bool Gecode::same | ( | const ConstViewBase & | , | |
const DerivedViewBase< ViewA > & | ||||
) | [inline] |
bool Gecode::same | ( | const VarViewBase< VarImpA > & | , | |
const DerivedViewBase< ViewB > & | ||||
) | [inline] |
bool Gecode::same | ( | const DerivedViewBase< ViewA > & | , | |
const VarViewBase< VarImpB > & | ||||
) | [inline] |
bool Gecode::same | ( | const DerivedViewBase< ViewA > & | , | |
const DerivedViewBase< ViewB > & | ||||
) | [inline] |
bool Gecode::same | ( | const VarViewBase< VarImp > & | x, | |
const VarViewBase< VarImp > & | y | |||
) | [inline] |
bool Gecode::before | ( | const ViewA & | x, | |
const ViewB & | y | |||
) | [related] |
bool Gecode::shared | ( | const DerivedViewBase< View > & | , | |
const ConstViewBase & | ||||
) | [inline] |
bool Gecode::shared | ( | const ConstViewBase & | , | |
const DerivedViewBase< View > & | ||||
) | [inline] |
void Gecode::element | ( | Home | home, | |
const Matrix< IntArgs > & | m, | |||
IntVar | x, | |||
IntVar | y, | |||
IntVar | z, | |||
IntConLevel | icl | |||
) | [inline] |
Definition at line 139 of file matrix.hpp.
void Gecode::element | ( | Home | home, | |
const Matrix< IntArgs > & | m, | |||
IntVar | x, | |||
IntVar | y, | |||
BoolVar | z, | |||
IntConLevel | icl | |||
) | [inline] |
Definition at line 144 of file matrix.hpp.
void Gecode::element | ( | Home | home, | |
const Matrix< IntVarArgs > & | m, | |||
IntVar | x, | |||
IntVar | y, | |||
IntVar | z, | |||
IntConLevel | icl | |||
) | [inline] |
Definition at line 149 of file matrix.hpp.
void Gecode::element | ( | Home | home, | |
const Matrix< BoolVarArgs > & | m, | |||
IntVar | x, | |||
IntVar | y, | |||
BoolVar | z, | |||
IntConLevel | icl | |||
) | [inline] |
Definition at line 154 of file matrix.hpp.
void Gecode::element | ( | Home | home, | |
const Matrix< IntSetArgs > & | m, | |||
IntVar | x, | |||
IntVar | y, | |||
SetVar | z | |||
) | [inline] |
Definition at line 161 of file matrix.hpp.
void Gecode::element | ( | Home | home, | |
const Matrix< SetVarArgs > & | m, | |||
IntVar | x, | |||
IntVar | y, | |||
SetVar | z | |||
) | [inline] |
Definition at line 166 of file matrix.hpp.
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const REG & | r | |||
) | [inline] |
T * Gecode::dfs | ( | T * | s, | |
const Search::Options & | o | |||
) | [inline] |
Invoke depth-first search engine for subclass T of space s with options o.
bool Gecode::viewarrayshared | ( | const Space & | home, | |
const ViewArray< View0 > & | va, | |||
const View1 & | y | |||
) | [inline] |
Definition at line 51 of file common.hpp.
bool Gecode::viewarrayshared< Set::SingletonView, Set::SetView > | ( | const Space & | , | |
const ViewArray< Set::SingletonView > & | , | |||
const Set::SetView & | ||||
) | [inline] |
void Gecode::rel_post | ( | Home | home, | |
View0 | x0, | |||
SetRelType | r, | |||
View1 | x1 | |||
) | [inline] |
void Gecode::rel_re | ( | Home | home, | |
View0 | x, | |||
SetRelType | r, | |||
View1 | y, | |||
BoolVar | b | |||
) | [inline] |
std::basic_ostream<Char,Traits>& Gecode::operator<< | ( | std::basic_ostream< Char, Traits > & | os, | |
const SetVar & | x | |||
) | [inline] |
bool Gecode::same | ( | const Set::ComplementView< View > & | x, | |
const Set::ComplementView< View > & | y | |||
) | [inline] |
Definition at line 575 of file complement.hpp.
bool Gecode::before | ( | const Set::ComplementView< View > & | x, | |
const Set::ComplementView< View > & | y | |||
) | [inline] |
Definition at line 581 of file complement.hpp.
bool Gecode::same | ( | const Set::ComplementView< Set::ComplementView< View > > & | x, | |
const Set::ComplementView< Set::ComplementView< View > > & | y | |||
) | [inline] |
Definition at line 587 of file complement.hpp.
bool Gecode::before | ( | const Set::ComplementView< Set::ComplementView< View > > & | x, | |
const Set::ComplementView< Set::ComplementView< View > > & | y | |||
) | [inline] |
Definition at line 593 of file complement.hpp.
bool Gecode::same | ( | const Set::ConstantView & | x, | |
const Set::ConstantView & | y | |||
) | [inline] |
bool Gecode::before | ( | const Set::ConstantView & | x, | |
const Set::ConstantView & | y | |||
) | [inline] |
bool Gecode::same | ( | const Set::EmptyView & | , | |
const Set::EmptyView & | ||||
) | [inline] |
bool Gecode::before | ( | const Set::EmptyView & | , | |
const Set::EmptyView & | ||||
) | [inline] |
bool Gecode::same | ( | const Set::UniverseView & | , | |
const Set::UniverseView & | ||||
) | [inline] |
bool Gecode::before | ( | const Set::UniverseView & | , | |
const Set::UniverseView & | ||||
) | [inline] |
bool Gecode::same | ( | const Set::OffsetSetView< View > & | x, | |
const Set::OffsetSetView< View > & | y | |||
) | [related] |
Definition at line 467 of file offset.hpp.
bool Gecode::before | ( | const Set::OffsetSetView< View > & | x, | |
const Set::OffsetSetView< View > & | y | |||
) | [related] |
Definition at line 473 of file offset.hpp.
bool Gecode::same | ( | const Set::SingletonView & | x, | |
const Set::SingletonView & | y | |||
) | [inline] |
Definition at line 413 of file singleton.hpp.
bool Gecode::before | ( | const Set::SingletonView & | x, | |
const Set::SingletonView & | y | |||
) | [inline] |
Definition at line 417 of file singleton.hpp.