| AllInterval | Example: All-Interval Series |
| Alpha | Example: Alpha puzzle |
| Baseline | Example: Baseline test |
| BIBD | Example: Balanced Incomplete Block Design (BIBD) |
| BIBD::Par | Class for BIBD parameters |
| BlackHole | Example: Black Hole Patience |
| BlackHoleBranch | |
| Cars | Example: Car sequencing |
| Crew | Example: Airline crew allocation |
| CrowdedChess | Example: Crowded Chessboard |
| Gecode::DFA::DFAI | Data stored for a DFA |
| Donald | Example: DONALD+GERALD=ROBERT puzzle |
| Eq20 | Example: Solving 20 linear equations |
| Example | Base-class for Gecode examples |
| ExtOptions | Extended Options taking two parameters instead of only one |
| Gecode::__Combine | A fake combination class |
| Gecode::Actor | Base-class for both propagators and branchings |
| Gecode::ActorDeleteLink | Double-linked list for deleting actors |
| Gecode::ActorLink | Double-linked list for actors |
| 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< 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::BinaryPropagator< View, pc > | Binary propagator |
| Gecode::BoolVar | Boolean integer variables |
| Gecode::BoolVarArgs | Passing Boolean variables |
| Gecode::BoolVarArray | Boolean variable array |
| Gecode::Branching | Base-class for branchings |
| Gecode::BranchingDesc | Branch description for batch recomputation |
| Gecode::ConstantViewBase | Base-class for constant views |
| Gecode::DerivedViewBase< View > | Base-class for derived views |
| Gecode::DFA | Deterministic finite automaton |
| Gecode::DFA::Transitions | Iterator for transitions (sorted by symbols/values) |
| Gecode::DFS< T > | Depth-first search engine |
| Gecode::Exception | Exception: Base-class for exceptions |
| Gecode::FreeList | Base-class for freelist-managed objects |
| Gecode::InhomBinaryPropagator< View0, pc0, View1, pc1 > | Inhomogeneous binary propagator |
| Gecode::InhomNaryOnePropagator< View0, pc0, View1, pc1 > | Inhomogeneous (n+1)-ary propagator |
| Gecode::InhomTernaryPropagator< View0, pc0, View1, pc1, View2, pc2 > | Inhomogeneous ternary propagator |
| Gecode::Int::ArgumentEmpty | Exception: No arguments available in argument array |
| 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::Max< View > | Bounds-consistent ternary maximum propagator |
| Gecode::Int::Arithmetic::Mult< View > | Bounds-consistent multiplication propagator |
| Gecode::Int::Arithmetic::MultPlus< VA, VB, VC > | Bounds-consistent positive multiplication propagator |
| Gecode::Int::Arithmetic::NaryMax< View > | Bounds-consistent n-ary maximum propagator |
| Gecode::Int::Arithmetic::Square< View > | Bounds-consistent square propagator |
| Gecode::Int::Arithmetic::SquarePlus< VA, VB > | Bounds-consistent positive square propagator |
| 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::NaryOr< View > | Boolean n-ary disjunction propagator |
| Gecode::Int::Bool::NaryOrTrue< View > | Boolean n-ary disjunction propagator (true) |
| Gecode::Int::Bool::Or< BVA, BVB, BVC > | Boolean disjunction propagator |
| Gecode::Int::Bool::OrTrue< BVA, BVB > | Boolean disjunction propagator (true) |
| Gecode::Int::BoolView | Boolean view for integer variables |
| Gecode::Int::Branch::Assign | Assignment (single-alternative branching) base-class |
| Gecode::Int::Branch::AssignDesc | Branching descriptions storing position and value |
| Gecode::Int::Branch::AssignMax | Maximum assignment (single-alternative branching) |
| Gecode::Int::Branch::AssignMed | Median assignment (single-alternative branching) |
| Gecode::Int::Branch::AssignMin | Minimum assignment (single-alternative branching) |
| Gecode::Int::Branch::ByDegreeMax | View selection class for view with largest degree (and smallest size in case of ties) |
| Gecode::Int::Branch::ByDegreeMin | View selection class for view with smallest degree (and smallest size in case of ties) |
| Gecode::Int::Branch::ByMaxMax | View selection class for view with largest max |
| Gecode::Int::Branch::ByMaxMin | View selection class for view with smallest max |
| Gecode::Int::Branch::ByMinMax | View selection class for view with largest min |
| Gecode::Int::Branch::ByMinMin | View selection class for view with smallest min |
| Gecode::Int::Branch::ByNone | View selection class for first variable |
| Gecode::Int::Branch::ByRegretMaxMax | View selection class for view with largest max-regret |
| Gecode::Int::Branch::ByRegretMaxMin | View selection class for view with smallest max-regret |
| Gecode::Int::Branch::ByRegretMinMax | View selection class for view with largest min-regret |
| Gecode::Int::Branch::ByRegretMinMin | View selection class for view with smallest min-regret |
| Gecode::Int::Branch::BySizeMax | View selection class for view with largest size |
| Gecode::Int::Branch::BySizeMin | View selection class for view with smallest size |
| Gecode::Int::Branch::ValMax | Class for selecting median value |
| Gecode::Int::Branch::ValMed | Class for selecting maximum value |
| Gecode::Int::Branch::ValMin | Class for selecting minimum value |
| Gecode::Int::Branch::ValSplitMax | Class for splitting domain (upper half first) |
| Gecode::Int::Branch::ValSplitMin | Class for splitting domain (lower half first) |
| Gecode::Int::Channel::Base< Info, pc > | Base-class for channel propagators |
| Gecode::Int::Channel::Dom< View > | Domain-consistent channel propagator |
| Gecode::Int::Channel::DomInfo< View > | Combine view with information for domain propagation |
| Gecode::Int::Channel::ProcessStack | A simple integer stack for tracking which views are assigned |
| Gecode::Int::Channel::Val< View > | Naive channel propagator |
| Gecode::Int::Channel::ValInfo< View > | Combine view with information for value propagation |
| 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 > | View-value graph for propagating domain-consistent distinct |
| 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::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< View > | Class for bounds-equality test |
| Gecode::Int::Element::RelTestDom< View > | Class for domain-equality test |
| Gecode::Int::Element::View< ViewA, ViewB, pcb > | Base-class for element propagator for array of views |
| Gecode::Int::Element::ViewBnd< ViewA, ViewB > | Bounds-consistent element propagator for array of views |
| Gecode::Int::Element::ViewDom< ViewA, ViewB > | Domain-consistent element propagator for array of views |
| 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::IntMeDiff | Modification event difference for Int-variable implementations |
| Gecode::Int::IntVarImp | Integer variable implementation |
| Gecode::Int::IntVarImp::RangeList | Lists of ranges (intervals) |
| Gecode::Int::IntVarImpBase | Base-class for Int-variable implementations |
| Gecode::Int::IntVarImpBase::Processor | Variable procesor for variables of this type |
| Gecode::Int::IntVarImpBwd | Backward iterator for ranges of integer 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::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::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::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::LinBoolInt< VX > | Baseclass for integer Boolean sum |
| 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::LqTer< Val, A, B, C > | Propagator for bounds-consistent ternary linear less or equal |
| 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::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::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::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::SupportIter< Val > | Base-class for support-based iterator |
| Gecode::Int::Linear::SupportSet | Set for support information |
| Gecode::Int::Linear::Term | Class for describing linear term  |
| Gecode::Int::Linear::TermLess | Sort linear terms by view |
| Gecode::Int::MinusView | Minus integer view |
| Gecode::Int::NegBoolView | Negated Boolean view |
| Gecode::Int::NumericalOverflow | Exception: Numerical overflow |
| Gecode::Int::OffsetView | Offset integer view |
| Gecode::Int::Regular::Dom< View > | Domain-consistent regular propagator |
| Gecode::Int::Regular::Dom< View >::LayeredGraph< View > | LayeredGraph as data structure used for propagation in regular |
| Gecode::Int::Regular::Edge | Edge in the layered graph |
| Gecode::Int::Regular::EdgeRanges | Iterator for telling variable domains by scanning transitions |
| Gecode::Int::Regular::FinalBag | For collecting final states while constructing a DFA |
| Gecode::Int::Regular::GroupStates | GroupStates is used to index StateGroup by group |
| Gecode::Int::Regular::Layer | A layer in the layered graph |
| Gecode::Int::Regular::NodeInfo | Node information computed during traversal of the expressions |
| Gecode::Int::Regular::PosInfo | Information on positions collected during traversal |
| Gecode::Int::Regular::PosSet | Sets of positions |
| Gecode::Int::Regular::State | States are described by number of incoming and outgoing edges |
| Gecode::Int::Regular::StateGroup | Stategroup is used to compute a partition of states |
| Gecode::Int::Regular::StateGroupByGroup | Sort groups stated by group and then state |
| Gecode::Int::Regular::StateNode | Node together with state information |
| Gecode::Int::Regular::StatePool | State pool combines a tree of states together with yet unprocessed states |
| Gecode::Int::Regular::SymbolsInc | Sort symbols |
| Gecode::Int::Regular::TransByI_State | Sort transition array by input state |
| Gecode::Int::Regular::TransByO_State | Sort transition array by output state |
| Gecode::Int::Regular::TransBySymbol | Sort transition array by symbol (value) |
| Gecode::Int::Regular::TransBySymbolI_State | Sort transition array by symbol and then input states |
| Gecode::Int::Regular::TransitionBag | For collecting transitions while constructing a DFA |
| 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::NaryNq< View > | Propagator for n-ary disequlaity |
| 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::Sortedness::OfflineMin | Offline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y |
| Gecode::Int::Sortedness::OfflineMinItem | Item used to construct the OfflineMin sequence |
| Gecode::Int::Sortedness::Rank | Storage class for mininmum and maximum of a variable |
| Gecode::Int::Sortedness::SccComponent | Representation of a strongly connected component |
| Gecode::Int::Sortedness::Sortedness< View, Tuple, Perm > | Bounds consistent sortedness propagator |
| Gecode::Int::Sortedness::TupleMaxInc< Tuple > | Index comparison for ViewArray<Tuple> |
| Gecode::Int::Sortedness::TupleMaxIncExt< Tuple > | Extended Index comparison for ViewArray<Tuple> |
| Gecode::Int::Sortedness::TupleMaxIncPerm< View > | View comparison on ViewTuples |
| Gecode::Int::Sortedness::TupleMinInc< View > | View comparison on ViewTuples |
| Gecode::Int::Sortedness::TupleMinIncExt< View > | Extended View comparison on ViewTuples |
| Gecode::Int::Sortedness::TupleMinIncPerm< View > | View comparison on ViewTuples |
| Gecode::Int::UnknownBranching | Exception: Unknown value or variable selection passed as argument |
| Gecode::Int::UnknownRelation | Exception: Unknown relation passed as argument |
| Gecode::Int::VariableEmptyDomain | Exception: Variable created with empty domain |
| Gecode::Int::VariableOutOfRangeDomain | Exception: Variable created with values too large for domain |
| Gecode::Int::ViewRanges< View > | Range iterator for integer 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< OffsetView > | Range iterator for offset integer views |
| Gecode::Int::ViewValues< View > | Value iterator for integer views |
| 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::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::Offset< I > | Range iterator for pointwise offset (by some constant) |
| 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::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::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::ToRanges< I > | Range iterator 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::LinExpr | Linear expressions |
| Gecode::MiniModel::LinRel | Linear relations |
| Gecode::MiniModel::Matrix< A > | Matrix-interface for arrays |
| Gecode::MiniModel::Matrix< A >::Slice | A slice of a matrix |
| Gecode::NaryOnePropagator< View, pc > | (n+1)-ary propagator |
| Gecode::NaryPropagator< View, pc > | N-ary propagator |
| Gecode::PosValDesc< Val > | 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::REG | Regular expressions |
| 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::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::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::ComplementView< ComplementView< View > > | Complement set view specialized for complement set views |
| 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::Distinct::Binomial | Computing binomial coefficients using dynamic programming |
| Gecode::Set::Distinct::Distinct | Propagator for the n-ary distinct constraint with fixed cardinalities |
| 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< EmptyView > | Range iterator for greatesr lower bound of constantly empty set view |
| 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 | Propagator for cardinality |
| Gecode::Set::Int::Channel | Propagator for channelling between variable-value-dual models |
| Gecode::Set::Int::IntLt | Sort order for integers |
| Gecode::Set::Int::Match | Propagator for the match constraint |
| Gecode::Set::Int::MaxElement | Propator for maximum element |
| Gecode::Set::Int::MinElement | Propator for minimum element |
| Gecode::Set::Int::OverweightValues< I > | Value Iterator for values above a certain weight |
| Gecode::Set::Int::Weights | 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< EmptyView > | Range iterator for least upper bound of constantly empty set view |
| 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::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, View1 > | 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::Select::IdxView< View > | Pairs of an index and a variable |
| Gecode::Set::Select::IdxViewArray< View > | An array of IndexView pairs |
| Gecode::Set::Select::SelectDisjoint | Propagator for selected disjointness |
| Gecode::Set::Select::SelectIntersection< SView, RView > | Propagator for selected intersection |
| Gecode::Set::Sequence::Seq | Propagator for the sequence constraint |
| Gecode::Set::Sequence::SeqU | Propagator for the sequenced union constraint |
| Gecode::Set::SetMeDiff | Modification event difference for Set-variable implementations |
| Gecode::Set::SetVarImp | Finite integer set variable implementation |
| Gecode::Set::SetVarImpBase | Base-class for Set-variable implementations |
| Gecode::Set::SetVarImpBase::Processor | Variable procesor for variables of this type |
| 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::VariableFailedDomain | Exception: Variable created with failed domain |
| Gecode::Set::VariableOutOfRangeCardinality | Exception: Variable created with wrong cardinality |
| Gecode::Set::VariableOutOfRangeDomain | Exception: Variable created with values too large for 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::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::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::Support::BlockAllocator< T > | Manage memory organized into block lists (allocator) |
| Gecode::Support::BlockClient< T > | 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::PQueue< T, Less > | Simple fixed-size priority queue |
| Gecode::Support::QuickSortStack< Type > | Static stack for quicksort |
| Gecode::Support::SharedArray< T, fd > | Shared array with arbitrary number of elements |
| Gecode::Support::StaticStack< T > | Stack with fixed number of elements |
| Gecode::TernaryPropagator< View, pc > | Ternary propagator |
| 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 | Base-class for variable implementations |
| Gecode::Variable< VTI, PC, MED > | Base-class for variable implementations |
| Gecode::VariableViewBase< Var > | Base-class for variable views |
| Gecode::VarTypeProcessor< VTI, PC, MED > | Variable type processor |
| Gecode::VarTypeProcessorBase | Base-class for variable type processor |
| Gecode::ViewArray< View > | View arrays |
| Gecode::ViewArray< Int::Linear::NoView > | View array for no view (empty) |
| Gecode::ViewTuple< View, n > | Tuple of views |
| Gecode::ViewValBranching< View, Val, ViewSel, ValSel > | Generic branching |
| Gecode::ViewVarTraits< View > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::BoolView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::ConstIntView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::IntView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::MinusView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::NegBoolView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::OffsetView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Int::ScaleView< Val, UnsVal > > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::ComplementView< Set::ComplementView< View > > > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::ComplementView< View > > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::ConstantView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::EmptyView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::SetView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::SingletonView > | Traits class for views and variable implementations |
| Gecode::ViewVarTraits< Set::UniverseView > | Traits class for views and variable implementations |
| Golf | Example: Golf tournament |
| Golomb | 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 |
| Knights | Example: n-Knights tour |
| LangfordNum | Example: Langford's number problem |
| MagicSequence | Example: Magic sequence |
| MagicSquare | Example: Magic squares |
| Money | Example: SEND+MORE=MONEY puzzle |
| Options | Class for options for examples |
| OrthoLatinSquare | Example: Orthogonal latin squares |
| Packing | Example: packing squares into a rectangle |
| PackingSpec | Packing problem specification |
| Partition | Example: partition numbers into two groups |
| Photo | Example: Placing people on a photo |
| PhotoSpec | Specifications for the Photo example |
| PicturePuzzle | Example: Picture puzzles |
| Play | Triple forming an entry in the round robin schedule |
| QueenArmies | Example: Peacable co-existing armies of queens |
| QueenArmies::QueenBranch | Custom branching for Peacable queens |
| Queens | Example: n-Queens puzzle |
| Gecode::MemoryManager::ReuseChunk | Memory-chunks for reusing slack memory |
| SportsLeague | Example: Sports League Scheduling |
| Steiner | Example: Steiner triples |
| StressDomain | Example: Domain stress test |
| StressElement | Example: Stress test for element constraint (involving integers) |
| StressExec | Example: Execution stress test |
| StressMin | Example: Stress test for the minimum constraint |
| StressSearch | Example: Search stress test |
| Sudoku | Example: Some Sudoku puzzles |
| SudokuMixed | Example: Some Sudoku puzzles using finite domain and set constraints |
| SudokuSet | Example: Some Sudoku puzzles using set constraints |
| Timer | Timer interface used for examples |
| Tournament | Tournament parameters |
| Gecode::DFA::Transition | Specification of a DFA transition |
| Warehouses | Example: Locating warehouses |
