# Class List

Here are the classes, structs, unions and interfaces with brief descriptions:AllInterval | Example: All-interval Series |

Alpha | Example: Alpha puzzle |

BACP | Example: The balanced academic curriculum problem |

Baseline | Example: Baseline test |

BaseOption | Base class for options |

BIBD | Example: Balanced Incomplete Block Design (BIBD) |

BIBDOptions | Options for BIBD problems |

BlackHole | Example: Black Hole Patience |

BlackHoleBranch | Custom branching for black hole patience |

Course | A course |

Crew | Example: Airline crew allocation |

CrowdedChess | Example: Crowded Chessboard |

Curriculum | A curriculum |

Domino | Example: Solitaire Domino |

Donald | Example: DONALD+GERALD=ROBERT puzzle |

Eq20 | Example: Solving 20 linear equations |

Example | Base-class for Gecode examples |

FileNameOptions | Options for examples with additional file name parameter |

Gecode::Actor | Base-class for both propagators and branchings |

Gecode::ActorLink | Double-linked list for actors |

Gecode::Advisor | Base-class for advisors |

Gecode::Advisors< A > | Class to iterate over advisors of a council |

Gecode::AllVarConf | Configuration for all variable implementations |

Gecode::ArgArrayBase< T > | Base-class for argument arrays |

Gecode::ArrayTraits< A > | Traits of arrays in Gecode |

Gecode::ArrayTraits< BoolVarArgs > | Traits of BoolVarArgs |

Gecode::ArrayTraits< BoolVarArray > | Traits of BoolVarArray |

Gecode::ArrayTraits< CpltSetVarArgs > | Traits of CpltSetVarArgs |

Gecode::ArrayTraits< CpltSetVarArray > | Traits of CpltSetVarArray |

Gecode::ArrayTraits< IntArgs > | Traits of IntArgs |

Gecode::ArrayTraits< IntVarArgs > | Traits of IntVarArgs |

Gecode::ArrayTraits< IntVarArray > | Traits of IntVarArray |

Gecode::ArrayTraits< SetVarArgs > | Traits of SetVarArgs |

Gecode::ArrayTraits< SetVarArray > | Traits of SetVarArray |

Gecode::BAB< T > | Depth-first branch-and-bound search engine |

Gecode::BddMgrException | Exception: Error in the Buddy ROBDD manager |

Gecode::BinaryPropagator< View, pc > | Binary propagator |

Gecode::BoolVar | Boolean integer variables |

Gecode::BoolVarArray | Boolean variable array |

Gecode::Branching | Base-class for branchings |

Gecode::BranchingDesc | Branch description for batch recomputation |

Gecode::ConstViewBase | Base-class for constant views |

Gecode::Council< A > | Council of advisors |

Gecode::CpltSet::ArgumentEmpty | Exception: No arguments available in argument array |

Gecode::CpltSet::ArgumentSizeMismatch | Exception: Arguments are of different size |

Gecode::CpltSet::BddIterator | Iterator for level-wise iteration over a given bdd |

Gecode::CpltSet::BddMgr | Manager for CpltSetVars |

Gecode::CpltSet::BinaryCpltSetPropagator< View0, View1 > | Binary propagator for CpltSet variables |

Gecode::CpltSet::BinRelDisj< View0, View1 > | Binary Rel Disjoint Propagator |

Gecode::CpltSet::Branch::ByMaxCard | View selection class for view with greatest cardinality of lub-glb |

Gecode::CpltSet::Branch::ByMaxUnknown | View selection class for view with greatest element in lub-glb |

Gecode::CpltSet::Branch::ByMinCard | View selection class for view with smallest cardinality of lub-glb |

Gecode::CpltSet::Branch::ByMinUnknown | View selection class for view with smallest element in lub-glb |

Gecode::CpltSet::Branch::ByNone | View selection class for first view |

Gecode::CpltSet::Branch::ValMaxUnknown< exclude > | Class for selecting maximum value of unknown ranges |

Gecode::CpltSet::Branch::ValMinUnknown< exclude > | Class for selecting minimum value of unknown ranges |

Gecode::CpltSet::CpltSetVarImp | Finite integer set variable implementation using a complete domain representation |

Gecode::CpltSet::CpltSetVarImpConf | Dummy configuration for CpltSet-variable implementations |

Gecode::CpltSet::CpltSetView | CpltSet view for CpltSet variables |

Gecode::CpltSet::DomBddIterator | Iterator for level-wise iteration of a variable domain |

Gecode::CpltSet::GlbLubSpecNoSubset | Exception: Variable created with glb not a subset of lub |

Gecode::CpltSet::GlbValues< T > | Iterate the values in the greatest lower bound of a CpltSetvariable |

Gecode::CpltSet::GlbValues< CpltSetVarImp * > | Iterator for the values in the greatest lower bound of a bdd variable implementation |

Gecode::CpltSet::GlbValues< CpltSetView > | Iterator for the values in the greatest lower bound of a CpltSetView |

Gecode::CpltSet::InvalidProjector | Exception: Invalid projector passed as argument |

Gecode::CpltSet::InvalidRelation | Exception: Invalid relation passed as argument |

Gecode::CpltSet::LubValues< T > | Iterate the values in the least upper bound of a bdd set variable |

Gecode::CpltSet::LubValues< CpltSetVarImp * > | Iterator for the values in the least upper bound of a bdd variable implementation |

Gecode::CpltSet::LubValues< CpltSetView > | Value iterator for least upper bound of singleton set view |

Gecode::CpltSet::NaryCpltSetPropagator< View > | Nary propagator for CpltSet variables |

Gecode::CpltSet::NaryOneCpltSetPropagator< View0, View1 > | Propagator for CpltSet variables with n+1 arguments |

Gecode::CpltSet::NaryTwoCpltSetPropagator< View0, View1 > | Propagator for CpltSet variables with n+2 arguments |

Gecode::CpltSet::Singleton< View1, View2 > | Singleton channel propagator from IntVar to CpltSetVar |

Gecode::CpltSet::UnaryCpltSetPropagator< View > | Unary propagator for CpltSet variables |

Gecode::CpltSet::UnknownBranching | Exception: Unknown value or variable selection passed as argument |

Gecode::CpltSet::UnknownValues< T > | Iterate the values lub-glb of a bdd set variable |

Gecode::CpltSet::UnknownValues< CpltSetVarImp * > | Iterator for the unknown values of a bdd variable implementation |

Gecode::CpltSet::UnknownValues< CpltSetView > | Iterator for the unknown values of a CpltSetView |

Gecode::CpltSet::VariableFailedDomain | Exception: Variable created with failed domain |

Gecode::CpltSet::VariableInvalidDomainSpec | Exception: Variable created with invalid domain specification |

Gecode::CpltSet::VariableOutOfRangeCardinality | Exception: Variable created with wrong cardinality |

Gecode::CpltSet::VariableOutOfRangeDomain | Exception: Variable created with values too large for domain |

Gecode::CpltSetVar | Finite set variable with complete domain representation |

Gecode::CpltSetVarArray | CpltSet variable array |

Gecode::CpltSetVarGlbRanges | Range iterator for the greatest lower bound of a bdd variable |

Gecode::CpltSetVarGlbValues | Value iterator for the greatest lower bound of a bdd variable |

Gecode::CpltSetVarLubRanges | Range iterator for the least upper bound of a bdd variable |

Gecode::CpltSetVarLubValues | Value iterator for the least upper bound of a bdd variable |

Gecode::CpltSetVarUnknownRanges | Range iterator for the unknown set of a bdd variable |

Gecode::Delta | Generic domain change information to be supplied to advisors |

Gecode::DerivedViewBase< View > | Base-class for derived views |

Gecode::DFA | Deterministic finite automaton (DFA) |

Gecode::DFA::DFAI | Data stored for a DFA |

Gecode::DFA::DFAI::HashEntry | Specification of transition range |

Gecode::DFA::Symbols | Iterator for DFA symbols |

Gecode::DFA::Transition | Specification of a DFA transition |

Gecode::DFA::Transitions | Iterator for DFA transitions (sorted by symbols) |

Gecode::DFS< T > | Depth-first search engine |

Gecode::DomainSize< View > | Traits class for variable domain size |

Gecode::DomainSize< Int::BoolView > | Class providing domain size info |

Gecode::DomainSize< Int::IntView > | Class providing domain size info |

Gecode::Exception | Exception: Base-class for exceptions |

Gecode::Formula | Formulas for specifying set constraints |

Gecode::Formula::Node | Nodes used to construct formulas |

Gecode::FreeList | Base-class for freelist-managed objects |

Gecode::Int::ArgumentSame | Exception: Arguments contain same variable multiply |

Gecode::Int::ArgumentSizeMismatch | Exception: Arguments are of different size |

Gecode::Int::Arithmetic::AbsBnd< View > | Bounds consistent absolute value propagator |

Gecode::Int::Arithmetic::AbsDom< View > | Domain consistent absolute value propagator |

Gecode::Int::Arithmetic::DivBnd< View > | Bounds consistent division propagator |

Gecode::Int::Arithmetic::DivMod< View > | Integer division/modulo propagator |

Gecode::Int::Arithmetic::DivPlusBnd< Val, VA, VB, VC, towardsMinInf > | Bounds consistent positive division propagator |

Gecode::Int::Arithmetic::MaxBnd< View > | Bounds consistent ternary maximum propagator |

Gecode::Int::Arithmetic::MaxDom< View > | Domain consistent ternary maximum propagator |

Gecode::Int::Arithmetic::MultBnd< View > | Bounds consistent multiplication propagator |

Gecode::Int::Arithmetic::MultDom< View > | Domain consistent multiplication propagator |

Gecode::Int::Arithmetic::MultPlusBnd< Val, VA, VB, VC > | Bounds consistent positive multiplication propagator |

Gecode::Int::Arithmetic::MultPlusDom< Val, VA, VB, VC > | Domain consistent positive multiplication propagator |

Gecode::Int::Arithmetic::MultZeroOne< View, pc > | Bounds or domain consistent propagator for |

Gecode::Int::Arithmetic::NaryMaxBnd< View > | Bounds consistent n-ary maximum propagator |

Gecode::Int::Arithmetic::NaryMaxDom< View > | Domain consistent n-ary maximum propagator |

Gecode::Int::Arithmetic::RangesMapSqr | Mapping ranges to squares |

Gecode::Int::Arithmetic::RangesMapSqrt | Mapping integer to square root |

Gecode::Int::Arithmetic::SqrBnd< View > | Bounds consistent square propagator |

Gecode::Int::Arithmetic::SqrDom< View > | Domain consistent square propagator |

Gecode::Int::Arithmetic::SqrPlusBnd< VA, VB > | Bounds consistent positive square propagator |

