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

<div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="modules.html">Modules</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="hierarchy.html">Class Hierarchy</a> | <a class="qindex" href="classes.html">Alphabetical List</a> | <a class="qindex" href="annotated.html">Data Structures</a> | <a class="qindex" href="dirs.html">Directories</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="namespacemembers.html">Namespace Members</a> | <a class="qindex" href="functions.html">Data Fields</a> | <a class="qindex" href="globals.html">Globals</a> | <a class="qindex" href="examples.html">Examples</a></div>

<a class="el" href="dir_000001.html">samples</a> / <a class="el" href="dir_000004.html">sample3</a></div>

<h1>sample3.cpp</h1><a href="a00122.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment">00001 /*

00003

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

00005 obtaining a copy of this software and associated documentation

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

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

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

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

00010 subject to the following conditions:

00011

00012 The above copyright notice and this permission notice shall be included

00013 in all copies or substantial portions of the Software.

00014

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

00016 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES

00017 OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

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

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

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

00021 OTHER DEALINGS IN THE SOFTWARE.

00022 */

00023

00024 /** \example sample3.cpp

00025 Exmaple demonstrates using bitvectors with different initial

00026 block allocation strategy.

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

00028 (best performance, maximum memory consumption).

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

00030

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

00032

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

00034

00035 */

00036

00037 #include <stdlib.h>

00038 #include <iostream>

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

00040

00041 using namespace std;

00042

<a name="l00043"></a><a class="code" href="a00122.html#a0">00043</a> const unsigned <a class="code" href="a00122.html#a0">MAX_VALUE</a> = 1000000;

00044

00045 // This procedure creates very dense bitvectors.

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

00047 // interrupted with small gaps of 0 bits.

00048

<a name="l00049"></a><a class="code" href="a00122.html#a1">00049</a> void <a class="code" href="a00122.html#a1">fill_bvector</a>(<a class="code" href="a00084.html">bm::bvector<></a>* bv1, <a class="code" href="a00084.html">bm::bvector<></a>* bv2)

00050 {

00051 for (unsigned i = 0; i < <a class="code" href="a00122.html#a0">MAX_VALUE</a>; ++i)

00052 {

00053 if (rand() % 2500)

00054 {

00055 bv1->set_bit(i);

00056 bv2->set_bit(i);

00057 }

00058 }

00059 }

00060

00061

<a name="l00062"></a><a class="code" href="a00122.html#a2">00062</a> void <a class="code" href="a00122.html#a2">print_statistics</a>(const <a class="code" href="a00084.html">bm::bvector<></a>& bv)

00063 {

00064 <a class="code" href="a00084.html">bm::bvector<></a>::statistics st;

00065 bv.calc_stat(&st);

00066

00067 cout << "Bits count:" << bv.count() << endl;

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

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

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

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

00072 }

00073

00074

<a name="l00075"></a><a class="code" href="a00122.html#a3">00075</a> int <a class="code" href="a00120.html#a0">main</a>(void)

00076 {

00077 <a class="code" href="a00084.html">bm::bvector<></a> bv1;

00078 <a class="code" href="a00084.html">bm::bvector<></a> bv2;

00079

00080 bv2.<a class="code" href="a00084.html#a52">set_new_blocks_strat</a>(bm::BM_GAP); // set DGAP compression mode ON

00081

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

00083

00084 // For a given distrubution statistics should demonstrate

00085 // lower memory consumption for the vector with compression

00086

00087 <a class="code" href="a00122.html#a2">print_statistics</a>(bv1);

00088 <a class="code" href="a00122.html#a2">print_statistics</a>(bv2);

00089

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

100

00091

101

00092 bv1.<a class="code" href="a00084.html#a55">optimize</a>();

102

00093

103

00094 <a class="code" href="a00122.html#a2">print_statistics</a>(bv1);

104

00095

105

00096 return 0;

106

00097 }

107

00098

108

</pre></div><hr size="1"><address style="align: right;">Generated on Sun Aug 5 14:12:26 2007 for BitMagic by

109

110

111

</body>

112

</html>

Older »