~ubuntu-branches/ubuntu/trusty/bmagic/trusty-proposed

<h1>sample3.cpp</h1>Exmaple demonstrates using bitvectors with different initial block allocation strategy. Bitvector 1 (bv1) by default working without RLE compression option (best performance, maximum memory consumption). Bitvector 2 (bv2) will be working in compression mode and use less memory.

<dl class="see" compact><dt>See also:</dt><dd><a class="el" href="a00040.html#b1094180d03cbc961d62f0f453097452" title="Sets new blocks allocation strategy.">bm::bvector<>::set_new_blocks_strat()</a></dd></dl>

For more information please visit: <a href="http://bmagic.sourceforge.net">http://bmagic.sourceforge.net</a>

<div class="fragment"><pre class="fragment">/*

Permission is hereby granted, free of charge, to any person

obtaining a copy of this software and associated documentation

files (the "Software"), to deal in the Software without restriction,

including without limitation the rights to use, copy, modify, merge,

publish, distribute, sublicense, and/or sell copies of the Software,

and to permit persons to whom the Software is furnished to do so,

subject to the following conditions:

The above copyright notice and this permission notice shall be included

in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,

EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES

OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,

DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,

ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

OTHER DEALINGS IN THE SOFTWARE.

*/

/** \example sample3.cpp

Exmaple demonstrates using bitvectors with different initial

block allocation strategy.

Bitvector 1 (bv1) by default working without RLE compression option

(best performance, maximum memory consumption).

Bitvector 2 (bv2) will be working in compression mode and use less memory.

\sa bm::bvector<>::set_new_blocks_strat()

For more information please visit: http://bmagic.sourceforge.net

*/

#include <stdlib.h>

#include <iostream>

#include "<a class="code" href="a00082.html">bm.h</a>"

using namespace std;

const unsigned <a name="a0"></a><a class="code" href="a00099.html#8652d848be89c1f9b0a77327ee32fc0f">MAX_VALUE</a> = 1000000;

// This procedure creates very dense bitvectors.

// The resulting set will consists mostly from ON (1) bits

// interrupted with small gaps of 0 bits.

void <a name="a1"></a><a class="code" href="a00099.html#6c4e3c21afef90ce9111f8f5e60d4c13">fill_bvector</a>(<a name="_a2"></a><a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>* bv1, <a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>* bv2)

{

for (unsigned i = 0; i < <a class="code" href="a00099.html#8652d848be89c1f9b0a77327ee32fc0f">MAX_VALUE</a>; ++i)

{

if (rand() % 2500)

{

bv1-><a name="a3"></a><a class="code" href="a00040.html#1769d9ed3a4ee41b03fc3ca4a0e5a58e" title="Sets bit n.">set_bit</a>(i);

bv2-><a class="code" href="a00040.html#1769d9ed3a4ee41b03fc3ca4a0e5a58e" title="Sets bit n.">set_bit</a>(i);

}

void <a name="a4"></a><a class="code" href="a00099.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(const <a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<></a>& bv)

{

<a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<>::statistics</a> st;

bv.<a name="a5"></a><a class="code" href="a00040.html#1eaaac76a97b9eb1d3c11f21cf9385ac" title="Calculates bitvector statistics.">calc_stat</a>(&st);

cout << "Bits count:" << bv.<a name="a6"></a><a class="code" href="a00040.html#71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;

cout << "Bit blocks:" << st.bit_blocks << endl;

cout << "GAP blocks:" << st.gap_blocks << endl;

cout << "Memory used:"<< st.memory_used << endl;

cout << "Max.serialize mem.:" << st.max_serialize_mem << endl << endl;;

}

int <a name="a7"></a><a class="code" href="a00097.html#840291bc02cba5474a4cb46a9b9566fe">main</a>(void)

{

100

<a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv1;

101

<a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv2;

102

103

bv2.<a name="a8"></a><a class="code" href="a00040.html#b1094180d03cbc961d62f0f453097452" title="Sets new blocks allocation strategy.">set_new_blocks_strat</a>(<a name="a9"></a><a class="code" href="a00109.html#ggd0b87b3b7292383a864d27feaf1c9eff7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">bm::BM_GAP</a>); // set DGAP compression mode ON

104

105

<a class="code" href="a00099.html#6c4e3c21afef90ce9111f8f5e60d4c13">fill_bvector</a>(&bv1, &bv2); // Fill both bvectors with the same values

106

107

// For a given distrubution statistics should demonstrate

108

// lower memory consumption for the vector with compression

109

110

<a class="code" href="a00099.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(bv1);

111

<a class="code" href="a00099.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(bv2);

112

113

// Now run optimization procedure for bv1 and see statistics.

114

115

bv1.<a name="a10"></a><a class="code" href="a00040.html#bd522c13e26c2b8f84636fe8b6648dcb" title="Optimize memory bitvector&#39;s memory allocation.">optimize</a>();

116

117

<a class="code" href="a00099.html#eb4ca6f0a986ad6ae67d1f7124fdc400">print_statistics</a>(bv1);

118

119

return 0;

120

}

121

122

</pre></div> </div>

123

<hr size="1"><address style="text-align: right;">Generated on Mon Oct 12 12:16:38 2009 for BitMagic by

124

125

126

</body>

127

</html>

Older »