Generated on Thu Jan 16 2025 00:00:00 for Gecode by doxygen 1.14.0

Space that requires propagation and has solutions. More...

Public Member Functions

void branch (const IntVarArgs &x, HowToBranch htb)
 Branch on x according to htb.
 HasSolutions (HowToBranch _htb1, HowToBranch _htb2, HowToBranch _htb3, HowToConstrain _htc=HTC_NONE)
 Constructor for space creation.
 HasSolutions (HasSolutions &s)
 Constructor for cloning s.
virtual Spacecopy (void)
 Copy during cloning.
virtual void constrain (const Space &_s)
 Add constraint for next better solution.
virtual int solutions (void) const
 Return number of solutions.
virtual bool best (void) const
 Verify that this is best solution.
virtual bool master (const MetaInfo &mi)
 Rule out that solution is found more than once during restarts.
Public Member Functions inherited from Test::Search::TestSpace
 TestSpace (void)
 Constructor for space creation.
 TestSpace (TestSpace &s)
 Constructor for cloning s.
 Space (void)
 Default constructor.
 Space (Space &s)
 Constructor for cloning.
Spaceoperator= (const Space &s)=default
 Assignment operator.
virtual ~Space (void)
 Destructor.
virtual bool slave (const MetaInfo &mi)
 Slave configuration function for meta search engines.
SpaceStatus status (StatusStatistics &stat=unused_status)
 Query space status.
const Choicechoice (void)
 Create new choice for current brancher.
const Choicechoice (Archive &e) const
 Create new choice from e.
Spaceclone (CloneStatistics &stat=unused_clone) const
 Clone space.
void commit (const Choice &c, unsigned int a, CommitStatistics &stat=unused_commit)
 Commit choice c for alternative a.
void trycommit (const Choice &c, unsigned int a, CommitStatistics &stat=unused_commit)
 If possible, commit choice c for alternative a.
NGLngl (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.

Static Public Member Functions

static std::string name (void)
 Return name.
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

IntVarArray x
 Variables used.
HowToBranch htb1
 How to branch.
HowToBranch htb2
HowToBranch htb3
HowToConstrain htc
 How to constrain.

Detailed Description

Space that requires propagation and has solutions.

Definition at line 166 of file search.cpp.

Constructor & Destructor Documentation

◆ HasSolutions() [1/2]

Test::Search::HasSolutions::HasSolutions ( HowToBranch _htb1,
HowToBranch _htb2,
HowToBranch _htb3,
HowToConstrain _htc = HTC_NONE )
inline

Constructor for space creation.

Definition at line 191 of file search.cpp.

◆ HasSolutions() [2/2]

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

Constructor for cloning s.

Definition at line 202 of file search.cpp.

Member Function Documentation

◆ branch()

void Test::Search::HasSolutions::branch ( const IntVarArgs & x,
HowToBranch htb )
inline

Branch on x according to htb.

Definition at line 175 of file search.cpp.

◆ copy()

virtual Space * Test::Search::HasSolutions::copy ( void )
inlinevirtual

Copy during cloning.

Implements Gecode::Space.

Definition at line 208 of file search.cpp.

◆ constrain()

virtual void Test::Search::HasSolutions::constrain ( const Space & _s)
inlinevirtual

Add constraint for next better solution.

Reimplemented from Gecode::Space.

Definition at line 212 of file search.cpp.

◆ solutions()

virtual int Test::Search::HasSolutions::solutions ( void ) const
inlinevirtual

Return number of solutions.

Implements Test::Search::TestSpace.

Definition at line 245 of file search.cpp.

◆ best()

virtual bool Test::Search::HasSolutions::best ( void ) const
inlinevirtual

Verify that this is best solution.

Implements Test::Search::TestSpace.

Definition at line 257 of file search.cpp.

◆ name()

std::string Test::Search::HasSolutions::name ( void )
inlinestatic

Return name.

Definition at line 285 of file search.cpp.

◆ master()

virtual bool Test::Search::HasSolutions::master ( const MetaInfo & mi)
inlinevirtual

Rule out that solution is found more than once during restarts.

Reimplemented from Test::Search::TestSpace.

Definition at line 289 of file search.cpp.

Member Data Documentation

◆ x

IntVarArray Test::Search::HasSolutions::x

Variables used.

Definition at line 169 of file search.cpp.

◆ htb1

HowToBranch Test::Search::HasSolutions::htb1

How to branch.

Definition at line 171 of file search.cpp.

◆ htb2

HowToBranch Test::Search::HasSolutions::htb2

Definition at line 171 of file search.cpp.

◆ htb3

HowToBranch Test::Search::HasSolutions::htb3

Definition at line 171 of file search.cpp.

◆ htc

HowToConstrain Test::Search::HasSolutions::htc

How to constrain.

Definition at line 173 of file search.cpp.


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