48 namespace Gecode {
namespace Support {
74 bool get(
int i)
const;
80 int next(
int i)
const;
82 void resize(A& a,
unsigned int n,
int offset,
bool set=
false);
143 template <
class A,
class Char,
class Traits>
144 std::basic_ostream<Char,Traits>&
146 for (
int i = bs.offset() ;
i < bs.offset()+
static_cast<int>(bs.size()) ;
i++)
bool get(unsigned int i) const
Access value at bit i.
void clear(unsigned int i)
Clear bit i.
void resize(A &a, unsigned int n, int offset, bool set=false)
Resize bitset to n elements with specified offset.
BitSetOffset(A &a, unsigned int s, int o)
Bit set with space for s bits with offset of .
void dispose(A &a)
Dispose memory for bit set.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
bool get(int i) const
Access value at bit i.
void clear(int i)
Clear bit i.
int next(int i) const
Return position greater or equal i of next set bit (i is allowed to be equal to size) ...
void set(unsigned int i)
Set bit i.
~BitSetOffset(void)
Destructor.
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) ...
bool valid(int i) const
Is the bit index valid for this bitset?
void set(int i)
Set bit i.
unsigned int size(void) const
Return size of bitset (number of bits)
void resize(A &a, unsigned int n, bool setbits=false)
Resize bitset to n elememts.
int offset(void) const
Retrieve the minimum valid index (the offset).
Gecode toplevel namespace
int max_bit(void) const
Retrieve the maximum valid index.
Bitsets with index offset.