Gecode::Int::Arithmetic::SqrPlusDom< VA, VB > | Domain consistent positive square propagator |

Gecode::Int::Arithmetic::SqrtBnd< View > | Bounds consistent square root propagator |

Gecode::Int::Arithmetic::SqrtDom< View > | Domain consistent square root propagator |

Gecode::Int::Arithmetic::ValuesMapSqr | Mapping integer to square |

Gecode::Int::Arithmetic::ValuesMapSqrt | Mapping integer to square root |

Gecode::Int::Bool::BinOrTrue< BVA, BVB > | Binary Boolean disjunction propagator (true) |

Gecode::Int::Bool::BoolBinary< BVA, BVB > | Base-class for binary Boolean propagators |

Gecode::Int::Bool::BoolTernary< BVA, BVB, BVC > | Base-class for ternary Boolean propagators |

Gecode::Int::Bool::Eq< BVA, BVB > | Boolean equality propagator |

Gecode::Int::Bool::Eqv< BVA, BVB, BVC > | Boolean equivalence propagator |

Gecode::Int::Bool::Le< BV > | Boolean less propagator |

Gecode::Int::Bool::Lq< BV > | Boolean less or equal propagator |

Gecode::Int::Bool::NaryEq< BV > | N-ary Boolean equality propagator |

Gecode::Int::Bool::NaryOr< BV > | Boolean n-ary disjunction propagator |

Gecode::Int::Bool::NaryOrTrue< BV > | Boolean n-ary disjunction propagator (true) |

Gecode::Int::Bool::Or< BVA, BVB, BVC > | Boolean disjunction propagator |

Gecode::Int::Bool::OrTrueSubsumed< BV > | Binary Boolean disjunction propagator (subsumed) |

Gecode::Int::Bool::QuadOrTrue< BV > | Quarternary Boolean disjunction propagator (true) |

Gecode::Int::Bool::TerOrTrue< BV > | Ternary Boolean disjunction propagator (true) |

Gecode::Int::BoolVarImp | Boolean variable implementation |

Gecode::Int::BoolVarImpConf | Dummy configuration for Bool-variable implementations |

Gecode::Int::BoolView | Boolean view for Boolean variables |

Gecode::Int::Branch::ByDegreeMax< View > | View selection class for view with largest degree (and smallest size in case of ties) |

Gecode::Int::Branch::ByDegreeMaxNoTies< View > | View selection class for view with largest degree |

Gecode::Int::Branch::ByDegreeMin< View > | View selection class for view with smallest degree (and smallest size in case of ties) |

Gecode::Int::Branch::ByDegreeMinNoTies< View > | View selection class for view with smallest degree |

Gecode::Int::Branch::ByMaxMax< View > | View selection class for view with largest max |

Gecode::Int::Branch::ByMaxMin< View > | View selection class for view with smallest max |

Gecode::Int::Branch::ByMinMax< View > | View selection class for view with largest min |

Gecode::Int::Branch::ByMinMin< View > | View selection class for view with smallest min |

Gecode::Int::Branch::ByNone< View > | View selection class for first variable |

Gecode::Int::Branch::ByRegretMaxMax< View > | View selection class for view with largest max-regret |

Gecode::Int::Branch::ByRegretMaxMin< View > | View selection class for view with smallest max-regret |

Gecode::Int::Branch::ByRegretMinMax< View > | View selection class for view with largest min-regret |

Gecode::Int::Branch::ByRegretMinMin< View > | View selection class for view with smallest min-regret |

Gecode::Int::Branch::BySizeDegreeMax< View > | View selection class for view with largest size divided by degree |

Gecode::Int::Branch::BySizeDegreeMin< View > | View selection class for view with smallest size divided by degree |

Gecode::Int::Branch::BySizeMax< View > | View selection class for view with largest size |

Gecode::Int::Branch::BySizeMin< View > | View selection class for view with smallest size |

Gecode::Int::Branch::Creator< View, Val, SelView > | Register reflection for branchings |

Gecode::Int::Branch::NoValue | For Boolean branchings not needing a value |

Gecode::Int::Branch::ValMax< View > | Class for selecting median value |

Gecode::Int::Branch::ValMed< View > | Class for selecting maximum value |

Gecode::Int::Branch::ValMin< View > | Class for selecting minimum value |

Gecode::Int::Branch::ValOneZero< View > | Class for trying one and then zero |

Gecode::Int::Branch::ValSplitMax< View > | Class for splitting domain (upper half first) |

Gecode::Int::Branch::ValSplitMin< View > | Class for splitting domain (lower half first) |

Gecode::Int::Branch::ValZeroOne< View > | Class for trying zero and then one |

Gecode::Int::Channel::Base< Info, pc > | Base-class for channel propagators |

Gecode::Int::Channel::BoolIter | Iterates the values to be removed as defined by an array of Boolean views |

Gecode::Int::Channel::Dom< View, shared > | Domain consistent channel propagator |

Gecode::Int::Channel::DomInfo< View > | Combine view with information for domain propagation |

Gecode::Int::Channel::LinkMulti | Link propagator for multiple Boolean views |

Gecode::Int::Channel::LinkSingle | Link propagator for a single Boolean view |

Gecode::Int::Channel::Val< View, shared > | Naive channel propagator |

Gecode::Int::Channel::ValInfo< View > | Combine view with information for value propagation |

Gecode::Int::Circuit::Base< View > | Base-class for circuit propagator |

Gecode::Int::Circuit::Dom< View > | "Domain consistent" circuit propagator |

Gecode::Int::Circuit::SsccInfo< View > | Information required for non-recursive checking for a single scc |

Gecode::Int::Circuit::TellInfo< View > | Information for performing a recorded tell |

Gecode::Int::Circuit::Val< View > | "Value-consistent" circuit propagator |

Gecode::Int::ConstIntView | Constant integer view |

Gecode::Int::Count::BaseInt< VX, VY > | Baseclass for count propagators (integer) |

Gecode::Int::Count::BaseView< VX, VY, VZ, shr > | Base-class for count propagators (view) |

Gecode::Int::Count::EqInt< VX, VY > | Propagator for counting views (equal integer to number of equal views) |

Gecode::Int::Count::EqView< VX, VY, VZ, shr > | Propagator for counting views (equal to number of equal views) |

Gecode::Int::Count::GqInt< VX, VY > | Propagator for counting views (greater or equal integer to number of equal views) |

Gecode::Int::Count::GqView< VX, VY, VZ, shr > | Propagator for counting views (greater or equal to number of equal views) |

Gecode::Int::Count::LqInt< VX, VY > | Propagator for counting views (less or equal integer to number of equal views) |

Gecode::Int::Count::LqView< VX, VY, VZ, shr > | Propagator for counting views (less or equal to number of equal views) |

Gecode::Int::Count::NqInt< VX, VY > | Propagator for counting views (not equal integer to number of equal views) |

Gecode::Int::Count::NqView< VX, VY, VZ, shr > | Propagator for counting views (different from number of equal views) |

Gecode::Int::Cumulatives::Event | An event collects the information for one evnet for the sweep-line |

Gecode::Int::Cumulatives::Val< ViewM, ViewD, ViewH, View > | Propagator for the cumulatives constraint |

Gecode::Int::Distinct::BiLink | Bidirectional links for both edges and anchors in nodes of view-value graph |

Gecode::Int::Distinct::Bnd< View > | Bounds consistent distinct propagator |

Gecode::Int::Distinct::CombPtrFlag< T > | Class for combining two pointers with a flag |

Gecode::Int::Distinct::Dom< View > | Domain consistent distinct propagator |

Gecode::Int::Distinct::DomCtrl< View > | Propagation controller for domain consistent distinct |

Gecode::Int::Distinct::DomCtrl< View >::ViewValGraph | View-value graph for propagation |

Gecode::Int::Distinct::Edge< View > | Edges in view-value graph |

Gecode::Int::Distinct::HallInfo | Information on Hall intervals |

Gecode::Int::Distinct::MaxInc< View > | Sort-order by increasing maximum |

Gecode::Int::Distinct::MinInc< View > | Sort-order by increasing minimum |

Gecode::Int::Distinct::Node< View > | Base-class for nodes (both view and value nodes) |

Gecode::Int::Distinct::PruneVal< View > | Prunes the values read from a view node |

Gecode::Int::Distinct::Rank | Rank information |

Gecode::Int::Distinct::TerDom< View > | Ternary domain consistent distinct propagator |

Gecode::Int::Distinct::Val< View > | Naive value distinct propagator |

Gecode::Int::Distinct::ValNode< View > | Value nodes in view-value graph |

Gecode::Int::Distinct::ViewNode< View > | View nodes in view-value graph |

Gecode::Int::Dom::ReIntSet< View > | Reified domain dom-propagator |

Gecode::Int::Dom::ReRange< View > | Reified range dom-propagator |

Gecode::Int::Element::IdxValLink | Links for index-value map |

Gecode::Int::Element::IdxValMap | Class for index-value map |

Gecode::Int::Element::IdxView< View > | Class for pair of index and view |

Gecode::Int::Element::Int< ViewA, ViewB > | Element propagator for array of integers |

Gecode::Int::Element::IterIdx | Value iterator for indices in index-value map |

Gecode::Int::Element::IterIdxView< View > | Value iterator for indices in index-view map |

Gecode::Int::Element::IterVal | Value iterator for values in index-value map |

Gecode::Int::Element::RelTestBnd< VA, VC > | Class for bounds-equality test |

Gecode::Int::Element::RelTestBnd< VA, ConstIntView > | Class for bounds-equality test (specialized) |

Gecode::Int::Element::RelTestDom< VA, VC > | Class for domain-equality test |

Gecode::Int::Element::RelTestDom< VA, ConstIntView > | Class for domain-equality test (specialized) |

Gecode::Int::Element::View< VA, VB, VC, pc_ac > | Base-class for element propagator for array of views |

Gecode::Int::Element::ViewBnd< VA, VB, VC > | Bounds consistent element propagator for array of views |

Gecode::Int::Element::ViewDom< VA, VB, VC > | Domain consistent element propagator for array of views |

Gecode::Int::Element::ViewToVarArg< View > | Class to get VarArg type for view |

Gecode::Int::Element::ViewToVarArg< BoolView > | VarArg type for Boolean views |

Gecode::Int::Element::ViewToVarArg< IntView > | VarArg type for integer views |

Gecode::Int::Extensional::Base< View, subscribe > | Base for domain consistent extensional propagation |

Gecode::Int::Extensional::Basic< View > | Domain consistent extensional propagator |

Gecode::Int::Extensional::BitSet | Simple bitsets |

Gecode::Int::Extensional::Edge | Edge in the layered graph |

Gecode::Int::Extensional::GroupStates | GroupStates is used to index StateGroup by group |

