Generated on Fri Oct 19 11:25:38 2018 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
ArchimedeanSpiralExample: Archimedean spiral
BACPExample: The balanced academic curriculum problem
BIBDExample: Balanced incomplete block design (BIBD)
BIBDOptionsOptions for BIBD problems
BinPackingExample: Bin packing
BlackHoleExample: Black hole patience
CarSequencingExample: Car sequencing
CartesianHeartExample: Cartesian Heart
CDBFCustom brancher implementing CDBF
CDBF::ChoiceChoice
ColoredMatrixExample: Colored matrix example
ColoredMatrixOptionsColoredMatrixOptions
CourseA course
CrewExample: Airline crew allocation
CrosswordExample: Crossword puzzle
CrowdedChessExample: Crowded chessboard
CurriculumA curriculum
DescartesFoliumExample: Folium of Descartes
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::ActionClass for action management
Gecode::Action::Recorder< View >Propagator for recording action information
Gecode::Action::Recorder< View >::IdxAdvisor with index and change information
Gecode::Action::StorageObject for storing action values
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::AFCClass for AFC (accumulated failure count) management
Gecode::AllVarConfConfiguration for all variable implementations
Gecode::ArchiveArchive representation
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< FloatVal > >Traits of FloatValArgs
Gecode::ArrayTraits< ArgArray< int > >Traits of IntArgs
Gecode::ArrayTraits< ArgArray< IntSet > >Traits of IntSetArgs
Gecode::ArrayTraits< ArgArray< SEB > >Traits of SEBs
Gecode::ArrayTraits< ArgArray< SymmetryHandle > >Traits of Symmetries
Gecode::ArrayTraits< ArgArray< TaskType > >Traits of TaskTypeArgs
Gecode::ArrayTraits< ArgArray< VarImpBase * > >Traits of ArgArray<VarImpBase*>
Gecode::ArrayTraits< BoolVarArgs >Traits of BoolVarArgs
Gecode::ArrayTraits< BoolVarArray >Traits of BoolVarArray
Gecode::ArrayTraits< FloatValArgs >Traits of FloatValArgs
Gecode::ArrayTraits< FloatVarArgs >Traits of FloatVarArgs
Gecode::ArrayTraits< FloatVarArray >Traits of FloatVarArray
Gecode::ArrayTraits< IntArgs >Traits of IntArgs
Gecode::ArrayTraits< IntVarArgs >Traits of IntVarArgs
Gecode::ArrayTraits< IntVarArray >Traits of IntVarArray
Gecode::ArrayTraits< LiteralArgs >Traits of LiteralArgs
Gecode::ArrayTraits< SEBs >Traits of SEBs
Gecode::ArrayTraits< SetVarArgs >Traits of SetVarArgs
Gecode::ArrayTraits< SetVarArray >Traits of SetVarArray
Gecode::ArrayTraits< VarArgArray< BoolVar > >Traits of BoolVarArgs
Gecode::ArrayTraits< VarArgArray< FloatVar > >Traits of FloatVarArgs
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< FloatVar > >Traits of FloatVarArray
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::BoolActionRecording actions for Boolean variables
Gecode::BoolAFCRecording AFC information for Boolean variables
Gecode::BoolAssignWhich values to select for assignment
Gecode::BoolCHBRecording CHB for Boolean variables
Gecode::BoolExprBoolean expressions
Gecode::BoolExpr::MiscMiscealloneous Boolean expressions
Gecode::BoolExpr::NodeNode for Boolean expression
Gecode::BoolTraceDeltaTrace delta information for Boolean variables
Gecode::BoolValBranchWhich values to select for branching first
Gecode::BoolVarBoolean integer variables
Gecode::BoolVarArgsPassing Boolean variables
Gecode::BoolVarArrayBoolean variable array
Gecode::BoolVarBranchWhich Boolean variable to select for branching
Gecode::BrancherBase-class for branchers
Gecode::BrancherFilter< View >Class storing a branch filter function
Gecode::BrancherGroupGroup of branchers
Gecode::BrancherNoFilter< View >Class withot a branch filter function
Gecode::BrancherNoPrint< View, Val >Class without print function
Gecode::BrancherPrint< View, Val >Class storing a print function
Gecode::BranchersClass to iterate over branchers in a group
Gecode::BranchTraits< Var >Traits for branching
Gecode::BranchTraits< BoolVar >Traits of BoolVar for branching
Gecode::BranchTraits< FloatVar >Traits of FloatVar for branching
Gecode::BranchTraits< IntVar >Traits of IntVar for branching
Gecode::BranchTraits< SetVar >Traits of SetVar for branching
Gecode::CHBClass for CHB management
Gecode::CHB::InfoView information
Gecode::CHB::Recorder< View >Propagator for recording chb information
Gecode::CHB::Recorder< View >::IdxAdvisor with index and change information
Gecode::CHB::StorageObject for storing chb information
Gecode::ChoiceChoice for performing commit
Gecode::ChooseMaxChoose views with larger merit values
Gecode::ChooseMinChoose views with smaller merit values
Gecode::CloneStatisticsStatistics for execution of clone
Gecode::CommitStatisticsStatistics for execution of commit
Gecode::CommitTraceInfoCommit trace information
Gecode::ConstView< View >Base-class for constant views
Gecode::Council< A >Council of advisors
Gecode::CPProfiler::Connector
Gecode::CPProfiler::MessageMessage for the CP Profiler
Gecode::CPProfiler::MessageMarshalling
Gecode::CPProfiler::Node
Gecode::CPProfiler::NodeUIDUnique identifier for a node
Gecode::CPProfiler::Option< T >Optional value class
Gecode::CPProfilerSearchTracerClass to record search trace info for CPProfiler
Gecode::CPProfilerSearchTracer::GetInfoClass to send solution information to CPProfiler
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::CombinedStopStop object based on nodes, failures, and time
Gecode::Driver::DoubleOptionDouble option
Gecode::Driver::EngineToMeta< T, E >Wrapper class to add engine template argument
Gecode::Driver::ExtractStepOption< BaseSpace >Class to extract the step option value
Gecode::Driver::GistEngine< Engine >Traits class for search engines
Gecode::Driver::GistEngine< BAB< S > >Specialization for BAB
Gecode::Driver::GistEngine< DFS< S > >Specialization for DFS
Gecode::Driver::GistEngine< LDS< S > >Specialization for LDS
Gecode::Driver::IgnoreStepOption< BaseSpace >Class to ignore the step option value
Gecode::Driver::IntOptionInteger option
Gecode::Driver::IplOptionInteger propagation level option
Gecode::Driver::ScriptBase< BaseSpace >Parametric base-class for scripts
Gecode::Driver::ScriptGetInfo< BaseSpace >Class to send solution information to CPProfiler for a script
Gecode::Driver::StringOptionString-valued option (integer value defined by strings)
Gecode::Driver::StringOption::ValueOption value
Gecode::Driver::StringValueOptionString-valued option
Gecode::Driver::TraceOptionTrace flag option
Gecode::Driver::UnsignedIntOptionUnsigned integer option
Gecode::DynamicCastFailedException: dynamic cast failed
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::AuxVarBrancherBranching on the introduced variables
Gecode::FlatZinc::AuxVarBrancher::ChoiceChoice that only signals failure or success
Gecode::FlatZinc::BoolVarSpecSpecification for Boolean variables
Gecode::FlatZinc::BranchInformation
Gecode::FlatZinc::BranchInformationO
Gecode::FlatZinc::ConExprAbstract representation of a constraint
Gecode::FlatZinc::ErrorException class for FlatZinc errors
Gecode::FlatZinc::FlatZincGetInfo
Gecode::FlatZinc::FlatZincOptionsOptions for running FlatZinc models
Gecode::FlatZinc::FlatZincSpaceA space that can be initialized with a FlatZinc model
Gecode::FlatZinc::FlatZincSpaceInitData
Gecode::FlatZinc::FloatVarSpecSpecification for floating point variables
Gecode::FlatZinc::FZPrintingComparator< S >
Gecode::FlatZinc::FZPrintingInspector< S >An inspector for printing simple text output
Gecode::FlatZinc::GistEngine< Engine >Traits class for search engines
Gecode::FlatZinc::GistEngine< BAB< S > >Specialization for BAB
Gecode::FlatZinc::GistEngine< DFS< S > >Specialization for DFS
Gecode::FlatZinc::IntBoolBrancher< Merit >Brancher for integer and Boolean views
Gecode::FlatZinc::IntBoolBrancherBaseBase-class for brancher for integer and Boolean views
Gecode::FlatZinc::IntBoolVarBranchWhich integer or Boolean variable to select for branching
Gecode::FlatZinc::IntVarSpecSpecification for integer variables
Gecode::FlatZinc::MeritMaxActionSelect by maximal Action
Gecode::FlatZinc::MeritMaxActionSizeSelect by maximal Action over size
Gecode::FlatZinc::MeritMaxAFCSelect by maximal AFC
Gecode::FlatZinc::MeritMaxAFCSizeSelect by maximal AFC over size
Gecode::FlatZinc::MeritMaxCHBSelect by maximal CHB
Gecode::FlatZinc::MeritMaxCHBSizeSelect by maximal CHB over size
Gecode::FlatZinc::Option< Val >Optional value
Gecode::FlatZinc::OutputOrderStrict weak ordering for output items
Gecode::FlatZinc::ParserStateState of the FlatZinc parser
Gecode::FlatZinc::PosIntChoiceChoice storing position and value
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::Float::ArgumentSameException: Arguments contain same variable multiply
Gecode::Float::ArgumentSizeMismatchException: Arguments are of different size
Gecode::Float::Arithmetic::Abs< A, B >Propagator for bounds consistent absolute operator
Gecode::Float::Arithmetic::Div< A, B, C >Propagator for bounds division operator
Gecode::Float::Arithmetic::Max< A, B, C >Propagator for bounds consistent max operator
Gecode::Float::Arithmetic::Min< A, B, C >Propagator for bounds consistent min operator
Gecode::Float::Arithmetic::Mult< View >Bounds consistent multiplication propagator
Gecode::Float::Arithmetic::MultPlus< VA, VB, VC >Bounds consistent positive multiplication propagator
Gecode::Float::Arithmetic::MultZeroOne< View >Bounds or domain consistent propagator for $x_0\times x_1=x_0$
Gecode::Float::Arithmetic::NaryMax< View >Bounds consistent n-ary maximum propagator
Gecode::Float::Arithmetic::NthRoot< A, B >Propagator for bounds consistent nth root operator
Gecode::Float::Arithmetic::Pow< A, B >Propagator for bounds consistent pow operator
Gecode::Float::Arithmetic::Sqr< View >Propagator for bounds consistent square operator
Gecode::Float::Arithmetic::SqrPlus< VA, VB >Bounds consistent positive square propagator
Gecode::Float::Arithmetic::Sqrt< A, B >Propagator for bounds consistent square root operator
Gecode::Float::Bool::Ite< View >If-then-else propagator
Gecode::Float::Branch::MeritActionSizeMerit class for action over size
Gecode::Float::Branch::MeritAFCSizeMerit class for AFC over size
Gecode::Float::Branch::MeritCHBSizeMerit class for CHB Q-score over size
Gecode::Float::Branch::MeritDegreeSizeMerit class for degree over size
Gecode::Float::Branch::MeritMaxMerit class for maximum of float view
Gecode::Float::Branch::MeritMinMerit class for mimimum
Gecode::Float::Branch::MeritSizeMerit class for size of float view
Gecode::Float::Branch::ValCommitLqGqValue commit class for less or equal or greater or equal
Gecode::Float::Branch::ValSelGqValue selection class for values smaller than median of view
Gecode::Float::Branch::ValSelLqValue selection class for values smaller than median of view
Gecode::Float::Branch::ValSelRndValue selection class for random value of view
Gecode::Float::Channel::Channel< A, B >Propagator for bounds consistent integer part operator
Gecode::Float::FloatDeltaFloat delta information for advisors
Gecode::Float::FloatTraceViewFloat trace view
Gecode::Float::FloatVarImpFloat variable implementation
Gecode::Float::FloatVarImpBaseBase-class for Float-variable implementations
Gecode::Float::FloatVarImpConfConfiguration for Float-variable implementations
Gecode::Float::FloatViewFloat view for float variables
Gecode::Float::IllegalOperationException: Illegal operation passed as argument
Gecode::Float::Linear::Eq< P, N >Propagator for bounds consistent n-ary linear equality
Gecode::Float::Linear::Lin< P, N, pc >Base-class for n-ary linear propagators
Gecode::Float::Linear::Lq< P, N >Propagator for bounds consistent n-ary linear less or equal
Gecode::Float::Linear::TermClass for describing linear term $a\cdot x$
Gecode::Float::Linear::TermLessSort linear terms by view
Gecode::Float::MinusViewMinus float view
Gecode::Float::OffsetViewOffsetView float view
Gecode::Float::OutOfLimitsException: Value out of limits
Gecode::Float::Rel::Eq< View0, View1 >Binary bounds consistent equality propagator
Gecode::Float::Rel::Le< View >Less propagator
Gecode::Float::Rel::Lq< View >Less or equal propagator
Gecode::Float::Rel::NaryEq< View >N-ary bounds consistent equality propagator
Gecode::Float::Rel::Nq< View0, View1 >Binary bounds consistent disequality propagator
Gecode::Float::Rel::NqFloat< View >Binary bounds consistent disequality propagator with float value
Gecode::Float::Rel::ReEq< View, CtrlView, rm >Reified binary bounds consistent equality propagator
Gecode::Float::Rel::ReEqFloat< View, CtrlView, rm >Reified bounds consistent equality with float propagator
Gecode::Float::Rel::ReLeFloat< View, CtrlView, rm >Reified less with float propagator
Gecode::Float::Rel::ReLq< View, CtrlView, rm >Reified less or equal propagator
Gecode::Float::Rel::ReLqFloat< View, CtrlView, rm >Reified less or equal with float propagator
Gecode::Float::RelaxClass for posting equalities for non-relaxed variables
Gecode::Float::RoundingFloating point rounding policy
Gecode::Float::ScaleViewScale float view
Gecode::Float::TooFewArgumentsException: Too few arguments available in argument array
Gecode::Float::Transcendental::Exp< A, B >Propagator for bounds consistent exp operator
Gecode::Float::Transcendental::Pow< A, B >Propagator for bounds consistent pow operator
Gecode::Float::Trigonometric::ACos< A, B >Propagator for bounds consistent arc cosinus operator
Gecode::Float::Trigonometric::ASin< A, B >Propagator for bounds consistent arc sinus operator
Gecode::Float::Trigonometric::ATan< A, B >Propagator for bounds consistent arc tangent operator
Gecode::Float::Trigonometric::Cos< A, B >Propagator for bounds consistent cosinus operator
Gecode::Float::Trigonometric::Sin< A, B >Propagator for bounds consistent sinus operator
Gecode::Float::Trigonometric::Tan< A, B >Propagator for bounds consistent tangent operator
Gecode::Float::UnknownBranchingException: Unknown value or variable selection passed as argument
Gecode::Float::UnknownOperationException: Unknown operation passed as argument
Gecode::Float::UnknownRelationException: Unknown relation passed as argument
Gecode::Float::ValOfUnassignedVarException: Attempt to access value of unassigned variable
Gecode::Float::ValueMixedSignException: Value with mixed sign
Gecode::Float::VariableEmptyDomainException: Variable created with empty domain
Gecode::FloatActionRecording actions for float variables
Gecode::FloatAFCRecording AFC information for float variables
Gecode::FloatAssignWhich values to select for assignment
Gecode::FloatCHBRecording CHB for float variables
Gecode::FloatMaximizeSpaceClass for maximizing float cost
Gecode::FloatMinimizeSpaceClass for minimizing float cost
Gecode::FloatNumBranchValue description class for branching
Gecode::FloatTraceDeltaTrace delta information for float variables
Gecode::FloatValFloat value type
Gecode::FloatValArgsPassing float arguments
Gecode::FloatValBranchWhich values to select for branching first
Gecode::FloatVarFloat variables
Gecode::FloatVarArgsPassing float variables
Gecode::FloatVarArrayFloat variable array
Gecode::FloatVarBranchWhich variable to select for branching
Gecode::FreeListBase-class for freelist-managed objects
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::BranchLabelCursorA cursor that labels branches
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::GroupGroup baseclass for controlling actors
Gecode::HeapHeap memory management class
Gecode::HeapAllocatedBase class for heap allocated objects
Gecode::HomeHome class for posting propagators
Gecode::IllegalDecayException: illegal decay factor
Gecode::InstanceOptionsOptions for scripts with additional instance parameter
Gecode::Int::AlreadyFinalizedException: Tuple set already finalized
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::ArgMax< VA, VB, tiebreak >Argument maximum propagator
Gecode::Int::Arithmetic::DivBnd< View >Bounds consistent division propagator
Gecode::Int::Arithmetic::DivMod< View >Integer division/modulo propagator
Gecode::Int::Arithmetic::DivPlusBnd< 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::MultBndBounds consistent multiplication propagator
Gecode::Int::Arithmetic::MultDomDomain consistent multiplication propagator
Gecode::Int::Arithmetic::MultPlusBnd< VA, VB, VC >Bounds consistent positive multiplication propagator
Gecode::Int::Arithmetic::MultPlusDom< 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::NrootBnd< Ops >Bounds consistent n-th root propagator
Gecode::Int::Arithmetic::NrootDom< Ops >Domain consistent n-th root propagator
Gecode::Int::Arithmetic::NrootPlusBnd< Ops, minus >Positive bounds consistent n-th root propagator
Gecode::Int::Arithmetic::NrootPlusDom< Ops, minus >Domain consistent n-th root propagator
Gecode::Int::Arithmetic::PowBnd< Ops >Bounds consistent power propagator
Gecode::Int::Arithmetic::PowDom< Ops >Domain consistent power propagator
Gecode::Int::Arithmetic::PowOpsOperations for power and nroot propagators
Gecode::Int::Arithmetic::PowPlusBnd< VA, VB, Ops >Bounds consistent positive power propagator
Gecode::Int::Arithmetic::PowPlusDom< VA, VB, Ops >Domain consistent positive power propagator
Gecode::Int::Arithmetic::RangesMapNroot< Ops >Mapping integer to n-th root
Gecode::Int::Arithmetic::RangesMapPow< Ops >Mapping ranges to powers
Gecode::Int::Arithmetic::SqrOpsOperations for square and square-root propagators
Gecode::Int::Arithmetic::ValuesMapNroot< Ops >Mapping integer (must be an n-th power) to n-th root
Gecode::Int::Arithmetic::ValuesMapNrootSigned< Ops >Mapping integer (must be an n-th power) to n-th root (signed)
Gecode::Int::Arithmetic::ValuesMapPow< Ops >Mapping integer to power
Gecode::Int::BinPacking::ConflictGraphGraph containing conflict information
Gecode::Int::BinPacking::ConflictGraph::CliqueClique information
Gecode::Int::BinPacking::ConflictGraph::NodeClass for node in graph
Gecode::Int::BinPacking::ConflictGraph::NodesIterator over node sets
Gecode::Int::BinPacking::ConflictGraph::NodeSetSets of graph nodes
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::IteBase< V0, V1, V2, pc >If-then-else propagator base-class
Gecode::Int::Bool::IteBnd< V0, V1, V2 >If-then-else bounds-consistent propagator
Gecode::Int::Bool::IteDom< V0, V1, V2 >If-then-else domain-consistent 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::BoolTraceViewDuplicate of a Boolean view
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::EqNGL< View >No-good literal for equality
Gecode::Int::Branch::GqNGL< View >No-good literal for greater or equal
Gecode::Int::Branch::LqNGL< View >No-good literal for less or equal
Gecode::Int::Branch::MeritActionSize< View >Merit class for action over size
Gecode::Int::Branch::MeritAFCSize< View >Merit class for AFC over size
Gecode::Int::Branch::MeritCHBSize< View >Merit class for CHB over size
Gecode::Int::Branch::MeritDegreeSize< View >Merit class for degree over size
Gecode::Int::Branch::MeritMax< View >Merit class for maximum
Gecode::Int::Branch::MeritMin< View >Merit class for mimimum of integer views
Gecode::Int::Branch::MeritRegretMax< View >Merit class for maximum regret
Gecode::Int::Branch::MeritRegretMin< View >Merit class for minimum regret
Gecode::Int::Branch::MeritSize< View >Merit class for size
Gecode::Int::Branch::NqNGL< View >No-good literal for disequality
Gecode::Int::Branch::PosValuesChoiceChoice storing position and values for integer views
Gecode::Int::Branch::ValCommitEq< View >Value commit class for equality
Gecode::Int::Branch::ValCommitGq< View >Value commit class for greater or equal
Gecode::Int::Branch::ValCommitGr< View >Value commit class for greater
Gecode::Int::Branch::ValCommitLq< View >Value commit class for less or equal
Gecode::Int::Branch::ValSelAvg< View >Value selection class for average of view
Gecode::Int::Branch::ValSelMax< View >Value selection class for maximum of view
Gecode::Int::Branch::ValSelMed< View >Value selection class for median of view
Gecode::Int::Branch::ValSelMin< View >Value selection class for mimimum of view
Gecode::Int::Branch::ValSelRangeMaxValue selection class for maximum range of integer view
Gecode::Int::Branch::ValSelRangeMinValue selection class for minimum range of integer view
Gecode::Int::Branch::ValSelRnd< View >Value selection class for random value of view
Gecode::Int::Branch::ViewValuesBrancher< n, min, Filter, Print >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::NodeInfo< 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::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, PL >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, PL >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::EqIteEqual-if-then-else domain-consistent propagator
Gecode::Int::Distinct::Graph< View >View-value graph for propagation
Gecode::Int::Distinct::HallInfo< IntType >Information 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, rm >Reified domain dom-propagator
Gecode::Int::Dom::ReRange< View, rm >Reified range dom-propagator
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::EventTime-tabling event for task
Gecode::Int::Exec::WhenConditional propagator
Gecode::Int::Extensional::BitSet< IndexType >Bit-set
Gecode::Int::Extensional::Compact< View, pos >Base class for compact table propagator
Gecode::Int::Extensional::Compact< View, pos >::CTAdvisorAdvisor for updating current table
Gecode::Int::Extensional::Compact< View, pos >::LostSupportsIterator over lost supports
Gecode::Int::Extensional::Compact< View, pos >::ValidSupportsIterator over valid supports
Gecode::Int::Extensional::GroupStatesGroupStates is used to index StateGroup by group
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::NegCompact< View, Table >Domain consistent negative extensional propagator
Gecode::Int::Extensional::PosCompact< View, Table >Domain consistent positive extensional propagator
Gecode::Int::Extensional::PosCompact< View, Table >::StatusStatus management
Gecode::Int::Extensional::PosCompareTuple comparison by position
Gecode::Int::Extensional::ReCompact< View, Table, CtrlView, rm >Domain consistent reified extensional propagator
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::TinyBitSet< _size >Tiny bit-set
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::TupleCompareTuple comparison
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::IdxView< View >Class for pair of index and view
Gecode::Int::IdxViewArray< View >An array of IdxView pairs
Gecode::Int::IllegalOperationException: Illegal operation passed as argument
Gecode::Int::IntDeltaInteger delta information for advisors
Gecode::Int::IntTraceViewDuplicate of an integer view
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::LDSB::LDSBBrancher< View, n, Val, a, Filter, Print >Symmetry-breaking brancher with generic view and value selection
Gecode::Int::LDSB::LDSBChoice< Val >Choice storing position and value, and symmetric literals to be excluded on the right branch
Gecode::Int::LDSB::LiteralA Literal is a pair of variable index and value
Gecode::Int::LDSB::SymmetryImp< View >Implementation of a single symmetry
Gecode::Int::LDSB::SymmetryObjectImplementation of a symmetry at the modelling level
Gecode::Int::LDSB::ValueSequenceSymmetryImp< View >Implementation of a value sequence symmetry
Gecode::Int::LDSB::ValueSequenceSymmetryObjectImplementation of a value sequence symmetry at the modelling level
Gecode::Int::LDSB::ValueSymmetryImp< View >Implementation of a value symmetry
Gecode::Int::LDSB::ValueSymmetryObjectImplementation of a value symmetry at the modelling level
Gecode::Int::LDSB::VariableMapMap from variable implementation to index
Gecode::Int::LDSB::VariableSequenceSymmetryImp< View >Implementation of a variable sequence symmetry
Gecode::Int::LDSB::VariableSequenceSymmetryObjectImplementation of a variable sequence symmetry at the modelling level
Gecode::Int::LDSB::VariableSymmetryImp< View >Implementation of a variable symmetry
Gecode::Int::LDSB::VariableSymmetryObjectImplementation of a variable symmetry at the modelling level
Gecode::Int::LDSBBadValueSelectionException: Value selection incompatible with LDSB
Gecode::Int::LDSBUnbranchedVariableException: Variable in symmetry not branched on
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, rm >Propagator for reified bounds consistent n-ary linear equality
Gecode::Int::Linear::ReEqBin< Val, A, B, Ctrl, rm >Propagator for reified bounds consistent binary linear equality
Gecode::Int::Linear::ReEqBoolInt< VX, VB, rm >Propagator for reified integer equal to Boolean sum (cardinality)
Gecode::Int::Linear::ReGqBoolInt< VX, VB, rm >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, rm >Propagator for reified bounds consistent n-ary linear less or equal
Gecode::Int::Linear::ReLqBin< Val, A, B, rm >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, rm >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< Box >No-overlap propagator for mandatory boxes
Gecode::Int::NoOverlap::OptBox< Dim, n >Optional box class
Gecode::Int::NoOverlap::OptProp< Box >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::PLAClass for defining advanced propagation level
Gecode::Int::PLBClass for defining basic propagation level
Gecode::Int::PLBAClass for defining basic and advanced propagation level
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::EqVal< View0, View1 >Binary value propagation equality propagator
Gecode::Int::Rel::Le< V0, V1 >Less propagator
Gecode::Int::Rel::LexLqLe< VX, VY >Lexical ordering propagator
Gecode::Int::Rel::LexNq< VX, VY >Lexical disequality propagator
Gecode::Int::Rel::Lq< V0, V1 >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< V0, V1 >Binary disequality propagator
Gecode::Int::Rel::ReEqBnd< View, CtrlView, rm >Reified binary bounds consistent equality propagator
Gecode::Int::Rel::ReEqBndInt< View, CtrlView, rm >Reified bounds consistent equality with integer propagator
Gecode::Int::Rel::ReEqDom< View, CtrlView, rm >Reified binary domain consistent equality propagator
Gecode::Int::Rel::ReEqDomInt< View, CtrlView, rm >Reified domain consistent equality with integer propagator
Gecode::Int::Rel::ReLq< View, CtrlView, rm >Reified less or equal propagator
Gecode::Int::Rel::ReLqInt< View, CtrlView, rm >Reified less or equal with integer propagator
Gecode::Int::RelaxClass for posting equalities for non-relaxed variables
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, PL >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, PL >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, PL >Scheduling propagator for unary resource with optional tasks
Gecode::Int::UninitializedTupleSetException: uninitialized tuple set
Gecode::Int::UnknownBranchingException: Unknown value or variable selection passed as argument
Gecode::Int::UnknownOperationException: Unknown operation passed as argument
Gecode::Int::UnknownReifyModeException: Unknown reification mode 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< 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< LLongScaleView >Range iterator for long long int-precision scale integer 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::ViewToVarArg< View >Class to map VarArg type to view
Gecode::Int::ViewToVarArg< BoolView >VarArg type for Boolean views
Gecode::Int::ViewToVarArg< Gecode::Set::ConstSetView >VarArg type for constant Set views
Gecode::Int::ViewToVarArg< Gecode::Set::SetView >VarArg type for Set views
Gecode::Int::ViewToVarArg< Gecode::Set::SingletonView >VarArg type for singleton views
Gecode::Int::ViewToVarArg< IntView >VarArg type for integer views
Gecode::Int::ViewToVarArg< MinusView >VarArg type for minus 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::IntActionRecording actions for integer variables
Gecode::IntAFCRecording AFC information for integer variables
Gecode::IntArgsPassing integer arguments
Gecode::IntAssignWhich values to select for assignment
Gecode::IntCHBRecording CHB for integer variables
Gecode::IntLexMaximizeSpaceClass for lexicographically maximizing integer costs
Gecode::IntLexMinimizeSpaceClass for lexicographically minimizing integer costs
Gecode::IntMaximizeSpaceClass for maximizing integer cost
Gecode::IntMinimizeSpaceClass for minimizing integer cost
Gecode::IntSetInteger sets
Gecode::IntSet::MinIncSort ranges according to increasing minimum
Gecode::IntSetInit< I >Integer set initialization
Gecode::IntSetInit< IntArgs >Initialize integer set with integer arguments
Gecode::IntSetInit< IntSet >Initialize integer set with integer set
Gecode::IntSetRangesRange iterator for integer sets
Gecode::IntSetValuesValue iterator for integer sets
Gecode::IntTraceDeltaTrace delta information for integer variables
Gecode::IntValBranchWhich values to select for branching first
Gecode::IntVarInteger variables
Gecode::IntVarArgsPassing integer variables
Gecode::IntVarArrayInteger variable array
Gecode::IntVarBranchWhich integer variable to select for branching
Gecode::IntVarRangesRange iterator for integer variables
Gecode::IntVarValuesValue iterator for integer variables
Gecode::InvalidFunctionException: invalid function
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::BitSetOffset< BS >Value iterator for values in an offset 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::FunctionBranchBrancher for calling a function
Gecode::Kernel::FunctionBranch::DescriptionMinimal brancher description storing no information
Gecode::Kernel::GPIGlobal propagator information
Gecode::Kernel::GPI::InfoClass for storing propagator information
Gecode::Kernel::HeapChunkMemory chunk allocated from heap with proper alignment
Gecode::Kernel::MemoryChunkMemory chunk with size information
Gecode::Kernel::MemoryManagerManage memory for space
Gecode::Kernel::SharedMemoryShared object for several memory areas
Gecode::Kernel::SharedSpaceDataClass to store data shared among several spaces
Gecode::Kernel::SharedSpaceData::DataThe shared data
Gecode::LDS< T >Limited discrepancy search engine
Gecode::LinFloatExprFloat expressions
Gecode::LinFloatExpr::NodeNodes for linear expressions
Gecode::LinFloatRelLinear relations
Gecode::LinIntExprLinear expressions over integer variables
Gecode::LinIntExpr::NodeNodes for linear expressions
Gecode::LinIntRelLinear relations over integer variables
Gecode::LocalHandleHandles for local (space-shared) objects
Gecode::LocalObjectLocal (space-shared) object
Gecode::Matrix< A >Matrix-interface for arrays
Gecode::MemoryExhaustedException: Memory exhausted
Gecode::MeritAction< View >Merit class for action
Gecode::MeritAFC< View >Merit class for AFC
Gecode::MeritBase< _View, _Val >Base-class for merit class
Gecode::MeritCHB< View >Merit class for CHB
Gecode::MeritDegree< View >Merit class for degree
Gecode::MeritFunction< View >Merit class for user-defined merit function
Gecode::MetaInfoInformation passed by meta search engines
Gecode::MiniModel::ArgumentOutOfRangeException: Argument out of range
Gecode::MiniModel::ArgumentSizeMismatchException: Sizes of arguments does not match
Gecode::MiniModel::ArithNonLinFloatExprNon-linear float arithmetic expressions
Gecode::MiniModel::ArithNonLinIntExprNon-linear arithmetic expressions over integer variables
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::PosInfoInformation on positions collected during traversal
Gecode::MiniModel::PosSetSets of positions
Gecode::MiniModel::SetNonLinIntExprInteger 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::MoreThanOneTracerException: action has wrong arity
Gecode::NaryOnePropagator< View, pc >(n+1)-ary propagator
Gecode::NaryPropagator< View, pc >N-ary propagator
Gecode::NaryWait< View >Wait propagator for several views
Gecode::NGLNo-good literal recorded during search
Gecode::NoGoodsNo-goods recorded from restarts
Gecode::NoIdxVarImpConfConfiguration class for variable implementations without index structure
Gecode::NonLinFloatExprBase class for non-linear float expressions
Gecode::NonLinIntExprBase class for non-linear expressions over integer variables
Gecode::OperatingSystemErrorException: operating system error
Gecode::OptionsOptions for scripts
Gecode::Options::_IHelper class storing Gist inspectors
Gecode::PBS< T, E >Meta engine using a portfolio of search engines
Gecode::PosPosition information
Gecode::PosChoiceChoices storing position
Gecode::PostInfoClass to set group information when a post function is executed
Gecode::PosValChoice< Val >Choice storing position and value
Gecode::PropagateTraceInfoPropagate trace information
Gecode::PropagatorBase-class for propagators
Gecode::PropagatorGroupGroup of propagators
Gecode::PropagatorsClass to iterate over propagators in a group
Gecode::PropCostPropagation cost
Gecode::RangeListLists of ranges (intervals)
Gecode::RBS< T, E >Meta-engine performing restart-based search
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::ReifyReification specification
Gecode::RndRandom number generator
Gecode::Search::BabBuilder< T >A BAB engine builder
Gecode::Search::Base< T >Base-class for search engines
Gecode::Search::BuilderA class for building search engines
Gecode::Search::CutoffBase class for cutoff generators for restart-based meta engine
Gecode::Search::CutoffAppendCutoff generator appending two cutoff generators
Gecode::Search::CutoffConstantCutoff generator for constant sequence
Gecode::Search::CutoffGeometricCutoff generator for the geometric sequence
Gecode::Search::CutoffLinearCutoff generator for linear sequence
Gecode::Search::CutoffLubyCutoff generator for the Luby sequence
Gecode::Search::CutoffMergeCutoff generator merging two cutoff generators
Gecode::Search::CutoffRandomCutoff generator for the random sequence
Gecode::Search::CutoffRepeatCutoff generator that repeats a cutoff from another cutoff generator
Gecode::Search::DfsBuilder< T >A DFS engine builder
Gecode::Search::EdgeTraceRecorderRecorder for a search tracer with edge information
Gecode::Search::EngineSearch engine implementation interface
Gecode::Search::FailStopStop-object based on number of failures
Gecode::Search::LdsBuilder< T >A DFS engine builder
Gecode::Search::MixedBestException: Mixed non-best and best solution search requested
Gecode::Search::NoAssetsException: No assets requested for portfolio-based search
Gecode::Search::NoBestException: Best solution search is not supported
Gecode::Search::NodeStopStop-object based on number of nodes
Gecode::Search::NoGoodsPropNo-good propagator
Gecode::Search::NoNGLClass for a sentinel no-good literal
Gecode::Search::NoTraceRecorderEmpty trace recorder
Gecode::Search::NoTraceRecorder::IDClass for storing node identifiers
Gecode::Search::OptionsSearch engine options
Gecode::Search::Par::BAB< Tracer >Parallel branch-and-bound engine
Gecode::Search::Par::BAB< Tracer >::WorkerParallel branch-and-bound search worker
Gecode::Search::Par::CollectAllCollect all solutions
Gecode::Search::Par::CollectBestCollect best solutions
Gecode::Search::Par::DFS< Tracer >Parallel depth-first search engine
Gecode::Search::Par::DFS< Tracer >::WorkerParallel depth-first search worker
Gecode::Search::Par::Engine< Tracer >Parallel depth-first search engine
Gecode::Search::Par::Engine< Tracer >::WorkerParallel depth-first search worker
Gecode::Search::Par::Path< Tracer >Depth-first path (stack of edges) supporting recomputation
Gecode::Search::Par::Path< Tracer >::EdgeSearch tree edge for recomputation
Gecode::Search::Par::PBS< Collect >Parallel portfolio engine implementation
Gecode::Search::Par::PortfolioStopStop object used for controling slaves in a portfolio
Gecode::Search::Par::Slave< Collect >Runnable slave of a portfolio master
Gecode::Search::PbsBuilder< T, E >A PBS engine builder
Gecode::Search::RbsBuilder< T, E >A RBS engine builder
Gecode::Search::Seq::BAB< Tracer >Implementation of depth-first branch-and-bound search engine
Gecode::Search::Seq::Dead< Tracer >A dead engine (failed root)
Gecode::Search::Seq::DFS< Tracer >Depth-first search engine implementation
Gecode::Search::Seq::LDS< Tracer >Limited discrepancy search engine implementation
Gecode::Search::Seq::Path< Tracer >Depth-first path (stack of edges) supporting recomputation
Gecode::Search::Seq::Path< Tracer >::EdgeSearch tree edge for recomputation
Gecode::Search::Seq::PBS< best >Sequential portfolio engine implementation
Gecode::Search::Seq::PortfolioStopStop object used for controling slaves in a portfolio
Gecode::Search::Seq::Probe< Tracer >Probe engine for LDS
Gecode::Search::Seq::Probe< Tracer >::NodeNode in the search tree for LDS
Gecode::Search::Seq::RBSEngine for restart-based search
Gecode::Search::Seq::RestartStopStop-object for restart engine
Gecode::Search::Seq::SharedStopInfoShared stop information
Gecode::Search::Seq::SlaveRunnable slave of a portfolio master
Gecode::Search::StatisticsSearch engine statistics
Gecode::Search::StopBase-class for Stop-object
Gecode::Search::TimeStopStop-object based on time
Gecode::Search::TraceRecorderSimple recorder for a search tracer
Gecode::Search::TraceRecorder::IDClass for storing identifiers
Gecode::Search::UninitializedCutoffException: Uninitialized cutoff for restart-based search
Gecode::Search::WorkerSearch worker statistics
Gecode::Search::WorkerToEngine< Worker >Virtualize a worker to an engine
Gecode::Search::WrapTraceRecorderRecorder for engine events (for access control)
Gecode::SearchTracerSupport for tracing search
Gecode::SearchTracer::EdgeInfoEdge information
Gecode::SearchTracer::EngineInfoInformation about an engine
Gecode::SearchTracer::NodeInfoNode information
Gecode::SEBsPassing search engine builder arguments
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::ExcNGLNo-good literal for exclusion
Gecode::Set::Branch::IncNGLNo-good literal for inclusion
Gecode::Set::Branch::MeritActionSizeMerit class for action over size
Gecode::Set::Branch::MeritAFCSizeMerit class for AFC over size
Gecode::Set::Branch::MeritCHBSizeMerit class for CHB Q-score over size
Gecode::Set::Branch::MeritDegreeSizeMerit class for degree over size
Gecode::Set::Branch::MeritMaxMerit class for maximum of set view
Gecode::Set::Branch::MeritMinMerit class for mimimum of set views
Gecode::Set::Branch::MeritSizeMerit class for size of set view
Gecode::Set::Branch::ValCommitExcValue commit class for exclusion
Gecode::Set::Branch::ValCommitIncValue commit class for inclusion
Gecode::Set::Branch::ValSelMaxValue selection class for maximum of view
Gecode::Set::Branch::ValSelMedValue selection class for median of view
Gecode::Set::Branch::ValSelMinValue selection class for mimimum of view
Gecode::Set::Branch::ValSelRndValue selection class for random value of view
Gecode::Set::CachedView< View >Cached set view
Gecode::Set::Channel::ChannelBool< View >Propagator for channelling between set variable and its characteristic function
Gecode::Set::Channel::ChannelBool< View >::IndexAdvisorAdvisor storing a single index
Gecode::Set::Channel::ChannelInt< View >Propagator for channelling between variable-value-dual models
Gecode::Set::Channel::ChannelSet< View >Propagator for successors/predecessors channelling
Gecode::Set::Channel::ChannelSorted< View >Propagator for the sorted channel constraint
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::IntLessSort order for integers
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, rm >Reified propagator for maximum element
Gecode::Set::Int::ReMinElement< View, rm >Propagator for reified minimum element
Gecode::Set::Int::Weights< View >Propagator for weight of a set
Gecode::Set::LDSB::LDSBSetBrancher< View, n, Val, a, Filter, Print >Symmetry-breaking brancher with generic view and value selection
Gecode::Set::LDSB::VariableMapMap from variable implementation to index
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, CtrlView, rm >Reified equality propagator
Gecode::Set::Rel::ReLq< View0, View1, rm, strict >Reified propagator for set less than or equal
Gecode::Set::Rel::ReSubset< View0, View1, CtrlView, rm >Reified subset propagator
Gecode::Set::Rel::Subset< View0, View1 >Propagator for the subset constraint
Gecode::Set::RelaxClass for posting equalities for non-relaxed variables
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::SetTraceViewDuplicate of a set view
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::SetActionRecording actions for set variables
Gecode::SetAFCRecording AFC information for set variables
Gecode::SetAssignWhich value to select for assignment
Gecode::SetCHBRecording CHB for set variables
Gecode::SetCmpRelComparison relation (for two-sided comparisons)
Gecode::SetExprSet expressions
Gecode::SetExpr::NodeNode for set expression
Gecode::SetRelSet relations
Gecode::SetTraceDeltaTrace delta information for set variables
Gecode::SetTraceDelta::GlbDelta for the greatest lower bound
Gecode::SetTraceDelta::LubDelta for the least upper bound
Gecode::SetValBranchWhich values to select for branching first
Gecode::SetVarSet variables
Gecode::SetVarArgsPassing set variables
Gecode::SetVarArraySet variable array
Gecode::SetVarBranchWhich variable to select for branching
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::SharedData< Data >Class for sharing data between spaces
Gecode::SharedData< Data >::SDOThe object storing the actual data
Gecode::SharedHandleThe shared handle
Gecode::SharedHandle::ObjectThe shared object
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::IdlePropagatorsClass to iterate over idle propagators of a space
Gecode::Space::PropagatorsClass to iterate over propagators of a space
Gecode::Space::ScheduledPropagatorsClass to iterate over scheduled 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::SpaceFailedException: Operation on failed space invoked
Gecode::SpaceIllegalAlternativeException: Commit with illegal alternative
Gecode::SpaceNoBrancherException: Commit when no brancher present
Gecode::SpaceNotClonedException: Copy constructor did not call base class copy constructor
Gecode::SpaceNotStableException: Operation on not stable space invoked
Gecode::StatusStatisticsStatistics for execution of status
Gecode::StdBoolTracerStandard Boolean variable tracer
Gecode::StdFloatTracerStandard float variable tracer
Gecode::StdIntTracerStandard integer variable tracer
Gecode::StdSearchTracer
Gecode::StdSetTracerStandard set variable tracer
Gecode::StdTracerDefault tracer
Gecode::SubscribedPropagatorsIterator over subscribed propagators
Gecode::Support::AllocatorDefault memory allocator
Gecode::Support::BitSet< A >Simple bitsets
Gecode::Support::BitSetBaseBasic bitset support
Gecode::Support::BitSetDataDate item for bitsets
Gecode::Support::BitSetOffset< A >Bitsets with index offset
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::Job< RetType >Baseclass for jobs with return type RetType
Gecode::Support::JobStop< RetType >Class to throw an exception to stop new jobs from being started
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::RawBitSetBaseBasic bitset support (without stored size information)
Gecode::Support::RefCountA class for thread-safe reference counting
Gecode::Support::RunJobs< Jobs, RetType >Parallel iterator that runs jobs with a given number of threads
Gecode::Support::RunJobs< Jobs, RetType >::DeleterA class to delete the master (running in parallel)
Gecode::Support::RunJobs< Jobs, RetType >::Master
Gecode::Support::RunJobs< Jobs, RetType >::WorkerThe actual worker using a thread to run a job
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::TerminatorAn interface for objects that can be called after a thread has terminated (after running the thread's destructor)
Gecode::Support::ThreadSimple threads
Gecode::Support::Thread::RunA real thread
Gecode::Support::TimerTimer
Gecode::SymmetriesCollection of symmetries
Gecode::SymmetryHandleA reference-counted pointer to a SymmetryObject
Gecode::TernaryPropagator< View, pc >Ternary propagator
Gecode::TFETrace filter expressions
Gecode::TFE::NodeNode for trace filter expression
Gecode::TieBreak< VarBranch >Combine variable selection criteria for tie-breaking
Gecode::TooManyBranchersException: too many branchers
Gecode::TooManyGroupsException: too many groups
Gecode::TraceFilterTrace filters
Gecode::TraceFilter::TFOThe actual object storing the shared filters
Gecode::TraceFilter::TFO::FilterFilter information
Gecode::TraceFilter::TFO::StackFrame
Gecode::TracerTracer
Gecode::TracerBaseClass to provide synchronization
Gecode::TraceRecorderPropagator for recording trace information
Gecode::TraceTraits< View >Traits for tracing
Gecode::TraceTraits< Float::FloatView >Trace traits for float views
Gecode::TraceTraits< Int::BoolView >Trace traits for Boolean views
Gecode::TraceTraits< Int::IntView >Trace traits for integer views
Gecode::TraceTraits< Set::SetView >Trace traits for set views
Gecode::TupleSetClass represeting a set of tuples
Gecode::TupleSet::DataData stored for a Table
Gecode::TupleSet::RangeRange information
Gecode::TupleSet::RangesIterator over ranges
Gecode::TupleSet::ValueDataData about values in the table
Gecode::UnaryPropagator< View, pc >Unary propagator
Gecode::UnaryWait< View >Wait propagator for single view
Gecode::UninitializedActionException: uninitialized action
Gecode::UninitializedAFCException: uninitialized AFC
Gecode::UninitializedCHBException: uninitialized CHB
Gecode::UninitializedRndException: uninitialized random number generator
Gecode::UnknownBrancherException: unknown brancher
Gecode::UnknownPropagatorException: unknown propagator
Gecode::ValBranch< Var >Value branching information
Gecode::ValCommit< _View, _Val >Base class for value commit
Gecode::ValCommitFunction< View >Class for user-defined value commit
Gecode::ValSel< _View, _Val >Base class for value selection
Gecode::ValSelCommit< ValSel, ValCommit >Class for value selection and commit
Gecode::ValSelCommitBase< _View, _Val >Base class for value selection and commit
Gecode::ValSelFunction< View >User-defined value selection
Gecode::VarBase class for variables
Gecode::VarArgArray< Var >Argument array for variables
Gecode::VarArray< Var >Variable arrays
Gecode::VarBranch< Var >Variable branching information
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< View, Filter, n >Generic brancher by view selection
Gecode::ViewSel< _View >Abstract class for view selection
Gecode::ViewSelChoose< Choose, Merit >Choose view according to merit
Gecode::ViewSelChooseTbl< Choose, Merit >Choose view according to merit taking tie-break limit into account
Gecode::ViewSelMax< Merit >Select view with largest merit
Gecode::ViewSelMaxTbl< Merit >Select view with largest merit taking tie-break limit into account
Gecode::ViewSelMin< Merit >Select view with least merit
Gecode::ViewSelMinTbl< Merit >Select view with least merit taking tie-break limit into account
Gecode::ViewSelNone< View >Select the first unassigned view
Gecode::ViewSelRnd< View >Select a view randomly
Gecode::ViewTraceInfoView trace information
Gecode::ViewTracer< View >Tracer that process view trace information
Gecode::ViewTraceRecorder< View >Propagator for recording view trace information
Gecode::ViewTraceRecorder< View >::IdxAdvisor with index information
Gecode::ViewTraceRecorder< View >::SlackCollection of slack values
Gecode::ViewValBrancher< View, n, Val, a, Filter, Print >Generic brancher by view and value selection
Gecode::ViewValNGL< View, Val, pc >View-value no-good literal
GoldenSpiralExample: Golden spiral
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
IntLexMinimizeScript
IntMinimizeScript
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
LexCostWarehousesModel with cost defined lexicographically
MagicSequenceExample: Magic sequence
MagicSquareExample: Magic squares
ManFixPSETask
ManFixPTask
ManFlexTask
MineSweeperExample: Minesweeper
MoneyExample: SEND+MORE=MONEY puzzle
MultiBinPackingExample: Multi-dimensional bin packing
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 photo example
PlayEntry in round robin schedule
QCPExample: Quasigroup completion
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
SortByWeightSort orders by weight
SportsLeagueExample: Sports league scheduling
std::hash< Gecode::DFA >Hashing for DFAs
std::hash< Gecode::SharedArray< int > >Hashing for tuple sets
std::hash< Gecode::TupleSet >Hashing for tuple sets
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
SumCostWarehousesModel with cost defined as sum
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::FloatTest assignment with distinct propagator
Test::Assign::FloatTestBase class for tests for branching on float variables
Test::Assign::FloatTestSpaceSpace 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::FloatTest brancher with distinct propagator
Test::Branch::FloatTestBase class for tests for branching on float variables
Test::Branch::FloatTestSpaceSpace for executing Float 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 Set tests
Test::FlatZinc::FlatZincTestBase class for tests for FlatZinc
Test::Float::Arithmetic::AbsXXTest for absolute value constraint with shared variables
Test::Float::Arithmetic::AbsXYTest for absolute value constraint
Test::Float::Arithmetic::DivTest for division constraint
Test::Float::Arithmetic::DivSolTest for division constraint when solution is ensured
Test::Float::Arithmetic::MaxNaryTest for n-ary maximum constraint
Test::Float::Arithmetic::MaxNarySharedTest for n-ary maximum constraint with shared variables
Test::Float::Arithmetic::MaxXXXTest for binary maximum constraint with shared variables
Test::Float::Arithmetic::MaxXXYTest for binary maximum constraint with shared variables
Test::Float::Arithmetic::MaxXYXTest for binary maximum constraint with shared variables
Test::Float::Arithmetic::MaxXYYTest for binary maximum constraint with shared variables
Test::Float::Arithmetic::MaxXYZTest for binary maximum constraint
Test::Float::Arithmetic::MinNaryTest for n-ary minimmum constraint
Test::Float::Arithmetic::MinNarySharedTest for n-ary minimmum constraint with shared variables
Test::Float::Arithmetic::MinXXXTest for binary minimum constraint with shared variables
Test::Float::Arithmetic::MinXXYTest for binary minimum constraint with shared variables
Test::Float::Arithmetic::MinXYXTest for binary minimum constraint with shared variables
Test::Float::Arithmetic::MinXYYTest for binary minimum constraint with shared variables
Test::Float::Arithmetic::MinXYZTest for binary minimum constraint
Test::Float::Arithmetic::MultXXXTest for multiplication constraint with shared variables
Test::Float::Arithmetic::MultXXYTest for multiplication constraint with shared variables
Test::Float::Arithmetic::MultXXYSolTest for multiplication constraint with shared variables when solution is ensured
Test::Float::Arithmetic::MultXYXTest for multiplication constraint with shared variables
Test::Float::Arithmetic::MultXYYTest for multiplication constraint with shared variables
Test::Float::Arithmetic::MultXYZTest for multiplication constraint
Test::Float::Arithmetic::MultXYZSolTest for multiplication constraint when solution is ensured
Test::Float::Arithmetic::NRootXXTest for nroot constraint with shared variables
Test::Float::Arithmetic::NRootXYTest for nroot constraint
Test::Float::Arithmetic::NRootXYSolTest for nroot constraint where solution is ensured
Test::Float::Arithmetic::PowXXTest for pow constraint with shared variables
Test::Float::Arithmetic::PowXYTest for pow constraint
Test::Float::Arithmetic::PowXYSolTest for pow constraint where solution is ensured
Test::Float::Arithmetic::SqrtXXTest for square root constraint with shared variables
Test::Float::Arithmetic::SqrtXYTest for square root constraint
Test::Float::Arithmetic::SqrtXYSolTest for square root constraint where solution is ensured
Test::Float::Arithmetic::SqrXXTest for squaring constraint with shared variables
Test::Float::Arithmetic::SqrXYTest for squaring constraint
Test::Float::Arithmetic::SqrXYSolTest for squaring constraint where solution is ensured
Test::Float::AssignmentBase class for assignments
Test::Float::Basic::BasicTest whether testing infrastructure for float variables works
Test::Float::Channel::BoolTest channel between float and Boolean
Test::Float::Channel::IntTest channel between float and integer
Test::Float::CpltAssignmentGenerate all assignments
Test::Float::Dom::CreateHelp class to create and register tests
Test::Float::Dom::NumTest for domain constraints with float numbers
Test::Float::Dom::ValTest for domain constraints with a float value
Test::Float::ExtAssignmentGenerate all assignments except the last variable and complete it to get a solution
Test::Float::FloatRelTypesIterator for float relation types
Test::Float::Linear::CreateHelp class to create and register tests
Test::Float::Linear::FloatFloatTest linear relation over float variables
Test::Float::Linear::FloatVarTest linear relation over float variables
Test::Float::MiniModelLin::CreateHelp class to create and register tests
Test::Float::MiniModelLin::LinExprTest linear expressions over float variables
Test::Float::MiniModelLin::LinInstrType for representing a linear instruction
Test::Float::MiniModelLin::LinRelTest linear relations over float variables
Test::Float::RandomAssignmentGenerate random selection of assignments
Test::Float::Rel::CreateHelp class to create and register tests
Test::Float::Rel::FloatFloatTest for simple relation involving float variable and float constant
Test::Float::Rel::FloatVarXXTest for simple relation involving shared float variables
Test::Float::Rel::FloatVarXYTest for simple relation involving float variables
Test::Float::TestBase class for tests with float constraints
Test::Float::TestSpaceSpace for executing tests
Test::Float::Transcendental::ExpXXTest for exponent constraint with shared variables
Test::Float::Transcendental::ExpXYTest for exponent constraint
Test::Float::Transcendental::ExpXYSolTest for exponent constraint where solution is ensured
Test::Float::Transcendental::LogNXXTest for logarithm base n constraint with shared variables
Test::Float::Transcendental::LogNXYTest for logarithm base n constraint
Test::Float::Transcendental::LogNXYSolTest for logarithm base n constraint where solution is ensured
Test::Float::Transcendental::LogXXTest for logarithm constraint with shared variables
Test::Float::Transcendental::LogXYTest for logarithm constraint
Test::Float::Transcendental::LogXYSolTest for logarithm constraint where solution is ensured
Test::Float::Transcendental::PowXXTest for pow exponent n constraint with shared variables
Test::Float::Transcendental::PowXYTest for pow exponent n constraint
Test::Float::Transcendental::PowXYSolTest for pow exponent n constraint where solution is ensured
Test::Float::Trigonometric::ACosXXTest for acosinus constraint with shared variables
Test::Float::Trigonometric::ACosXYTest for acosinus constraint
Test::Float::Trigonometric::ACosXYSolTest for acosinus constraint where solution is ensured
Test::Float::Trigonometric::ASinXXTest for asinus constraint with shared variables
Test::Float::Trigonometric::ASinXYTest for asinus constraint
Test::Float::Trigonometric::ASinXYSolTest for asinus constraint where solution is ensured
Test::Float::Trigonometric::ATanXXTest for atangent constraint with shared variables
Test::Float::Trigonometric::ATanXYTest for atangent constraint
Test::Float::Trigonometric::ATanXYSolTest for atangent constraint where solution is ensured
Test::Float::Trigonometric::CosXXTest for cosinus constraint with shared variables
Test::Float::Trigonometric::CosXYTest for cosinus constraint
Test::Float::Trigonometric::CosXYSolTest for cosinus constraint where solution is ensured
Test::Float::Trigonometric::SinXXTest for sinus constraint with shared variables
Test::Float::Trigonometric::SinXYTest for sinus constraint
Test::Float::Trigonometric::SinXYSolTest for sinus constraint where solution is ensured
Test::Float::Trigonometric::TanXXTest for tangent constraint with shared variables
Test::Float::Trigonometric::TanXYTest for tangent constraint
Test::Float::Trigonometric::TanXYSolTest for tangent constraint where solution is ensured
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::ArgMaxTest for argument maximum constraint
Test::Int::Arithmetic::ArgMaxSharedTest for argument maximum constraint with shared variables
Test::Int::Arithmetic::ArgMinTest for argument minimum constraint
Test::Int::Arithmetic::ArgMinSharedTest for argument minimum constraint with shared variables
Test::Int::Arithmetic::CreateHelp class to create and register tests
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::NrootXXTest for nroot constraint with shared variables
Test::Int::Arithmetic::NrootXYTest for nroot constraint
Test::Int::Arithmetic::PowXXTest for power constraint with shared variables
Test::Int::Arithmetic::PowXYTest for power 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::CliqueMBPTTest for testing the max-clique finding for multi bin-packing
Test::Int::BinPacking::CliqueMBPT::TestSpaceSimple test space class
Test::Int::BinPacking::CreateHelp class to create and register tests
Test::Int::BinPacking::LoadBinAssignmentGenerate load and bin assignments
Test::Int::BinPacking::MBPTTest with different bin loads and items
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::ITEBoolTest for if-then-else-constraint
Test::Int::Bool::ITEIntTest for if-then-else-constraint
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::ExceptSimple test for distinct except constant constraint
Test::Int::Distinct::OffsetSimple test for distinct constraint with offsets
Test::Int::Distinct::OptionalSimple test for optional distinct constraint
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::CreateHelp class to create and register tests
Test::Int::Extensional::RandomTupleSetTest
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::TupleSetBaseTest with tuple set
Test::Int::Extensional::TupleSetBoolTest with bool tuple set
Test::Int::Extensional::TupleSetLargeTest with large tuple set
Test::Int::Extensional::TupleSetTestTest with tuple set
Test::Int::Extensional::TupleSetTestSizeHelp class to create and register tests with a fixed table size
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::IntPropBasicAdvancedIterator for basic and advanced integer propagation levels
Test::Int::IntPropLevelsIterator for simple integer propagation 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::BoolElementTest for Boolean element (regression)
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::NoOverlap::VarOptShared2Test for no-overlap with optional rectangles and shared variables
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::BoolArrayIntTest for relation between arrays of Boolean variables and integers
Test::Int::Rel::BoolArrayVarTest 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::IntArrayDiffTest for relation between differently sized arrays of integer variables
Test::Int::Rel::IntArrayIntTest for relation between same sized arrays of integer variables and integers
Test::Int::Rel::IntArrayVarTest for relation between same 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::CreateHelp class to create and register 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::FailedTest for unsharing in failed spaces
Test::Int::Unshare::IntTest for unsharing integer variables
Test::LDSB::Action1Test with action
Test::LDSB::LDSB< T >Test for LDSB infrastructure
Test::LDSB::LDSBLatinTest for LDSB infrastructure with Latin square problem
Test::LDSB::LDSBLatin::LatinLatin square space
Test::LDSB::LDSBSet< T >Test for LDSB infrastructure
Test::LDSB::MatSym1Test for matrix symmetry
Test::LDSB::MatSym2Test for matrix symmetry
Test::LDSB::MatSym3Test for matrix symmetry
Test::LDSB::MatSym4Test for matrix symmetry
Test::LDSB::OneArrayTest space
Test::LDSB::OneArraySetTest space (set version)
Test::LDSB::RecomputationTest for handling of recomputation
Test::LDSB::ReflectSym1Test for reflection symmetry
Test::LDSB::ReflectSym2Test for reflection symmetry
Test::LDSB::SetValSym1Test for set value symmetry
Test::LDSB::SetValSym2Test for set value symmetry
Test::LDSB::SetVarSeqSym1Test for set variable sequence symmetry
Test::LDSB::SetVarSeqSym2Test for set variable sequence symmetry
Test::LDSB::SetVarSym1Test for set variable symmetry
Test::LDSB::SimIntValSym1Test for value sequence symmetry
Test::LDSB::SimIntValSym2Test for value sequence symmetry
Test::LDSB::SimIntValSym3Test for value sequence symmetry
Test::LDSB::SimIntVarSym1Test for variable sequence symmetry
Test::LDSB::SimIntVarSym2Test for variable sequence symmetry
Test::LDSB::TieBreakTest tiebreaking variable heuristic
Test::LDSB::ValSym1Test for value symmetry
Test::LDSB::ValSym1bTest for value symmetry
Test::LDSB::ValSym1cTest for value symmetry
Test::LDSB::ValSym2Test for value symmetry
Test::LDSB::ValSym2bTest for value symmetry
Test::LDSB::ValSym3Test for value symmetry
Test::LDSB::ValSym4Test for value symmetry
Test::LDSB::ValSym5Test for value symmetry
Test::LDSB::VarSym1Test for variable symmetry
Test::LDSB::VarSym1bTest for variable symmetry
Test::LDSB::VarSym2Test for variable symmetry
Test::LDSB::VarSym3Test for variable symmetry
Test::LDSB::VarSym4Test for variable symmetry
Test::LDSB::VarSym5Test for variable symmetry
Test::LDSB::VarValSym1Test for variable and value symmetry
Test::NoGoods::CreateHelp class to create and register tests
Test::NoGoods::HammingExample for testing set no-goods
Test::NoGoods::NoGoods< Model, ValBranch >Base class for no-good tests
Test::NoGoods::QueensExample for testing integer no-goods
Test::OptionsCommandline options
Test::RegionTest for Region memory area
Test::Search::BAB< Model >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::LDS< Model >Test for limited discrepancy search
Test::Search::PBS< Model, Engine >Test for portfolio-based search
Test::Search::RBS< Model, Engine >Test for restart-based search
Test::Search::SEBPBS< Model >Test for portfolio-based search using SEBs
Test::Search::SolveImmediateSpace that is immediately solved
Test::Search::TestBase class for search tests
Test::Search::TestSpaceSpace with information
Test::Set::Channel::ChannelBoolTest for Boolean channel constraint
Test::Set::Channel::ChannelIntTest for integer channel constraint
Test::Set::Channel::ChannelSetTest for set channel constraint
Test::Set::Channel::ChannelSortedTest for sorted channeling constraint
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::Int::CardTest for cardinality constraint
Test::Set::Int::ElemTest for element constraint
Test::Set::Int::IntRelTest for integer relation 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::ITETest for if-then-else-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)
Warehouses< Script >Example: Locating warehouses
WarnsdorffCustom brancher for knight's tours using Warnsdorff's rule
Warnsdorff::ChoiceChoice
WordSquareExample: Word-square puzzle