Generated on for Gecode by doxygen 1.17.0
Test::Set::SetTestSpace Class Reference

Space for executing set tests. More...

#include <test/set.hh>

Public Member Functions

 SetTestSpace (int n, Gecode::IntSet &d0, int i, SetTest *t, bool log=true)
 Create test space without reification.
 SetTestSpace (int n, Gecode::IntSet &d0, int i, SetTest *t, Gecode::ReifyMode rm, bool log=true)
 Create test space with reification.
 SetTestSpace (SetTestSpace &s)
 Constructor for cloning s.
virtual Gecode::Spacecopy (void)
 Copy space during cloning.
void post (void)
 Post propagator.
bool failed (void)
 Compute a fixpoint and check for failure.
bool subsumed (bool b)
 Check for subsumption if b is true.
void rel (int i, Gecode::SetRelType srt, const Gecode::IntSet &is)
 Perform set tell operation on x[i].
void cardinality (int i, int cmin, int cmax)
 Perform cardinality tell operation on x[i].
void rel (int i, Gecode::IntRelType irt, int n)
 Perform integer tell operation on y[i].
void rel (bool sol)
 Perform Boolean tell on b.
void assign (const SetAssignment &a, Gecode::Support::RandomGenerator &rand)
 Assign all variables to values in a.
bool assigned (void) const
 Test whether all variables are assigned.
void removeFromLub (int v, int i, const SetAssignment &a)
 Remove value v from the upper bound of x[i].
void removeFromLub (int v, int i, const SetAssignment &a, SetTestSpace &c)
 Remove value v from the upper bound of x[i].
void addToGlb (int v, int i, const SetAssignment &a)
 Remove value v from the lower bound of x[i].
void addToGlb (int v, int i, const SetAssignment &a, SetTestSpace &c)
 Remove value v from the lower bound of x[i].
bool fixprob (void)
 Perform fixpoint computation.
bool prune (const SetAssignment &a, Gecode::Support::RandomGenerator &rand)
 Perform random pruning.
unsigned int propagators (void)
 Return the number of propagators.
void disable (void)
 Disable propagators in space and compute fixpoint (make all idle).
void enable (void)
 Enable propagators in space.
bool disabled (const SetAssignment &a, SetTestSpace &c, Gecode::Support::RandomGenerator &rand)
 Prune values also in a space c with disabled propagators, but not those in assignment a.
bool same (SetTestSpace &c)
 Check whether propagation is the same as in c.
 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)
 Query space status.
SpaceStatus status (void)
 Query space status without collecting statistics.
const Choicechoice (void)
 Create new choice for current brancher.
const Choicechoice (Archive &e) const
 Create new choice from e.
Spaceclone (void) const
 Clone space.
