BitMagic-C++
|
Algorithms for rank compression of bit-vector. More...
#include <bmalgo.h>
Public Types | |
enum | buffer_cap { n_buffer_cap = 1024 } |
typedef BV | bvector_type |
typedef BV::size_type | size_type |
typedef BV::rs_index_type | rs_index_type |
Public Member Functions | |
void | decompress (BV &bv_target, const BV &bv_idx, const BV &bv_src) |
Rank decompression. More... | |
void | compress (BV &bv_target, const BV &bv_idx, const BV &bv_src) |
Rank compression algorithm based on two palallel iterators/enumerators set of source vector gets re-mapped in accord with the index/rank vector. More... | |
void | compress_by_source (BV &bv_target, const BV &bv_idx, const rs_index_type &bc_idx, const BV &bv_src) |
Source vector priority + index based rank. More... | |
Algorithms for rank compression of bit-vector.
typedef BV bm::rank_compressor< BV >::bvector_type |
typedef BV::rs_index_type bm::rank_compressor< BV >::rs_index_type |
typedef BV::size_type bm::rank_compressor< BV >::size_type |
enum bm::rank_compressor::buffer_cap |
void bm::rank_compressor< BV >::compress | ( | BV & | bv_target, |
const BV & | bv_idx, | ||
const BV & | bv_src | ||
) |
Rank compression algorithm based on two palallel iterators/enumerators set of source vector gets re-mapped in accord with the index/rank vector.
bv_target | - target bit-vector |
bv_idx | - index (rank) vector used for address recalculation |
bv_src | - source vector for re-mapping |
Definition at line 220 of file bmalgo.h.
Referenced by bm::rsc_sparse_vector< Val, SV >::load_from().
void bm::rank_compressor< BV >::compress_by_source | ( | BV & | bv_target, |
const BV & | bv_idx, | ||
const rs_index_type & | bc_idx, | ||
const BV & | bv_src | ||
) |
void bm::rank_compressor< BV >::decompress | ( | BV & | bv_target, |
const BV & | bv_idx, | ||
const BV & | bv_src | ||
) |
Rank decompression.
Definition at line 294 of file bmalgo.h.
Referenced by bm::rsc_sparse_vector< Val, SV >::load_to().