44 namespace Gecode {
namespace Support {
70 bool get(
int i)
const;
76 int next(
int i)
const;
78 void resize(A& a,
unsigned int n,
int offset,
bool set=
false);
123 BitSetBase::resize(a, n,
set);
139 template <
class A,
class Char,
class Traits>
140 std::basic_ostream<Char,Traits>&
142 for (
int i = bs.offset() ;
i < bs.offset()+
static_cast<int>(bs.size()) ;
i++)
int next(int i) const
Return position greater or equal i of next set bit (i is allowed to be equal to size) ...
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 .
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
void clear(int i)
Clear bit i.
unsigned int size(I &i)
Size of all ranges of range iterator i.
~BitSetOffset(void)
Destructor.
struct Gecode::@585::NNF::@62::@64 a
For atomic nodes.
int max_bit(void) const
Retrieve the maximum valid index.
Gecode toplevel namespace
bool valid(int i) const
Is the bit index valid for this bitset?
Bitsets with index offset.