Gecode::Int::Extensional::Incremental< View > | Domain consistent extensional propagator |

Gecode::Int::Extensional::Incremental< View >::SupportEntry | Entry for storing support |

Gecode::Int::Extensional::Incremental< View >::Work | Description of work to be done |

Gecode::Int::Extensional::Layer | Layer for a view in the layered graph |

Gecode::Int::Extensional::LayeredGraph< View > | Domain consistent layered graph (regular) propagator |

Gecode::Int::Extensional::LayeredGraph< View >::Index | Advisors for views (by position in array) |

Gecode::Int::Extensional::LayeredGraph< View >::IndexRange | Range approximation of which positions have changed |

Gecode::Int::Extensional::LayerValues | Iterator for telling variable domains by scanning support |

Gecode::Int::Extensional::State | States are described by number of incoming and outgoing edges |

Gecode::Int::Extensional::StateGroup | Stategroup is used to compute a partition of states |

Gecode::Int::Extensional::StateGroupByGroup | Sort groups stated by group and then state |

Gecode::Int::Extensional::Support | Support information for a value |

Gecode::Int::Extensional::TransByI_State | Sort transition array by input state |

Gecode::Int::Extensional::TransByO_State | Sort transition array by output state |

Gecode::Int::Extensional::TransBySymbol | Sort transition array by symbol (value) |

Gecode::Int::Extensional::TransBySymbolI_State | Sort transition array by symbol and then input states |

Gecode::Int::GCC::Bnd< View, Card, isView > | Bounds consistent global cardinality propagator |

Gecode::Int::GCC::BndImp< View, Card, isView, shared > | Implementation of the bounds consistent global cardinality propagator |

Gecode::Int::GCC::CardView | Card integer view |

Gecode::Int::GCC::Dom< View, Card, isView > | Domain consistent global cardinality propagator |

Gecode::Int::GCC::Edge | Class for edges in the variable-value-graph |

Gecode::Int::GCC::HallInfo | Container class provding information about the Hall structure of the problem variables |

Gecode::Int::GCC::MaxInc< View > | Compares two indices i, j of two views according to the ascending order of the views upper bounds |

Gecode::Int::GCC::MinInc< View > | Compares two indices i, j of two views according to the ascending order of the views lower bounds |

Gecode::Int::GCC::OccurBndsView | Tuple conataining the lower and upper cardinality bounds |

Gecode::Int::GCC::PartialSum< Card > | Partial sum structure for constant time computation of the maximal capacity of an interval |

Gecode::Int::GCC::Rank | Maps domain bounds to their position in hall[].bounds |

Gecode::Int::GCC::SharingTest< View1, View2 > | Sharing test for the bounds consistent global cardinality propagator |

Gecode::Int::GCC::SharingTest< IntView, OccurBndsView > | Specialization of class SharingTest for the case of fixed cardinalities using IntView as View1 and OccurBndsView as View2 |

Gecode::Int::GCC::UnReachable | Class for computing unreachable values in the value GCC propagator |

Gecode::Int::GCC::Val< View, Card, isView > | Value consistent global cardinality propagator |

Gecode::Int::GCC::ValNode | Value node |

Gecode::Int::GCC::VarNode | Variable Node |

Gecode::Int::GCC::VarValGraph< View, Card, isView > | Variable-value-graph used during propagation |

Gecode::Int::GCC::VVGNode | Base class for nodes in the variable-value-graph |

Gecode::Int::IntDelta | Integer delta information for advisors |

Gecode::Int::IntVarImp | Integer variable implementation |

Gecode::Int::IntVarImp::RangeList | Lists of ranges (intervals) |

Gecode::Int::IntVarImpBwd | Backward iterator for ranges of integer variable implementations |

Gecode::Int::IntVarImpConf | Dummy configuration for Int-variable implementations |

Gecode::Int::IntVarImpFwd | Range iterator for ranges of integer variable implementation |

Gecode::Int::IntView | Integer view for integer variables |

Gecode::Int::Linear::DomEq< Val, View > | Propagator for domain consistent n-ary linear equality |

Gecode::Int::Linear::EmptyScaleBoolArray | Empty array of scale Boolean views |

Gecode::Int::Linear::Eq< Val, P, N > | Propagator for bounds consistent n-ary linear equality |

Gecode::Int::Linear::EqBin< Val, A, B > | Propagator for bounds consistent binary linear equality |

Gecode::Int::Linear::EqBoolInt< VX > | Propagator for integer equal to Boolean sum (cardinality) |

Gecode::Int::Linear::EqBoolInt< VX >::Memory | Propagator using less memory but with linear runtime |

Gecode::Int::Linear::EqBoolInt< VX >::Speed | Propagator using more memory but with constant runtime |

Gecode::Int::Linear::EqBoolScale< SBAP, SBAN, VX > | Propagator for equality to Boolean sum with coefficients |

Gecode::Int::Linear::EqBoolView< XV, YV > | Propagator for equality to Boolean sum (cardinality) |

Gecode::Int::Linear::EqTer< Val, A, B, C > | Propagator for bounds consistent ternary linear equality |

Gecode::Int::Linear::GqBin< Val, A, B > | Propagator for bounds consistent binary linear greater or equal |

Gecode::Int::Linear::GqBoolInt< VX > | Propagator for integer less or equal to Boolean sum (cardinality) |

Gecode::Int::Linear::GqBoolInt< VX >::Memory | Propagator using less memory but with linear runtime |

Gecode::Int::Linear::GqBoolInt< VX >::Speed | Propagator using more memory but with constant runtime |

Gecode::Int::Linear::GqBoolView< XV, YV > | Propagator for greater or equal to Boolean sum (cardinality) |

Gecode::Int::Linear::Lin< Val, P, N, pc > | Base-class for n-ary linear propagators |

Gecode::Int::Linear::LinBin< Val, A, B, pc > | Base-class for binary linear propagators |

Gecode::Int::Linear::LinBoolScale< SBAP, SBAN, VX, pcx > | Base class for linear Boolean constraints with coefficients |

Gecode::Int::Linear::LinBoolView< XV, YV > | Base-class for Boolean linear propagators |

Gecode::Int::Linear::LinTer< Val, A, B, C, pc > | Base-class for ternary linear propagators |

Gecode::Int::Linear::Lq< Val, P, N > | Propagator for bounds consistent n-ary linear less or equal |

Gecode::Int::Linear::LqBin< Val, A, B > | Propagator for bounds consistent binary linear less or equal |

Gecode::Int::Linear::LqBoolScale< SBAP, SBAN, VX > | Propagator for inequality to Boolean sum with coefficients |

Gecode::Int::Linear::LqTer< Val, A, B, C > | Propagator for bounds consistent ternary linear less or equal |

Gecode::Int::Linear::MemoryLinBoolInt< VX > | Baseclass for integer Boolean sum using dependencies |

Gecode::Int::Linear::NegSupportIter< Val > | Support-based iterator for negative view |

Gecode::Int::Linear::NoView | No view serves as filler for empty view arrays |

Gecode::Int::Linear::Nq< Val, P, N > | Propagator for bounds consistent n-ary linear disequality |

Gecode::Int::Linear::NqBin< Val, A, B > | Propagator for bounds consistent binary linear disequality |

Gecode::Int::Linear::NqBoolInt< VX > | Propagator for integer disequal to Boolean sum (cardinality) |

Gecode::Int::Linear::NqBoolScale< SBAP, SBAN, VX > | Propagator for disequality to Boolean sum with coefficients |

Gecode::Int::Linear::NqBoolView< XV, YV > | Propagator for disequality to Boolean sum (cardinality) |

Gecode::Int::Linear::NqTer< Val, A, B, C > | Propagator for bounds consistent ternary linear disquality |

Gecode::Int::Linear::PosSupportIter< Val > | Support-based iterator for positive view |

Gecode::Int::Linear::ReEq< Val, P, N, Ctrl > | Propagator for reified bounds consistent n-ary linear equality |

Gecode::Int::Linear::ReEqBin< Val, A, B, Ctrl > | Propagator for reified bounds consistent binary linear equality |

Gecode::Int::Linear::ReEqBoolView< XV, YV, BV > | Propagator for reified equality to Boolean sum (cardinality) |

Gecode::Int::Linear::ReGqBoolView< XV, YV, BV > | Propagator for reified greater or equal to Boolean sum (cardinality) |

Gecode::Int::Linear::ReLin< Val, P, N, pc, Ctrl > | Base-class for reified n-ary linear propagators |

Gecode::Int::Linear::ReLinBin< Val, A, B, pc, Ctrl > | Base-class for reified binary linear propagators |

Gecode::Int::Linear::ReLinBoolView< XV, YV, BV > | Base-class for reified Boolean linear propagators |

Gecode::Int::Linear::ReLq< Val, P, N > | Propagator for reified bounds consistent n-ary linear less or equal |

Gecode::Int::Linear::ReLqBin< Val, A, B > | Propagator for reified bounds consistent binary linear less or equal |

Gecode::Int::Linear::ScaleBool | Coefficient and Boolean view |

Gecode::Int::Linear::ScaleBoolArray | Array of scale Boolean views |

Gecode::Int::Linear::SpeedLinBoolInt< VX > | Baseclass for integer Boolean sum using advisors |

Gecode::Int::Linear::SupportIter< Val > | Base-class for support-based iterator |

Gecode::Int::Linear::SupportSet | Set for support information |

Gecode::Int::Linear::Term< View > | Class for describing linear term |

Gecode::Int::Linear::TermLess< View > | Sort linear terms by view |

Gecode::Int::MinusView | Minus integer view |

Gecode::Int::NegBoolView | Negated Boolean view |

Gecode::Int::NotZeroOne | Exception: Not 0/1 integer |

Gecode::Int::OffsetView | Offset integer view |

Gecode::Int::OutOfLimits | Exception: Value out of limits |

Gecode::Int::Rel::EqBnd< View0, View1 > | Binary bounds consistent equality propagator |

Gecode::Int::Rel::EqDom< View0, View1 > | Binary domain consistent equality propagator |

Gecode::Int::Rel::Le< View > | Less propagator |

Gecode::Int::Rel::Lex< View > | Lexical ordering propagator |

Gecode::Int::Rel::Lq< View > | Less or equal propagator |

Gecode::Int::Rel::NaryEqBnd< View > | N-ary bounds consistent equality propagator |

Gecode::Int::Rel::NaryEqDom< View > | N-ary domain consistent equality propagator |

Gecode::Int::Rel::Nq< View > | Binary disequality propagator |

Gecode::Int::Rel::ReEqBnd< View, CtrlView > | Reified binary bounds consistent equality propagator |

Gecode::Int::Rel::ReEqBndInt< View, CtrlView > | Reified bounds consistent equality with integer propagator |

