54template<
typename SV>
void PrintSV(
const SV& sv)
56 typename SV::const_iterator it = sv.begin();
57 typename SV::const_iterator it_end = sv.end();
59 for (
size_t i = 0; it != it_end; ++it, ++i)
62 cout << i <<
": " << *it <<
", ";
94 catch(std::exception& ex)
96 std::cerr << ex.what() << std::endl;
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
Sparse constainer sparse_vector<> for integer types using bit-transposition transform.
Compressed sparse container rsc_sparse_vector<> for integer types.
pre-processor un-defines to avoid global space pollution (internal)
Bitvector Bit-vector container with runtime compression of bits.
void set(size_type idx, value_type v)
set specified element with bounds checking and automatic resize
void sync(bool force)
Re-calculate rank-select index for faster access to vector.
bool in_sync() const BMNOEXCEPT
returns true if prefix sum table is in sync with the vector
void inc(size_type idx)
increment specified element by one
succinct sparse vector with runtime compression using bit-slicing / transposition method
bm::sparse_vector< unsigned, bm::bvector<> > sparse_vector_u32
bm::rsc_sparse_vector< unsigned, sparse_vector_u32 > rsc_sparse_vector_u32
void PrintSV(const SV &sv)
Print sparse vector not NULL elements.