46template<
typename SV>
void PrintSV(
const SV& sv)
48 cout <<
"size() = " << sv.size() <<
" : ";
49 auto it = sv.begin();
auto it_end = sv.end();
50 for (; it != it_end; ++it)
117 const unsigned char* buf = sv_lay.
buf();
147 catch(std::exception& ex)
149 std::cerr << ex.what() << std::endl;
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
#define BM_DECLARE_TEMP_BLOCK(x)
Sparse constainer sparse_vector<> for integer types using bit-transposition transform.
Serialization for sparse_vector<>
bvector< Alloc > & set(size_type n, bool val=true)
Sets bit n if val is true, clears bit n if val is false.
sparse vector de-serializer
void deserialize_range(SV &sv, const unsigned char *buf, size_type from, size_type to)
void deserialize(SV &sv, const unsigned char *buf)
void set_bookmarks(bool enable, unsigned bm_interval=256)
Add skip-markers for faster range deserialization.
void serialize(const SV &sv, sparse_vector_serial_layout< SV > &sv_layout)
Serialize sparse vector into a memory buffer(s) structure.
sparse vector with runtime compression using bit transposition method
back_insert_iterator get_back_inserter()
Provide back insert iterator Back insert iterator implements buffered insertion, which is faster,...
void optimize(bm::word_t *temp_block=0, typename bvector_type::optmode opt_mode=bvector_type::opt_compress, typename sparse_vector< Val, BV >::statistics *stat=0)
run memory optimization for all vector plains
@ use_null
support "non-assigned" or "NULL" logic
layout class for serialization buffer structure
const unsigned char * buf() const
Return serialization buffer pointer.
bm::sparse_vector< unsigned, bm::bvector<> > svector_u32
void PrintSV(const SV &sv)
Print sparse vector content.