Collaboration diagram for Set algorithms:
![]() |
Modules | |
Distance metrics | |
Functions | |
template<class BV, class It> | |
void | bm::combine_or (BV &bv, It first, It last) |
OR Combine bitvector and the iterable sequence. | |
template<class BV, class It> | |
void | bm::combine_xor (BV &bv, It first, It last) |
XOR Combine bitvector and the iterable sequence. | |
template<class BV, class It> | |
void | bm::combine_sub (BV &bv, It first, It last) |
SUB Combine bitvector and the iterable sequence. | |
template<class BV, class It> | |
void | bm::combine_and (BV &bv, It first, It last) |
AND Combine bitvector and the iterable sequence. | |
template<class BV> | |
bm::id_t | bm::count_intervals (const BV &bv) |
Compute number of bit intervals (GAPs) in the bitvector. | |
template<class BV, class It> | |
void | bm::export_array (BV &bv, It first, It last) |
Export bitset from an array of binary data representing the bit vector. |
|
AND Combine bitvector and the iterable sequence. Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.
Definition at line 787 of file bmalgo.h. References bm::combine_or(). |
|
OR Combine bitvector and the iterable sequence. Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.
Definition at line 550 of file bmalgo.h. References bm::block_range_scan(), BMGAP_PTR, bm::gap_limit(), and bm::gap_set_value(). Referenced by bm::combine_and(). |
|
SUB Combine bitvector and the iterable sequence. Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.
Definition at line 707 of file bmalgo.h. References bm::block_range_scan(), BMGAP_PTR, bm::gap_limit(), bm::gap_set_value(), and bm::gap_test(). |
|
XOR Combine bitvector and the iterable sequence. Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.
Definition at line 626 of file bmalgo.h. References bm::block_range_scan(), BM_ASSERT, BMGAP_PTR, bm::gap_limit(), bm::gap_set_value(), and bm::gap_test(). |
|
Compute number of bit intervals (GAPs) in the bitvector. Algorithm traverses bit vector and count number of uninterrupted intervals of 1s and 0s. For example: 00001111100000 - gives us 3 intervals 10001111100000 - 4 intervals 00000000000000 - 1 interval 11111111111111 - 1 interval
Definition at line 810 of file bmalgo.h. References bm::for_each_block(). |
|
Export bitset from an array of binary data representing the bit vector. Input array can be array of ints, chars or other native C types. Method works with iterators, which makes it compatible with STL containers and C arrays
|