39 cout <<
"<EMPTY SET>";
41 for(;first != last; ++first)
42 cout << *first <<
";";
56 for (i = 0; i < 30000; i+=10)
61 for (i = 300000; i < 400000; i+=100)
72 rand_sampler.
sample(bvsubset1, bv, 20);
73 rand_sampler.
sample(bvsubset2, bv, 20);
79 catch(std::exception& ex)
81 std::cerr << ex.what() << std::endl;
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
void PrintContainer(T first, T last)
void sample(BV &bv_out, const BV &bv_in, size_type sample_count)
Get random subset of input vector.
enumerator first() const
Returns enumerator pointing on the first non-zero bit.
bvector< Alloc > & set(size_type n, bool val=true)
Sets bit n if val is true, clears bit n if val is false.
enumerator end() const
Returns enumerator pointing on the next bit after the last.
Generation of random subset.