~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>

<h1>sample5.cpp</h1>Example demonstrates using enumerators - the fastest way to retrieve indexes of 1 bits from the bitvector. This approach works faster than get_first/get_next functions.

<dl compact><dt>See also:</dt><dd><a class="el" href="a00084.html#n1">bm::bvector<>::enumerator</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 sample5.cpp

Example demonstrates using enumerators - the fastest way to retrieve

indexes of 1 bits from the bitvector. This approach works faster than

get_first/get_next functions.

\sa bm::bvector<>::enumerator

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

*/

#include <iostream>

#include <algorithm>

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

using namespace std;

void <a name="a28"></a><a class="code" href="a00124.html#a0">Print</a>(unsigned n)

{

cout << n << endl;;

}

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

{

<a name="_a30"></a><a class="code" href="a00084.html">bm::bvector<></a> bv;

bv[10] = true;

bv[100] = true;

bv[10000] = true;

<a class="code" href="a00084.html">bm::bvector<></a>::enumerator en = bv.<a name="a31"></a><a class="code" href="a00084.html#a61">first</a>();

<a class="code" href="a00084.html">bm::bvector<></a>::enumerator en_end = bv.<a name="a32"></a><a class="code" href="a00084.html#a62">end</a>();

while (en < en_end)

{

cout << *en << endl;

++en; // Fastest way to increment enumerator

}

en = bv.<a class="code" href="a00084.html#a61">first</a>();

// This is not the fastest way to do the job, because for_each

// often will try to calculate difference between iterators,

// which is expensive for enumerators.

// But it can be useful for some STL loyal applications.

std::for_each(en, en_end, Print);

return 0;

}

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

</body>

</html>

Older »