Gecode::Int::Rel::ReEqDom< View, CtrlView > | Reified binary domain consistent equality propagator |

Gecode::Int::Rel::ReEqDomInt< View, CtrlView > | Reified domain consistent equality with integer propagator |

Gecode::Int::Rel::ReLq< View, CtrlView > | Reified less or equal propagator |

Gecode::Int::Rel::ReLqInt< View, CtrlView > | Reified less or equal with integer propagator |

Gecode::Int::ScaleView< Val, UnsVal > | Scale integer view (template) |

Gecode::Int::Sorted::OfflineMin | Offline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y |

Gecode::Int::Sorted::OfflineMinItem | Item used to construct the OfflineMin sequence |

Gecode::Int::Sorted::Rank | Storage class for mininmum and maximum of a variable |

Gecode::Int::Sorted::SccComponent | Representation of a strongly connected component |

Gecode::Int::Sorted::Sorted< View, Perm > | Bounds consistent sortedness propagator |

Gecode::Int::Sorted::TupleMaxInc< View > | Index comparison for ViewArray<Tuple> |

Gecode::Int::Sorted::TupleMaxIncExt< View > | Extended Index comparison for ViewArray<Tuple> |

Gecode::Int::Sorted::TupleMinInc< View > | View comparison on ViewTuples |

Gecode::Int::Sorted::TupleMinIncExt< View > | |

Gecode::Int::Sorted::ViewPair< View > | Extended View comparison on ViewTuples |

Gecode::Int::SupportValues< View > | Support value iterator and recorder |

Gecode::Int::TooFewArguments | Exception: Too few arguments available in argument array |

Gecode::Int::UnknownBoolOp | Exception: Unknown Boolean operation passed as argument |

Gecode::Int::UnknownBranching | Exception: Unknown value or variable selection passed as argument |

Gecode::Int::UnknownRelation | Exception: Unknown relation passed as argument |

Gecode::Int::Unshare::VarPtrLess< Var > | Sort order for variables |

Gecode::Int::ValOfUnassignedVar | Exception: Attempt to access value of unassigned variable |

Gecode::Int::VariableEmptyDomain | Exception: Variable created with empty domain |

Gecode::Int::ViewRanges< View > | Range iterator for integer views |

Gecode::Int::ViewRanges< BoolView > | Range iterator for Boolean variable views |

Gecode::Int::ViewRanges< ConstIntView > | Range iterator for constant integer views |

Gecode::Int::ViewRanges< DoubleScaleView > | Range iterator for double-precision scale integer views |

Gecode::Int::ViewRanges< GCC::CardView > | Range iterator for indexed problem variables |

Gecode::Int::ViewRanges< IntScaleView > | Range iterator for integer-precision scale integer views |

Gecode::Int::ViewRanges< IntView > | Range iterator for integer variable views |

Gecode::Int::ViewRanges< MinusView > | Range iterator for minus integer views |

Gecode::Int::ViewRanges< NegBoolView > | Range iterator for negated Boolean variable views |

Gecode::Int::ViewRanges< OffsetView > | Range iterator for offset integer views |

Gecode::Int::ViewRanges< ZeroIntView > | Range iterator for constant integer views |

Gecode::Int::ViewValues< View > | Value iterator for integer views |

Gecode::Int::ZeroIntView | Zero integer view |

Gecode::IntSet | Integer sets |

Gecode::IntSet::MinInc | Sort ranges according to increasing minimum |

Gecode::IntSetPropagator< View, pcs, pci > | Set/Int connection propagator |

Gecode::IntSetRanges | Range iterator for integer sets |

Gecode::IntSetValues | Value iterator for integer sets |

Gecode::IntVar | Integer variables |

Gecode::IntVarArray | Integer variable array |

Gecode::IntVarRanges | Range iterator for integer variables |

Gecode::IntVarValues | Value iterator for integer variables |

Gecode::Iter::Ranges::AddRange< I > | Range iterator for adding a single range to a range iterator |

Gecode::Iter::Ranges::Append< I, J > | Range iterator for appending two range iterators |

Gecode::Iter::Ranges::Array | Range iterator for array of ranges |

Gecode::Iter::Ranges::Array::Range | Ranges for array |

Gecode::Iter::Ranges::Cache< I > | Range iterator cache |

Gecode::Iter::Ranges::Cache< I >::Range | Ranges stored in cache |

Gecode::Iter::Ranges::Compl< UMIN, UMAX, I > | Range iterator for computing the complement (described by template arguments) |

Gecode::Iter::Ranges::ComplVal< I > | Range iterator for computing the complement (described by values) |

Gecode::Iter::Ranges::Diff< I, J > | Range iterator for computing set difference |

Gecode::Iter::Ranges::Empty | Range iterator for empty range |

Gecode::Iter::Ranges::Inter< I, J > | Range iterator for computing intersection (binary) |

Gecode::Iter::Ranges::Map< I, M, strict > | Range iterator for mapping ranges |

Gecode::Iter::Ranges::Map< I, M, false > | Specialized mapping of ranges for non-strict maps |

Gecode::Iter::Ranges::Map< I, M, true > | Specialized mapping of ranges for strict maps |

Gecode::Iter::Ranges::MinMax | Base for range iterators with explicit min and max |

Gecode::Iter::Ranges::Minus< I > | Range iterator for pointwise minus of a range iterator |

Gecode::Iter::Ranges::NaryAppend< I > | Range iterator for appending arbitrarily many iterators |

Gecode::Iter::Ranges::NaryInter< I > | Range iterator for intersection for any number of iterators |

Gecode::Iter::Ranges::NaryUnion< I > | Range iterator for union for any number of iterators |

Gecode::Iter::Ranges::NaryUnion< I >::RangeUnionOrder | Order for iterators: by increasing minimum of next range |

Gecode::Iter::Ranges::Negative< I, strict > | Range iterator for negative part of a range iterator |

Gecode::Iter::Ranges::Offset< I > | Range iterator for pointwise offset (by some constant) |

Gecode::Iter::Ranges::Positive< I, strict > | Range iterator for positive part of a range iterator |

Gecode::Iter::Ranges::ScaleDown< I > | Range iterator for pointwise division by a positive integer |

Gecode::Iter::Ranges::ScaleUp< Val, UnsVal, I > | Range iterator for pointwise product with a positive integer |

Gecode::Iter::Ranges::Singleton | Range iterator for singleton range |

Gecode::Iter::Ranges::SingletonAppend< J > | Range iterator for appending a singleton with a range iterator |

Gecode::Iter::Ranges::Size< I > | Range iterator with size counting |

Gecode::Iter::Ranges::SubRange< I > | Range iterator for subtracting a single range from a range iterator |

Gecode::Iter::Ranges::ToValues< I > | Value iterator from range iterator |

Gecode::Iter::Ranges::Union< I, J > | Range iterator for computing union (binary) |

Gecode::Iter::Ranges::ValCache< I > | Range iterator cache |

Gecode::Iter::Ranges::Virt::Compl< UMIN, UMAX > | Range iterator for computing the complement (described by template arguments) |

Gecode::Iter::Ranges::Virt::ComplVal | Range iterator for computing the complement (described by values) |

Gecode::Iter::Ranges::Virt::Inter | Range iterator for computing intersection (binary) |

Gecode::Iter::Ranges::Virt::Iterator | Abstract base class for range iterators |

Gecode::Iter::Ranges::Virt::NaryInter | Range iterator for intersection for any number of iterators |

Gecode::Iter::Ranges::Virt::NaryUnion | Range iterator for union for any number of iterators |

Gecode::Iter::Ranges::Virt::NaryUnion::RangeUnionOrder | Order for iterators: by increasing minimum of next range |

Gecode::Iter::Ranges::Virt::RangesTemplate< I > | Adaptor class to virtualize any iterator |

Gecode::Iter::Ranges::Virt::Union | Range iterator for computing union (binary) |

Gecode::Iter::Values::Array | Value iterator for array of integers |

Gecode::Iter::Values::Inter< I, J > | Value iterator for the intersection of two value iterators |

Gecode::Iter::Values::Map< I, M, strict > | Value iterator for mapping values of a value iterator |

Gecode::Iter::Values::Minus< I > | Value iterator for pointwise minus of a value iterator |

Gecode::Iter::Values::Negative< I, strict > | Value iterator for selecting only negative values |

Gecode::Iter::Values::Offset< I > | Value iterator for pointwise offset (by some constant) |

Gecode::Iter::Values::Positive< I, strict > | Value iterator for selecting only positive values |

Gecode::Iter::Values::Singleton | Value iterator for single value |

Gecode::Iter::Values::ToRanges< I > | Range iterator from value iterator |

Gecode::Iter::Values::Union< I, J > | Value iterator for the union of two value iterators |

Gecode::Iter::Values::Unique< I > | Remove duplicate values from from value iterator |

Gecode::LDS< T > | Limited discrepancy search engine |

Gecode::Memory::AutoArray< T > | Helper class for large automatic memory chunks |

Gecode::MemoryExhausted | Exception: Memory exhausted |

Gecode::MemoryManager | Manage memory for space |

Gecode::MiniModel::ArgumentOutOfRange | Exception: Argument out of range |

Gecode::MiniModel::ArgumentSizeMismatch | Exception: Sizes of arguments does not match |

Gecode::MiniModel::BoolExpr | Boolean expressions |

Gecode::MiniModel::BoolExpr::Node | Node for Boolean expression |

Gecode::MiniModel::BoolRel | Boolean relations |

Gecode::MiniModel::FinalBag | For collecting final states while constructing a DFA |

Gecode::MiniModel::LinExpr< Var > | Linear expressions |

Gecode::MiniModel::LinRel< Var > | Linear relations |

Gecode::MiniModel::Matrix< A > | Matrix-interface for arrays |

Gecode::MiniModel::Matrix< A >::Slice | A slice of a matrix |

Gecode::MiniModel::NodeInfo | Node information computed during traversal of the expressions |

Gecode::MiniModel::PosInfo | Information on positions collected during traversal |

Gecode::MiniModel::PosSet | Sets of positions |

Gecode::MiniModel::StateNode | Node together with state information |

Gecode::MiniModel::StatePool | State pool combines a tree of states together with yet unprocessed states |

Gecode::MiniModel::SymbolsInc | Sort symbols |

Gecode::MiniModel::TooFewArguments | Exception: Too few arguments available in argument array |

Gecode::MiniModel::TransitionBag | For collecting transitions while constructing a DFA |

Gecode::MixBinaryPropagator< View0, pc0, View1, pc1 > | Mixed binary propagator |

Gecode::MixNaryOnePropagator< View0, pc0, View1, pc1 > | Mixed (n+1)-ary propagator |

