|
| 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...
|
| |
template<typename BV>
class bm::rank_compressor< BV >
Algorithms for rank compression of bit-vector.
- Source vector (bv_src) is a subset of index vector (bv_idx)
- As a subset it can be collapsed using bit-rank method, where each position in the source vector is defined by population count (range) [0..index_position] (count_range()) As a result all integer set of source vector gets re-mapped in accord with the index vector.
Definition at line 175 of file bmalgo.h.