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

Example for testing integer no-goods. More...

Public Member Functions

 Queens (IntValBranch ivb, bool assign, bool null)
 The actual problem.
 Queens (Queens &s)
 Constructor for cloning s.
virtual Spacecopy (void)
 Perform copying during cloning.
bool same (const Queens &s) const
 Check whether two solutions are the same.
 Space (void)
 Default constructor.
 Space (Space &s)
 Constructor for cloning.
Spaceoperator= (const Space &s)=default
 Assignment operator.
virtual ~Space (void)
 Destructor.
virtual void constrain (const Space &best)
 Constrain function for best solution search.
virtual bool master (const MetaInfo &mi)
 Master configuration function for meta search engines.
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 unsigned int nodeinc (void)
 Return increment for node stop.
static std::string name (void)
 Return name.
static std::string val (IntValBranch ivb)
 Return name for branching.
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 q
 Position of queens on boards.

Static Public Attributes

static const int n = 18
 Number of queens (must be even)

Detailed Description

Example for testing integer no-goods.

Definition at line 55 of file nogoods.cpp.

Constructor & Destructor Documentation

◆ Queens() [1/2]

Test::NoGoods::Queens::Queens ( IntValBranch ivb,
bool assign,
bool null )
inline

The actual problem.

Definition at line 62 of file nogoods.cpp.

◆ Queens() [2/2]

Test::NoGoods::Queens::Queens ( Queens & s)
inline

Constructor for cloning s.

Definition at line 85 of file nogoods.cpp.

Member Function Documentation

◆ copy()

virtual Space * Test::NoGoods::Queens::copy ( void )
inlinevirtual

Perform copying during cloning.

Implements Gecode::Space.

Definition at line 89 of file nogoods.cpp.

◆ same()

bool Test::NoGoods::Queens::same ( const Queens & s) const
inline

Check whether two solutions are the same.

Definition at line 93 of file nogoods.cpp.

◆ nodeinc()

unsigned int Test::NoGoods::Queens::nodeinc ( void )
inlinestatic

Return increment for node stop.

Definition at line 100 of file nogoods.cpp.

◆ name()

std::string Test::NoGoods::Queens::name ( void )
inlinestatic

Return name.

Definition at line 104 of file nogoods.cpp.

◆ val()

std::string Test::NoGoods::Queens::val ( IntValBranch ivb)
inlinestatic

Return name for branching.

Definition at line 108 of file nogoods.cpp.

Member Data Documentation

◆ n

const int Test::NoGoods::Queens::n = 18
static

Number of queens (must be even)

Definition at line 58 of file nogoods.cpp.

◆ q

IntVarArray Test::NoGoods::Queens::q

Position of queens on boards.

Definition at line 60 of file nogoods.cpp.


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