Gecode::MixTernaryPropagator< View0, pc0, View1, pc1, View2, pc2 > | Mixed ternary propagator |

Gecode::NaryOnePropagator< View, pc > | (n+1)-ary propagator |

Gecode::NaryPropagator< View, pc > | N-ary propagator |

Gecode::NoIdxVarImpConf | Configuration class for variable implementations without index structure |

Gecode::PosValDesc< Val, alt > | Branching descriptions storing position and value |

Gecode::PrimArgArray< T > | Argument array for primtive types |

Gecode::Projector | Finite set projector specification |

Gecode::ProjectorCompiler | Compiler from projector specifications to C++ |

Gecode::ProjectorCompiler::Indent | Indentation helper class |

Gecode::ProjectorPropagatorSpec | Specification for a C++ finite set propagator |

Gecode::ProjectorSet | Group of finite set projector specifications |

Gecode::Propagator | Base-class for propagators |

Gecode::ReBinaryPropagator< View, pc, CtrlView > | Reified binary propagator |

Gecode::Reflection::ActorRegistrar< P > | Class used for registering actors |

Gecode::Reflection::ActorSpec | Actor specification |

Gecode::Reflection::ActorSpec::Arguments | Implementation of an ActorSpec, holding all information about an actor |

Gecode::Reflection::ActorSpecIter | Iterating actor specifications |

Gecode::Reflection::Arg | Arguments for actor and variable specifications |

Gecode::Reflection::ArrayArg | Array arguments |

Gecode::Reflection::BranchingSpec | Branching specification |

Gecode::Reflection::BranchingSpec::Arguments | Implementation of a BranchingSpec |

Gecode::Reflection::IntArrayArg | Integer array arguments |

Gecode::Reflection::IntArrayArgRanges | Iterate over an IntArrayArg, interpreting consecutive pairs of integers as ranges |

Gecode::Reflection::NoReflectionDefinedException | Exception: no reflection defined |

Gecode::Reflection::ReflectionException | Exception for errors during reflection |

Gecode::Reflection::Registry | Registry of constraint posting and variable creation functions |

Gecode::Reflection::Registry::RegistryObject | The actual registry, holding SymbolMap objects |

Gecode::Reflection::TypeOf< View > | String representation for View types, used for name mangling |

Gecode::Reflection::TypeOf< bool > | String representation for bool, used for name mangling |

Gecode::Reflection::TypeOf< const IntSet > | String representation for IntSets, used for name mangling |

Gecode::Reflection::TypeOf< double > | String representation for doubles, used for name mangling |

Gecode::Reflection::TypeOf< int > | String representation for ints, used for name mangling |

Gecode::Reflection::Unreflector | Unreflection from VarSpec and ActorSpec An Unreflector allows you to install variables and propagators in a Space using variable and actor specifications |

Gecode::Reflection::Var | Generic variables |

Gecode::Reflection::VarImpRegistrar< V > | Class used for registering variable implementations |

Gecode::Reflection::VarMap | Mapping Gecode variable implementations to variable specifications |

Gecode::Reflection::VarMap::VarMapObj | Implementation of a VarMap |

Gecode::Reflection::VarMapIter | Iterating a variable map |

Gecode::Reflection::VarSpec | Variable specification |

Gecode::Reflection::VarSpec::Domain | Implementation of a VarSpec, holding all information about a variable |

Gecode::REG | Regular expressions over integer values |

Gecode::REG::Exp | Implementation of the actual expression tree |

Gecode::Restart< T > | Depth-first restart best solution search engine |

Gecode::ReUnaryPropagator< View, pc, CtrlView > | Reified unary propagator |

Gecode::Search::BAB | Depth-first branch-and-bound search engine |

Gecode::Search::BabEngine | Implementation of depth-first branch-and-bound search engines |

Gecode::Search::DFS | Depth-first search engine |

Gecode::Search::DfsEngine | Depth-first search engine implementation |

Gecode::Search::EngineCtrl | Search engine control including memory information |

Gecode::Search::FailStop | Stop-object based on number of failures |

Gecode::Search::LDS | Limited discrepancy search engine |

Gecode::Search::MemoryStop | Stop-object based on memory consumption |

Gecode::Search::Options | Search engine options |

Gecode::Search::ProbeEngine | Probing engine for LDS |

Gecode::Search::ProbeEngine::ProbeNode | Node in the search tree for LDS |

Gecode::Search::ReCoNode | Search tree node for recomputation |

Gecode::Search::ReCoStack | Stack of nodes supporting recomputation |

Gecode::Search::Statistics | Search engine statistics |

Gecode::Search::Stop | Base-class for Stop-object |

Gecode::Search::TimeStop | Stop-object based on time |

Gecode::Serialization::GJSSpace | Wrapper class to export a Space to JavaScript |

Gecode::Set::ArgumentEmpty | Exception: No arguments available in argument array |

Gecode::Set::ArgumentSizeMismatch | Exception: Arguments are of different size |

Gecode::Set::ArrayRanges | Range iterator for a two-dimensional array |

Gecode::Set::BndSet | Sets of integers |

Gecode::Set::BndSetRanges | Range iterator for integer sets |

Gecode::Set::Branch::ByMaxCard | View selection class for view with greatest cardinality of lub-glb |

Gecode::Set::Branch::ByMaxUnknown | View selection class for view with greatest element in lub-glb |

Gecode::Set::Branch::ByMinCard | View selection class for view with smallest cardinality of lub-glb |

Gecode::Set::Branch::ByMinUnknown | View selection class for view with smallest element in lub-glb |

Gecode::Set::Branch::ByNone | View selection class for first view |

Gecode::Set::Branch::ValMax | Class for selecting maximum value |

Gecode::Set::Branch::ValMin | Class for selecting minimum value |

Gecode::Set::ComplementView< View > | Complement set view |

Gecode::Set::ConstantView | Constant view |

Gecode::Set::Convex::Convex | Propagator for the convex constraint |

Gecode::Set::Convex::ConvexHull | Propagator for the convex hull constraint |

Gecode::Set::Distinct::AtmostOne | Propagator for the AtMostOneIntersection constraint |

Gecode::Set::Element::ElementDisjoint | Propagator for element with disjointness |

Gecode::Set::Element::ElementIntersection< SView, RView > | Propagator for element with intersection |

Gecode::Set::Element::ElementUnion< SView, RView > | Propagator for element with union |

Gecode::Set::Element::ElementUnionConst< SView, RView > | Propagator for element with union of constant sets |

Gecode::Set::Element::IdxView< View > | Pairs of an index and a variable |

Gecode::Set::Element::IdxViewArray< View > | An array of IndexView pairs |

Gecode::Set::EmptyView | Constant view for the empty set |

Gecode::Set::GLBndSet | Growing sets of integers |

Gecode::Set::GlbRanges< T > | Range iterator for the greatest lower bound |

Gecode::Set::GlbRanges< ComplementView< ComplementView< View > > > | Range iterator for the greatest lower bound of double-complement-views |

Gecode::Set::GlbRanges< ComplementView< View > > | Range iterator for greatest lower bound of complement set views |

Gecode::Set::GlbRanges< ConstantView > | Range iterator for greatest lower bound of constant set view |

Gecode::Set::GlbRanges< CpltSet::CpltSetVarImp * > | Range iterator for greatest lower bound of CpltSet variable implementation |

Gecode::Set::GlbRanges< CpltSet::CpltSetView > | Range iterator for greatest lower bound of CpltSet view |

Gecode::Set::GlbRanges< EmptyView > | Range iterator for greatest lower bound of constantly empty set view |

Gecode::Set::GlbRanges< OffsetSetView< View > > | Range iterator for greatest lower bound of offset set views |

Gecode::Set::GlbRanges< SetVarImp * > | Range iterator for the greatest lower bound of a set variable implementation |

Gecode::Set::GlbRanges< SetView > | Range iterator for greatest lower bound of set variable views |

Gecode::Set::GlbRanges< SingletonView > | Range iterator for greatest lower bound of singleton set view |

Gecode::Set::GlbRanges< UniverseView > | Range iterator for greatest lower bound of constant universe set view |

Gecode::Set::Int::Card< View > | Propagator for cardinality |

Gecode::Set::Int::ChannelBool< View > | Propagator for channelling between set variable and its characteristic function |

Gecode::Set::Int::ChannelBool< View >::IndexAdvisor | Advisor storing a single index |

Gecode::Set::Int::ChannelInt< View > | Propagator for channelling between variable-value-dual models |

Gecode::Set::Int::IntLt | Sort order for integers |

Gecode::Set::Int::Match< View > | Propagator for the match constraint |

Gecode::Set::Int::MaxElement< View > | Propator for maximum element |

Gecode::Set::Int::MinElement< View > | Propator for minimum element |

Gecode::Set::Int::OverweightValues< I > | Value Iterator for values above a certain weight |

Gecode::Set::Int::Weights< View > | Propagator for weight of a set |

Gecode::Set::InvalidProjector | Exception: Invalid projector passed as argument |

Gecode::Set::InvalidRelation | Exception: Invalid relation passed as argument |

Gecode::Set::LUBndSet | Shrinking sets of integers |

Gecode::Set::LubRanges< T > | Range iterator for the least upper bound |

Gecode::Set::LubRanges< ComplementView< ComplementView< View > > > | Range iterator for the least upper bound of double-complement-views |

Gecode::Set::LubRanges< ComplementView< View > > | Range iterator for least upper bound of complement set views |

Gecode::Set::LubRanges< ConstantView > | Range iterator for least upper bound of constant set view |

Gecode::Set::LubRanges< CpltSet::CpltSetVarImp * > | Range iterator for least upper bound of CpltSet variable implementation |

Gecode::Set::LubRanges< CpltSet::CpltSetView > | Range iterator for least upper bound of CpltSet view |

Gecode::Set::LubRanges< EmptyView > | Range iterator for least upper bound of constantly empty set view |

Gecode::Set::LubRanges< OffsetSetView< View > > | Range iterator for least upper bound of offset set views |

Gecode::Set::LubRanges< SetVarImp * > | Range iterator for the least upper bound of a set variable implementation |

Gecode::Set::LubRanges< SetView > | Range iterator for least upper bound of set variable views |

Gecode::Set::LubRanges< SingletonView > | Range iterator for least upper bound of singleton set view |

Gecode::Set::LubRanges< UniverseView > | Range iterator for least upper bound of constant universe set view |

Gecode::Set::OffsetSetView< View > | Offset set view |

Gecode::Set::OutOfLimits | Exception: Value out of limits |

Gecode::Set::Projection::CardProjection | Nary cardinality projection propagator |

Gecode::Set::Projection::NaryProjection< negated > | Nary projection propagator |

Gecode::Set::Projection::ReNaryProjection | Reified Nary projection propagator |

