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

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

<a name="l00003"></a>00003

<a name="l00004"></a>00004 Permission is hereby granted, free of charge, to any person

<a name="l00005"></a>00005 obtaining a copy of this software and associated documentation

<a name="l00006"></a>00006 files (the "Software"), to deal in the Software without restriction,

<a name="l00007"></a>00007 including without limitation the rights to use, copy, modify, merge,

<a name="l00008"></a>00008 publish, distribute, sublicense, and/or sell copies of the Software,

<a name="l00009"></a>00009 and to permit persons to whom the Software is furnished to do so,

<a name="l00010"></a>00010 subject to the following conditions:

<a name="l00011"></a>00011

<a name="l00012"></a>00012 The above copyright notice and this permission notice shall be included

<a name="l00013"></a>00013 in all copies or substantial portions of the Software.

<a name="l00014"></a>00014

<a name="l00015"></a>00015 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,

<a name="l00016"></a>00016 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES

<a name="l00017"></a>00017 OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

<a name="l00018"></a>00018 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,

<a name="l00019"></a>00019 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,

<a name="l00020"></a>00020 ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

<a name="l00021"></a>00021 OTHER DEALINGS IN THE SOFTWARE.

<a name="l00022"></a>00022 */

<a name="l00023"></a>00023

<a name="l00024"></a>00024 /** \example sample1.cpp

<a name="l00025"></a>00025 Example of how to use bvector template class to set

<a name="l00026"></a>00026 bits and then retrieve indexes of ON bits.

<a name="l00027"></a>00027

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

<a name="l00029"></a>00029

<a name="l00030"></a>00030 \sa bm::bvector<>::get_next()

<a name="l00031"></a>00031 \sa bm::bvector<>::get_first()

<a name="l00032"></a>00032 \sa bm::bvector<>::set()

<a name="l00033"></a>00033 \sa bm::bvector<>::count()

<a name="l00034"></a>00034 \sa bm::bvector<>::clear()

<a name="l00035"></a>00035

<a name="l00036"></a>00036 */

<a name="l00037"></a>00037

<a name="l00038"></a>00038

<a name="l00039"></a>00039 #include <iostream>

<a name="l00040"></a>00040 #include "<a class="code" href="a00084.html">bm.h</a>"

<a name="l00041"></a>00041

<a name="l00042"></a>00042 using namespace std;

<a name="l00043"></a>00043

<a name="l00044"></a><a class="code" href="a00101.html#a840291bc02cba5474a4cb46a9b9566fe">00044</a> int <a class="code" href="a00101.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(void)

<a name="l00045"></a>00045 {

<a name="l00046"></a>00046 <a class="code" href="a00043.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv; // Bitvector variable declaration.

<a name="l00047"></a>00047

<a name="l00048"></a>00048 cout << bv.<a class="code" href="a00043.html#a71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;

<a name="l00049"></a>00049

<a name="l00050"></a>00050 // Set some bits.

<a name="l00051"></a>00051

<a name="l00052"></a>00052 bv.<a class="code" href="a00043.html#abc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(10);

<a name="l00053"></a>00053 bv.<a class="code" href="a00043.html#abc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(100);

<a name="l00054"></a>00054 bv.<a class="code" href="a00043.html#abc85ec9da74de03ff7e2a6c836656dd8" title="Sets bit n if val is true, clears bit n if val is false.">set</a>(1000000);

<a name="l00055"></a>00055

<a name="l00056"></a>00056 // New bitvector's count.

<a name="l00057"></a>00057

<a name="l00058"></a>00058 cout << bv.<a class="code" href="a00043.html#a71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;

<a name="l00059"></a>00059

<a name="l00060"></a>00060

<a name="l00061"></a>00061 // Print the bitvector.

<a name="l00062"></a>00062

<a name="l00063"></a>00063 unsigned value = bv.<a class="code" href="a00043.html#af3129b35cabf0554d85711c085a8616d" title="Gets number of first bit which is ON.">get_first</a>();

<a name="l00064"></a>00064 do

<a name="l00065"></a>00065 {

<a name="l00066"></a>00066 cout << value;

<a name="l00067"></a>00067 value = bv.<a class="code" href="a00043.html#adef9c095a682a9857068c280e37c8240" title="Finds the number of the next bit ON.">get_next</a>(value);

<a name="l00068"></a>00068 if (value)

<a name="l00069"></a>00069 {

<a name="l00070"></a>00070 cout << ",";

<a name="l00071"></a>00071 }

<a name="l00072"></a>00072 else

100

<a name="l00073"></a>00073 {

101

<a name="l00074"></a>00074 break;

102

<a name="l00075"></a>00075 }

103

<a name="l00076"></a>00076 } while(1);

104

<a name="l00077"></a>00077

105

<a name="l00078"></a>00078 cout << endl;

106

<a name="l00079"></a>00079

107

<a name="l00080"></a>00080 bv.<a class="code" href="a00043.html#afe98c658c4ee54155e61f9bdfa7b9019" title="Clears every bit in the bitvector.">clear</a>(); // Clean up.

108

<a name="l00081"></a>00081

109

<a name="l00082"></a>00082 cout << bv.<a class="code" href="a00043.html#a71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;

110

<a name="l00083"></a>00083

111

<a name="l00084"></a>00084 // We also can use operators to set-clear bits;

112

<a name="l00085"></a>00085

113

<a name="l00086"></a>00086 bv[10] = true;

114

<a name="l00087"></a>00087 bv[100] = true;

115

<a name="l00088"></a>00088 bv[10000] = true;

116

<a name="l00089"></a>00089

117

<a name="l00090"></a>00090 cout << bv.<a class="code" href="a00043.html#a71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;

118

<a name="l00091"></a>00091

119

<a name="l00092"></a>00092 if (bv[10])

120

<a name="l00093"></a>00093 {

121

<a name="l00094"></a>00094 bv[10] = false;

122

<a name="l00095"></a>00095 }

123

<a name="l00096"></a>00096

124

<a name="l00097"></a>00097 cout << bv.<a class="code" href="a00043.html#a71077c1315555301532e24d4d2b95ea2" title="Returns count of bits which are 1.">count</a>() << endl;

125

<a name="l00098"></a>00098

126

<a name="l00099"></a>00099 return 0;

127

<a name="l00100"></a>00100 }

128

<a name="l00101"></a>00101

129

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

130

<hr size="1"/><address style="text-align: right;">Generated on Sun Nov 22 10:49:36 2009 for BitMagic by

131

132

133

</body>

134

</html>

Older »