48 namespace Gecode {
namespace Support {
74 bool get(
int i)
const;
80 int next(
int i)
const;
127 BitSetBase::resize(
a,
n, set);
143 template <
class A,
class Char,
class Traits>
144 std::basic_ostream<Char,Traits>&
int next(int i) const
Return position greater or equal i of next set bit (i is allowed to be equal to size)
unsigned int size(void) const
Return size of bitset (number of bits)
bool valid(const FloatVal &n)
Return whether float n is a valid number.
int offset(void) const
Retrieve the minimum valid index (the offset).
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 \o.
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
IntSet * A
Position of a piece in a square board.
void clear(int i)
Clear bit i.
unsigned int size(I &i)
Size of all ranges of range iterator i.
~BitSetOffset(void)
Destructor.
bool get(int i) const
Access value at bit i.
void set(int i)
Set bit i.
int max_bit(void) const
Retrieve the maximum valid index.
Gecode toplevel namespace
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const FloatView &x)
Print float variable view.
bool valid(int i) const
Is the bit index valid for this bitset?
Bitsets with index offset.