Gecode::Set::RangeList | Lists of ranges (intervals) |

Gecode::Set::RangesCompl< I > | A complement iterator spezialized for the BndSet limits |

Gecode::Set::Rel::Distinct< View0, View1 > | Propagator for negated equality |

Gecode::Set::Rel::DistinctDoit< View0 > | Propagator for negated equality |

Gecode::Set::Rel::Eq< View0, View1 > | Propagator for set equality |

Gecode::Set::Rel::NoSubSet< View0, View1 > | Propagator for the negated subset constraint |

Gecode::Set::Rel::ReEq< View0, View1 > | Reified equality propagator |

Gecode::Set::Rel::ReSubset< View0, View1 > | Reified subset propagator |

Gecode::Set::Rel::SubSet< View0, View1 > | Propagator for the subset constraint |

Gecode::Set::RelOp::Intersection< View0, View1, View2 > | Propagator for ternary intersection |

Gecode::Set::RelOp::IntersectionN< View0, View1 > | Propagator for nary intersection |

Gecode::Set::RelOp::PartitionN< View0, View1 > | Propagator for nary partition |

Gecode::Set::RelOp::SubOfUnion< View0, View1, View2 > | Propagator for the subset of union |

Gecode::Set::RelOp::SuperOfInter< View0, View1, View2 > | Propagator for the superset of intersection |

Gecode::Set::RelOp::Union< View0, View1, View2 > | Propagator for ternary union |

Gecode::Set::RelOp::UnionN< View0, View1 > | Propagator for nary union |

Gecode::Set::Sequence::Seq | Propagator for the sequence constraint |

Gecode::Set::Sequence::SeqU | Propagator for the sequenced union constraint |

Gecode::Set::SetDelta | Finite set delta information for advisors |

Gecode::Set::SetVarImp | Finite integer set variable implementation |

Gecode::Set::SetVarImpConf | Dummy configuration for Set-variable implementations |

Gecode::Set::SetView | Set view for set variables |

Gecode::Set::SingletonView | Singleton set view |

Gecode::Set::UniverseView | Constant view for the universe |

Gecode::Set::UnknownBranching | Exception: Unknown value or variable selection passed as argument |

Gecode::Set::UnknownRanges< T > | Range iterator for the unknown set |

Gecode::Set::UnknownRanges< CpltSet::CpltSetVarImp * > | Range iterator for the unknown set of CpltSet variable implementation |

Gecode::Set::UnknownRanges< CpltSet::CpltSetView > | Range iterator for the unknown set of CpltSet view |

Gecode::Set::VariableEmptyDomain | Exception: Variable created with empty domain |

Gecode::SetExpr | Set-valued expressions for finite set projectors |

Gecode::SetExpr::Node | Nodes used to construct set expressions |

Gecode::SetExprCode | Code representing set-valued expressions for finite set projectors |

Gecode::SetExprCode::Stream | To incrementally build up the instructions |

Gecode::SetExprRanges | Range iterator for set expressions |

Gecode::SetExprRanges::Iter | Reference-counted range iterators with virtual member functions |

Gecode::SetVar | Set variables |

Gecode::SetVarArray | Set variable array |

Gecode::SetVarGlbRanges | Iterator for the greatest lower bound ranges of a set variable |

Gecode::SetVarGlbValues | Iterator for the values in the greatest lower bound of a set variable |

Gecode::SetVarLubRanges | Iterator for the least upper bound ranges of a set variable |

Gecode::SetVarLubValues | Iterator for the values in the least upper bound of a set variable |

Gecode::SetVarUnknownRanges | Iterator for the unknown ranges of a set variable |

Gecode::SetVarUnknownValues | Iterator for the values in the unknown set of a set variable |

Gecode::SharedArray< T > | Shared array with arbitrary number of elements |

Gecode::SharedArray< T >::SAO | Implementation of object for shared arrays |

Gecode::SharedArraySerialization< T > | Serialization helper for SharedArray objects |

Gecode::SharedArraySerialization< int > | Serialization helper for SharedArray<int> objects |

Gecode::SharedHandle | The shared handle |

Gecode::SharedHandle::Object | The shared object |

Gecode::Space | Computation spaces |

Gecode::SpaceFailed | Exception: Operation on failed space invoked |

Gecode::SpaceIllegalAlternative | Exception: Commit with illegal alternative |

Gecode::SpaceNoBranching | Exception: Commit when no branching present |

Gecode::SpaceNotStable | Exception: Operation on not stable space invoked |

Gecode::Support::BlockAllocator< T, blocksize > | Manage memory organized into block lists (allocator) |

Gecode::Support::BlockClient< T, blocksize > | Client for block allocator of type T |

Gecode::Support::DynamicArray< T > | Array with arbitrary number of elements |

Gecode::Support::DynamicStack< T > | Stack with arbitrary number of elements |

Gecode::Support::LinearCongruentialGenerator< m, a, q, r > | Template for linear congruential generators |

Gecode::Support::Map< Key, Value > | Hash map |

Gecode::Support::Pointer< P > | Pointer wrapper class to make pointers hashable |

Gecode::Support::PQueue< T, Less > | Simple fixed-size priority queue |

Gecode::Support::PtrMap< P, Value > | Hash table for pointers |

Gecode::Support::QuickSortStack< Type > | Static stack for quicksort |

Gecode::Support::SentinelStack< T > | A simple stack that uses a sentinel element |

Gecode::Support::StaticStack< T > | Stack with fixed number of elements |

Gecode::Support::Symbol | Immutable Symbols |

Gecode::Support::SymbolMap< Value > | Hash table for strings |

Gecode::TernaryPropagator< View, pc > | Ternary propagator |

Gecode::TupleSet | Data stored for a Table |

Gecode::UnaryPropagator< View, pc > | Unary propagator |

Gecode::VarArgArray< Var > | Argument array for variables |

Gecode::VarArgArray< Var >::VarLess | Sort order for variables |

Gecode::VarArray< Var > | Variable arrays |

Gecode::VarBase< VarImp > | Base-class for variables |

Gecode::VarDisposer< VarType > | Variable type disposer |

Gecode::VarDisposerBase | Base class for Variable type disposer |

Gecode::VarImp< VIC > | Base-class for variable implementations |

Gecode::VarImpBase | Base-class for variable implementations |

Gecode::VarImpVarTraits< VarImp > | Traits class for mapping variable implementations to variables |

Gecode::VarImpVarTraits< CpltSet::CpltSetVarImp > | Traits class for variable implementations and variables |

Gecode::VarImpVarTraits< Int::BoolVarImp > | Traits class for variable implementations and variables |

Gecode::VarImpVarTraits< Int::IntVarImp > | Traits class for variable implementations and variables |

Gecode::VarImpVarTraits< Set::SetVarImp > | Traits class for variable implementations and variables |

Gecode::VarViewBase< VarImp > | Base-class for variable views |

Gecode::VarViewTraits< Var > | Traits class for mapping variables to views |

Gecode::VarViewTraits< BoolVar > | Traits class mapping variables to views |

Gecode::VarViewTraits< IntVar > | Traits class mapping variables to views |

Gecode::VarViewTraits< SetVar > | Traits class mapping variables to views |

Gecode::ViewAdvisor< View > | Advisor storing a single view |

Gecode::ViewArray< View > | View arrays |

Gecode::ViewArray< Int::Linear::NoView > | View array for no view (empty) |

Gecode::ViewValAssignment< View, Val, ValSel > | Generic assignment |

Gecode::ViewValBranching< View, Val, ViewSel, ValSel > | Generic branching |

Gecode::ViewVarImpTraits< View > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< CpltSet::CpltSetView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::BoolView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::ConstIntView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::IntView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::MinusView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::NegBoolView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::OffsetView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::ScaleView< Val, UnsVal > > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Int::ZeroIntView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::ComplementView< View > > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::ConstantView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::EmptyView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::OffsetSetView< View > > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::SetView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::SingletonView > | Traits class for views and variable implementations |

Gecode::ViewVarImpTraits< Set::UniverseView > | Traits class for views and variable implementations |

Golf | Example: Golf tournament |

GolombRuler | Example: Finding optimal Golomb rulers |

Graph | Graph specification |

GraphColor | Example: Clique-based graph coloring |

GraphColorSpec | Graph specification |

Grocery | Example: Grocery puzzle |

Hamming | Example: Generating hamming codes |

IndSet | Example: Independent Sets in a Graph |

JavaScript | Example: Gecode/JavaScript interpreter |

Kakuro | Example: Kakuro |

Knights | Base-class for Knights tour example |

KnightsCircuit | Example: n-Knights tour (Model using Circuit) |

KnightsReified | Example: n-Knights tour (Simple Model) |

LangfordNumber | Example: Langford's number problem |

LangfordNumberOptions | Options taking two additional parameters |

MagicSequence | Example: Magic sequence |

MagicSquare | Example: Magic squares |

MineSweeper | Example: Minesweeper |

Money | Example: SEND+MORE=MONEY puzzle |

Nonogram | Example: Nonogram |

Options | Options for examples |

OrthoLatinSquare | Example: Orthogonal latin squares |

Partition | Example: partition numbers into two groups |

Pentominoes | Example: Pentominoes |

PerfectSquare | Example: packing squares into a rectangle |

Photo | Example: Placing people on a photo |

PhotoSpec | Specifications for the Photo example |

Play | Entry in round robin schedule |

QueenArmies | Example: Peaceable co-existing armies of queens |

QueenArmies::QueenBranch | Custom branching for Peacaeble queens |

Queens | Example: n-Queens puzzle |

RRS | Round robin schedule |

SizeOptions | Options for examples with additional size parameter |

SportsLeague | Example: Sports League Scheduling |

Steiner | Example: Steiner triples |

StressDistinct | Example: Stress distinct propagator |

StressDomain | Example: Domain stress test |

StressElement | Example: Stress test for element constraint (involving integers) |

StressExec | Example: Execution stress test |

StressExtensional | Example: Stress extensional propagator |

StressLinearBool | Example: Stress linear Boolean inequality |

StressMin | Example: Stress test for the minimum constraint |

StressSearch | Example: Search stress test |

StringOption | String-valued option |

StringOption::Value | Option value |

Sudoku | Base class for Sudoku puzzles |

SudokuCpltSet | Example: Solving Sudoku puzzles using CpltSet constraints |

SudokuInt | Example: Solving Sudoku puzzles using integer constraints |

SudokuMixed | Example: Solving Sudoku puzzles using both set and integer constraints |

SudokuSet | Example: Solving Sudoku puzzles using set constraints |

Test::Assign::Bool | Test branching with distinct propagator |

Test::Assign::BoolTest | Base class for tests for branching on Boolean variables |

