
Sets of graph nodes. More...
#include <bin-packing.hh>
Public Member Functions | |
| NodeSet (void) | |
| Keep uninitialized. More... | |
| NodeSet (Region &r, int n) | |
| Initialize node set for n nodes. More... | |
| NodeSet (Region &r, int n, const NodeSet &ns) | |
| Initialize node set as copy of ns with n nodes. More... | |
| void | allocate (Region &r, int n) |
| Allocate node set for n nodes. More... | |
| void | init (Region &r, int n) |
| Initialize node set for n nodes. More... | |
| bool | in (int i) const |
| Test whether node i is included. More... | |
| void | incl (int i) |
| Include node i. More... | |
| void | excl (int i) |
| Exclude node i. More... | |
| void | copy (int n, const NodeSet &ns) |
| Copy elements from node set ns with n nodes. More... | |
| void | empty (int n) |
| Clear the whole node set for n nodes. More... | |
Public Member Functions inherited from Gecode::Support::RawBitSetBase | |
| RawBitSetBase (void) | |
| Default constructor (yields empty set) More... | |
| template<class A > | |
| RawBitSetBase (A &a, unsigned int sz, bool setbits=false) | |
| Initialize for sz bits and allocator a. More... | |
| template<class A > | |
| RawBitSetBase (A &a, unsigned int sz, const RawBitSetBase &bs) | |
| Copy from bitset bs with allocator a. More... | |
| template<class A > | |
| void | allocate (A &a, unsigned int sz) |
| Allocate for sz bits and allocator a (only after default constructor) More... | |
| template<class A > | |
| void | init (A &a, unsigned int sz, bool setbits=false) |
| Initialize for sz bits and allocator a (only after default constructor) More... | |
| void | clearall (unsigned int sz, bool setbits=false) |
| Clear sz bits. More... | |
| void | copy (unsigned int sz, const RawBitSetBase &bs) |
| Copy sz bits from bs. More... | |
| bool | get (unsigned int i) const |
| Access value at bit i. More... | |
| void | set (unsigned int i) |
| Set bit i. More... | |
| void | clear (unsigned int i) |
| Clear bit i. More... | |
| unsigned int | next (unsigned int i) const |
| Return position greater or equal i of next set bit (i is allowed to be equal to size) More... | |
| BitSetStatus | status (unsigned int sz) const |
| Return status of bitset. More... | |
| bool | all (unsigned int sz) const |
| Test whether all bits are set. More... | |
| bool | none (unsigned int sz) const |
| Test whether no bits are set. More... | |
| template<class A > | |
| void | resize (A &a, unsigned int sz, unsigned int n, bool setbits=false) |
| Resize bitset from sz to n elememts. More... | |
| template<class A > | |
| void | dispose (A &a, unsigned int sz) |
| Dispose memory for bit set. More... | |
Static Public Member Functions | |
| static bool | iwn (NodeSet &iwa, const NodeSet &a, NodeSet &iwb, const NodeSet &b, const NodeSet &c, int n) |
Additional Inherited Members | |
Protected Attributes inherited from Gecode::Support::RawBitSetBase | |
| BitSetData * | data |
| Stored bits. More... | |
Static Protected Attributes inherited from Gecode::Support::RawBitSetBase | |
| static const unsigned int | bpb = BitSetData::bpb |
| Bits per base. More... | |
Sets of graph nodes.
Definition at line 195 of file bin-packing.hh.
|
inline |
Keep uninitialized.
Definition at line 51 of file conflict-graph.hpp.
|
inline |
Initialize node set for n nodes.
Definition at line 53 of file conflict-graph.hpp.
|
inline |
Initialize node set as copy of ns with n nodes.
Definition at line 56 of file conflict-graph.hpp.
|
inline |
Allocate node set for n nodes.
Definition at line 60 of file conflict-graph.hpp.
|
inline |
Initialize node set for n nodes.
Definition at line 64 of file conflict-graph.hpp.
|
inline |
Test whether node i is included.
Definition at line 68 of file conflict-graph.hpp.
|
inline |
Include node i.
Definition at line 72 of file conflict-graph.hpp.
|
inline |
Exclude node i.
Definition at line 76 of file conflict-graph.hpp.
|
inline |
Copy elements from node set ns with n nodes.
Definition at line 80 of file conflict-graph.hpp.
|
inline |
Clear the whole node set for n nodes.
Definition at line 84 of file conflict-graph.hpp.
|
inlinestatic |
Initialize ac as intersection of a and c, bc as intersection of b and c where n is the maximal number of nodes. Return whether both and bc are empty.
Definition at line 88 of file conflict-graph.hpp.