Go to the documentation of this file.
44 template<
typename SV>
void PrintSV(
const SV& sv)
46 typename SV::const_iterator it = sv.begin();
47 typename SV::const_iterator it_end = sv.end();
49 for (; it != it_end; ++it)
115 cout << it.
value() << endl;
120 catch(std::exception& ex)
122 std::cerr << ex.what() << std::endl;
sparse vector with runtime compression using bit transposition method
void go_to(size_type pos) BMNOEXCEPT
re-position to a specified position
Const iterator to traverse the rsc sparse vector.
Sparse constainer sparse_vector<> for integer types using bit-transposition transform.
void add_null() BMNOEXCEPT
add NULL (no-value) to the container
Compressed sparse container rsc_sparse_vector<> for integer types.
value_type value() const
Get current position (value)
bm::sparse_vector< unsigned, bm::bvector<> > sparse_vector_u32
bool is_null() const BMNOEXCEPT
Get NULL status.
bool valid() const BMNOEXCEPT
Returns true if iterator is at a valid position.
back_insert_iterator get_back_inserter()
bm::rsc_sparse_vector< unsigned, sparse_vector_u32 > rsc_sparse_vector_u32
Rank-Select compressed sparse vector.
bool advance() BMNOEXCEPT
advance iterator forward by one
void sync(bool force)
Re-calculate prefix sum table used for rank search.
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
void PrintSV(const SV &sv)
Print sparse vector content.
const_iterator get_const_iterator(size_type idx) const BMNOEXCEPT
Get const_itertor re-positioned to specific element.