Test::Assign::BoolTestSpace | Space for executing Boolean tests |

Test::Assign::Int | Test assignment with distinct propagator |

Test::Assign::IntTest | Base class for tests for assigning integer variables |

Test::Assign::IntTestSpace | Space for executing integer tests |

Test::Base | Base class for all tests to be run |

Test::Branch::Bool | Test branching with distinct propagator |

Test::Branch::BoolTest | Base class for tests for branching on Boolean variables |

Test::Branch::BoolTestSpace | Space for executing Boolean tests |

Test::Branch::CpltSet | Test branching |

Test::Branch::CpltSetTest | Base class for tests for branching on CpltSet variables |

Test::Branch::CpltSetTestSpace | Space for executing Boolean tests |

Test::Branch::Int | Test branching with distinct propagator |

Test::Branch::IntTest | Base class for tests for branching on integer variables |

Test::Branch::IntTestSpace | Space for executing integer tests |

Test::Branch::RunInfo | Information about one test-run |

Test::Branch::Set | Test branching |

Test::Branch::SetTest | Base class for tests for branching on set variables |

Test::Branch::SetTestSpace | Space for executing Boolean tests |

Test::CpltSet::AtMost::CpltSetAtmost | Test for atmost intersection constraint |

Test::CpltSet::AtMost::CpltSetAtmostIntSet | Test for atmost intersection with IntSet constraint |

Test::CpltSet::AtMost::CpltSetAtmostLexLe | Test for atmost intersection with lexicographic order constraint |

Test::CpltSet::Cardinality::CpltSetCardEq | Test for simple cardinality constraint |

Test::CpltSet::Cardinality::CpltSetCardMinInf | Test for simple cardinality range constraint |

Test::CpltSet::Cardinality::CpltSetCardMinMax | Test for simple cardinality range constraint |

Test::CpltSet::CpltSetTest | Base class for tests with CpltSet constraints |

Test::CpltSet::CpltSetTestSpace | Space for executing CpltSet tests |

Test::CpltSet::Dom::CpltSetDomEqDom | Test for domain equality with full domain constraint |

Test::CpltSet::Dom::CpltSetDomEqRange | Test for domain equality with range constraint |

Test::CpltSet::Dom::CpltSetDomSupDom | Test for domain superset with full domain constraint |

Test::CpltSet::Dom::CpltSetDomSupRange | Test for domain superset with range constraint |

Test::CpltSet::Partition::CpltSetPartition | Test for partition constraint |

Test::CpltSet::Partition::CpltSetPartitionLex | Test for partition with lexicographic order constraint |

Test::CpltSet::Partition::CpltSetPartitionNaryOne | Test for partition with result constraint |

Test::CpltSet::Partition::CpltSetPartitionNaryOneBigger | Test for bigger instance of partition constraint |

Test::CpltSet::Rel::CpltSetRelDisj | Test for disjoint constraint |

Test::CpltSet::Rel::CpltSetRelLe | Test for lexicographic less relation constraint |

Test::CpltSet::Rel::CpltSetRelLeDiff | Test for lexicographic less diff constraint |

Test::CpltSet::Rel::CpltSetRelLq | Test for lexicographic less-or-equal relation constraint |

Test::CpltSet::Selection::CpltSetSelectNonEmptySub | Test for selected non-empty subset constraint |

Test::CpltSet::Selection::CpltSetSelectUnion | Test for selected union constraint |

Test::ind | Simple class for describing identation |

Test::Int::Arithmetic::AbsXX | Test for absolute value constraint with shared variables |

Test::Int::Arithmetic::AbsXY | Test for absolute value constraint |

Test::Int::Arithmetic::Div | Test for division constraint |

Test::Int::Arithmetic::DivMod | Test for division/modulo constraint |

Test::Int::Arithmetic::MaxNary | Test for n-ary maximum constraint |

Test::Int::Arithmetic::MaxNaryShared | Test for n-ary maximum constraint with shared variables |

Test::Int::Arithmetic::MaxXXX | Test for binary maximum constraint with shared variables |

Test::Int::Arithmetic::MaxXXY | Test for binary maximum constraint with shared variables |

Test::Int::Arithmetic::MaxXYX | Test for binary maximum constraint with shared variables |

Test::Int::Arithmetic::MaxXYY | Test for binary maximum constraint with shared variables |

Test::Int::Arithmetic::MaxXYZ | Test for binary maximum constraint |

Test::Int::Arithmetic::MinNary | Test for n-ary minimmum constraint |

Test::Int::Arithmetic::MinNaryShared | Test for n-ary minimmum constraint with shared variables |

Test::Int::Arithmetic::MinXXX | Test for binary minimum constraint with shared variables |

Test::Int::Arithmetic::MinXXY | Test for binary minimum constraint with shared variables |

Test::Int::Arithmetic::MinXYX | Test for binary minimum constraint with shared variables |

Test::Int::Arithmetic::MinXYY | Test for binary minimum constraint with shared variables |

Test::Int::Arithmetic::MinXYZ | Test for binary minimum constraint |

Test::Int::Arithmetic::Mod | Test for modulo constraint |

Test::Int::Arithmetic::MultXXX | Test for multiplication constraint with shared variables |

Test::Int::Arithmetic::MultXXY | Test for multiplication constraint with shared variables |

Test::Int::Arithmetic::MultXYX | Test for multiplication constraint with shared variables |

Test::Int::Arithmetic::MultXYY | Test for multiplication constraint with shared variables |

Test::Int::Arithmetic::MultXYZ | Test for multiplication constraint |

Test::Int::Arithmetic::SqrtXX | Test for square root constraint with shared variables |

Test::Int::Arithmetic::SqrtXY | Test for square root constraint |

Test::Int::Arithmetic::SqrXX | Test for squaring constraint with shared variables |

Test::Int::Arithmetic::SqrXY | Test for squaring constraint |

Test::Int::Assignment | Base class for assignments |

Test::Int::Basic::Basic | Test whether testing infrastructure for integer variables works |

Test::Int::Bool::BinConstXX | Test for binary Boolean operation with shared variables and constant |

Test::Int::Bool::BinConstXY | Test for binary Boolean operation with constant |

Test::Int::Bool::BinXXX | Test for binary Boolean operation with shared variables |

Test::Int::Bool::BinXXY | Test for binary Boolean operation with shared variables |

Test::Int::Bool::BinXYX | Test for binary Boolean operation with shared variables |

Test::Int::Bool::BinXYY | Test for binary Boolean operation with shared variables |

Test::Int::Bool::BinXYZ | Test for binary Boolean operation |

Test::Int::Bool::Create | Help class to create and register tests |

Test::Int::Bool::Nary | Test for Nary Boolean operation |

Test::Int::Bool::NaryConst | Test for Nary Boolean operation with constant |

Test::Int::Bool::NaryShared | Test for Nary Boolean operation |

Test::Int::BoolOpTypes | Iterator for Boolean operation types |

Test::Int::Channel::ChannelFull | Simple test for channel (testing all variables) |

Test::Int::Channel::ChannelHalf | Simple test for channel (testing single set of variables) |

Test::Int::Channel::ChannelLinkMulti | Test channel between integer variable and array of Boolean variables |

Test::Int::Channel::ChannelLinkSingle | Test channel between integer and Boolean variable |

Test::Int::Channel::ChannelShared | Test channel with shared variables |

Test::Int::Circuit::Circuit | Simple test for circuit constraint |

Test::Int::Circuit::Create | Help class to create and register tests |

Test::Int::Count::Create | Help class to create and register tests |

Test::Int::Count::IntArrayInt | Test number of several equal integers equal to integer |

Test::Int::Count::IntArrayVar | Test number of several equal integers equal to integer variable |

Test::Int::Count::IntInt | Test number of equal integers equal to integer |

Test::Int::Count::IntIntDup | Test number of equal integers equal to integer with duplicate variables |

Test::Int::Count::IntVar | Test number of equal integers equal to integer variable |

Test::Int::Count::IntVarShared | Test number of equal integers equal to integer variable with sharing |

Test::Int::Count::VarInt | Test number of equal variables equal to integer |

Test::Int::Count::VarVar | Test number of equal variables equal to integer variable |

Test::Int::Count::VarVarSharedA | Test number of equal variables equal to integer variable with sharing |

Test::Int::Count::VarVarSharedB | Test number of equal variables equal to integer variable with sharing |

Test::Int::Count::VarVarSharedC | Test number of equal variables equal to integer variable with sharing |

Test::Int::CpltAssignment | Generate all assignments |

Test::Int::Distinct::Distinct< useCount > | Simple test for distinct constraint |

Test::Int::Distinct::Offset | Simple test for distinct constraint with offsets |

Test::Int::Distinct::Pathological | Testing pathological cases |

Test::Int::Distinct::Pathological::TestSpace | Test space |

Test::Int::Distinct::Random | Randomized test for distinct constraint |

Test::Int::Dom::DomDom | Test for domain constraint (full integer set) |

Test::Int::Dom::DomRange | Test for domain constraint (range) |

Test::Int::Element::Create | Help class to create and register tests |

Test::Int::Element::IntBoolInt | Test for element with integer array and integer and Boolean variable |

Test::Int::Element::IntBoolVar | Test for element with integer array and integer and Boolean variable |

Test::Int::Element::IntIntInt | Test for element with integer array and integer variables |

Test::Int::Element::IntIntShared | Test for element with integer array and single shared integer variable |

Test::Int::Element::IntIntVar | Test for element with integer array and integer variables |

Test::Int::Element::VarBoolInt | Test for element with Boolean variable array and integer variable |

Test::Int::Element::VarBoolVar | Test for element with Boolean variable array and integer variable |

Test::Int::Element::VarIntInt | Test for element with variable array and integer variables |

Test::Int::Element::VarIntShared | Test for element with variable array and shared integer variable |

Test::Int::Element::VarIntVar | Test for element with variable array and integer variables |

Test::Int::Extensional::RegDistinct | Test with regular expression for distinct constraint |

Test::Int::Extensional::RegEmptyDFA | Test for empty DFA |

Test::Int::Extensional::RegEmptyREG | Test for empty regular expression |

Test::Int::Extensional::RegSharedA | Test with simple regular expression and shared variables (uses unsharing) |

Test::Int::Extensional::RegSharedB | Test with simple regular expression and shared variables (uses unsharing) |

Test::Int::Extensional::RegSharedC | Test with simple regular expression and shared variables (uses unsharing) |

Test::Int::Extensional::RegSharedD | Test with simple regular expression and shared variables (uses unsharing) |

Test::Int::Extensional::RegSimpleA | Test with simple regular expression |

Test::Int::Extensional::RegSimpleB | Test with simple regular expression |

Test::Int::Extensional::RegSimpleC | Test with simple regular expression |

