Go to the documentation of this file.
73 cout <<
"[" << ien.
start() <<
".." << ien.
end() <<
"]";
88 for (; ien != ien_end; ++ien)
91 cout <<
"[" << (*ien).first <<
".." << (*ien).second <<
"]";
102 for (; ien != ien_end; ++ien)
108 ien.
go_to(105,
false);
109 for (; ien != ien_end; ++ien)
116 ien.
go_to(105,
false);
117 for (; ien != ien_end; ++ien)
127 ien.
go_to(115,
true);
128 for (; ien != ien_end; ++ien)
135 ien.
go_to(1150000,
true);
142 cout <<
"EMPTY" << endl;
147 catch(std::exception& ex)
149 std::cerr << ex.what() << std::endl;
bvector< Alloc > & set_range(size_type left, size_type right, bool value=true)
Sets all bits in the specified closed interval [left,right] Interval must be inside the bvector's siz...
bool go_to(size_type pos, bool extend_start=true)
Go to inetrval at specified position Jump to position with interval. If interval is not available at ...
size_type end() const BMNOEXCEPT
Return interval end/right as bit-vector coordinate 011110 [left..right].
bm::interval_enumerator< bm::bvector<> > interval_enumerator_type
size_type start() const BMNOEXCEPT
Return interval start/left as bit-vector coordinate 011110 [left..right].
const pair_type & get() const BMNOEXCEPT
Get interval pair.
@ BM_GAP
GAP compression is ON.
Algorithms for bit ranges and intervals.
bool valid() const BMNOEXCEPT
Returns true if enumerator is valid (false if traversal is done)
forward iterator class to traverse bit-vector as ranges
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
void optimize(bm::word_t *temp_block=0, optmode opt_mode=opt_compress, statistics *stat=0)
Optimize memory bitvector's memory allocation.