~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>sample2.cpp</h1>Example demonstrates using set operations AND, OR, XOR, etc. 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 sample2.cpp

Example demonstrates using set operations AND, OR, XOR, etc.

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

*/

#include <iostream>

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

using namespace std;

void <a name="a7"></a><a class="code" href="a00121.html#a0">print_bvector</a>(const <a name="_a8"></a><a class="code" href="a00084.html">bm::bvector<></a>& bv)

{

unsigned value = bv.get_first();

do

{

cout << value;

value = bv.get_next(value);

if (value)

{

cout << ",";

}

else

{

break;

}

} while(1);

cout << endl;

}

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

{

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

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

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

bv1.<a name="a10"></a><a class="code" href="a00084.html#a21">set</a>(10);

bv1.<a class="code" href="a00084.html#a21">set</a>(100);

bv1.<a class="code" href="a00084.html#a21">set</a>(1000000);

bv2.<a class="code" href="a00084.html#a21">set</a>(10);

bv2.<a class="code" href="a00084.html#a21">set</a>(100);

// Logical AND operation on bv2 (bv1 is the argument)

// bv2 = bv2 AND bv1

bv3 = bv1 & bv2;

<a class="code" href="a00121.html#a0">print_bvector</a>(bv3);

bv2 &= bv1; // You also can use: bv2.bit_and(bv1);

<a class="code" href="a00121.html#a0">print_bvector</a>(bv2);

// bv2 = bv2 OR bv1

bv3 = bv1 | bv2;

<a class="code" href="a00121.html#a0">print_bvector</a>(bv3);

bv2 |= bv1; // You can also use: bv2.bit_or(bv1);

<a class="code" href="a00121.html#a0">print_bvector</a>(bv2);

bv1.<a class="code" href="a00084.html#a21">set</a>(1000000, false);

// bv2 = bv2 SUB bv1

bv3 = bv2 - bv1;

100

<a class="code" href="a00121.html#a0">print_bvector</a>(bv3);

101

102

bv2 -= bv1; // You can also use: bv2.bit_sub(bv1);

103

<a class="code" href="a00121.html#a0">print_bvector</a>(bv2);

104

105

// bv2 XOR bv1

106

107

bv3 = bv2 ^ bv1;

108

<a class="code" href="a00121.html#a0">print_bvector</a>(bv3);

109

110

bv2 ^= bv1; // You can also use: bv2.bit_xor(bv1);

111

<a class="code" href="a00121.html#a0">print_bvector</a>(bv2);

112

113

// For lexicographical comparison there is set of overloaded

114

// operators and function compare.

115

116

if (bv2 == bv3)

117

{

118

cerr << "Equivalent. Comparison result = "

119

<< bv2.<a name="a11"></a><a class="code" href="a00084.html#a58">compare</a>(bv3) << endl;

120

}

121

else

122

{

123

cout << "Error." << endl;

124

return 1;

125

}

126

127

128

return 0;

129

}

130

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

131

132

133

</body>

134

</html>

Older »