Test::Int::Extensional::TupleSetA | Test with tuple set |

Test::Int::Extensional::TupleSetB | Test with tuple set |

Test::Int::Extensional::TupleSetBool | Test with bool tuple set |

Test::Int::GCC::Create | Help class to create and register tests |

Test::Int::GCC::IntAllMax | Test for integer cardinality with max cardinality for all variables |

Test::Int::GCC::IntAllMinMax | Test for integer cardinality with min and max for all variables |

Test::Int::GCC::IntAllMinMaxDef | Test for integer cardinality with min and max for all variables |

Test::Int::GCC::IntSome< hole > | Test for integer cardinality for some variables |

Test::Int::GCC::VarAll | Test for variable cardinality for all cardinality values |

Test::Int::GCC::VarSome | Test for variable cardinality for some cardinality values |

Test::Int::IntConLevels | Iterator for integer consistency levels |

Test::Int::IntRelTypes | Iterator for integer relation types |

Test::Int::Linear::BoolInt | Test linear relation over Boolean variables equal to constant |

Test::Int::Linear::BoolVar | Test linear relation over Boolean variables equal to integer variable |

Test::Int::Linear::Create | Help class to create and register tests |

Test::Int::Linear::IntInt | Test linear relation over integer variables |

Test::Int::Linear::IntVar | Test linear relation over integer variables |

Test::Int::MiniModel::BoolLex | Test for relation between arrays of Boolean variables |

Test::Int::MiniModel::Create | Help class to create and register tests |

Test::Int::MiniModel::IntLex | Test for relation between arrays of integer variables |

Test::Int::MiniModelArithmetic::Abs | Test for absolute value constraint |

Test::Int::MiniModelArithmetic::Max | Test for binary maximum constraint |

Test::Int::MiniModelArithmetic::MaxNary | Test for n-ary maximum constraint |

Test::Int::MiniModelArithmetic::Min | Test for binary minimum constraint |

Test::Int::MiniModelArithmetic::MinNary | Test for n-ary minimmum constraint |

Test::Int::MiniModelArithmetic::Minus | Test for subtraction constraint |

Test::Int::MiniModelArithmetic::Mult | Test for multiplication constraint |

Test::Int::MiniModelArithmetic::Plus | Test for addition constraint |

Test::Int::MiniModelArithmetic::Sqr | Test for sqr constraint |

Test::Int::MiniModelArithmetic::Sqrt | Test for sqrt constraint |

Test::Int::MiniModelBoolean::BoolExprInt | Test Boolean expressions with integer result |

Test::Int::MiniModelBoolean::BoolExprVar | Test posting Boolean expressions |

Test::Int::MiniModelBoolean::BoolInstr | Type for representing a Boolean instruction |

Test::Int::MiniModelBoolean::Create | Help class to create and register tests |

Test::Int::MiniModelCount::Create | Help class to create and register tests |

Test::Int::MiniModelCount::IntArrayInt | Test number of several equal integers equal to integer |

Test::Int::MiniModelCount::IntArrayVar | Test number of several equal integers equal to integer variable |

Test::Int::MiniModelCount::IntInt | Test number of equal integers equal to integer |

Test::Int::MiniModelCount::IntVar | Test number of equal integers equal to integer variable |

Test::Int::MiniModelCount::VarInt | Test number of equal variables equal to integer |

Test::Int::MiniModelCount::VarVar | Test number of equal variables equal to integer variable |

Test::Int::MiniModelLin::Create | Help class to create and register tests |

Test::Int::MiniModelLin::LinExprBool | Test linear expressions over Boolean variables |

Test::Int::MiniModelLin::LinExprInt | Test linear expressions over integer variables |

Test::Int::MiniModelLin::LinInstr | Type for representing a linear instruction |

Test::Int::MiniModelLin::LinRelBool | Test linear relations over Boolean variables |

Test::Int::MiniModelLin::LinRelInt | Test linear relations over integer variables |

Test::Int::RandomAssignment | Generate random selection of assignments |

Test::Int::Rel::BoolArray | Test for relation between arrays of Boolean variables |

Test::Int::Rel::BoolInt | Test for simple relation involving Boolean variable and integer constant |

Test::Int::Rel::BoolPairwise | Test for pairwise relation between Boolean variables |

Test::Int::Rel::BoolVarXX | Test for simple relation involving shared Boolean variables |

Test::Int::Rel::BoolVarXY | Test for simple relation involving Boolean variables |

Test::Int::Rel::Create | Help class to create and register tests |

Test::Int::Rel::IntArray | Test for relation between arrays of integer variables |

Test::Int::Rel::IntInt | Test for simple relation involving integer variable and integer constant |

Test::Int::Rel::IntPairwise | Test for pairwise relation between integer variables |

Test::Int::Rel::IntVarXX | Test for simple relation involving shared integer variables |

Test::Int::Rel::IntVarXY | Test for simple relation involving integer variables |

Test::Int::Scheduling::Above | Describe that event is above a certain limit |

Test::Int::Scheduling::Ass | Script for generating assignments |

Test::Int::Scheduling::Below | Describe that event is below a certain limit |

Test::Int::Scheduling::CumulativeAssignment | Class for generating reasonable assignments |

Test::Int::Scheduling::Cumulatives | Test for cumulatives constraint |

Test::Int::Scheduling::Event | Event to be scheduled |

Test::Int::Sorted::NoVar | Test sorted without permutation variables |

Test::Int::Sorted::PermVar | Test sorted with permutation variables |

Test::Int::Sorted::SortIntMin | Relation for sorting integers in increasing order |

Test::Int::Test | Base class for tests with integer constraints |

Test::Int::TestSpace | Space for executing tests |

Test::Int::Unshare::Bool | Test for unsharing Boolean variables |

Test::Int::Unshare::Int | Test for unsharing integer variables |

Test::Options | Commandline options |

Test::PropKinds | Iterator for propagation kinds |

Test::Search::Best< Model, Engine > | Test for best solution search |

Test::Search::BranchTypes | Iterator for branching types |

Test::Search::ConstrainTypes | Iterator for constrain types |

Test::Search::Create | Help class to create and register tests |

Test::Search::DFS< Model > | Test for depth-first search |

Test::Search::FailImmediate | Space that immediately fails |

Test::Search::HasSolutions | Space that requires propagation and has solutions |

Test::Search::LDS< Model > | Test for limited discrepancy search |

Test::Search::NaryBranching | Class for nary branchings |

Test::Search::PosValuesDesc | Branching description storing position and values |

Test::Search::Test | Base class for search tests |

Test::Search::TestSpace | Space with information |

Test::Set::Convex::Convex | Test for convexity propagator |

Test::Set::Convex::ConvexHull | Test for convex hull propagator |

Test::Set::Convex::ConvexHullS | Sharing test for convex hull propagator |

Test::Set::CountableSet | Iterate all subsets of a given set |

Test::Set::CountableSetRanges | Range iterator producing subsets of an IntSet |

Test::Set::CountableSetValues | Value iterator producing subsets of an IntSet |

Test::Set::Distinct::AtmostOne | Test for the atmostone propagator |

Test::Set::Dom::CardRange | Test for cardinality range |

Test::Set::Dom::DomDom | Test for equality with a domain |

Test::Set::Dom::DomInt | Test for equality with an integer |

Test::Set::Dom::DomIntRange | Test for equality with an integer range |

Test::Set::Dom::DomRange | Test for equality with a range |

Test::Set::Element::ElementDisjoint | Test for ElementDisjoint constraint |

Test::Set::Element::ElementInter | Test for ElementInter constraint |

Test::Set::Element::ElementInterIn | Test for ElementInter constraint |

Test::Set::Element::ElementSet | Test for ElementElement constraint |

Test::Set::Element::ElementSetConst | Test for ElementUnion constraint |

Test::Set::Element::ElementUnion | Test for ElementUnion constraint |

Test::Set::Element::ElementUnionConst | Test for ElementUnion constraint |

Test::Set::Int::Card | Test for cardinality constraint |

Test::Set::Int::ChannelBool | Test for Boolean channel constraint |

Test::Set::Int::ChannelInt | Test for integer channel constraint |

Test::Set::Int::Elem | Test for element constraint |

Test::Set::Int::IntRel | Test for integer relation constraint |

Test::Set::Int::Match | Test for match constraint |

Test::Set::Int::Max | Test for maximal element constraint |

Test::Set::Int::Min | Test for minimal element constraint |

Test::Set::Int::NoElem | Test for negated element constraint |

Test::Set::Int::Rel | Test for relation constraint |

Test::Set::Int::Weights | Test for set weight constraint |

Test::Set::Projection::NegRelUnionEq | Test for negated ternary union constraint |

Test::Set::Projection::RelBinCompl | Test for binary complement constraint |

Test::Set::Projection::RelBinDisj | Test for binary disjointness constraint |

Test::Set::Projection::RelBinEq | Test for binary equality constraint |

Test::Set::Projection::RelBinNEq | Test for binary disequality constraint |

Test::Set::Projection::RelBinSub | Test for binary subset constraint |

Test::Set::Projection::RelInterEqCard | Test for ternary intersection constraint with cardinality propagation |

Test::Set::Projection::RelUnionEq | Test for ternary union constraint |

Test::Set::Projection::RelUnionEqFormula | Test for ternary union constraint, posted using a formula |

Test::Set::Rel::RelBin | Test for binary set relation constraint |

Test::Set::RelOp::Create | Help class to create and register tests |

Test::Set::RelOp::CreateIntN | Help class to create and register tests |

Test::Set::RelOp::CreateN | Help class to create and register tests |

Test::Set::RelOp::Rel | Test for ternary relation constraint |

Test::Set::RelOp::RelIntN | Test for n-ary partition constraint |

Test::Set::RelOp::RelN | Test for n-ary partition constraint |

Test::Set::RelOpConst::Create | Help class to create and register tests |

Test::Set::RelOpConst::RelISI | Test for set relation constraint with constants |

Test::Set::RelOpConst::RelSIS | Test for set relation constraint with constants |

Test::Set::RelOpConst::RelSSI | Test for set relation constraint with constants |

Test::Set::Sequence::SeqU | Test for sequential-union constraint |

Test::Set::Sequence::Sequence | Test for sequence constraint |

Test::Set::SetAssignment | Generate all set assignments |

Test::Set::SetOpTypes | Iterator for Boolean operation types |

Test::Set::SetRelTypes | Iterator for set relation types |

Test::Set::SetTest | Base class for tests with set constraints |

Test::Set::SetTestSpace | Space for executing set tests |

TileSpec | Specification of one tile |

Tournament | Tournament parameters |

TSP | Example: Travelling Salesman Problem |

UnsignedIntOption | Unsigned integer option |

Warehouses | Example: Locating warehouses |