Spaceclone (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.
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.

Public Attributes

Gecode::IntSet d
 Initial domain.
Gecode::SetVarArray x
 Set variables to be tested.
Gecode::IntVarArray y
 Int variables to be tested.
int withInt
 How many integer variables are used by the test.
Gecode::Reify r
 Reification information.
bool reified
 Whether the test is for a reified propagator.
SetTesttest
 The test currently run.

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.

Detailed Description

Space for executing set tests.

Definition at line 182 of file set.hh.

Constructor & Destructor Documentation

◆ SetTestSpace() [1/3]

Test::Set::SetTestSpace::SetTestSpace ( int n,
Gecode::IntSet & d0,
int i,
SetTest * t,
bool log = true )

Create test space without reification.

Creates n set variables with domain d0, i integer variables with domain d0, and stores whether the test is for a reified propagator (r), and the test itself (t).

◆ SetTestSpace() [2/3]

Test::Set::SetTestSpace::SetTestSpace ( int n,
Gecode::IntSet & d0,
int i,
SetTest * t,
Gecode::ReifyMode rm,
bool log = true )

Create test space with reification.

Creates n set variables with domain d0, i integer variables with domain d0, and stores whether the test is for a reified propagator (r), and the test itself (t).

◆ SetTestSpace() [3/3]

Test::Set::SetTestSpace::SetTestSpace ( SetTestSpace & s)

Constructor for cloning s.

Member Function Documentation

◆ copy()

virtual Gecode::Space * Test::Set::SetTestSpace::copy ( void )
virtual

Copy space during cloning.

Implements Gecode::Space.

◆ post()

void Test::Set::SetTestSpace::post ( void )

Post propagator.

◆ failed()

bool Test::Set::SetTestSpace::failed ( void )

Compute a fixpoint and check for failure.

◆ subsumed()

bool Test::Set::SetTestSpace::subsumed ( bool b)

Check for subsumption if b is true.

◆ rel() [1/3]

void Test::Set::SetTestSpace::rel ( int i,
Gecode::SetRelType srt,
const Gecode::IntSet & is )

Perform set tell operation on x[i].

◆ cardinality()

void Test::Set::SetTestSpace::cardinality ( int i,
int cmin,
int cmax )

Perform cardinality tell operation on x[i].

◆ rel() [2/3]

void Test::Set::SetTestSpace::rel ( int i,
Gecode::IntRelType irt,
int n )

Perform integer tell operation on y[i].

◆ rel() [3/3]

void Test::Set::SetTestSpace::rel ( bool sol)

Perform Boolean tell on b.

◆ assign()

void Test::Set::SetTestSpace::assign ( const SetAssignment & a,
Gecode::Support::RandomGenerator & rand )

Assign all variables to values in a.

◆ assigned()

bool Test::Set::SetTestSpace::assigned ( void ) const

Test whether all variables are assigned.

◆ removeFromLub() [1/2]

void Test::Set::SetTestSpace::removeFromLub ( int v,
int i,
const SetAssignment & a )

Remove value v from the upper bound of x[i].

◆ removeFromLub() [2/2]

void Test::Set::SetTestSpace::removeFromLub ( int v,
int i,
const SetAssignment & a,
SetTestSpace & c )

Remove value v from the upper bound of x[i].

◆ addToGlb() [1/2]

void Test::Set::SetTestSpace::addToGlb ( int v,
int i,
const SetAssignment & a )

Remove value v from the lower bound of x[i].

◆ addToGlb() [2/2]

void Test::Set::SetTestSpace::addToGlb ( int v,
int i,
const SetAssignment & a,
SetTestSpace & c )

Remove value v from the lower bound of x[i].

◆ fixprob()

bool Test::Set::SetTestSpace::fixprob ( void )

Perform fixpoint computation.

◆ prune()

bool Test::Set::SetTestSpace::prune ( const SetAssignment & a,
Gecode::Support::RandomGenerator & rand )

Perform random pruning.

◆ propagators()

unsigned int Test::Set::SetTestSpace::propagators ( void )

Return the number of propagators.

◆ disable()

void Test::Set::SetTestSpace::disable ( void )

Disable propagators in space and compute fixpoint (make all idle).

◆ enable()

void Test::Set::SetTestSpace::enable ( void )

Enable propagators in space.

◆ disabled()

bool Test::Set::SetTestSpace::disabled ( const SetAssignment & a,
SetTestSpace & c,
Gecode::Support::RandomGenerator & rand )

Prune values also in a space c with disabled propagators, but not those in assignment a.

◆ same()

bool Test::Set::SetTestSpace::same ( SetTestSpace & c)

Check whether propagation is the same as in c.

Member Data Documentation

◆ d

Gecode::IntSet Test::Set::SetTestSpace::d

Initial domain.

Definition at line 185 of file set.hh.

◆ x

Gecode::SetVarArray Test::Set::SetTestSpace::x

Set variables to be tested.

Definition at line 187 of file set.hh.

◆ y

Gecode::IntVarArray Test::Set::SetTestSpace::y

Int variables to be tested.

Definition at line 189 of file set.hh.

◆ withInt

int Test::Set::SetTestSpace::withInt

How many integer variables are used by the test.

Definition at line 191 of file set.hh.

◆ r

Gecode::Reify Test::Set::SetTestSpace::r

Reification information.

Definition at line 193 of file set.hh.

◆ reified

bool Test::Set::SetTestSpace::reified

Whether the test is for a reified propagator.

Definition at line 195 of file set.hh.

◆ test

SetTest* Test::Set::SetTestSpace::test

The test currently run.

Definition at line 197 of file set.hh.


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