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

<h1>sample5.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 sample5.cpp

<a name="l00025"></a>00025 Example demonstrates using enumerators - the fastest way to retrieve

<a name="l00026"></a>00026 indexes of 1 bits from the bitvector. This approach works faster than

<a name="l00027"></a>00027 get_first/get_next functions.

<a name="l00028"></a>00028

<a name="l00029"></a>00029 \sa bm::bvector<>::enumerator

<a name="l00030"></a>00030

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

<a name="l00032"></a>00032

<a name="l00033"></a>00033 */

<a name="l00034"></a>00034

<a name="l00035"></a>00035 #include <iostream>

<a name="l00036"></a>00036 #include <algorithm>

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

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

<a name="l00039"></a>00039 using namespace std;

<a name="l00040"></a>00040

<a name="l00041"></a><a class="code" href="a00101.html#80085d7c877f4c6f36d10c67dc163845">00041</a> void <a class="code" href="a00101.html#80085d7c877f4c6f36d10c67dc163845">Print</a>(unsigned n)

<a name="l00042"></a>00042 {

<a name="l00043"></a>00043 cout << n << endl;;

<a name="l00044"></a>00044 }

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

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

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

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

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

<a name="l00050"></a>00050 bv[10] = true;

<a name="l00051"></a>00051 bv[100] = true;

<a name="l00052"></a>00052 bv[10000] = true;

<a name="l00053"></a>00053

<a name="l00054"></a>00054 <a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<>::enumerator</a> en = bv.<a class="code" href="a00040.html#ad48c661f843e32c9893438a6f27a8f0" title="Returns enumerator pointing on the first non-zero bit.">first</a>();

<a name="l00055"></a>00055 <a class="code" href="a00040.html" title="bitvector with runtime compression of bits.">bm::bvector<>::enumerator</a> en_end = bv.<a class="code" href="a00040.html#2c6e522f858fdc466765d2c0f269f590" title="Returns enumerator pointing on the next bit after the last.">end</a>();

<a name="l00056"></a>00056

<a name="l00057"></a>00057 while (en < en_end)

<a name="l00058"></a>00058 {

<a name="l00059"></a>00059 cout << *en << endl;

<a name="l00060"></a>00060 ++en; // Fastest way to increment enumerator

<a name="l00061"></a>00061 }

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

<a name="l00063"></a>00063 en = bv.<a class="code" href="a00040.html#ad48c661f843e32c9893438a6f27a8f0" title="Returns enumerator pointing on the first non-zero bit.">first</a>();

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

<a name="l00065"></a>00065 // This is not the fastest way to do the job, because for_each

<a name="l00066"></a>00066 // often will try to calculate difference between iterators,

<a name="l00067"></a>00067 // which is expensive for enumerators.

<a name="l00068"></a>00068 // But it can be useful for some STL loyal applications.

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

<a name="l00070"></a>00070 std::for_each(en, en_end, <a class="code" href="a00101.html#80085d7c877f4c6f36d10c67dc163845">Print</a>);

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

<a name="l00072"></a>00072 return 0;

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

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

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

</body>

</html>

Older »