|
| | 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::Space * | copy (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) |
| | 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) |
| | 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) |
| | 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.
|
| |
| Space & | operator= (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 Choice * | choice (void) |
| | Create new choice for current brancher.
|
| |
| const Choice * | choice (Archive &e) const |
| | Create new choice from e.
|
| |
| Space * | clone (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.
|
| |
| 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.
|
| |