Generated on for Gecode by doxygen 1.17.0
Test::Search::FailingFirstSlave Class Reference

Space with solutions whose first, incomplete slave fails at the root. More...

Public Member Functions

 FailingFirstSlave (void)=default
 FailingFirstSlave (FailingFirstSlave &s)
Gecode::Space * copy (void) override
 Copying member function.
bool slave (const Gecode::MetaInfo &mi) override
 Slave configuration function for meta search engines.
Public Member Functions inherited from Test::Search::RestrictedFirstSlave
 RestrictedFirstSlave (void)
 RestrictedFirstSlave (RestrictedFirstSlave &s)
Gecode::Space * copy (void) override
 Copying member function.
Gecode::IntVar cost (void) const override
 Return variable with current cost.
bool slave (const Gecode::MetaInfo &mi) override
 Slave configuration function for meta search engines.
Public Member Functions inherited from Gecode::IntMinimizeSpace
 IntMinimizeSpace (void)
 Default constructor.
 IntMinimizeSpace (IntMinimizeSpace &s)
 Constructor for cloning.
virtual void constrain (const Space &best)
 Member function constraining according to decreasing cost.
 Space (void)
 Default constructor.
 Space (Space &s)
 Constructor for cloning.
Space & operator= (const Space &s)=default
 Assignment operator.
virtual ~Space (void)
 Destructor.
virtual bool master (const MetaInfo &mi)
 Master configuration function for meta search engines.
SpaceStatus status (StatusStatistics &stat)
 Query space status.
SpaceStatus status (void)
 Query space status without collecting statistics.
const Choice * choice (void)
 Create new choice for current brancher.
const Choice * choice (Archive &e) const
 Create new choice from e.
Space * clone (void) const
 Clone space.
Space * clone (CloneStatistics &stat) const
 Clone space.
void commit (const Choice &c, unsigned int a)
 Commit choice c for alternative a.
void commit (const Choice &c, unsigned int a, CommitStatistics &stat)
 Commit choice c for alternative a.
void trycommit (const Choice &c, unsigned int a)
 If possible, commit choice c for alternative a.
void trycommit (const Choice &c, unsigned int a, CommitStatistics &stat)
 If possible, commit choice c for alternative a.
NGL * ngl (const Choice &c, unsigned int a)
 Create no-good literal for choice c and alternative a.
void print (const Choice &c, unsigned int a, std::ostream &o) const
 Print branch for choice c and alternative a.
void notice (Actor &a, ActorProperty p, bool duplicate=false)
 Notice actor property.
void ignore (Actor &a, ActorProperty p, bool duplicate=false)
 Ignore actor property.
ExecStatus ES_SUBSUMED (Propagator &p)
 Propagator p is subsumed
ExecStatus ES_SUBSUMED_DISPOSED (Propagator &p, size_t s)
 Propagator p is subsumed
ExecStatus ES_FIX_PARTIAL (Propagator &p, const ModEventDelta &med)
 Propagator p has computed partial fixpoint
ExecStatus ES_NOFIX_PARTIAL (Propagator &p, const ModEventDelta &med)
 Propagator p has not computed partial fixpoint
template<class A>
ExecStatus ES_FIX_DISPOSE (Council< A > &c, A &a)
 Advisor a must be disposed
template<class A>
ExecStatus ES_NOFIX_DISPOSE (Council< A > &c, A &a)
 Advisor a must be disposed and its propagator must be run
template<class A>
ExecStatus ES_NOFIX_DISPOSE_FORCE (Council< A > &c, A &a)
 Advisor a must be disposed and its propagator must be forcefully rescheduled
void fail (void)
 Fail space.
bool failed (void) const
 Check whether space is failed.
bool stable (void) const
 Return if space is stable (at fixpoint or failed).
Home operator() (Propagator &p)
 Return a home for this space with the information that p is being rewritten.
Home operator() (PropagatorGroup pg)
 Return a home for this space with propagator group information pg.
Home operator() (BrancherGroup bg)
 Return a home for this space with brancher group information bg.
template<class T>
T * alloc (long unsigned int n)
 Allocate block of n objects of type T from space heap.
template<class T>
T * alloc (long int n)
 Allocate block of n objects of type T from space heap.
template<class T>
T * alloc (unsigned int n)
 Allocate block of n objects of type T from space heap.
template<class T>
T * alloc (int n)
 Allocate block of n objects of type T from space heap.
template<class T>
void free (T *b, long unsigned int n)
 Delete n objects allocated from space heap starting at b.
template<class T>
void free (T *b, long int n)
 Delete n objects allocated from space heap starting at b.
template<class T>
void free (T *b, unsigned int n)
 Delete n objects allocated from space heap starting at b.
template<class T>
void free (T *b, int n)
 Delete n objects allocated from space heap starting at b.
template<class T>
T * realloc (T *b, long unsigned int n, long unsigned int m)
 Reallocate block of n objects starting at b to m objects of type T from the space heap.
