Generated on Wed Jan 4 17:49:16 2006 for Gecode by doxygen 1.4.6

Gecode Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AllIntervalExample: All-Interval Series
AlphaExample: Alpha puzzle
BIBDExample: Balanced Incomplete Block Design (BIBD)
BIBD::ParClass for BIBD parameters
CarsExample: Car sequencing
CrewExample: Airline crew allocation
CrowdedChessExample: Crowded Chessboard
Gecode::DFA::DFAIData stored for a DFA
DonaldExample: DONALD+GERALD=ROBERT puzzle
Eq20Example: Solving 20 linear equations
ExampleBase-class for Gecode examples
ExtOptionsExtended Options taking two parameters instead of only one
Gecode::ActorBase-class for both propagators and branchings
Gecode::ActorDeleteLinkDouble-linked list for deleting actors
Gecode::ActorLinkDouble-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::BoolVarBoolean integer variables
Gecode::BoolVarArgsPassing Boolean variables
Gecode::BoolVarArrayBoolean variable array
Gecode::BranchingBase-class for branchings
Gecode::BranchingDescBranch description for batch recomputation
Gecode::DFADeterministic finite automaton
Gecode::DFA::TransitionsIterator for transitions (sorted by symbols/values)
Gecode::DFS< T >Depth-first search engine
Gecode::ExceptionException: Base-class for exceptions
Gecode::FreeListBase-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::ArgumentEmptyException: No arguments available in argument array
Gecode::Int::ArgumentSizeMismatchException: Arguments are of different size
Gecode::Int::Arithmetic::Abs< View >Bounds-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::And< BVA, BVB, BVC >Boolean conjunction 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::NaryAnd< View >Boolean n-ary conjunction propagator
Gecode::Int::BoolViewBoolean view for integer variables
Gecode::Int::Branch::AssignAssignment (single-alternative branching) base-class
Gecode::Int::Branch::AssignMaxMaximum assignment (single-alternative branching)
Gecode::Int::Branch::AssignMedMedian assignment (single-alternative branching)
Gecode::Int::Branch::AssignMinMinimum assignment (single-alternative branching)
Gecode::Int::Branch::ByDegreeMaxView selection class for view with largest degree (and smallest size in case of ties)
Gecode::Int::Branch::ByDegreeMinView selection class for view with smallest degree (and smallest size in case of ties)
Gecode::Int::Branch::ByMaxMaxView selection class for view with largest max
Gecode::Int::Branch::ByMaxMinView selection class for view with smallest max
Gecode::Int::Branch::ByMinMaxView selection class for view with largest min
Gecode::Int::Branch::ByMinMinView selection class for view with smallest min
Gecode::Int::Branch::ByNoneView selection class for first variable
Gecode::Int::Branch::ByRegretMaxMaxView selection class for view with largest max-regret
Gecode::Int::Branch::ByRegretMaxMinView selection class for view with smallest max-regret
Gecode::Int::Branch::ByRegretMinMaxView selection class for view with largest min-regret
Gecode::Int::Branch::ByRegretMinMinView selection class for view with smallest min-regret
Gecode::Int::Branch::BySizeMaxView selection class for view with largest size
Gecode::Int::Branch::BySizeMinView selection class for view with smallest size
Gecode::Int::Branch::ValMaxClass for selecting median value
Gecode::Int::Branch::ValMedClass for selecting maximum value
Gecode::Int::Branch::ValMinClass for selecting minimum value
Gecode::Int::Branch::ValSplitMaxClass for splitting domain (upper half first)
Gecode::Int::Branch::ValSplitMinClass for splitting domain (lower half first)
Gecode::Int::ConstIntViewConstant integer view
Gecode::Int::Count::Base< VX, VY, VZ, Rel, shr >Base-class for count propagators
Gecode::Int::Count::Eq< VX, VY, VZ, Rel, shr >Propagator for counting views (equal to number of equal views)
Gecode::Int::Count::Gq< VX, VY, VZ, Rel, shr >Propagator for counting views (greater or equal to number of equal views)
Gecode::Int::Count::Lq< VX, VY, VZ, Rel, shr >Propagator for counting views (less or equal to number of equal views)
Gecode::Int::Count::Nq< VX, VY, VZ, Rel, shr >Propagator for counting views (different from number of equal views)
Gecode::Int::Count::RelEqBnd< VX >Relation for bounds-consistent counting
Gecode::Int::Count::RelEqDom< VX >Relation for domain-consistent counting
Gecode::Int::Cumulatives::EventAn 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::BiLinkBidirectional links for both edges and anchors in nodes of view-value graph
Gecode::Int::Distinct::Bnd< View >Bounds-consistent distinct propagator
Gecode::Int::Distinct::BndImp< View, shared >Implementation of 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::Dom< View >::ViewValGraph< View >View-value graph for propagating domain-consistent distinct
Gecode::Int::Distinct::Edge< View >Edges in view-value graph
Gecode::Int::Distinct::HallInfoInformation 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::RankRank information
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::IdxValLinkLinks for index-value map
Gecode::Int::Element::IdxValMapClass 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::IterIdxValue iterator for indices in index-value map
Gecode::Int::Element::IterIdxView< View >Value iterator for indices in index-view map
Gecode::Int::Element::IterValValue 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 bounds-consistent global cardinality propagator
Gecode::Int::GCC::CardArray< T >Array containing CardView and supporting lookup operation
Gecode::Int::GCC::CardViewCard integer view
Gecode::Int::GCC::Dom< View, Card, isView >Domain-consistent global cardinality propagator
Gecode::Int::GCC::EdgeClass for edges $ e(x,v) $ in the variable-value-graph
Gecode::Int::GCC::HallInfoContainer class provding information about the Hall structure of the problem variables
Gecode::Int::GCC::IdxViewCard integer view
Gecode::Int::GCC::MaxInc< View >Compares two indeces i, j of two views $ x_i $ $ x_j$ according to the ascending order of the views upper bounds
Gecode::Int::GCC::MinInc< View >Compares two indeces i, j of two views $ x_i $ $ x_j$ according to the ascending order of the views lower bounds
Gecode::Int::GCC::OccurArray< T >Array of OccurBnds mimicking cardinality variables
Gecode::Int::GCC::OccurBnds< T, n >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::RankMaps domain bounds to their position in hall[].bounds
Gecode::Int::GCC::Val< View, Card, isView >Value consistent global cardinality propagator
Gecode::Int::GCC::ValNodeValue node
Gecode::Int::GCC::VarNodeVariable Node
Gecode::Int::GCC::VarValGraph< View, Card, isView >Variable-value-graph used during propagation
Gecode::Int::GCC::VVGNodeBase class for nodes in the variable-value-graph
Gecode::Int::IntVarImpInteger variable implementation
Gecode::Int::IntVarImp::RangeListLists of ranges (intervals)
Gecode::Int::IntVarImpBwdBackward iterator for ranges of integer variable implementations
Gecode::Int::IntVarImpFwdRange iterator for ranges of integer variable implementation
Gecode::Int::IntViewInteger view for integer variables
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::EqBool< View >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::GqBool< View >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::LinBool< View >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::LqBool< View >Propagator for less or equal to Boolean sum (cardinality)
Gecode::Int::Linear::LqTer< Val, A, B, C >Propagator for bounds-consistent ternary linear less or equal
Gecode::Int::Linear::NoViewNo 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::NqBool< View >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::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::TermClass for describing linear term $a\cdot x$
Gecode::Int::Linear::TermLessSort linear terms by view
Gecode::Int::MinusViewMinus integer view
Gecode::Int::NegBoolViewNegated Boolean view
Gecode::Int::NumericalOverflowException: Numerical overflow
Gecode::Int::OffsetViewOffset integer view
Gecode::Int::OnlyInequalityRelationsException: Only inequality relations are supported
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::EdgeEdge in the layered graph
Gecode::Int::Regular::EdgeRangesIterator for telling variable domains by scanning transitions
Gecode::Int::Regular::FinalBagFor collecting final states while constructing a DFA
Gecode::Int::Regular::GroupStatesGroupStates is used to index StateGroup by group
Gecode::Int::Regular::LayerA layer in the layered graph
Gecode::Int::Regular::NodeInfoNode information computed during traversal of the expressions
Gecode::Int::Regular::PosInfoInformation on positions collected during traversal
Gecode::Int::Regular::PosSetSets of positions
Gecode::Int::Regular::StateStates are described by number of incoming and outgoing edges
Gecode::Int::Regular::StateGroupStategroup is used to compute a partition of states
Gecode::Int::Regular::StateGroupByGroupSort groups stated by group and then state
Gecode::Int::Regular::StateNodeNode together with state information
Gecode::Int::Regular::StatePoolState pool combines a tree of states together with yet unprocessed states
Gecode::Int::Regular::SymbolsIncSort symbols
Gecode::Int::Regular::TransByI_StateSort transition array by input state
Gecode::Int::Regular::TransByO_StateSort transition array by output state
Gecode::Int::Regular::TransBySymbolSort transition array by symbol (value)
Gecode::Int::Regular::TransBySymbolI_StateSort transition array by symbol and then input states
Gecode::Int::Regular::TransitionBagFor collecting transitions while constructing a DFA
Gecode::Int::Rel::EqBnd< View >Binary bounds-consistent equality propagator
Gecode::Int::Rel::EqDom< View >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::Sortedness::OfflineMinOffline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y
Gecode::Int::Sortedness::OfflineMinItemItem used to construct the OfflineMin sequence
Gecode::Int::Sortedness::SccComponentRepresentation of a strongly connected component
Gecode::Int::Sortedness::Sortedness< View, Tuple, Perm, shared >Bounds consistent sortedness propagator
Gecode::Int::Sortedness::TupleMaxInc< Tuple >Index comparison for ViewArray<Tuple>
Gecode::Int::Sortedness::TupleMinInc< View >View comparison on ViewTuples
Gecode::Int::Sortedness::TupleMinIncPerm< View >View comparison on ViewTuples
Gecode::Int::UnknownBranchingException: Unknown value or variable selection passed as argument
Gecode::Int::UnknownRelationException: Unknown relation passed as argument
Gecode::Int::VariableEmptyDomainException: Variable created with empty domain
Gecode::Int::VariableOutOfRangeDomainException: 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::IdxView >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::IntSetInteger sets
Gecode::IntSet::MinIncSort ranges according to increasing minimum
Gecode::IntSetPropagator< View, pcs, pci >Set/Int connection propagator
Gecode::IntSetRangesRange iterator for integer sets
Gecode::IntSetValuesValue iterator for integer sets
Gecode::IntVarInteger variables
Gecode::IntVarArrayInteger variable array
Gecode::IntVarRangesRange iterator for integer variables
Gecode::IntVarValuesValue 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::Cache< I >Range iterator cache
Gecode::Iter::Ranges::Cache< I >::RangeRanges stored in cache
Gecode::Iter::Ranges::Compl< UMIN, UMAX, I >Range iterator for computing the complement
Gecode::Iter::Ranges::Diff< I, J >Range iterator for computing set difference
Gecode::Iter::Ranges::EmptyRange iterator for empty range
Gecode::Iter::Ranges::Inter< I, J >Range iterator for computing intersection (binary)
Gecode::Iter::Ranges::MinMaxBase 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 >::RangeUnionOrderOrder 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::SingletonRange iterator for singleton range
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::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::MemoryExhaustedException: Memory exhausted
Gecode::MemoryManagerManage memory for space
Gecode::MiniModel::ArgumentOutOfRangeException: Argument out of range
Gecode::MiniModel::ArgumentSizeMismatchException: Sizes of arguments does not match
Gecode::MiniModel::BoolExprBoolean expressions
Gecode::MiniModel::BoolExpr::NodeNode for Boolean expression
Gecode::MiniModel::BoolRelBoolean relations
Gecode::MiniModel::LinExprLinear expressions
Gecode::MiniModel::LinRelLinear relations
Gecode::MiniModel::Matrix< A >Matrix-interface for arrays
Gecode::MiniModel::Matrix< A >::SliceA 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::PropagatorBase-class for propagators
Gecode::ReBinaryPropagator< View, pc, CtrlView >Reified binary propagator
Gecode::REGRegular expressions
Gecode::REG::ExpImplementation 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::BABDepth-first branch-and-bound search engine
Gecode::Search::BabCopyEngineCopying branch-and-bound engine implementation
Gecode::Search::BabEngineInterface for depth-first branch-and-bound search engines
Gecode::Search::BabReCoEngineRecomputing branch-and-bound engine implementation
Gecode::Search::BaseStack< Node >Stack of nodes in search tree base-class
Gecode::Search::CopyNodeSearch tree node for copying
Gecode::Search::CopyStackStack of nodes for copying
Gecode::Search::DFSDepth-first search engine
Gecode::Search::DfsCopyEngineCopying depth-first engine implementation
Gecode::Search::DfsReCoEngineRecomputing depth-first engine implementation
Gecode::Search::FullStatisticsFull search engine statistics including memory information
Gecode::Search::LDSLimited discrepancy search engine
Gecode::Search::PlainEngineInterface for depth-first search engines
Gecode::Search::ProbeEngineProbing engine for LDS
Gecode::Search::ProbeEngine::NodeNode in the search tree for LDS
Gecode::Search::ReCoNodeSearch tree node for recomputation
Gecode::Search::ReCoStackStack of nodes for recomputation
Gecode::Search::StatisticsSearch engine statistics
Gecode::Set::ArgumentEmptyException: No arguments available in argument array
Gecode::Set::ArgumentSizeMismatchException: Arguments are of different size
Gecode::Set::ArrayRangesRange iterator for a two-dimensional array
Gecode::Set::BndSetSets of integers
Gecode::Set::BndSetRangesRange iterator for integer sets
Gecode::Set::Branch::ByMaxCardView selection class for view with greatest cardinality of lub-glb
Gecode::Set::Branch::ByMaxUnknownView selection class for view with greatest element in lub-glb
Gecode::Set::Branch::ByMinCardView selection class for view with smallest cardinality of lub-glb
Gecode::Set::Branch::ByMinUnknownView selection class for view with smallest element in lub-glb
Gecode::Set::Branch::ByNoneView selection class for first view
Gecode::Set::Branch::ValMaxClass for selecting maximum value
Gecode::Set::Branch::ValMinClass 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::ConstantViewConstant view
Gecode::Set::Convex::ConvexPropagator for the convex constraint
Gecode::Set::Convex::ConvexHullPropagator for the convex hull constraint
Gecode::Set::Distinct::AtmostOnePropagator for the AtMostOneIntersection constraint
Gecode::Set::Distinct::BinomialComputing binomial coefficients using dynamic programming
Gecode::Set::Distinct::DistinctPropagator for the n-ary distinct constraint with fixed cardinalities
Gecode::Set::EmptyViewConstant view for the empty set
Gecode::Set::GLBndSetGrowing 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::CardPropagator for cardinality
Gecode::Set::Int::ChannelVarValPropagator for channelling between variable-value-dual models
Gecode::Set::Int::IntLt
Gecode::Set::Int::MatchPropagator for the match constraint
Gecode::Set::Int::MaxElementPropator for maximum element
Gecode::Set::Int::MinElementPropator for minimum element
Gecode::Set::Int::OverweightValues< I >Value Iterator for values above a certain weight
Gecode::Set::Int::WeightsPropagator for weight of a set
Gecode::Set::InvalidRelationException: Invalid relation passed as argument
Gecode::Set::LUBndSetShrinking 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::RangeListLists 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::SelectDisjointPropagator for selected disjointness
Gecode::Set::Select::SelectIntersection< SView, RView >Propagator for selected intersection
Gecode::Set::Sequence::SeqPropagator for the sequence constraint
Gecode::Set::Sequence::SeqUPropagator for the sequenced union constraint
Gecode::Set::SetVarImpFinite integer set variable implementation
Gecode::Set::SetViewSet view for set variables
Gecode::Set::SingletonViewSingleton set view
Gecode::Set::UniverseViewConstant view for the universe
Gecode::Set::UnknownBranchingException: Unknown value or variable selection passed as argument
Gecode::Set::UnknownRanges< T >Range iterator for the unknown set
Gecode::Set::VariableFailedDomainException: Variable created with failed domain
Gecode::Set::VariableOutOfRangeCardinalityException: Variable created with wrong cardinality
Gecode::Set::VariableOutOfRangeDomainException: Variable created with values too large for domain
Gecode::SetVarSet variables
Gecode::SetVarArraySet variable array
Gecode::SetVarGlbRangesIterator for the greatest lower bound ranges of a set variable
Gecode::SetVarGlbValuesIterator for the values in the greatest lower bound of a set variable
Gecode::SetVarLubRangesIterator for the least upper bound ranges of a set variable
Gecode::SetVarLubValuesIterator for the values in the least upper bound of a set variable
Gecode::SetVarUnknownRangesIterator for the unknown ranges of a set variable
Gecode::SetVarUnknownValuesIterator for the values in the unknown set of a set variable
Gecode::SpaceComputation spaces
Gecode::SpaceFailedException: Operation on failed space invoked
Gecode::SpaceIllegalAlternativeException: Commit with illegal alternative
Gecode::SpaceNoBranchingException: 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::PQueue< T, Less >Simple fixed-size priority queue
Gecode::Support::QuickSortStack< Type >Static stack for quicksort
Gecode::Support::SharedArray< T >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::VarArray< Var >Variable arrays
Gecode::VarBaseBase-class for variable implementations
Gecode::Variable< VTI, PC >Base-class for variable implementations
Gecode::VarTypeProcessor< VTI, PC >Variable type processor
Gecode::VarTypeProcessorBaseBase-class for variable type processor
Gecode::ViewArray< View >View arrays
Gecode::ViewArray< Int::Linear::NoView >View array for no view (empty)
Gecode::ViewValBranching< View, Val, ViewSel, ValSel >Generic branching
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
GolfExample: Golf tournament
GolombExample: Finding optimal Golomb rulers
GraphGraph specification
GraphColorExample: Clique-based graph coloring
GraphColorSpecGraph specification
GroceryExample: Grocery puzzle
HammingExample: Generating hamming codes
IndSetExample: Independent Sets in a Graph
KnightsExample: n-Knights tour
LangfordNumExample: Langford's number problem
MagicSequenceExample: Magic sequence
MagicSquareExample: Magic squares
MoneyExample: SEND+MORE=MONEY puzzle
OptionsClass for options for examples
OrthoLatinSquareExample: Orthogonal latin squares
PackingExample: packing squares into a rectangle
PackingSpecPacking problem specification
PartitionExample: partition numbers into two groups
PhotoExample: Placing people on a photo
PhotoSpecSpecifications for the Photo example
PicturePuzzleExample: Picture puzzles
PlayTriple forming an entry in the round robin schedule
Gecode::Int::IntVarImp::ProcessorInteger variable processor for modified variables
QueensExample: n-Queens puzzle
Gecode::MemoryManager::ReuseChunkMemory-chunks for reusing slack memory
SportsLeagueExample: Sports League Scheduling
SteinerExample: Steiner triples
SudokuExample: Some Sudoku puzzles
SudokuMixedExample: Some Sudoku puzzles using finite domain and set constraints
SudokuSetExample: Some Sudoku puzzles using set constraints
TimerTimer interface used for examples
TournamentTournament parameters
Gecode::DFA::TransitionSpecification of a DFA transition
WarehousesExample: Locating warehouses