Generated on Thu Mar 22 10:39:50 2012 for Gecode by doxygen 1.6.3

Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AllIntervalExample: All-interval series
AlphaExample: Alpha puzzle
BACPExample: The balanced academic curriculum problem
BACP::ValBestLoad< minimize >Custom value selection class for a view-value branching
BIBDExample: Balanced incomplete block design (BIBD)
BIBDOptionsOptions for BIBD problems
BinPackingExample: Bin packing
BlackHoleExample: Black hole patience
BlackHoleBranchCustom brancher for black hole patience
BlackHoleBranch::ChoiceChoice for black hole brancher
CarSequencingExample: Car sequencing
CDBFCustom brancher implementing CDBF
CDBF::ChoiceChoice
CourseA course
CrewExample: Airline crew allocation
CrosswordExample: Crossword puzzle
CrowdedChessExample: Crowded chessboard
CurriculumA curriculum
DictionaryA simple dictionary class
DominatingQueensExample: Dominating Queens
DominoExample: Solitaire domino
DonaldExample: DONALD+GERALD=ROBERT puzzle
EFPAExample: Equidistant Frequency Permutation Arrays
EFPAOptionsOptions for EFPA problems
Eq20Example: Solving 20 linear equations
FileSizeOptionsParse an additional file option
Gecode::ActorBase-class for both propagators and branchers
Gecode::ActorLinkDouble-linked list for actors
Gecode::AdvisorBase-class for advisors
Gecode::Advisors< A >Class to iterate over advisors of a council
Gecode::AllVarConfConfiguration for all variable implementations
Gecode::ArchiveArchive representation
Gecode::ArchivedRandomGeneratorRandom generator with archiving (to be used in branchers)
Gecode::ArgArray< T >Argument array for non-primitive types
Gecode::ArgArrayBase< T >Base-class for argument arrays
Gecode::ArrayTraits< A >Traits of arrays in Gecode
Gecode::ArrayTraits< ArgArray< IntSet > >Traits of IntSetArgs
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< PrimArgArray< int > >Traits of IntArgs
Gecode::ArrayTraits< PrimArgArray< TaskType > >Traits of TaskTypeArgs
Gecode::ArrayTraits< SetVarArgs >Traits of SetVarArgs
Gecode::ArrayTraits< SetVarArray >Traits of SetVarArray
Gecode::ArrayTraits< VarArgArray< BoolVar > >Traits of BoolVarArgs
Gecode::ArrayTraits< VarArgArray< IntVar > >Traits of IntVarArgs
Gecode::ArrayTraits< VarArgArray< SetVar > >Traits of VarArgArray<SetVar>
Gecode::ArrayTraits< VarArray< BoolVar > >Traits of BoolVarArray
Gecode::ArrayTraits< VarArray< IntVar > >Traits of IntVarArray
Gecode::ArrayTraits< VarArray< SetVar > >Traits of VarArray<SetVar>
Gecode::BAB< T >Depth-first branch-and-bound search engine
Gecode::BaseOptionsBase class for script options
Gecode::BElementExprBoolean element expressions
Gecode::BinaryPropagator< View, pc >Binary propagator
Gecode::BoolExprBoolean expressions
Gecode::BoolExpr::MiscExprMiscealloneous Boolean expressions
Gecode::BoolExpr::NNFNode for negation normalform (NNF)
Gecode::BoolExpr::NodeNode for Boolean expression
Gecode::BoolVarBoolean integer variables
Gecode::BoolVarArgsPassing Boolean variables
Gecode::BoolVarArrayBoolean variable array
Gecode::BrancherBase-class for branchers
Gecode::ChoiceChoice for performing commit
Gecode::ChoiceVirtual< Choice >Virtualized choice
Gecode::ChoiceVirtualBaseVirtualized choice baseclass
Gecode::CloneStatisticsStatistics for execution of clone
Gecode::CommitStatisticsStatistics for execution of commit
Gecode::ConstView< View >Base-class for constant views
Gecode::Council< A >Council of advisors
Gecode::DeltaGeneric domain change information to be supplied to advisors
Gecode::DerivedView< View >Base-class for derived views
Gecode::DFADeterministic finite automaton (DFA)
Gecode::DFA::DFAIData stored for a DFA
Gecode::DFA::DFAI::HashEntrySpecification of transition range
Gecode::DFA::SymbolsIterator for DFA symbols
Gecode::DFA::TransitionSpecification of a DFA transition
Gecode::DFA::TransitionsIterator for DFA transitions (sorted by symbols)
Gecode::DFS< T >Depth-first search engine
Gecode::Driver::BaseOptionBase class for options
Gecode::Driver::BoolOptionBoolean option
Gecode::Driver::CutoffStop object based on nodes, failures, and time
Gecode::Driver::DoubleOptionDouble option
Gecode::Driver::IntOptionInteger option
Gecode::Driver::ScriptBase< BaseSpace >Parametric base-class for scripts
Gecode::Driver::StringOptionString-valued option (integer value defined by strings)
Gecode::Driver::StringOption::ValueOption value
Gecode::Driver::StringValueOptionString-valued option
Gecode::Driver::UnsignedIntOptionUnsigned integer option
Gecode::DynamicCastFailedException: dynamic cast failed
Gecode::EmptyValSelChoiceEmty value selection choice
Gecode::EmptyViewSelChoiceEmty view selection choice
Gecode::ExceptionException: Base-class for exceptions
Gecode::FlatZinc::AliasAlias for a variable specification
Gecode::FlatZinc::AST::ArrayArray node
Gecode::FlatZinc::AST::ArrayAccessNode representing an array access
Gecode::FlatZinc::AST::AtomNode representing an atom
Gecode::FlatZinc::AST::BoolLitBoolean literal node
Gecode::FlatZinc::AST::BoolVarBoolean variable node
Gecode::FlatZinc::AST::CallNode representing a function call
Gecode::FlatZinc::AST::FloatLitFloat literal node
Gecode::FlatZinc::AST::FloatVarFloat variable node
Gecode::FlatZinc::AST::IntLitInteger literal node
Gecode::FlatZinc::AST::IntVarInteger variable node
Gecode::FlatZinc::AST::NodeA node in a FlatZinc abstract syntax tree
Gecode::FlatZinc::AST::SetLitSet literal node
Gecode::FlatZinc::AST::SetVarSet variable node
Gecode::FlatZinc::AST::StringString node
Gecode::FlatZinc::AST::TypeErrorException signaling type error
Gecode::FlatZinc::AST::VarVariable node base class
Gecode::FlatZinc::BoolVarSpecSpecification for Boolean variables
Gecode::FlatZinc::ConExprAbstract representation of a constraint
Gecode::FlatZinc::ErrorException class for FlatZinc errors
Gecode::FlatZinc::FlatZincOptionsOptions for running FlatZinc models
Gecode::FlatZinc::FlatZincSpaceA space that can be initialized with a FlatZinc model
Gecode::FlatZinc::FloatVarSpecSpecification for floating point variables
Gecode::FlatZinc::IntVarSpecSpecification for integer variables
Gecode::FlatZinc::Option< Val >Optional value
Gecode::FlatZinc::OutputOrderStrict weak ordering for output items
Gecode::FlatZinc::ParserStateState of the FlatZinc parser
Gecode::FlatZinc::PrinterOutput support class for FlatZinc interpreter
Gecode::FlatZinc::RegistryMap from constraint identifier to constraint posting functions
Gecode::FlatZinc::SetVarSpecSpecification for set variables
Gecode::FlatZinc::SymbolEntryEntries in the symbol table
Gecode::FlatZinc::SymbolTable< Val >Symbol table mapping identifiers (strings) to values
Gecode::FlatZinc::VarSpecBase class for variable specifications
Gecode::FreeListBase-class for freelist-managed objects
Gecode::FunctionBranchBrancher for calling a function
Gecode::FunctionBranch::DescriptionMinimal brancher description storing no information
Gecode::Gist::AboutGistDisplay information about Gist
Gecode::Gist::BestNodeStatic reference to the currently best space
Gecode::Gist::BoundingBoxBounding box
Gecode::Gist::BranchRepresentation of a branch in the search tree
Gecode::Gist::ComparatorAbstract base class for comparators
Gecode::Gist::DisposeCursorA cursor that frees all memory
Gecode::Gist::DrawingCursorA cursor that draws a tree on a QWidget
Gecode::Gist::ExtentExtent representing shape of a tree at one depth level
Gecode::Gist::GistGecode Interactive Search Tool
Gecode::Gist::GistMainWindowMain window for stand-alone Gist
Gecode::Gist::GistOutputStreamAn outputstream that prints on a QTextEdit
Gecode::Gist::HideFailedCursorA cursor that marks failed subtrees as hidden
Gecode::Gist::InspectorAbstract base class for inspectors
Gecode::Gist::LayoutLayout parameters
Gecode::Gist::LayoutCursorA cursor that computes a tree layout for VisualNodes
Gecode::Gist::LayouterHelper functions for the layout algorithm
Gecode::Gist::LogosClass holding Gecode and Gist logo icons
Gecode::Gist::NextSolCursorA cursor that finds the next solution
Gecode::Gist::NodeBase class for nodes of the search tree
Gecode::Gist::NodeAllocatorBase< T >Node allocator
Gecode::Gist::NodeCursor< Node >A cursor that can be run over a tree
Gecode::Gist::NodeStatInspectorDisplay information about nodes
Gecode::Gist::NodeVisitor< Cursor >Base class for a visitor that runs a cursor over a tree
Gecode::Gist::NodeWidgetSmall node drawings for the status bar
Gecode::Gist::OptionsOptions for Gist
Gecode::Gist::Options::_IHelper class storing inspectors
Gecode::Gist::PostorderNodeVisitor< Cursor >Run a cursor over a tree, processing nodes in post-order
Gecode::Gist::PreferencesDialogPreferences dialog for Gist
Gecode::Gist::PreorderNodeVisitor< Cursor >Run a cursor over a tree, processing nodes in pre-order
Gecode::Gist::Print< S >An inspector for printing simple text output
Gecode::Gist::SearcherThreadA thread that concurrently explores the tree
Gecode::Gist::SearchItemA stack item for depth first search
Gecode::Gist::ShapeThe shape of a subtree
Gecode::Gist::ShapeAllocatorAllocate shapes statically
Gecode::Gist::SpaceNodeA node of a search tree of Gecode spaces
Gecode::Gist::StatCursorA cursor that collects statistics
Gecode::Gist::StatisticsStatistics about the search tree
Gecode::Gist::StopBrancherBrancher that stops exploration in Gist
Gecode::Gist::StopChoiceChoice for StopBrancher
Gecode::Gist::TextOutputAn window for simple text output
Gecode::Gist::TextOutputIWindow with associated ostream, used for inspecting Gist nodes
Gecode::Gist::TreeCanvasA canvas that displays the search tree
Gecode::Gist::UnhideAllCursorA cursor that marks all nodes in the tree as not hidden
Gecode::Gist::UnstopAllCursorA cursor that marks all nodes in the tree as not stopping
Gecode::Gist::VarComparator< S >A simple comparator
Gecode::Gist::VisualNodeNode class that supports visual layout
Gecode::GlobalPropInfoGlobally shared object for propagator information
Gecode::HeapHeap memory management class
Gecode::HeapChunkMemory chunk allocated from heap with proper alignment
Gecode::HomeHome class for posting propagators
Gecode::InstanceOptionsOptions for scripts with additional instance parameter
Gecode::Int::ArgumentSameException: Arguments contain same variable multiply
Gecode::Int::ArgumentSizeMismatchException: 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 >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 $x_0\times x_1=x_0$
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::RangesMapSqrMapping ranges to squares
Gecode::Int::Arithmetic::RangesMapSqrtMapping 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::ValuesMapSqrMapping integer to square
Gecode::Int::Arithmetic::ValuesMapSqrtMapping integer to square root
Gecode::Int::BinPacking::ItemItem combining bin and size information
Gecode::Int::BinPacking::PackBin-packing propagator
Gecode::Int::BinPacking::SizeSetSize sets
Gecode::Int::BinPacking::SizeSetMinusOneSize sets with one element discarded
Gecode::Int::BinPacking::TellCacheRecord tell information
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::Clause< VX, VY >Boolean clause propagator (disjunctive)
Gecode::Int::Bool::Clause< VX, VY >::TaggedAdvisors for views (tagged whether for x or y)
Gecode::Int::Bool::ClauseTrue< VX, VY >Boolean clause propagator (disjunctive, true)
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::NaryEqvBoolean n-ary equivalence propagator
Gecode::Int::Bool::NaryLq< VX >Nary Boolean less or equal propagator
Gecode::Int::Bool::NaryOr< VX, VY >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::BoolVarImpBoolean variable implementation
Gecode::Int::BoolVarImpBaseBase-class for Bool-variable implementations
Gecode::Int::BoolVarImpConfConfiguration for Bool-variable implementations
Gecode::Int::BoolViewBoolean view for Boolean variables
Gecode::Int::Branch::AssignValMed< View >Class for assigning maximum value
Gecode::Int::Branch::AssignValMin< View >Class for assigning minimum value
Gecode::Int::Branch::AssignValRnd< View >Class for assigning random value
Gecode::Int::Branch::AssignValZero< View >Class for assigning zero
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::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::BySizeAfcMaxView selection class for view with largest size divided by accumulated failure count
Gecode::Int::Branch::BySizeAfcMinView selection class for view with smallest size divided by accumulated failure count
Gecode::Int::Branch::BySizeDegreeMaxView selection class for view with largest size divided by degree
Gecode::Int::Branch::BySizeDegreeMinView selection class for view with smallest size divided by degree
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::NoValueFor Boolean branchers not needing a value
Gecode::Int::Branch::PosValuesChoice< ViewSel, View >Choice storing position and values
Gecode::Int::Branch::ValMed< View >Class for selecting median value
Gecode::Int::Branch::ValMin< View >Class for selecting minimum value
Gecode::Int::Branch::ValRangeMin< View >Class for trying the first range of a domain first or splitting domain at mean of smallest and largest element (lower half first)
Gecode::Int::Branch::ValRnd< _View >Class for random value selection
Gecode::Int::Branch::ValSplitMin< View >Class for splitting domain at mean of smallest and largest element (lower half first)
Gecode::Int::Branch::ValZeroOne< View >Class for trying zero and then one
Gecode::Int::Branch::ViewValuesBrancher< ViewSel, View >Brancher by view and values selection
Gecode::Int::CachedView< View >Cached integer view
Gecode::Int::Channel::Base< Info, Offset, pc >Base-class for channel propagators
Gecode::Int::Channel::BoolIterIterates the values to be removed as defined by an array of Boolean views
Gecode::Int::Channel::Dom< View, Offset, shared >Domain consistent channel propagator
Gecode::Int::Channel::DomInfo< View, Offset >Combine view with information for domain propagation
Gecode::Int::Channel::LinkMultiLink propagator for multiple Boolean views
Gecode::Int::Channel::LinkSingleLink propagator for a single Boolean view
Gecode::Int::Channel::Val< View, Offset, shared >Naive channel propagator
Gecode::Int::Channel::ValInfo< View >Combine view with information for value propagation
Gecode::Int::Circuit::Base< View, Offset >Base-class for circuit propagator
Gecode::Int::Circuit::Dom< View, Offset >"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, Offset >"Value-consistent" circuit propagator
Gecode::Int::ConstIntViewConstant integer 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, dom >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, dom >Propagator for counting views (greater or equal to number of equal views)
Gecode::Int::Count::IntBase< VX, VY >Baseclass for count propagators (integer)
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::ViewBase< VX, VY, VZ >Base-class for count propagators (view)
Gecode::Int::Cumulative::EventEvent for task
Gecode::Int::Cumulative::ExtOmegaNodeNode for an extended omega tree
Gecode::Int::Cumulative::ExtOmegaTree< TaskView >Omega trees for computing ect of task sets
Gecode::Int::Cumulative::ManFixPSETaskCumulative (mandatory) task with fixed processing, start or end time
Gecode::Int::Cumulative::ManFixPTaskCumulative (mandatory) task with fixed processing time
Gecode::Int::Cumulative::ManFlexTaskCumulative (mandatory) task with flexible processing time
Gecode::Int::Cumulative::ManProp< ManTask, Cap >Scheduling propagator for cumulative resource with mandatory tasks
Gecode::Int::Cumulative::OmegaLambdaNodeNode for an omega lambda tree
Gecode::Int::Cumulative::OmegaLambdaTree< TaskView >Omega-lambda trees for computing ect of task sets
Gecode::Int::Cumulative::OmegaNodeNode for an omega tree
Gecode::Int::Cumulative::OmegaTree< TaskView >Omega trees for computing ect of task sets
Gecode::Int::Cumulative::OptFixPSETaskCumulative optional task with fixed processing, start or end time
Gecode::Int::Cumulative::OptFixPTaskCumulative optional task with fixed processing time
Gecode::Int::Cumulative::OptFlexTaskCumulative optional task with flexible processing time
Gecode::Int::Cumulative::OptProp< OptTask, Cap >Scheduling propagator for cumulative resource with optional tasks
Gecode::Int::Cumulative::PrecOrderSort by prec array
Gecode::Int::Cumulative::StoCap< TaskView, inc >Sort by capacity
Gecode::Int::Cumulative::TaskByDecCap< Task >Sort order for tasks by decreasing capacity
Gecode::Int::Cumulatives::EventAn event collects the information for one evnet for the sweep-line
Gecode::Int::Cumulatives::Val< ViewM, ViewP, ViewU, View >Propagator for the cumulatives constraint
Gecode::Int::Distinct::Bnd< View >Bounds consistent distinct propagator
Gecode::Int::Distinct::Dom< View >Domain consistent distinct propagator
Gecode::Int::Distinct::DomCtrl< View >Propagation controller for domain consistent distinct
Gecode::Int::Distinct::Graph< View >View-value graph for propagation
Gecode::Int::Distinct::HallInfoInformation on Hall intervals
Gecode::Int::Distinct::MaxIncIdx< View >Sort-order by increasing maximum (by index)
Gecode::Int::Distinct::MinInc< View >Sort-order by increasing minimum (direct)
Gecode::Int::Distinct::MinIncIdx< View >Sort-order by increasing minimum (by index)
Gecode::Int::Distinct::RankRank information
Gecode::Int::Distinct::TerDom< View >Ternary domain consistent distinct propagator
Gecode::Int::Distinct::Val< View >Naive value distinct propagator
Gecode::Int::Dom::ReIntSet< View >Reified domain dom-propagator
Gecode::Int::Dom::ReRange< View >Reified range dom-propagator
Gecode::Int::Element::IdxView< View >Class for pair of index and view
Gecode::Int::Element::IdxViewArray< View >An array of IndexView pairs
Gecode::Int::Element::Int< V0, V1, Idx, Val >Element propagator for array of integers
Gecode::Int::Element::Int< V0, V1, Idx, Val >::ByValSorting pointers to (index,value) pairs in value order
Gecode::Int::Element::Int< V0, V1, Idx, Val >::IdxValLinked index-value pairs
Gecode::Int::Element::Int< V0, V1, Idx, Val >::IterIdxUnmarkValue iterator for indices in index-value map
Gecode::Int::Element::Int< V0, V1, Idx, Val >::IterValValue iterator for values in index-value map
Gecode::Int::Element::Int< V0, V1, Idx, Val >::IterValUnmarkValue iterator for values in index-value map
Gecode::Int::Element::IterIdxView< View >Value iterator for indices in index-view map
Gecode::Int::Element::PairDomain consistent pair propagator
Gecode::Int::Element::PairValuesValue iterator for pair of iterators
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< Gecode::Set::ConstSetView >VarArg type for constant Set views
Gecode::Int::Element::ViewToVarArg< Gecode::Set::SetView >VarArg type for Set views
Gecode::Int::Element::ViewToVarArg< Gecode::Set::SingletonView >VarArg type for singleton views
Gecode::Int::Element::ViewToVarArg< IntView >VarArg type for integer views
Gecode::Int::Exec::WhenConditional propagator
Gecode::Int::Extensional::Base< View, subscribe >Base for domain consistent extensional propagation
Gecode::Int::Extensional::Basic< View, shared >Domain consistent extensional propagator
Gecode::Int::Extensional::GroupStatesGroupStates is used to index StateGroup by group
Gecode::Int::Extensional::Incremental< View >Domain consistent extensional propagator
Gecode::Int::Extensional::Incremental< View >::SupportEntryEntry for storing support
Gecode::Int::Extensional::Incremental< View >::WorkWork stack
Gecode::Int::Extensional::Incremental< View >::WorkEntryDescription of work to be done
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >Domain consistent layered graph (regular) propagator
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::EdgeEdge defined by in-state and out-state
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::IndexAdvisors for views (by position in array)
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::IndexRangeRange approximation of which positions have changed
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::LayerLayer for a view in the layered graph
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::LayerValuesIterator for telling variable domains by scanning support
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::StateStates are described by number of incoming and outgoing edges
Gecode::Int::Extensional::LayeredGraph< View, Val, Degree, StateIdx >::SupportSupport information for a value
Gecode::Int::Extensional::StateGroupStategroup is used to compute a partition of states
Gecode::Int::Extensional::StateGroupByGroupSort groups stated by group and then state
Gecode::Int::Extensional::TransByI_StateSort transition array by input state
Gecode::Int::Extensional::TransByO_StateSort transition array by output state
Gecode::Int::Extensional::TransBySymbolSort transition array by symbol (value)
Gecode::Int::Extensional::TransBySymbolI_StateSort transition array by symbol and then input states
Gecode::Int::Extensional::VarTraits< Var >Traits class for variables
Gecode::Int::Extensional::VarTraits< BoolVar >Traits class for variables
Gecode::Int::Extensional::VarTraits< IntVar >Traits class for variables
Gecode::Int::FwdToBwd< TaskView >Task mapper: turns a task view into its dual
Gecode::Int::GCC::Bnd< Card >Bounds consistent global cardinality propagator
Gecode::Int::GCC::CardConstConstant view containing lower and upper cardinality bounds
Gecode::Int::GCC::CardLess< Card >Sort by increasing cardinality
Gecode::Int::GCC::CardViewCardinality integer view
Gecode::Int::GCC::Dom< Card >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::MaxInc< View >Compares two indices i, j of two views $ x_i $ $ x_j$ according to the ascending order of the views upper bounds
Gecode::Int::GCC::MinIdx< Card >Compares two cardinality views $ x_i $ $ x_j$ according to the index
Gecode::Int::GCC::MinInc< View >Compares two indices i, j of two views $ x_i $ $ x_j$ according to the ascending order of the views lower bounds
Gecode::Int::GCC::NodeBase class for nodes in the variable-value-graph
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::UnReachableClass for computing unreachable values in the value GCC propagator
Gecode::Int::GCC::Val< Card >Value consistent global cardinality propagator
Gecode::Int::GCC::ValNodeValue node
Gecode::Int::GCC::VarNodeVariable node
Gecode::Int::GCC::VarValGraph< Card >Variable-value-graph used during propagation
Gecode::Int::IllegalOperationException: Illegal operation passed as argument
Gecode::Int::IntDeltaInteger delta information for advisors
Gecode::Int::IntVarImpInteger variable implementation
Gecode::Int::IntVarImp::RangeListLists of ranges (intervals)
Gecode::Int::IntVarImpBaseBase-class for Int-variable implementations
Gecode::Int::IntVarImpBwdBackward iterator for ranges of integer variable implementations
Gecode::Int::IntVarImpConfConfiguration for Int-variable implementations
Gecode::Int::IntVarImpFwdRange iterator for ranges of integer variable implementation
Gecode::Int::IntViewInteger view for integer variables
Gecode::Int::Linear::BoolNegTraits< BV >Traits for Boolean negation view
Gecode::Int::Linear::BoolNegTraits< BoolView >Traits for Boolean negation view
Gecode::Int::Linear::BoolNegTraits< NegBoolView >Traits for Boolean negation view
Gecode::Int::Linear::DomEq< Val, View >Propagator for domain consistent n-ary linear equality
Gecode::Int::Linear::EmptyScaleBoolArrayEmpty 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::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::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::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::NegSupportIter< Val >Support-based iterator for negative view
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::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::ReEqBoolInt< VX, VB >Propagator for reified integer equal to Boolean sum (cardinality)
Gecode::Int::Linear::ReGqBoolInt< VX, VB >Propagator for reified integer less 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::ReLinBoolInt< VX, VB >Baseclass for reified integer Boolean sum
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::ScaleBoolCoefficient and Boolean view
Gecode::Int::Linear::ScaleBoolArrayArray of scale Boolean views
Gecode::Int::Linear::SupportIter< Val >Base-class for support-based iterator
Gecode::Int::Linear::SupportSetSet for support information
Gecode::Int::Linear::Term< View >Class for describing linear term $a\cdot x$
Gecode::Int::Linear::TermLess< View >Sort linear terms by view
Gecode::Int::ManTaskViewIter< OptTaskView, sto, inc >Allows to iterate over mandatory task views according to a specified order
Gecode::Int::ManToOptTask< ManTask >Class to define an optional from a mandatory task
Gecode::Int::Member::Prop< View >Membership propagator
Gecode::Int::Member::ReProp< View >Reified membership propagator
Gecode::Int::MinusViewMinus integer view
Gecode::Int::NegBoolViewNegated Boolean view
Gecode::Int::NoOffset< View >Converter without offsets
Gecode::Int::NoOverlap::Base< Box >Base class for no-overlap propagator
Gecode::Int::NoOverlap::FixDimDimension combining coordinate and integer size information
Gecode::Int::NoOverlap::FlexDimDimension combining coordinate and integer view size information
Gecode::Int::NoOverlap::ManBox< Dim, n >Mandatory box class
Gecode::Int::NoOverlap::ManProp< Dim, d >No-overlap propagator for mandatory boxes
Gecode::Int::NoOverlap::OptBox< Dim, n >Optional box class
Gecode::Int::NoOverlap::OptProp< Dim, d >No-overlap propagator for optional boxes
Gecode::Int::NotYetFinalizedException: Tuple set not yet finalized
Gecode::Int::NotZeroOneException: Not 0/1 integer
Gecode::Int::NValues::BoolBase< VY >Number of values propagator for Boolean views base class
Gecode::Int::NValues::EqBool< VY >Equal to number of values propagator for Boolean views
Gecode::Int::NValues::EqInt< VY >Equal to number of values propagator for integer views
Gecode::Int::NValues::GqBool< VY >Greater or equal to number of values propagator for Boolean views
Gecode::Int::NValues::GqInt< VY >Greater or equal to number of values propagator for integer views
Gecode::Int::NValues::GraphView-value graph for propagation of upper bound
Gecode::Int::NValues::IntBase< VY >Number of values propagator for integer views base class
Gecode::Int::NValues::LqBool< VY >Less or equal to number of values propagator for Boolean views
Gecode::Int::NValues::LqInt< VY >Less or equal to number of values propagator for integer views
Gecode::Int::NValues::RangeEventEvent for range-based overlap analysis
Gecode::Int::NValues::SymBitMatrixSymmetric diagonal bit matrix
Gecode::Int::OffsetConverter with fixed offset
Gecode::Int::OffsetViewOffset integer view
Gecode::Int::OutOfLimitsException: Value out of limits
Gecode::Int::Precede::Single< View >Single value precedence propagator
Gecode::Int::Precede::Single< View >::IndexAdvisors for views (by position in array)
Gecode::Int::ReBinaryPropagator< View, pc, CtrlView >Reified binary propagator
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::LexLqLe< View >Lexical ordering propagator
Gecode::Int::Rel::LexNq< View >Lexical disequality 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::NaryLqLe< View, o >N-ary less and less or equal propagator
Gecode::Int::Rel::NaryLqLe< View, o >::IndexAdvisors for views (by position in array)
Gecode::Int::Rel::NaryLqLe< View, o >::PosPositions in view array that have to be propagated
Gecode::Int::Rel::NaryNq< View >Nary disequality 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::ReMixBinaryPropagator< View0, pc0, View1, pc1, CtrlView >Reified mixed binary propagator
Gecode::Int::ReUnaryPropagator< View, pc, CtrlView >Reified unary propagator
Gecode::Int::ScaleView< Val, UnsVal >Scale integer view (template)
Gecode::Int::Sequence::Sequence< View, Val >Sequence propagator for array of integers
Gecode::Int::Sequence::SupportAdvisor< View >Class for advising the propagator
Gecode::Int::Sequence::ViewValSupport< View, Val, iss >Class for view value support structure
Gecode::Int::Sequence::ViewValSupportArray< View, Val, iss >An array of ViewValSupport data structures
Gecode::Int::Sequence::ViolationsSimple bitsets for recording violations
Gecode::Int::Sorted::OfflineMinOffline-Min datastructure Used to compute the perfect matching between the unsorted views x and the sorted views y
Gecode::Int::Sorted::OfflineMinItemItem used to construct the OfflineMin sequence
Gecode::Int::Sorted::RankStorage class for mininmum and maximum of a variable
Gecode::Int::Sorted::SccComponentRepresentation 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 >Extended view comparison on pairs of views
Gecode::Int::Sorted::ViewPair< View >Pair of views
Gecode::Int::SortMap< TaskView, STO, inc >Sorting maps rather than tasks
Gecode::Int::StoEct< TaskView, inc >Sort by earliest completion times
Gecode::Int::StoEst< TaskView, inc >Sort by earliest start times
Gecode::Int::StoLct< TaskView, inc >Sort by latest completion times
Gecode::Int::StoLst< TaskView, inc >Sort by latest start times
Gecode::Int::SupportValues< View, A >Support value iterator and recorder
Gecode::Int::TaskArray< Task >Task array
Gecode::Int::TaskProp< Task, pc >Propagator for tasks
Gecode::Int::TaskTraits< Task >Traits class for mapping tasks to task views
Gecode::Int::TaskTraits< Cumulative::ManFixPSETask >Task traits for mandatory fixed tasks
Gecode::Int::TaskTraits< Cumulative::ManFixPTask >Task traits for mandatory fixed tasks
Gecode::Int::TaskTraits< Cumulative::ManFlexTask >Task traits for mandatory flexible tasks
Gecode::Int::TaskTraits< Cumulative::OptFixPSETask >Task traits for optional fixed tasks
Gecode::Int::TaskTraits< Cumulative::OptFixPTask >Task traits for optional fixed tasks
Gecode::Int::TaskTraits< Cumulative::OptFlexTask >Task traits for optional flexible tasks
Gecode::Int::TaskTraits< Unary::ManFixPSETask >Task traits for mandatory fixed tasks
Gecode::Int::TaskTraits< Unary::ManFixPTask >Task traits for mandatory fixed tasks
Gecode::Int::TaskTraits< Unary::ManFlexTask >Task traits for mandatory flexible tasks
Gecode::Int::TaskTraits< Unary::OptFixPSETask >Task traits for optional fixed tasks
Gecode::Int::TaskTraits< Unary::OptFixPTask >Task traits for optional fixed tasks
Gecode::Int::TaskTraits< Unary::OptFlexTask >Task traits for optional flexible tasks
Gecode::Int::TaskTree< TaskView, Node >Task trees for task views with node type Node
Gecode::Int::TaskViewArray< TaskView >Task view array
Gecode::Int::TaskViewIter< TaskView, sto, inc >Allows to iterate over task views according to a specified order
Gecode::Int::TaskViewTraits< TaskView >Traits class for mapping task views to tasks
Gecode::Int::TaskViewTraits< Cumulative::ManFixPSETaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Cumulative::ManFixPSETaskFwd >Task view traits for forward task views
Gecode::Int::TaskViewTraits< Cumulative::ManFixPTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Cumulative::ManFixPTaskFwd >Task view traits for forward task views
Gecode::Int::TaskViewTraits< Cumulative::ManFlexTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Cumulative::ManFlexTaskFwd >Task view traits for forward task views
Gecode::Int::TaskViewTraits< Cumulative::OptFixPSETaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Cumulative::OptFixPSETaskFwd >Task view traits for forward optional task views
Gecode::Int::TaskViewTraits< Cumulative::OptFixPTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Cumulative::OptFixPTaskFwd >Task view traits for forward optional task views
Gecode::Int::TaskViewTraits< Cumulative::OptFlexTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Cumulative::OptFlexTaskFwd >Task view traits for forward optional task views
Gecode::Int::TaskViewTraits< Unary::ManFixPSETaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Unary::ManFixPSETaskFwd >Task view traits for forward task views
Gecode::Int::TaskViewTraits< Unary::ManFixPTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Unary::ManFixPTaskFwd >Task view traits for forward task views
Gecode::Int::TaskViewTraits< Unary::ManFlexTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Unary::ManFlexTaskFwd >Task view traits for forward task views
Gecode::Int::TaskViewTraits< Unary::OptFixPSETaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Unary::OptFixPSETaskFwd >Task view traits for forward optional task views
Gecode::Int::TaskViewTraits< Unary::OptFixPTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Unary::OptFixPTaskFwd >Task view traits for forward optional task views
Gecode::Int::TaskViewTraits< Unary::OptFlexTaskBwd >Task view traits for backward task views
Gecode::Int::TaskViewTraits< Unary::OptFlexTaskFwd >Task view traits for forward optional task views
Gecode::Int::TooFewArgumentsException: Too few arguments available in argument array
Gecode::Int::Unary::ManFixPSETaskUnary (mandatory) task with fixed processing, start or end time
Gecode::Int::Unary::ManFixPTaskUnary (mandatory) task with fixed processing time
Gecode::Int::Unary::ManFlexTaskUnary (mandatory) task with flexible processing time
Gecode::Int::Unary::ManProp< ManTask >Scheduling propagator for unary resource with mandatory tasks
Gecode::Int::Unary::OmegaLambdaNodeNode for an omega lambda tree
Gecode::Int::Unary::OmegaLambdaTree< TaskView >Omega-lambda trees for computing ect of task sets
Gecode::Int::Unary::OmegaNodeNode for an omega tree
Gecode::Int::Unary::OmegaTree< TaskView >Omega trees for computing ect of task sets
Gecode::Int::Unary::OptFixPSETaskUnary optional task with fixed processing, start or end time
Gecode::Int::Unary::OptFixPTaskUnary optional task with fixed processing time
Gecode::Int::Unary::OptFlexTaskUnary optional task with flexible processing time
Gecode::Int::Unary::OptProp< OptTask >Scheduling propagator for unary resource with optional tasks
Gecode::Int::UnknownBranchingException: Unknown value or variable selection passed as argument
Gecode::Int::UnknownOperationException: Unknown operation passed as argument
Gecode::Int::UnknownRelationException: Unknown relation passed as argument
Gecode::Int::Unshare::VarPtrLess< Var >Sort order for variables
Gecode::Int::ValOfUnassignedVarException: Attempt to access value of unassigned variable
Gecode::Int::ValSetClass for storing values of already assigned views
Gecode::Int::ValSet::RangesIterator over ranges
Gecode::Int::VariableEmptyDomainException: Variable created with empty domain
Gecode::Int::ViewDiffRanges< View >Range iterator for cached integer views
Gecode::Int::ViewRanges< View >Range iterator for integer views
Gecode::Int::ViewRanges< BoolView >Range iterator for Boolean variable views
Gecode::Int::ViewRanges< CachedView< View > >Range iterator for offset 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< 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::ViewValGraph::BiLinkBidirectional links for edges and anchors in nodes of view-value graph
Gecode::Int::ViewValGraph::CombPtrFlag< T >Class for combining two pointers with a flag
Gecode::Int::ViewValGraph::Edge< View >Edges in view-value graph
Gecode::Int::ViewValGraph::Graph< View >View-value graph base class
Gecode::Int::ViewValGraph::IterPruneVal< View >Iterates the values to be pruned from a view node
Gecode::Int::ViewValGraph::Node< View >Base-class for nodes (both view and value nodes)
Gecode::Int::ViewValGraph::ValNode< View >Value nodes in view-value graph
Gecode::Int::ViewValGraph::ViewNode< View >View nodes in view-value graph
Gecode::Int::ViewValues< View >Value iterator for integer views
Gecode::Int::ZeroIntViewZero integer view
Gecode::IntArgsPassing integer arguments
Gecode::IntSetInteger sets
Gecode::IntSet::MinIncSort ranges according to increasing minimum
Gecode::IntSetInit< I >Integer set initialization
Gecode::IntSetInit< IntArgs >
Gecode::IntSetInit< IntSet >
Gecode::IntSetRangesRange iterator for integer sets
Gecode::IntSetValuesValue iterator for integer sets
Gecode::IntVarInteger variables
Gecode::IntVarArgsPassing integer 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::ArrayRange iterator for array of ranges
Gecode::Iter::Ranges::Array::RangeRanges for array
Gecode::Iter::Ranges::CacheRange iterator 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::EmptyRange 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::MinMaxBase for range iterators with explicit min and max
Gecode::Iter::Ranges::MinusRange iterator for pointwise minus of a range iterator
Gecode::Iter::Ranges::NaryAppend< I >Range iterator for appending arbitrarily many iterators
Gecode::Iter::Ranges::NaryInterRange iterator for intersection of iterators
Gecode::Iter::Ranges::NaryUnionRange iterator for union of iterators
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::RangeListRange iterator for range lists
Gecode::Iter::Ranges::RangeListIterIterator over range lists
Gecode::Iter::Ranges::RangeListIter::RangeListRange list class
Gecode::Iter::Ranges::RangeListIter::RLIOShared object for allocation
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::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::Values::ArrayValue iterator for array of integers
Gecode::Iter::Values::BitSet< BS >Value iterator for values in a bitset
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::MinusValue 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::SingletonValue 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::Iter::Values::ValueListIterIterator over value lists
Gecode::Iter::Values::ValueListIter::ValueListValue list class
Gecode::Iter::Values::ValueListIter::VLIOShared object for allocation
Gecode::Kernel::NaryWait< View >Wait propagator for several views
Gecode::Kernel::UnaryWait< View >Wait propagator for single view
Gecode::LinExprLinear expressions
Gecode::LinRelLinear relations
Gecode::LocalHandleHandles for local (space-shared) objects
Gecode::LocalObjectLocal (space-shared) object
Gecode::Matrix< A >Matrix-interface for arrays
Gecode::MemoryChunkMemory chunk with size information
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::ArithNonLinExprNon-linear arithmetic expressions
Gecode::MiniModel::ExpInfoExpression information
Gecode::MiniModel::FinalBagFor collecting final states while constructing a DFA
Gecode::MiniModel::NodeInfoNode information computed during traversal of the expressions
Gecode::MiniModel::OptimizeSpace< irt >Baseclass for cost-based optimization
Gecode::MiniModel::PosInfoInformation on positions collected during traversal
Gecode::MiniModel::PosSetSets of positions
Gecode::MiniModel::SetNonLinExprInteger valued set expressions
Gecode::MiniModel::StateNodeNode together with state information
Gecode::MiniModel::StatePoolState pool combines a tree of states together with yet unprocessed states
Gecode::MiniModel::SymbolsIncSort symbols
Gecode::MiniModel::TooFewArgumentsException: Too few arguments available in argument array
Gecode::MiniModel::TransitionBagFor 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::NoIdxVarImpConfConfiguration class for variable implementations without index structure
Gecode::NonLinExprBase class for non-linear expressions
Gecode::OperatingSystemErrorException: operating system error
Gecode::OptionsOptions for scripts
Gecode::PosPosition information
Gecode::PosChoice< ViewSel >Choices storing position
Gecode::PosValChoice< ViewSel, ValSel >Choice storing position and value
Gecode::PrimArgArray< T >Argument array for primtive types
Gecode::PropagatorBase-class for propagators
Gecode::PropCostPropagation cost
Gecode::PropInfoClass for propagator information
Gecode::RangeListLists of ranges (intervals)
Gecode::REGRegular expressions over integer values
Gecode::REG::ExpImplementation of the actual expression tree
Gecode::RegionHandle to region
Gecode::region_allocator< T >Allocator that allocates memory from a region
Gecode::region_allocator< T >::rebind< U >Rebinding helper (returns the type of a similar allocator for type U)
Gecode::region_allocator< void >Region allocator - specialization for void
Gecode::region_allocator< void >::rebind< U >Rebinding helper (returns the type of a similar allocator for type U)
Gecode::Restart< T >Depth-first restart best solution search engine
Gecode::Search::EngineSearch engine interface
Gecode::Search::FailStopStop-object based on number of failures
Gecode::Search::MemoryStopStop-object based on memory consumption
Gecode::Search::NodeStopStop-object based on number of nodes
Gecode::Search::OptionsSearch engine options
Gecode::Search::Parallel::BABParallel branch-and-bound engine
Gecode::Search::Parallel::BAB::WorkerParallel branch-and-bound search worker
Gecode::Search::Parallel::DFSParallel depth-first search engine
Gecode::Search::Parallel::DFS::WorkerParallel depth-first search worker
Gecode::Search::Parallel::EngineParallel depth-first search engine
Gecode::Search::Parallel::Engine::WorkerParallel depth-first search worker
Gecode::Search::Parallel::PathDepth-first path (stack of edges) supporting recomputation
Gecode::Search::Parallel::Path::EdgeSearch tree edge for recomputation
Gecode::Search::Parallel::RestartDepth-first restart best solution search engine implementation
Gecode::Search::Sequential::BABImplementation of depth-first branch-and-bound search engine
Gecode::Search::Sequential::DFSDepth-first search engine implementation
Gecode::Search::Sequential::PathDepth-first path (stack of edges) supporting recomputation
Gecode::Search::Sequential::Path::EdgeSearch tree edge for recomputation
Gecode::Search::Sequential::RestartDepth-first restart best solution search engine implementation
Gecode::Search::StatisticsSearch engine statistics
Gecode::Search::StopBase-class for Stop-object
Gecode::Search::TimeStopStop-object based on time
Gecode::Search::WorkerSearch worker control including memory information
Gecode::Search::WorkerToEngine< Worker >Virtualize a worker to an engine
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::AssignValMax< inc >Class for assigning maximum value
Gecode::Set::Branch::AssignValMed< inc >Class for assigning median value (rounding downwards)
Gecode::Set::Branch::AssignValMin< inc >Class for assigning minimum value
Gecode::Set::Branch::AssignValRnd< inc >Class for assigning random value
Gecode::Set::Branch::ByMaxMaxView selection class for view with largest maximal element in lub-glb
Gecode::Set::Branch::ByMaxMinView selection class for view with smallest maximal element in lub-glb
Gecode::Set::Branch::ByMinMaxView selection class for view with largest minimum element in lub-glb
Gecode::Set::Branch::ByMinMinView selection class for view with smallest minimum element in lub-glb
Gecode::Set::Branch::BySizeAfcMaxView selection class for view with largest cardinality of lub-glb divided by accumulated failure count
Gecode::Set::Branch::BySizeAfcMinView selection class for view with smallest cardinality of lub-glb divided by accumulated failure count
Gecode::Set::Branch::BySizeDegreeMaxView selection class for view with largest cardinality of lub-glb divided by degree
Gecode::Set::Branch::BySizeDegreeMinView selection class for view with smallest cardinality of lub-glb divided by degree
Gecode::Set::Branch::BySizeMaxView selection class for view with largest cardinality of lub-glb
Gecode::Set::Branch::BySizeMinView selection class for view with smallest cardinality of lub-glb
Gecode::Set::Branch::ValMax< inc >Class for selecting maximum value
Gecode::Set::Branch::ValMed< inc >Class for selecting median value (rounding downwards)
Gecode::Set::Branch::ValMin< inc >Class for selecting minimum value
Gecode::Set::Branch::ValRnd< inc >Class for random value selection
Gecode::Set::CachedView< View >Cached set view
Gecode::Set::ComplementView< View >Complement set view
Gecode::Set::ConstSetViewConstant 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::Element::ElementDisjoint< SView, RView >Propagator for element with disjointness
Gecode::Set::Element::ElementIntersection< View, View0, View1 >Propagator for element with intersection
Gecode::Set::Element::ElementUnion< View, View0, View1 >Propagator for element with union
Gecode::Set::Element::ElementUnionConst< SView, RView >Propagator for element with union of constant sets
Gecode::Set::EmptyViewConstant view for the empty set
Gecode::Set::GlbDiffRanges< View >Range iterator for difference of greatest lower bound and cache
Gecode::Set::GLBndSetGrowing sets of integers
Gecode::Set::GlbRanges< T >Range iterator for the greatest lower bound
Gecode::Set::GlbRanges< CachedView< View > >Range iterator for greatest lower bound of cached set views
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< ConstSetView >Range iterator for greatest lower bound of constant set view
Gecode::Set::GlbRanges< EmptyView >Range iterator for greatest 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::IllegalOperationException: Illegal operation passed as argument
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 >::IndexAdvisorAdvisor storing a single index
Gecode::Set::Int::ChannelInt< View >Propagator for channelling between variable-value-dual models
Gecode::Set::Int::IntLessSort order for integers
Gecode::Set::Int::Match< View >Propagator for the match constraint
Gecode::Set::Int::MaxElement< View >Propagator for maximum element
Gecode::Set::Int::MinElement< View >Propagator for minimum element
Gecode::Set::Int::NotMaxElement< View >Propagator for not maximum element
Gecode::Set::Int::NotMinElement< View >Propagator for not minimum element
Gecode::Set::Int::OverweightValues< I >Value Iterator for values above a certain weight
Gecode::Set::Int::ReMaxElement< View >Reified propagator for maximum element
Gecode::Set::Int::ReMinElement< View >Propagator for reified minimum element
Gecode::Set::Int::Weights< View >Propagator for weight of a set
Gecode::Set::LubDiffRanges< View >Range iterator for difference of least upper bound and cache
Gecode::Set::LUBndSetShrinking sets of integers
Gecode::Set::LubRanges< T >Range iterator for the least upper bound
Gecode::Set::LubRanges< CachedView< View > >Range iterator for least upper bound of cached set views
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< ConstSetView >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::OutOfLimitsException: Value out of limits
Gecode::Set::Precede::Single< View >Single value precedence propagator
Gecode::Set::Precede::Single< View >::IndexAdvisors for views (by position in array)
Gecode::Set::RangesCompl< I >A complement iterator spezialized for the BndSet limits
Gecode::Set::Rel::CharacteristicSetsRepresentation of the characteristic functions of two sets
Gecode::Set::Rel::CharacteristicSets::CSIterValue iterator for characteristic function
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::Lq< View0, View1, strict >Propagator for set less than or equal
Gecode::Set::Rel::NoSubset< View0, View1 >Propagator for the negated subset constraint
Gecode::Set::Rel::ReEq< View0, View1 >Reified equality propagator
Gecode::Set::Rel::ReLq< View0, View1, strict >Reified propagator for set less than or equal
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::SeqPropagator for the sequence constraint
Gecode::Set::Sequence::SeqUPropagator for the sequenced union constraint
Gecode::Set::SetDeltaFinite set delta information for advisors
Gecode::Set::SetVarImpFinite integer set variable implementation
Gecode::Set::SetVarImpBaseBase-class for Set-variable implementations
Gecode::Set::SetVarImpConfConfiguration for Set-variable implementations
Gecode::Set::SetViewSet view for set variables
Gecode::Set::SingletonViewSingleton set view
Gecode::Set::TooFewArgumentsException: No arguments available in argument array
Gecode::Set::UniverseViewConstant view for the universe
Gecode::Set::UnknownBranchingException: Unknown value or variable selection passed as argument
Gecode::Set::UnknownOperationException: Unknown operation type passed as argument
Gecode::Set::UnknownRanges< T >Range iterator for the unknown set
Gecode::Set::UnknownRelationException: Unknown relation type passed as argument
Gecode::Set::VariableEmptyDomainException: Variable created with empty domain
Gecode::SetCmpRelComparison relation (for two-sided comparisons)
Gecode::SetExprSet expressions
Gecode::SetExpr::NNFNode for negation normalform (NNF)
Gecode::SetExpr::NodeNode for set expression
Gecode::SetRelSet relations
Gecode::SetVarSet variables
Gecode::SetVarArgsPassing set 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::SharedArray< T >Shared array with arbitrary number of elements
Gecode::SharedArray< T >::SAOImplementation of object for shared arrays
Gecode::SharedHandleThe shared handle
Gecode::SharedHandle::ObjectThe shared object
Gecode::SharedMemoryShared object for several memory areas
Gecode::SizeOptionsOptions for scripts with additional size parameter
Gecode::Slice< A >A slice of a matrix
Gecode::SpaceComputation spaces
Gecode::Space::BranchersClass to iterate over branchers of a space
Gecode::Space::PropagatorsClass to iterate over propagators of a space
Gecode::space_allocator< T >Allocator that allocates memory from a space heap
Gecode::space_allocator< T >::rebind< U >Rebinding helper (returns the type of a similar allocator for type U)
Gecode::space_allocator< void >Space allocator - specialization for void
Gecode::space_allocator< void >::rebind< U >Rebinding helper (returns the type of a similar allocator for type U)
Gecode::SpaceConstrainUndefinedException: no constrain member function defined
Gecode::SpaceFailedException: Operation on failed space invoked
Gecode::SpaceIllegalAlternativeException: Commit with illegal alternative
Gecode::SpaceNoBrancherException: Commit when no brancher present
Gecode::SpaceNotStableException: Operation on not stable space invoked
Gecode::StatusStatisticsStatistics for execution of status
Gecode::Support::BitSet< A >Simple bitsets
Gecode::Support::BitSetBaseBasic bitset support
Gecode::Support::BitSetDataDate item for bitsets
Gecode::Support::BlockAllocator< T, A, blocksize >Manage memory organized into block lists (allocator)
Gecode::Support::BlockClient< T, A, blocksize >Client for block allocator of type T
Gecode::Support::DynamicArray< T, A >Array with arbitrary number of elements
Gecode::Support::DynamicQueue< T, A >Queue with arbitrary number of elements
Gecode::Support::DynamicStack< T, A >Stack with arbitrary number of elements
Gecode::Support::EventAn event for synchronization
Gecode::Support::IntTypeTraits< IntType >Traits to for information about integer types
Gecode::Support::IntTypeTraits< signed char >Traits for signed char
Gecode::Support::IntTypeTraits< signed int >Traits for signed integer
Gecode::Support::IntTypeTraits< signed short int >Traits for signed short int
Gecode::Support::IntTypeTraits< unsigned char >Traits for unsigned char
Gecode::Support::IntTypeTraits< unsigned int >Traits for unsigned integer
Gecode::Support::IntTypeTraits< unsigned short int >Traits for unsigned short int
Gecode::Support::Less< Type >Comparison class for sorting using <
Gecode::Support::LinearCongruentialGenerator< m, a, q, r >Template for linear congruential generators
Gecode::Support::LockA lock as a scoped frontend for a mutex
Gecode::Support::MutexA mutex for mutual exclausion among several threads
Gecode::Support::QuickSortStack< Type >Static stack for quicksort
Gecode::Support::RunnableAn interface for objects that can be run by a thread
Gecode::Support::StaticStack< T, A >Stack with fixed number of elements
Gecode::Support::ThreadSimple threads
Gecode::Support::Thread::RunA real thread
Gecode::Support::TimerTimer
Gecode::TernaryPropagator< View, pc >Ternary propagator
Gecode::TieBreakVarBranch< VarBranch >Combine variable selection criteria for tie-breaking
Gecode::TieBreakVarBranchOptionsCombine variable branch options for tie-breaking
Gecode::TooManyBranchersException: too many branchers
Gecode::TupleSetClass represeting a set of tuples
Gecode::TupleSet::TupleSetIData stored for a Table
Gecode::UnaryPropagator< View, pc >Unary propagator
Gecode::ValBranchOptionsValue branch options
Gecode::ValSelBase< _View, _Val >Base class for value selection
Gecode::VarBase class for variables
Gecode::VarArgArray< Var >Argument array for variables
Gecode::VarArgArray< Var >::VarLessSort order for variables
Gecode::VarArray< Var >Variable arrays
Gecode::VarBranchOptionsVariable branch options
Gecode::VarImp< VIC >Base-class for variable implementations
Gecode::VarImpBaseBase-class for variable implementations
Gecode::VarImpDisposer< VarImp >Variable implementation disposer
Gecode::VarImpDisposerBaseBase class for Variable type disposer
Gecode::VarImpVar< VarImp >Variables as interfaces to variable implementations
Gecode::VarImpView< Var >Base-class for variable implementation 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::ViewBrancher< ViewSel >Generic brancher by view selection
Gecode::ViewSelAfcMax< View >View selection class for view with largest accumulated failure count
Gecode::ViewSelAfcMin< View >View selection class for view with smallest accumulated failure count
Gecode::ViewSelBase< _View >Base class for view selection
Gecode::ViewSelDegreeMax< View >View selection class for view with largest degree
Gecode::ViewSelDegreeMin< View >View selection class for view with smallest degree
Gecode::ViewSelNone< View >Select first not assigned view
Gecode::ViewSelRnd< _View >View selection class for random selection
Gecode::ViewSelTieBreakDynamic< _View >View selection class for dynamic tie breaking
Gecode::ViewSelTieBreakDynamic< _View >::ChoiceChoice for tie breakers
Gecode::ViewSelTieBreakStatic< A, B >View selection class for static tie breaking
Gecode::ViewSelTieBreakStatic< A, B >::ChoiceView selection choice
Gecode::ViewSelVirtual< ViewSel >Virtualized view selection
Gecode::ViewSelVirtualBase< View >Virtualized view selection base class
Gecode::ViewValBrancher< ViewSel, ValSel >Generic brancher by view and value selection
GolfExample: Golf tournament
GolfOptionsOptions for Golf example
GolombRulerExample: Finding optimal Golomb rulers
GraphGraph specification
GraphColorExample: Clique-based graph coloring
GraphColorSpecGraph specification
GroceryExample: Grocery puzzle
HammingExample: Generating Hamming codes
HammingOptionsOptions for Hamming problems
IndSetExample: Independent sets in a graph
KakuroExample: Kakuro
KnightsBase-class for knight's tour example
KnightsCircuitExample: n-Knights tour (model using circuit)
KnightsReifiedExample: n-Knight's tour (simple model)
LangfordNumberExample: Langford's number problem
LangfordNumberOptionsOptions taking two additional parameters
MagicSequenceExample: Magic sequence
MagicSquareExample: Magic squares
ManFixPSETask
ManFixPTask
ManFlexTask
MineSweeperExample: Minesweeper
MoneyExample: SEND+MORE=MONEY puzzle
NonogramExample: Nonogram
OpenShopExample: open-shop scheduling
OpenShop::PrintTaskHelper class for representing tasks when printing a solution
OpenShop::TaskTask representation for CROSH heuristic
OrthoLatinSquareExample: Orthogonal latin squares
PartitionExample: partition numbers into two groups
PentominoesExample: Pentominoes
PerfectSquareExample: Packing squares into a rectangle
PhotoExample: Placing people on a photo
PhotoSpecSpecifications for the photo example
PlayEntry in round robin schedule
QueenArmiesExample: Peaceable co-existing armies of queens
QueenArmies::QueenBranchCustom brancher for Peacable queens
QueensExample: n-Queens puzzle
RadiotherapyExample: Radiotherapy
Radiotherapy::NestedSearchNested search on the q variables
RadiotherapyDataInstance data for radio therapy problem
RRSRound robin schedule
SatExample: CNF SAT solver
SatOptionsOptions for SAT problems
SchurExample: Schur's lemma
SchurOptionsOptions for Schur's Lemma
SportsLeagueExample: Sports league scheduling
SteelMillExample: Steel-mill slab design problem
SteelMill::SteelMillBranchCustom brancher for steel mill slab design
SteelMill::SteelMillBranch::ChoiceChoice
SteelMillOptionsSteelMillOptions for examples with size option and an additional optional file name parameter
SteinerExample: Steiner triples
SudokuBase class for Sudoku puzzles
SudokuIntExample: Solving Sudoku puzzles using integer constraints
SudokuMixedExample: Solving Sudoku puzzles using both set and integer constraints
SudokuSetExample: Solving Sudoku puzzles using set constraints
Test::AFCTest for AFC infrastructure
Test::AFC::TestSpaceTest space
Test::Array::IteratorBase class for testing iterators
Test::Array::SharedArrayIteratorClass for testing the SharedArray iterator
Test::Array::TestSpaceTest space
Test::Array::VarArgsIteratorClass for testing the VarArgs iterator
Test::Array::VarArrayIteratorClass for testing the VarArray iterator
Test::Array::ViewArrayIteratorClass for testing the ViewArray iterator
Test::Assign::BoolTest branching with distinct propagator
Test::Assign::BoolTestBase class for tests for branching on Boolean variables
Test::Assign::BoolTestSpaceSpace for executing Boolean tests
Test::Assign::IntTest assignment with distinct propagator
Test::Assign::IntTestBase class for tests for assigning integer variables
Test::Assign::IntTestSpaceSpace for executing integer tests
Test::Assign::SetTest assignment with disjoint union propagator
Test::Assign::SetTestBase class for tests for branching on set variables
Test::Assign::SetTestSpaceSpace for executing Boolean tests
Test::BaseBase class for all tests to be run
Test::Branch::BoolTest brancher with distinct propagator
Test::Branch::BoolTestBase class for tests for branching on Boolean variables
Test::Branch::BoolTestSpaceSpace for executing Boolean tests
Test::Branch::IntTest brancher with distinct propagator
Test::Branch::IntTestBase class for tests for branching on integer variables
Test::Branch::IntTestSpaceSpace for executing integer tests
Test::Branch::RunInfoInformation about one test-run
Test::Branch::SetTest brancher
Test::Branch::SetTestBase class for tests for branching on set variables
Test::Branch::SetTestSpaceSpace for executing Boolean tests
Test::indSimple class for describing identation
Test::Int::Arithmetic::AbsXXTest for absolute value constraint with shared variables
Test::Int::Arithmetic::AbsXYTest for absolute value constraint
Test::Int::Arithmetic::DivTest for division constraint
Test::Int::Arithmetic::DivModTest for division/modulo constraint
Test::Int::Arithmetic::MaxNaryTest for n-ary maximum constraint
Test::Int::Arithmetic::MaxNarySharedTest for n-ary maximum constraint with shared variables
Test::Int::Arithmetic::MaxXXXTest for binary maximum constraint with shared variables
Test::Int::Arithmetic::MaxXXYTest for binary maximum constraint with shared variables
Test::Int::Arithmetic::MaxXYXTest for binary maximum constraint with shared variables
Test::Int::Arithmetic::MaxXYYTest for binary maximum constraint with shared variables
Test::Int::Arithmetic::MaxXYZTest for binary maximum constraint
Test::Int::Arithmetic::MinNaryTest for n-ary minimmum constraint
Test::Int::Arithmetic::MinNarySharedTest for n-ary minimmum constraint with shared variables
Test::Int::Arithmetic::MinXXXTest for binary minimum constraint with shared variables
Test::Int::Arithmetic::MinXXYTest for binary minimum constraint with shared variables
Test::Int::Arithmetic::MinXYXTest for binary minimum constraint with shared variables
Test::Int::Arithmetic::MinXYYTest for binary minimum constraint with shared variables
Test::Int::Arithmetic::MinXYZTest for binary minimum constraint
Test::Int::Arithmetic::ModTest for modulo constraint
Test::Int::Arithmetic::MultXXXTest for multiplication constraint with shared variables
Test::Int::Arithmetic::MultXXYTest for multiplication constraint with shared variables
Test::Int::Arithmetic::MultXYXTest for multiplication constraint with shared variables
Test::Int::Arithmetic::MultXYYTest for multiplication constraint with shared variables
Test::Int::Arithmetic::MultXYZTest for multiplication constraint
Test::Int::Arithmetic::SqrtXXTest for square root constraint with shared variables
Test::Int::Arithmetic::SqrtXYTest for square root constraint
Test::Int::Arithmetic::SqrXXTest for squaring constraint with shared variables
Test::Int::Arithmetic::SqrXYTest for squaring constraint
Test::Int::AssignmentBase class for assignments
Test::Int::Basic::BasicTest whether testing infrastructure for integer variables works
Test::Int::BinPacking::BPTTest with different bin loads and items
Test::Int::BinPacking::CreateHelp class to create and register tests
Test::Int::BinPacking::LoadBinAssignmentGenerate load and bin assignments
Test::Int::Bool::BinConstXXTest for binary Boolean operation with shared variables and constant
Test::Int::Bool::BinConstXYTest for binary Boolean operation with constant
Test::Int::Bool::BinXXXTest for binary Boolean operation with shared variables
Test::Int::Bool::BinXXYTest for binary Boolean operation with shared variables
Test::Int::Bool::BinXYXTest for binary Boolean operation with shared variables
Test::Int::Bool::BinXYYTest for binary Boolean operation with shared variables
Test::Int::Bool::BinXYZTest for binary Boolean operation
Test::Int::Bool::ClauseConstTest for Clause Boolean operation with constant
Test::Int::Bool::ClauseXXYTest for Clause Boolean operation
Test::Int::Bool::ClauseXXYYXTest for Clause Boolean operation
Test::Int::Bool::ClauseXYZTest for Clause Boolean operation
Test::Int::Bool::CreateHelp class to create and register tests
Test::Int::Bool::NaryTest for Nary Boolean operation
Test::Int::Bool::NaryConstTest for Nary Boolean operation with constant
Test::Int::Bool::NarySharedTest for Nary Boolean operation
Test::Int::BoolOpTypesIterator for Boolean operation types
Test::Int::Channel::ChannelFullSimple test for channel (testing all variables)
Test::Int::Channel::ChannelHalfSimple test for channel (testing single set of variables)
Test::Int::Channel::ChannelLinkMultiTest channel between integer variable and array of Boolean variables
Test::Int::Channel::ChannelLinkSingleTest channel between integer and Boolean variable
Test::Int::Channel::ChannelSharedTest channel with shared variables
Test::Int::Circuit::CircuitSimple test for circuit constraint
Test::Int::Circuit::CircuitCostSimple test for circuit constraint with total cost
Test::Int::Circuit::CircuitFullCostSimple test for circuit constraint with full cost information
Test::Int::Circuit::CreateHelp class to create and register tests
Test::Int::Circuit::PathSimple test for Hamiltonian path constraint
Test::Int::Circuit::PathCostSimple test for path constraint with total cost
Test::Int::Count::CreateHelp class to create and register tests
Test::Int::Count::IntArrayIntTest number of several equal integers equal to integer
Test::Int::Count::IntArrayVarTest number of several equal integers equal to integer variable
Test::Int::Count::IntIntTest number of equal integers equal to integer
Test::Int::Count::IntIntDupTest number of equal integers equal to integer with duplicate variables
Test::Int::Count::IntVarTest number of equal integers equal to integer variable
Test::Int::Count::IntVarSharedTest number of equal integers equal to integer variable with sharing
Test::Int::Count::SetIntTest number of integers contained in an integer set equal to integer
Test::Int::Count::SetVarTest number of integers contained in an integer set equal to integer variable
Test::Int::Count::VarIntTest number of equal variables equal to integer
Test::Int::Count::VarVarTest number of equal variables equal to integer variable
Test::Int::Count::VarVarSharedATest number of equal variables equal to integer variable with sharing
Test::Int::Count::VarVarSharedBTest number of equal variables equal to integer variable with sharing
Test::Int::Count::VarVarSharedCTest number of equal variables equal to integer variable with sharing
Test::Int::CpltAssignmentGenerate all assignments
Test::Int::Cumulative::CreateHelp class to create and register tests
Test::Int::Cumulative::ManFixPCumulativeTest for cumulative constraint with mandatory tasks
Test::Int::Cumulative::ManFlexCumulativeTest for cumulative constraint with flexible mandatory tasks
Test::Int::Cumulative::OptFixPCumulativeTest for cumulative constraint with optional tasks
Test::Int::Cumulative::OptFlexCumulativeTest for cumulative constraint with optional flexible tasks
Test::Int::Cumulatives::AboveDescribe that event is above a certain limit
Test::Int::Cumulatives::AssScript for generating assignments
Test::Int::Cumulatives::BelowDescribe that event is below a certain limit
Test::Int::Cumulatives::CumulativeAssignmentClass for generating reasonable assignments
Test::Int::Cumulatives::CumulativesTest for cumulatives constraint
Test::Int::Cumulatives::EventEvent to be scheduled
Test::Int::Distinct::Distinct< useCount >Simple test for distinct constraint
Test::Int::Distinct::OffsetSimple test for distinct constraint with offsets
Test::Int::Distinct::PathologicalTesting pathological cases
Test::Int::Distinct::Pathological::TestSpaceTest space
Test::Int::Distinct::RandomRandomized test for distinct constraint
Test::Int::Dom::DomDomTest for domain constraint (full integer set)
Test::Int::Dom::DomIntTest for domain constraint (integer)
Test::Int::Dom::DomRangeTest for domain constraint (range)
Test::Int::Dom::DomRangeEmptyTest for domain constraint (empty range)
Test::Int::Element::CreateHelp class to create and register tests
Test::Int::Element::IntBoolIntTest for element with integer array and integer and Boolean variable
Test::Int::Element::IntBoolVarTest for element with integer array and integer and Boolean variable
Test::Int::Element::IntIntIntTest for element with integer array and integer variables
Test::Int::Element::IntIntSharedTest for element with integer array and single shared integer variable
Test::Int::Element::IntIntVarTest for element with integer array and integer variables
Test::Int::Element::MatrixBoolVarBoolVarXXTest for matrix element with Boolean variable array and Boolean variable
Test::Int::Element::MatrixBoolVarBoolVarXYTest for matrix element with Boolean variable array and Boolean variable
Test::Int::Element::MatrixIntBoolVarXXTest for matrix element with integer array and Boolean variable
Test::Int::Element::MatrixIntBoolVarXYTest for matrix element with integer array and Boolean variable
Test::Int::Element::MatrixIntIntVarXXTest for matrix element with integer array and integer variable
Test::Int::Element::MatrixIntIntVarXYTest for matrix element with integer array and integer variable
Test::Int::Element::MatrixIntVarIntVarXXTest for matrix element with integer variable array and integer variable
Test::Int::Element::MatrixIntVarIntVarXYTest for matrix element with integer variable array and integer variable
Test::Int::Element::VarBoolIntTest for element with Boolean variable array and integer variable
Test::Int::Element::VarBoolVarTest for element with Boolean variable array and integer variable
Test::Int::Element::VarIntIntTest for element with variable array and integer variables
Test::Int::Element::VarIntSharedTest for element with variable array and shared integer variable
Test::Int::Element::VarIntVarTest for element with variable array and integer variables
Test::Int::Exec::BoolWaitSimple test for wait (Boolean variables)
Test::Int::Exec::IntWaitSimple test for wait (integer variables)
Test::Int::Exec::WhenSimple test for when
Test::Int::Extensional::RegDistinctTest with regular expression for distinct constraint
Test::Int::Extensional::RegEmptyDFATest for empty DFA
Test::Int::Extensional::RegEmptyREGTest for empty regular expression
Test::Int::Extensional::RegOptTest for optimizations
Test::Int::Extensional::RegRolandTest with simple regular expression from Roland Yap
Test::Int::Extensional::RegSharedATest with simple regular expression and shared variables (uses unsharing)
Test::Int::Extensional::RegSharedBTest with simple regular expression and shared variables (uses unsharing)
Test::Int::Extensional::RegSharedCTest with simple regular expression and shared variables (uses unsharing)
Test::Int::Extensional::RegSharedDTest with simple regular expression and shared variables (uses unsharing)
Test::Int::Extensional::RegSimpleATest with simple regular expression
Test::Int::Extensional::RegSimpleBTest with simple regular expression
Test::Int::Extensional::RegSimpleCTest with simple regular expression
Test::Int::Extensional::TupleSetATest with tuple set
Test::Int::Extensional::TupleSetBTest with tuple set
Test::Int::Extensional::TupleSetBoolTest with bool tuple set
Test::Int::GCC::CreateHelp class to create and register tests
Test::Int::GCC::IntAllMaxTest for integer cardinality with max cardinality for all variables
Test::Int::GCC::IntAllMinMaxTest for integer cardinality with min and max for all variables
Test::Int::GCC::IntAllMinMaxDefTest 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::VarAllTest for variable cardinality for all cardinality values
Test::Int::GCC::VarSomeTest for variable cardinality for some cardinality values
Test::Int::IntConLevelsIterator for integer consistency levels
Test::Int::IntRelTypesIterator for integer relation types
Test::Int::Linear::BoolIntTest linear relation over Boolean variables equal to constant
Test::Int::Linear::BoolVarTest linear relation over Boolean variables equal to integer variable
Test::Int::Linear::CreateHelp class to create and register tests
Test::Int::Linear::IntIntTest linear relation over integer variables
Test::Int::Linear::IntVarTest linear relation over integer variables
Test::Int::Member::BoolTest membership for Boolean variables
Test::Int::Member::CreateHelp class to create and register tests
Test::Int::Member::IntTest membership for integer variables
Test::Int::MiniModel::BoolLexTest for relation between arrays of Boolean variables
Test::Int::MiniModel::CreateHelp class to create and register tests
Test::Int::MiniModel::IntLexTest for relation between arrays of integer variables
Test::Int::MiniModelArithmetic::AbsTest for absolute value constraint
Test::Int::MiniModelArithmetic::DivTest for division constraint
Test::Int::MiniModelArithmetic::MaxTest for binary maximum constraint
Test::Int::MiniModelArithmetic::MaxNaryTest for n-ary maximum constraint
Test::Int::MiniModelArithmetic::MinTest for binary minimum constraint
Test::Int::MiniModelArithmetic::MinNaryTest for n-ary minimmum constraint
Test::Int::MiniModelArithmetic::MinusTest for subtraction constraint
Test::Int::MiniModelArithmetic::ModTest for division constraint
Test::Int::MiniModelArithmetic::MultTest for multiplication constraint
Test::Int::MiniModelArithmetic::PlusTest for addition constraint
Test::Int::MiniModelArithmetic::SqrTest for sqr constraint
Test::Int::MiniModelArithmetic::SqrtTest for sqrt constraint
Test::Int::MiniModelBoolean::BoolExprIntTest Boolean expressions with integer result
Test::Int::MiniModelBoolean::BoolExprVarTest posting Boolean expressions
Test::Int::MiniModelBoolean::BoolInstrType for representing a Boolean instruction
Test::Int::MiniModelBoolean::CreateHelp class to create and register tests
Test::Int::MiniModelCount::CreateHelp class to create and register tests
Test::Int::MiniModelCount::IntArrayIntTest number of several equal integers equal to integer
Test::Int::MiniModelCount::IntArrayVarTest number of several equal integers equal to integer variable
Test::Int::MiniModelCount::IntIntTest number of equal integers equal to integer
Test::Int::MiniModelCount::IntVarTest number of equal integers equal to integer variable
Test::Int::MiniModelCount::VarIntTest number of equal variables equal to integer
Test::Int::MiniModelCount::VarVarTest number of equal variables equal to integer variable
Test::Int::MiniModelLin::CreateHelp class to create and register tests
Test::Int::MiniModelLin::LinExprBoolTest linear expressions over Boolean variables
Test::Int::MiniModelLin::LinExprIntTest linear expressions over integer variables
Test::Int::MiniModelLin::LinExprMixedTest linear expressions over integer and Boolean variables
Test::Int::MiniModelLin::LinInstrType for representing a linear instruction
Test::Int::MiniModelLin::LinRelBoolTest linear relations over Boolean variables
Test::Int::MiniModelLin::LinRelIntTest linear relations over integer variables
Test::Int::MiniModelLin::LinRelMixedTest linear relations over integer and Boolean variables
Test::Int::MiniModelSet::CreateHelp class to create and register tests
Test::Int::MiniModelSet::SetExprConstTest set expressions with constant result
Test::Int::MiniModelSet::SetExprExprTest set expressions with expression result
Test::Int::MiniModelSet::SetInstrType for representing a set instruction
Test::Int::NoOverlap::CreateHelp class to create and register tests
Test::Int::NoOverlap::Int2Test for no-overlap with integer dimensions (rectangles)
Test::Int::NoOverlap::IntOpt2Test for no-overlap with optional rectangles
Test::Int::NoOverlap::Var2Test for no-overlap with variable dimensions (rectangles)
Test::Int::NoOverlap::VarOpt2Test for no-overlap with optional rectangles
Test::Int::NValues::BoolIntTest number of values of Boolean variables equal to integer
Test::Int::NValues::BoolVarTest number of values of Boolean variables equal to integer variable
Test::Int::NValues::CreateHelp class to create and register tests
Test::Int::NValues::IntIntTest number of values of integer variables equal to integer
Test::Int::NValues::IntVarTest number of values of integer variables equal to integer variable
Test::Int::Precede::MultiTest for multiple value precedence constraint
Test::Int::Precede::SingleTest for single value precedence constraint
Test::Int::RandomAssignmentGenerate random selection of assignments
Test::Int::RandomMixAssignmentGenerate random selection of assignments
Test::Int::Rel::BoolArrayTest for relation between arrays of Boolean variables
Test::Int::Rel::BoolIntTest for simple relation involving Boolean variable and integer constant
Test::Int::Rel::BoolSeqTest for sequence of relations between Boolean variables
Test::Int::Rel::BoolSharedSeqTest for sequence of relations between shared Boolean variables
Test::Int::Rel::BoolVarXXTest for simple relation involving shared Boolean variables
Test::Int::Rel::BoolVarXYTest for simple relation involving Boolean variables
Test::Int::Rel::CreateHelp class to create and register tests
Test::Int::Rel::IntArrayTest for relation between same sized arrays of integer variables
Test::Int::Rel::IntArrayDiffTest for relation between differently sized arrays of integer variables
Test::Int::Rel::IntIntTest for simple relation involving integer variable and integer constant
Test::Int::Rel::IntSeqTest for sequence of relations between integer variables
Test::Int::Rel::IntSharedSeqTest for sequence of relations between shared integer variables
Test::Int::Rel::IntVarXXTest for simple relation involving shared integer variables
Test::Int::Rel::IntVarXYTest for simple relation involving integer variables
Test::Int::Sequence::CreateHelp class to create and register tests
Test::Int::Sequence::SequenceBoolTestTest for sequence with boolean variables
Test::Int::Sequence::SequenceIntTestTest for sequence with boolean variables
Test::Int::Sequence::SequenceTestBase test for sequence
Test::Int::Sorted::NoVarTest sorted without permutation variables
Test::Int::Sorted::PermVarTest sorted with permutation variables
Test::Int::Sorted::SortIntMinRelation for sorting integers in increasing order
Test::Int::TestBase class for tests with integer constraints
Test::Int::TestSpaceSpace for executing tests
Test::Int::Unary::ManFixPUnaryTest for unary constraint
Test::Int::Unary::ManFlexUnaryTest for unary constraint
Test::Int::Unary::OptFixPUnaryTest for unary constraint with optional tasks
Test::Int::Unary::OptFlexUnaryTest for unary constraint with optional tasks
Test::Int::Unshare::BoolTest for unsharing Boolean variables
Test::Int::Unshare::IntTest for unsharing integer variables
Test::OptionsCommandline options
Test::Search::Best< Model, Engine >Test for best solution search
Test::Search::BranchTypesIterator for branching types
Test::Search::ConstrainTypesIterator for constrain types
Test::Search::CreateHelp class to create and register tests
Test::Search::DFS< Model >Test for depth-first search
Test::Search::FailImmediateSpace that immediately fails
Test::Search::HasSolutionsSpace that requires propagation and has solutions
Test::Search::TestBase class for search tests
Test::Search::TestSpaceSpace with information
Test::Set::Convex::ConvexTest for convexity propagator
Test::Set::Convex::ConvexHullTest for convex hull propagator
Test::Set::Convex::ConvexHullSSharing test for convex hull propagator
Test::Set::CountableSetIterate all subsets of a given set
Test::Set::CountableSetRangesRange iterator producing subsets of an IntSet
Test::Set::CountableSetValuesValue iterator producing subsets of an IntSet
Test::Set::Distinct::AtmostOneTest for the atmostone propagator
Test::Set::Dom::CardRangeTest for cardinality range
Test::Set::Dom::DomDomTest for equality with a domain
Test::Set::Dom::DomIntTest for equality with an integer
Test::Set::Dom::DomIntRangeTest for equality with an integer range
Test::Set::Dom::DomRangeTest for equality with a range
Test::Set::Element::ElementDisjointTest for ElementDisjoint constraint
Test::Set::Element::ElementInterTest for ElementInter constraint
Test::Set::Element::ElementInterInTest for ElementInter constraint
Test::Set::Element::ElementSetTest for ElementSet constraint
Test::Set::Element::ElementSetConstTest for ElementSetConst constraint
Test::Set::Element::ElementUnionTest for ElementUnion constraint
Test::Set::Element::ElementUnionConstTest for ElementUnionConst constraint
Test::Set::Element::MatrixIntSetTest for matrix element with integer set array and set variable
Test::Set::Exec::WaitSimple test for wait (set variables)
Test::Set::FakeSpaceFake space for creation of regions
Test::Set::Int::CardTest for cardinality constraint
Test::Set::Int::ChannelBoolTest for Boolean channel constraint
Test::Set::Int::ChannelIntTest for integer channel constraint
Test::Set::Int::ElemTest for element constraint
Test::Set::Int::IntRelTest for integer relation constraint
Test::Set::Int::MatchTest for match constraint
Test::Set::Int::MaxTest for maximal element constraint
Test::Set::Int::MinTest for minimal element constraint
Test::Set::Int::NoElemTest for negated element constraint
Test::Set::Int::NotMaxTest for negated maximal element constraint
Test::Set::Int::NotMinTest for negated minimal element constraint
Test::Set::Int::RelTest for relation constraint
Test::Set::Int::WeightsTest for set weight constraint
Test::Set::Precede::MultiTest for multiple value precedence constraint
Test::Set::Precede::SingleTest for single value precedence constraint
Test::Set::Rel::RelBinTest for binary set relation constraint
Test::Set::RelOp::CreateHelp class to create and register tests
Test::Set::RelOp::CreateIntNHelp class to create and register tests
Test::Set::RelOp::CreateNHelp class to create and register tests
Test::Set::RelOp::RelTest for ternary relation constraint
Test::Set::RelOp::RelIntNTest for n-ary partition constraint
Test::Set::RelOp::RelNTest for n-ary partition constraint
Test::Set::RelOpConst::CreateHelp class to create and register tests
Test::Set::RelOpConst::RelISITest for set relation constraint with constants
Test::Set::RelOpConst::RelSISTest for set relation constraint with constants
Test::Set::RelOpConst::RelSSITest for set relation constraint with constants
Test::Set::Sequence::SeqUTest for sequential-union constraint
Test::Set::Sequence::SequenceTest for sequence constraint
Test::Set::SetAssignmentGenerate all set assignments
Test::Set::SetOpTypesIterator for Boolean operation types
Test::Set::SetRelTypesIterator for set relation types
Test::Set::SetTestBase class for tests with set constraints
Test::Set::SetTestSpaceSpace for executing set tests
Test::Set::Var::ConstructTest for cardinality constraint
Test::SortByNameSort tests by name
TileSpecSpecification of one tile
TSPExample: Travelling salesman problem (TSP)
WarehousesExample: Locating warehouses
WarnsdorffCustom brancher for knight's tours using Warnsdorff's rule
Warnsdorff::ChoiceChoice
WordSquareExample: Word-square puzzle