template<class T>
T * realloc (T *b, long int n, long int m)
 Reallocate block of n objects starting at b to m objects of type T from the space heap.
template<class T>
T * realloc (T *b, unsigned int n, unsigned int m)
 Reallocate block of n objects starting at b to m objects of type T from the space heap.
template<class T>
T * realloc (T *b, int n, int m)
 Reallocate block of n objects starting at b to m objects of type T from the space heap.
template<class T>
T ** realloc (T **b, long unsigned int n, long unsigned int m)
 Reallocate block of n pointers starting at b to m objects of type T* from the space heap.
template<class T>
T ** realloc (T **b, long int n, long int m)
 Reallocate block of n pointers starting at b to m objects of type T* from the space heap.
template<class T>
T ** realloc (T **b, unsigned int n, unsigned int m)
 Reallocate block of n pointers starting at b to m objects of type T* from the space heap.
template<class T>
T ** realloc (T **b, int n, int m)
 Reallocate block of n pointers starting at b to m objects of type T* from the space heap.
void * ralloc (size_t s)
 Allocate memory on space heap.
void rfree (void *p, size_t s)
 Free memory previously allocated with alloc (might be reused later).
void * rrealloc (void *b, size_t n, size_t m)
 Reallocate memory block starting at b from size n to size s.
template<size_t>
void * fl_alloc (void)
 Allocate from freelist-managed memory.
template<size_t>
void fl_dispose (FreeList *f, FreeList *l)
 Return freelist-managed memory to freelist.
template<class T>
T & construct (void)
 Construction routines.
template<class T, typename A1>
T & construct (A1 const &a1)
 Constructs a single object of type T from space heap using a unary constructor.
template<class T, typename A1, typename A2>
T & construct (A1 const &a1, A2 const &a2)
 Constructs a single object of type T from space heap using a binary constructor.
template<class T, typename A1, typename A2, typename A3>
T & construct (A1 const &a1, A2 const &a2, A3 const &a3)
 Constructs a single object of type T from space heap using a ternary constructor.
template<class T, typename A1, typename A2, typename A3, typename A4>
T & construct (A1 const &a1, A2 const &a2, A3 const &a3, A4 const &a4)
 Constructs a single object of type T from space heap using a quaternary constructor.
template<class T, typename A1, typename A2, typename A3, typename A4, typename A5>
T & construct (A1 const &a1, A2 const &a2, A3 const &a3, A4 const &a4, A5 const &a5)
 Constructs a single object of type T from space heap using a quinary constructor.
void afc_decay (double d)
 Set AFC decay factor to d
double afc_decay (void) const
 Return AFC decay factor.
void afc_unshare (void)
 Unshare AFC information for all propagators.

Additional Inherited Members

Static Public Member Functions inherited from Gecode::HeapAllocated
static void * operator new (size_t s)
 Memory management.
static void operator delete (void *p)
 Free memory allocated from heap.
Public Attributes inherited from Test::Search::RestrictedFirstSlave
Gecode::IntVarArray x
 Distinct variables, the cost is x0.

Detailed Description

Space with solutions whose first, incomplete slave fails at the root.

Definition at line 1496 of file search.cpp.

Constructor & Destructor Documentation

◆ FailingFirstSlave() [1/2]

Test::Search::FailingFirstSlave::FailingFirstSlave ( void )
default

◆ FailingFirstSlave() [2/2]

Test::Search::FailingFirstSlave::FailingFirstSlave ( FailingFirstSlave & s)
inline

Definition at line 1499 of file search.cpp.

Member Function Documentation

◆ copy()

Gecode::Space * Test::Search::FailingFirstSlave::copy ( void )
inlineoverridevirtual

Copying member function.

Must create a new object using the constructor for cloning.

Should not be used directly, use Space::clone to create a clone of a Space.

Implements Gecode::Space.

Definition at line 1500 of file search.cpp.

◆ slave()

bool Test::Search::FailingFirstSlave::slave ( const Gecode::MetaInfo & mi)
inlineoverridevirtual

Slave configuration function for meta search engines.

This configuration function is used by both restart and portfolio meta search engines.

  • A restart meta search engine calls this function on its slave space when search starts and whenever it finds a solution or exploration restarts. mi contains information about the current restart.

If the function returns true, the search on the slave space is considered complete, i.e., if it fails or exhaustively explores the entire search space, the meta search engine finishes. If the function returns false, the search on the slave space is considered incomplete, and the meta engine will restart the search regardless of whether the search on the slave space finishes or times out. The no-goods recorded by an incomplete search only hold in the slave's search space, so the meta engine does not pass them to the master configuration function. This also holds for the first search when search starts.

  • A portfolio meta engine calls this function once on each asset (that is, on each slave) and passes the number of the asset, starting from zero.

The default function does nothing and returns true.

Reimplemented from Gecode::Space.

Definition at line 1503 of file search.cpp.


The documentation for this class was generated from the following file: