38 #ifndef __GECODE_INT_BIN_PACKING_HH__ 39 #define __GECODE_INT_BIN_PACKING_HH__ 103 int card(
void)
const;
105 int total(
void)
const;
107 int operator [](
int i)
const;
123 int card(
void)
const;
125 int total(
void)
const;
127 int operator [](
int i)
const;
159 template<
class SizeSet>
160 bool nosum(
const SizeSet&
s,
int a,
int b,
int& ap,
int& bp);
162 template<
class SizeSet>
177 virtual size_t dispose(
Space& home);
191 int nodes(
void)
const;
203 void allocate(
Region& r,
int n);
205 void init(
Region& r,
int n);
207 bool in(
int i)
const;
213 void copy(
int n,
const NodeSet& ns);
254 void operator ++(
void);
260 int operator ()(
void)
const;
279 void incl(
int i,
unsigned int w);
281 void excl(
int i,
unsigned int w);
311 void edge(
int i,
int j,
bool add=
true);
313 bool adjacent(
int i,
int j)
const;
317 IntSet maxclique(
void)
const;
int * s
Array of sizes (will have more elements)
int p
Position of discarded item.
Item combining bin and size information.
ViewArray< Item > bs
Items with bin and size.
static ModEventDelta med(ModEvent)
Translate modification event me to modification event delta for view.
Node * node
The nodes in the graph.
int t
Total size of all items.
unsigned int c
Cardinality of clique.
Basic bitset support (without stored size information)
Base-class for propagators.
int n
Number of size entries in the set.
ViewArray< OffsetView > l
Views for load of bins.
int size(void) const
Return size of item.
const unsigned int card
Maximum cardinality of an integer set.
Base-class for derived views.
Base-class for both propagators and branchers.
Graph containing conflict information.
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
Gecode::IntArgs i({1, 2, 3, 4})
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
bool operator<(const DerivedView< IntView > &y) const
Whether this view comes before view y (arbitray order)
unsigned int w
Weight (initialized with degree before graph is reduced)
bool operator!=(const Item &i, const Item &j)
Whether two items are not the same.
Passing integer variables.
Item(void)
Default constructor.
bool operator==(const Item &i, const Item &j)
Whether two items are the same.
Post propagator for SetVar SetOpType SetVar SetRelType r
Integer view for integer variables.
IntView bin(void) const
Return bin of item.
Clique max
Largest clique so far.
Size sets with one element discarded.
int t
Total size of the set.
unsigned int w
Weight of clique.
NodeSet n
Nodes in the clique.
const IntVarArgs & b
Bin variables.
void reschedule(Space &home, Propagator &p, PropCond pc)
Re-schedule propagator p with propagation condition pc.
IntView x
View from which this view is derived.
Gecode toplevel namespace
unsigned int bins
Number of bins.
#define GECODE_INT_EXPORT
int ModEventDelta
Modification event deltas.
Home class for posting propagators
void update(Space &home, Item &i)
Update item during cloning.
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.