65 cout <<
"<EMPTY SET>";
67 for(;first != last; ++first)
68 cout << *first <<
";";
87 cout <<
"Source set 1:";
90 cout <<
"Source set 2:";
98 cout <<
"Result 1(AND): ";
111 bm::combine_or(bv, &arr[0], &arr[0] + (
sizeof(arr)/
sizeof(arr[0])));
112 cout <<
"Result 2(OR): ";
118 std::sort(&arr[0], &arr[0] + (
sizeof(arr)/
sizeof(arr[0])));
123 cout <<
"Result 3(AND): ";
129 cout <<
"Result 4(MINUS): ";
133 catch(std::exception& ex)
135 std::cerr << ex.what() << std::endl;
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
Algorithms for bvector<> (main include)
pre-processor un-defines to avoid global space pollution (internal)
Bitvector Bit-vector container with runtime compression of bits.
bvector_size_type size_type
enumerator first() const
Returns enumerator pointing on the first non-zero bit.
enumerator end() const
Returns enumerator pointing on the next bit after the last.
void clear(const size_type *ids, size_type ids_size, bm::sort_order so=bm::BM_UNKNOWN)
clear list of bits in this bitset
void combine_and_sorted(BV &bv, It first, It last)
AND Combine bitvector and the iterable sequence.
void combine_and(BV &bv, It first, It last)
AND Combine bitvector and the iterable sequence.
void combine_sub(BV &bv, It first, It last)
SUB Combine bitvector and the iterable sequence.
void combine_or(BV &bv, It first, It last)
OR Combine bitvector and the iterable sequence.
void PrintContainer(T first, T last)