1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en_US" lang="en_US">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<!-- qbitarray.cpp -->
<title>Qt 4.8: QBitArray Class Reference</title>
<link rel="stylesheet" type="text/css" href="style/offline.css" />
</head>
<body>
<div class="header" id="qtdocheader">
<div class="content">
<a href="index.html" class="qtref"><span>Qt Reference Documentation</span></a>
</div>
<div class="breadcrumb toolblock">
<ul>
<li class="first"><a href="index.html">Home</a></li>
<!-- Breadcrumbs go here -->
<li><a href="modules.html">Modules</a></li>
<li><a href="qtcore.html">QtCore</a></li>
<li>QBitArray</li>
</ul>
</div>
</div>
<div class="content mainContent">
<div class="toc">
<h3><a name="toc">Contents</a></h3>
<ul>
<li class="level1"><a href="#public-functions">Public Functions</a></li>
<li class="level1"><a href="#related-non-members">Related Non-Members</a></li>
<li class="level1"><a href="#details">Detailed Description</a></li>
</ul>
</div>
<h1 class="title">QBitArray Class Reference</h1>
<!-- $$$QBitArray-brief -->
<p>The QBitArray class provides an array of bits. <a href="#details">More...</a></p>
<!-- @@@QBitArray -->
<pre class="cpp"> <span class="preprocessor">#include <QBitArray></span></pre><p><b>Note:</b> All functions in this class are <a href="threads-reentrancy.html#reentrant">reentrant</a>.</p>
<ul>
<li><a href="qbitarray-members.html">List of all members, including inherited members</a></li>
</ul>
<a name="public-functions"></a>
<h2>Public Functions</h2>
<table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#QBitArray">QBitArray</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#QBitArray-2">QBitArray</a></b> ( int <i>size</i>, bool <i>value</i> = false )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#QBitArray-3">QBitArray</a></b> ( const QBitArray & <i>other</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#at">at</a></b> ( int <i>i</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#clear">clear</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#clearBit">clearBit</a></b> ( int <i>i</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#count">count</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#count-2">count</a></b> ( bool <i>on</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#fill">fill</a></b> ( bool <i>value</i>, int <i>size</i> = -1 )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#fill-2">fill</a></b> ( bool <i>value</i>, int <i>begin</i>, int <i>end</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#isEmpty">isEmpty</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#isNull">isNull</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#resize">resize</a></b> ( int <i>size</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#setBit">setBit</a></b> ( int <i>i</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#setBit-2">setBit</a></b> ( int <i>i</i>, bool <i>value</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#size">size</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#swap">swap</a></b> ( QBitArray & <i>other</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#testBit">testBit</a></b> ( int <i>i</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#toggleBit">toggleBit</a></b> ( int <i>i</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#truncate">truncate</a></b> ( int <i>pos</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-not-eq">operator!=</a></b> ( const QBitArray & <i>other</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray & </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-and-eq">operator&=</a></b> ( const QBitArray & <i>other</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray & </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-eq">operator=</a></b> ( const QBitArray & <i>other</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-eq-eq">operator==</a></b> ( const QBitArray & <i>other</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitRef </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-5b-5d">operator[]</a></b> ( int <i>i</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-5b-5d-2">operator[]</a></b> ( int <i>i</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitRef </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-5b-5d-3">operator[]</a></b> ( uint <i>i</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-5b-5d-4">operator[]</a></b> ( uint <i>i</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray & </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-5e-eq">operator^=</a></b> ( const QBitArray & <i>other</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray & </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-7c-eq">operator|=</a></b> ( const QBitArray & <i>other</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-7e">operator~</a></b> () const</td></tr>
</table>
<a name="related-non-members"></a>
<h2>Related Non-Members</h2>
<table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-and">operator&</a></b> ( const QBitArray & <i>a1</i>, const QBitArray & <i>a2</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QDataStream & </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-lt-lt-82">operator<<</a></b> ( QDataStream & <i>out</i>, const QBitArray & <i>ba</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QDataStream & </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-gt-gt-43">operator>></a></b> ( QDataStream & <i>in</i>, QBitArray & <i>ba</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-5e">operator^</a></b> ( const QBitArray & <i>a1</i>, const QBitArray & <i>a2</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QBitArray </td><td class="memItemRight bottomAlign"><b><a href="qbitarray.html#operator-7c">operator|</a></b> ( const QBitArray & <i>a1</i>, const QBitArray & <i>a2</i> )</td></tr>
</table>
<a name="details"></a>
<!-- $$$QBitArray-description -->
<div class="descr">
<h2>Detailed Description</h2>
<p>The QBitArray class provides an array of bits.</p>
<p>A QBitArray is an array that gives access to individual bits and provides operators (<a href="qbitarray.html#operator-and">AND</a>, <a href="qbitarray.html#operator-7c">OR</a>, <a href="qbitarray.html#operator-5e">XOR</a>, and <a href="qbitarray.html#operator-7e">NOT</a>) that work on entire arrays of bits. It uses <a href="implicit-sharing.html">implicit sharing</a> (copy-on-write) to reduce memory usage and to avoid the needless copying of data.</p>
<p>The following code constructs a QBitArray containing 200 bits initialized to false (0):</p>
<pre class="cpp"> <span class="type">QBitArray</span> ba(<span class="number">200</span>);</pre>
<p>To initialize the bits to true, either pass <tt>true</tt> as second argument to the constructor, or call <a href="qbitarray.html#fill">fill</a>() later on.</p>
<p>QBitArray uses 0-based indexes, just like C++ arrays. To access the bit at a particular index position, you can use operator[](). On non-const bit arrays, operator[]() returns a reference to a bit that can be used on the left side of an assignment. For example:</p>
<pre class="cpp"> <span class="type">QBitArray</span> ba;
ba<span class="operator">.</span><a href="qbitarray.html#resize">resize</a>(<span class="number">3</span>);
ba<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="keyword">true</span>;
ba<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="keyword">false</span>;
ba<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="keyword">true</span>;</pre>
<p>For technical reasons, it is more efficient to use <a href="qbitarray.html#testBit">testBit</a>() and <a href="qbitarray.html#setBit">setBit</a>() to access bits in the array than operator[](). For example:</p>
<pre class="cpp"> <span class="type">QBitArray</span> ba(<span class="number">3</span>);
ba<span class="operator">.</span><a href="qbitarray.html#setBit">setBit</a>(<span class="number">0</span><span class="operator">,</span> <span class="keyword">true</span>);
ba<span class="operator">.</span><a href="qbitarray.html#setBit">setBit</a>(<span class="number">1</span><span class="operator">,</span> <span class="keyword">false</span>);
ba<span class="operator">.</span><a href="qbitarray.html#setBit">setBit</a>(<span class="number">2</span><span class="operator">,</span> <span class="keyword">true</span>);</pre>
<p>QBitArray supports <tt>&</tt> (<a href="qbitarray.html#operator-and">AND</a>), <tt>|</tt> (<a href="qbitarray.html#operator-7c">OR</a>), <tt>^</tt> (<a href="qbitarray.html#operator-5e">XOR</a>), <tt>~</tt> (<a href="qbitarray.html#operator-7e">NOT</a>), as well as <tt>&=</tt>, <tt>|=</tt>, and <tt>^=</tt>. These operators work in the same way as the built-in C++ bitwise operators of the same name. For example:</p>
<pre class="cpp"> <span class="type">QBitArray</span> x(<span class="number">5</span>);
x<span class="operator">.</span><a href="qbitarray.html#setBit">setBit</a>(<span class="number">3</span><span class="operator">,</span> <span class="keyword">true</span>);
<span class="comment">// x: [ 0, 0, 0, 1, 0 ]</span>
<span class="type">QBitArray</span> y(<span class="number">5</span>);
y<span class="operator">.</span><a href="qbitarray.html#setBit">setBit</a>(<span class="number">4</span><span class="operator">,</span> <span class="keyword">true</span>);
<span class="comment">// y: [ 0, 0, 0, 0, 1 ]</span>
x <span class="operator">|</span><span class="operator">=</span> y;
<span class="comment">// x: [ 0, 0, 0, 1, 1 ]</span></pre>
<p>For historical reasons, QBitArray distinguishes between a null bit array and an empty bit array. A <i>null</i> bit array is a bit array that is initialized using QBitArray's default constructor. An <i>empty</i> bit array is any bit array with size 0. A null bit array is always empty, but an empty bit array isn't necessarily null:</p>
<pre class="cpp"> <span class="type">QBitArray</span>()<span class="operator">.</span><a href="qbitarray.html#isNull">isNull</a>(); <span class="comment">// returns true</span>
<span class="type">QBitArray</span>()<span class="operator">.</span><a href="qbitarray.html#isEmpty">isEmpty</a>(); <span class="comment">// returns true</span>
<span class="type">QBitArray</span>(<span class="number">0</span>)<span class="operator">.</span><a href="qbitarray.html#isNull">isNull</a>(); <span class="comment">// returns false</span>
<span class="type">QBitArray</span>(<span class="number">0</span>)<span class="operator">.</span><a href="qbitarray.html#isEmpty">isEmpty</a>(); <span class="comment">// returns true</span>
<span class="type">QBitArray</span>(<span class="number">3</span>)<span class="operator">.</span><a href="qbitarray.html#isNull">isNull</a>(); <span class="comment">// returns false</span>
<span class="type">QBitArray</span>(<span class="number">3</span>)<span class="operator">.</span><a href="qbitarray.html#isEmpty">isEmpty</a>(); <span class="comment">// returns false</span></pre>
<p>All functions except <a href="qbitarray.html#isNull">isNull</a>() treat null bit arrays the same as empty bit arrays; for example, <a href="qbitarray.html#QBitArray">QBitArray</a>() compares equal to QBitArray(0). We recommend that you always use <a href="qbitarray.html#isEmpty">isEmpty</a>() and avoid <a href="qbitarray.html#isNull">isNull</a>().</p>
</div>
<p><b>See also </b><a href="qbytearray.html">QByteArray</a> and <a href="qvector.html">QVector</a>.</p>
<!-- @@@QBitArray -->
<div class="func">
<h2>Member Function Documentation</h2>
<!-- $$$QBitArray[overload1]$$$QBitArray -->
<h3 class="fn"><a name="QBitArray"></a>QBitArray::<span class="name">QBitArray</span> ()</h3>
<p>Constructs an empty bit array.</p>
<p><b>See also </b><a href="qbitarray.html#isEmpty">isEmpty</a>().</p>
<!-- @@@QBitArray -->
<!-- $$$QBitArray$$$QBitArrayintbool -->
<h3 class="fn"><a name="QBitArray-2"></a>QBitArray::<span class="name">QBitArray</span> ( <span class="type">int</span> <i>size</i>, <span class="type">bool</span> <i>value</i> = false )</h3>
<p>Constructs a bit array containing <i>size</i> bits. The bits are initialized with <i>value</i>, which defaults to false (0).</p>
<!-- @@@QBitArray -->
<!-- $$$QBitArray$$$QBitArrayconstQBitArray& -->
<h3 class="fn"><a name="QBitArray-3"></a>QBitArray::<span class="name">QBitArray</span> ( const <span class="type">QBitArray</span> & <i>other</i> )</h3>
<p>Constructs a copy of <i>other</i>.</p>
<p>This operation takes <a href="containers.html#constant-time">constant time</a>, because <a href="qbitarray.html">QBitArray</a> is <a href="implicit-sharing.html#implicitly-shared">implicitly shared</a>. This makes returning a <a href="qbitarray.html">QBitArray</a> from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and that takes <a href="containers.html#linear-time">linear time</a>.</p>
<p><b>See also </b><a href="qbitarray.html#operator-eq">operator=</a>().</p>
<!-- @@@QBitArray -->
<!-- $$$at[overload1]$$$atint -->
<h3 class="fn"><a name="at"></a><span class="type">bool</span> QBitArray::<span class="name">at</span> ( <span class="type">int</span> <i>i</i> ) const</h3>
<p>Returns the value of the bit at index position <i>i</i>.</p>
<p><i>i</i> must be a valid index position in the bit array (i.e., 0 <= <i>i</i> < <a href="qbitarray.html#size">size</a>()).</p>
<p><b>See also </b><a href="qbitarray.html#operator-5b-5d">operator[]</a>().</p>
<!-- @@@at -->
<!-- $$$clear[overload1]$$$clear -->
<h3 class="fn"><a name="clear"></a><span class="type">void</span> QBitArray::<span class="name">clear</span> ()</h3>
<p>Clears the contents of the bit array and makes it empty.</p>
<p><b>See also </b><a href="qbitarray.html#resize">resize</a>() and <a href="qbitarray.html#isEmpty">isEmpty</a>().</p>
<!-- @@@clear -->
<!-- $$$clearBit[overload1]$$$clearBitint -->
<h3 class="fn"><a name="clearBit"></a><span class="type">void</span> QBitArray::<span class="name">clearBit</span> ( <span class="type">int</span> <i>i</i> )</h3>
<p>Sets the bit at index position <i>i</i> to 0.</p>
<p><i>i</i> must be a valid index position in the bit array (i.e., 0 <= <i>i</i> < <a href="qbitarray.html#size">size</a>()).</p>
<p><b>See also </b><a href="qbitarray.html#setBit">setBit</a>() and <a href="qbitarray.html#toggleBit">toggleBit</a>().</p>
<!-- @@@clearBit -->
<!-- $$$count[overload1]$$$count -->
<h3 class="fn"><a name="count"></a><span class="type">int</span> QBitArray::<span class="name">count</span> () const</h3>
<p>Same as <a href="qbitarray.html#size">size</a>().</p>
<!-- @@@count -->
<!-- $$$count$$$countbool -->
<h3 class="fn"><a name="count-2"></a><span class="type">int</span> QBitArray::<span class="name">count</span> ( <span class="type">bool</span> <i>on</i> ) const</h3>
<p>If <i>on</i> is true, this function returns the number of 1-bits stored in the bit array; otherwise the number of 0-bits is returned.</p>
<!-- @@@count -->
<!-- $$$fill[overload1]$$$fillboolint -->
<h3 class="fn"><a name="fill"></a><span class="type">bool</span> QBitArray::<span class="name">fill</span> ( <span class="type">bool</span> <i>value</i>, <span class="type">int</span> <i>size</i> = -1 )</h3>
<p>Sets every bit in the bit array to <i>value</i>, returning true if successful; otherwise returns false. If <i>size</i> is different from -1 (the default), the bit array is resized to <i>size</i> beforehand.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> ba(<span class="number">8</span>);
ba<span class="operator">.</span>fill(<span class="keyword">true</span>);
<span class="comment">// ba: [ 1, 1, 1, 1, 1, 1, 1, 1 ]</span>
ba<span class="operator">.</span>fill(<span class="keyword">false</span><span class="operator">,</span> <span class="number">2</span>);
<span class="comment">// ba: [ 0, 0 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#resize">resize</a>().</p>
<!-- @@@fill -->
<!-- $$$fill$$$fillboolintint -->
<h3 class="fn"><a name="fill-2"></a><span class="type">void</span> QBitArray::<span class="name">fill</span> ( <span class="type">bool</span> <i>value</i>, <span class="type">int</span> <i>begin</i>, <span class="type">int</span> <i>end</i> )</h3>
<p>This is an overloaded function.</p>
<p>Sets bits at index positions <i>begin</i> up to and excluding <i>end</i> to <i>value</i>.</p>
<p><i>begin</i> and <i>end</i> must be a valid index position in the bit array (i.e., 0 <= <i>begin</i> <= <a href="qbitarray.html#size">size</a>() and 0 <= <i>end</i> <= <a href="qbitarray.html#size">size</a>()).</p>
<!-- @@@fill -->
<!-- $$$isEmpty[overload1]$$$isEmpty -->
<h3 class="fn"><a name="isEmpty"></a><span class="type">bool</span> QBitArray::<span class="name">isEmpty</span> () const</h3>
<p>Returns true if this bit array has size 0; otherwise returns false.</p>
<p><b>See also </b><a href="qbitarray.html#size">size</a>().</p>
<!-- @@@isEmpty -->
<!-- $$$isNull[overload1]$$$isNull -->
<h3 class="fn"><a name="isNull"></a><span class="type">bool</span> QBitArray::<span class="name">isNull</span> () const</h3>
<p>Returns true if this bit array is null; otherwise returns false.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span>()<span class="operator">.</span>isNull(); <span class="comment">// returns true</span>
<span class="type"><a href="qbitarray.html">QBitArray</a></span>(<span class="number">0</span>)<span class="operator">.</span>isNull(); <span class="comment">// returns false</span>
<span class="type"><a href="qbitarray.html">QBitArray</a></span>(<span class="number">3</span>)<span class="operator">.</span>isNull(); <span class="comment">// returns false</span></pre>
<p>Qt makes a distinction between null bit arrays and empty bit arrays for historical reasons. For most applications, what matters is whether or not a bit array contains any data, and this can be determined using <a href="qbitarray.html#isEmpty">isEmpty</a>().</p>
<p><b>See also </b><a href="qbitarray.html#isEmpty">isEmpty</a>().</p>
<!-- @@@isNull -->
<!-- $$$resize[overload1]$$$resizeint -->
<h3 class="fn"><a name="resize"></a><span class="type">void</span> QBitArray::<span class="name">resize</span> ( <span class="type">int</span> <i>size</i> )</h3>
<p>Resizes the bit array to <i>size</i> bits.</p>
<p>If <i>size</i> is greater than the current size, the bit array is extended to make it <i>size</i> bits with the extra bits added to the end. The new bits are initialized to false (0).</p>
<p>If <i>size</i> is less than the current size, bits are removed from the end.</p>
<p><b>See also </b><a href="qbitarray.html#size">size</a>().</p>
<!-- @@@resize -->
<!-- $$$setBit[overload1]$$$setBitint -->
<h3 class="fn"><a name="setBit"></a><span class="type">void</span> QBitArray::<span class="name">setBit</span> ( <span class="type">int</span> <i>i</i> )</h3>
<p>Sets the bit at index position <i>i</i> to 1.</p>
<p><i>i</i> must be a valid index position in the bit array (i.e., 0 <= <i>i</i> < <a href="qbitarray.html#size">size</a>()).</p>
<p><b>See also </b><a href="qbitarray.html#clearBit">clearBit</a>() and <a href="qbitarray.html#toggleBit">toggleBit</a>().</p>
<!-- @@@setBit -->
<!-- $$$setBit$$$setBitintbool -->
<h3 class="fn"><a name="setBit-2"></a><span class="type">void</span> QBitArray::<span class="name">setBit</span> ( <span class="type">int</span> <i>i</i>, <span class="type">bool</span> <i>value</i> )</h3>
<p>This is an overloaded function.</p>
<p>Sets the bit at index position <i>i</i> to <i>value</i>.</p>
<!-- @@@setBit -->
<!-- $$$size[overload1]$$$size -->
<h3 class="fn"><a name="size"></a><span class="type">int</span> QBitArray::<span class="name">size</span> () const</h3>
<p>Returns the number of bits stored in the bit array.</p>
<p><b>See also </b><a href="qbitarray.html#resize">resize</a>().</p>
<!-- @@@size -->
<!-- $$$swap[overload1]$$$swapQBitArray& -->
<h3 class="fn"><a name="swap"></a><span class="type">void</span> QBitArray::<span class="name">swap</span> ( <span class="type">QBitArray</span> & <i>other</i> )</h3>
<p>Swaps bit array <i>other</i> with this bit array. This operation is very fast and never fails.</p>
<p>This function was introduced in Qt 4.8.</p>
<!-- @@@swap -->
<!-- $$$testBit[overload1]$$$testBitint -->
<h3 class="fn"><a name="testBit"></a><span class="type">bool</span> QBitArray::<span class="name">testBit</span> ( <span class="type">int</span> <i>i</i> ) const</h3>
<p>Returns true if the bit at index position <i>i</i> is 1; otherwise returns false.</p>
<p><i>i</i> must be a valid index position in the bit array (i.e., 0 <= <i>i</i> < <a href="qbitarray.html#size">size</a>()).</p>
<p><b>See also </b><a href="qbitarray.html#setBit">setBit</a>() and <a href="qbitarray.html#clearBit">clearBit</a>().</p>
<!-- @@@testBit -->
<!-- $$$toggleBit[overload1]$$$toggleBitint -->
<h3 class="fn"><a name="toggleBit"></a><span class="type">bool</span> QBitArray::<span class="name">toggleBit</span> ( <span class="type">int</span> <i>i</i> )</h3>
<p>Inverts the value of the bit at index position <i>i</i>, returning the previous value of that bit as either true (if it was set) or false (if it was unset).</p>
<p>If the previous value was 0, the new value will be 1. If the previous value was 1, the new value will be 0.</p>
<p><i>i</i> must be a valid index position in the bit array (i.e., 0 <= <i>i</i> < <a href="qbitarray.html#size">size</a>()).</p>
<p><b>See also </b><a href="qbitarray.html#setBit">setBit</a>() and <a href="qbitarray.html#clearBit">clearBit</a>().</p>
<!-- @@@toggleBit -->
<!-- $$$truncate[overload1]$$$truncateint -->
<h3 class="fn"><a name="truncate"></a><span class="type">void</span> QBitArray::<span class="name">truncate</span> ( <span class="type">int</span> <i>pos</i> )</h3>
<p>Truncates the bit array at index position <i>pos</i>.</p>
<p>If <i>pos</i> is beyond the end of the array, nothing happens.</p>
<p><b>See also </b><a href="qbitarray.html#resize">resize</a>().</p>
<!-- @@@truncate -->
<!-- $$$operator!=[overload1]$$$operator!=constQBitArray& -->
<h3 class="fn"><a name="operator-not-eq"></a><span class="type">bool</span> QBitArray::<span class="name">operator!=</span> ( const <span class="type">QBitArray</span> & <i>other</i> ) const</h3>
<p>Returns true if <i>other</i> is not equal to this bit array; otherwise returns false.</p>
<p><b>See also </b><a href="qbitarray.html#operator-eq-eq">operator==</a>().</p>
<!-- @@@operator!= -->
<!-- $$$operator&=[overload1]$$$operator&=constQBitArray& -->
<h3 class="fn"><a name="operator-and-eq"></a><span class="type">QBitArray</span> & QBitArray::<span class="name">operator&=</span> ( const <span class="type">QBitArray</span> & <i>other</i> )</h3>
<p>Performs the AND operation between all bits in this bit array and <i>other</i>. Assigns the result to this bit array, and returns a reference to it.</p>
<p>The result has the length of the longest of the two bit arrays, with any missing bits (if one array is shorter than the other) taken to be 0.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b(<span class="number">2</span>);
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; b<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; <span class="comment">// b: [ 1, 1 ]</span>
a <span class="operator">&</span><span class="operator">=</span> b; <span class="comment">// a: [ 1, 0, 0 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-and">operator&</a>(), <a href="qbitarray.html#operator-7c-eq">operator|=</a>(), <a href="qbitarray.html#operator-5e-eq">operator^=</a>(), and <a href="qbitarray.html#operator-7e">operator~</a>().</p>
<!-- @@@operator&= -->
<!-- $$$operator=[overload1]$$$operator=constQBitArray& -->
<h3 class="fn"><a name="operator-eq"></a><span class="type">QBitArray</span> & QBitArray::<span class="name">operator=</span> ( const <span class="type">QBitArray</span> & <i>other</i> )</h3>
<p>Assigns <i>other</i> to this bit array and returns a reference to this bit array.</p>
<!-- @@@operator= -->
<!-- $$$operator==[overload1]$$$operator==constQBitArray& -->
<h3 class="fn"><a name="operator-eq-eq"></a><span class="type">bool</span> QBitArray::<span class="name">operator==</span> ( const <span class="type">QBitArray</span> & <i>other</i> ) const</h3>
<p>Returns true if <i>other</i> is equal to this bit array; otherwise returns false.</p>
<p><b>See also </b><a href="qbitarray.html#operator-not-eq">operator!=</a>().</p>
<!-- @@@operator== -->
<!-- $$$operator[][overload1]$$$operator[]int -->
<h3 class="fn"><a name="operator-5b-5d"></a><span class="type">QBitRef</span> QBitArray::<span class="name">operator[]</span> ( <span class="type">int</span> <i>i</i> )</h3>
<p>Returns the bit at index position <i>i</i> as a modifiable reference.</p>
<p><i>i</i> must be a valid index position in the bit array (i.e., 0 <= <i>i</i> < <a href="qbitarray.html#size">size</a>()).</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="keyword">false</span>;
a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="keyword">true</span>;
a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">^</span> a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span>;</pre>
<p>The return value is of type QBitRef, a helper class for <a href="qbitarray.html">QBitArray</a>. When you get an object of type QBitRef, you can assign to it, and the assignment will apply to the bit in the <a href="qbitarray.html">QBitArray</a> from which you got the reference.</p>
<p>The functions <a href="qbitarray.html#testBit">testBit</a>(), <a href="qbitarray.html#setBit">setBit</a>(), and <a href="qbitarray.html#clearBit">clearBit</a>() are slightly faster.</p>
<p><b>See also </b><a href="qbitarray.html#at">at</a>(), <a href="qbitarray.html#testBit">testBit</a>(), <a href="qbitarray.html#setBit">setBit</a>(), and <a href="qbitarray.html#clearBit">clearBit</a>().</p>
<!-- @@@operator[] -->
<!-- $$$operator[]$$$operator[]int -->
<h3 class="fn"><a name="operator-5b-5d-2"></a><span class="type">bool</span> QBitArray::<span class="name">operator[]</span> ( <span class="type">int</span> <i>i</i> ) const</h3>
<p>This is an overloaded function.</p>
<!-- @@@operator[] -->
<!-- $$$operator[]$$$operator[]uint -->
<h3 class="fn"><a name="operator-5b-5d-3"></a><span class="type">QBitRef</span> QBitArray::<span class="name">operator[]</span> ( <span class="type"><a href="qtglobal.html#uint-typedef">uint</a></span> <i>i</i> )</h3>
<p>This is an overloaded function.</p>
<!-- @@@operator[] -->
<!-- $$$operator[]$$$operator[]uint -->
<h3 class="fn"><a name="operator-5b-5d-4"></a><span class="type">bool</span> QBitArray::<span class="name">operator[]</span> ( <span class="type"><a href="qtglobal.html#uint-typedef">uint</a></span> <i>i</i> ) const</h3>
<p>This is an overloaded function.</p>
<!-- @@@operator[] -->
<!-- $$$operator^=[overload1]$$$operator^=constQBitArray& -->
<h3 class="fn"><a name="operator-5e-eq"></a><span class="type">QBitArray</span> & QBitArray::<span class="name">operator^=</span> ( const <span class="type">QBitArray</span> & <i>other</i> )</h3>
<p>Performs the XOR operation between all bits in this bit array and <i>other</i>. Assigns the result to this bit array, and returns a reference to it.</p>
<p>The result has the length of the longest of the two bit arrays, with any missing bits (if one array is shorter than the other) taken to be 0.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b(<span class="number">2</span>);
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; b<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; <span class="comment">// b: [ 1, 1 ]</span>
a <span class="operator">^</span><span class="operator">=</span> b; <span class="comment">// a: [ 0, 1, 1 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-5e">operator^</a>(), <a href="qbitarray.html#operator-and-eq">operator&=</a>(), <a href="qbitarray.html#operator-7c-eq">operator|=</a>(), and <a href="qbitarray.html#operator-7e">operator~</a>().</p>
<!-- @@@operator^= -->
<!-- $$$operator|=[overload1]$$$operator|=constQBitArray& -->
<h3 class="fn"><a name="operator-7c-eq"></a><span class="type">QBitArray</span> & QBitArray::<span class="name">operator|=</span> ( const <span class="type">QBitArray</span> & <i>other</i> )</h3>
<p>Performs the OR operation between all bits in this bit array and <i>other</i>. Assigns the result to this bit array, and returns a reference to it.</p>
<p>The result has the length of the longest of the two bit arrays, with any missing bits (if one array is shorter than the other) taken to be 0.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b(<span class="number">2</span>);
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; b<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; <span class="comment">// b: [ 1, 1 ]</span>
a <span class="operator">|</span><span class="operator">=</span> b; <span class="comment">// a: [ 1, 1, 1 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-7c">operator|</a>(), <a href="qbitarray.html#operator-and-eq">operator&=</a>(), <a href="qbitarray.html#operator-5e-eq">operator^=</a>(), and <a href="qbitarray.html#operator-7e">operator~</a>().</p>
<!-- @@@operator|= -->
<!-- $$$operator~[overload1]$$$operator~ -->
<h3 class="fn"><a name="operator-7e"></a><span class="type">QBitArray</span> QBitArray::<span class="name">operator~</span> () const</h3>
<p>Returns a bit array that contains the inverted bits of this bit array.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b;
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b <span class="operator">=</span> <span class="operator">~</span>a; <span class="comment">// b: [ 0, 1, 0 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-and">operator&</a>(), <a href="qbitarray.html#operator-7c">operator|</a>(), and <a href="qbitarray.html#operator-5e">operator^</a>().</p>
<!-- @@@operator~ -->
</div>
<div class="relnonmem">
<h2>Related Non-Members</h2>
<!-- $$$operator&[overload1]$$$operator&constQBitArray&constQBitArray& -->
<h3 class="fn"><a name="operator-and"></a><span class="type">QBitArray</span> <span class="name">operator&</span> ( const <span class="type">QBitArray</span> & <i>a1</i>, const <span class="type">QBitArray</span> & <i>a2</i> )</h3>
<p>Returns a bit array that is the AND of the bit arrays <i>a1</i> and <i>a2</i>.</p>
<p>The result has the length of the longest of the two bit arrays, with any missing bits (if one array is shorter than the other) taken to be 0.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b(<span class="number">2</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> c;
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; b<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; <span class="comment">// b: [ 1, 1 ]</span>
c <span class="operator">=</span> a <span class="operator">&</span> b; <span class="comment">// c: [ 1, 0, 0 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-and-eq">QBitArray::operator&=</a>(), <a href="qbitarray.html#operator-7c">operator|</a>(), and <a href="qbitarray.html#operator-5e">operator^</a>().</p>
<!-- @@@operator& -->
<!-- $$$operator<<$$$operator<<QDataStream&constQBitArray& -->
<h3 class="fn"><a name="operator-lt-lt-82"></a><span class="type"><a href="qdatastream.html">QDataStream</a></span> & <span class="name">operator<<</span> ( <span class="type"><a href="qdatastream.html">QDataStream</a></span> & <i>out</i>, const <span class="type">QBitArray</span> & <i>ba</i> )</h3>
<p>Writes bit array <i>ba</i> to stream <i>out</i>.</p>
<p><b>See also </b><a href="datastreamformat.html">Format of the QDataStream operators</a>.</p>
<!-- @@@operator<< -->
<!-- $$$operator>>$$$operator>>QDataStream&QBitArray& -->
<h3 class="fn"><a name="operator-gt-gt-43"></a><span class="type"><a href="qdatastream.html">QDataStream</a></span> & <span class="name">operator>></span> ( <span class="type"><a href="qdatastream.html">QDataStream</a></span> & <i>in</i>, <span class="type">QBitArray</span> & <i>ba</i> )</h3>
<p>Reads a bit array into <i>ba</i> from stream <i>in</i>.</p>
<p><b>See also </b><a href="datastreamformat.html">Format of the QDataStream operators</a>.</p>
<!-- @@@operator>> -->
<!-- $$$operator^[overload1]$$$operator^constQBitArray&constQBitArray& -->
<h3 class="fn"><a name="operator-5e"></a><span class="type">QBitArray</span> <span class="name">operator^</span> ( const <span class="type">QBitArray</span> & <i>a1</i>, const <span class="type">QBitArray</span> & <i>a2</i> )</h3>
<p>Returns a bit array that is the XOR of the bit arrays <i>a1</i> and <i>a2</i>.</p>
<p>The result has the length of the longest of the two bit arrays, with any missing bits (if one array is shorter than the other) taken to be 0.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b(<span class="number">2</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> c;
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; b<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; <span class="comment">// b: [ 1, 1 ]</span>
c <span class="operator">=</span> a <span class="operator">^</span> b; <span class="comment">// c: [ 0, 1, 1 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-5e-eq">QBitArray::operator^=</a>(), <a href="qbitarray.html#operator-and">operator&</a>(), and <a href="qbitarray.html#operator-7c">operator|</a>().</p>
<!-- @@@operator^ -->
<!-- $$$operator|[overload1]$$$operator|constQBitArray&constQBitArray& -->
<h3 class="fn"><a name="operator-7c"></a><span class="type">QBitArray</span> <span class="name">operator|</span> ( const <span class="type">QBitArray</span> & <i>a1</i>, const <span class="type">QBitArray</span> & <i>a2</i> )</h3>
<p>Returns a bit array that is the OR of the bit arrays <i>a1</i> and <i>a2</i>.</p>
<p>The result has the length of the longest of the two bit arrays, with any missing bits (if one array is shorter than the other) taken to be 0.</p>
<p>Example:</p>
<pre class="cpp"> <span class="type"><a href="qbitarray.html">QBitArray</a></span> a(<span class="number">3</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> b(<span class="number">2</span>);
<span class="type"><a href="qbitarray.html">QBitArray</a></span> c;
a<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; a<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; a<span class="operator">[</span><span class="number">2</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; <span class="comment">// a: [ 1, 0, 1 ]</span>
b<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">1</span>; b<span class="operator">[</span><span class="number">1</span><span class="operator">]</span> <span class="operator">=</span> <span class="number">0</span>; <span class="comment">// b: [ 1, 1 ]</span>
c <span class="operator">=</span> a <span class="operator">|</span> b; <span class="comment">// c: [ 1, 1, 1 ]</span></pre>
<p><b>See also </b><a href="qbitarray.html#operator-7c-eq">QBitArray::operator|=</a>(), <a href="qbitarray.html#operator-and">operator&</a>(), and <a href="qbitarray.html#operator-5e">operator^</a>().</p>
<!-- @@@operator| -->
</div>
<div class="ft">
<span></span>
</div>
</div>
<div class="footer">
<p>
<acronym title="Copyright">©</acronym> 2012 Nokia Corporation and/or its
subsidiaries. Documentation contributions included herein are the copyrights of
their respective owners.</p>
<br />
<p>
The documentation provided herein is licensed under the terms of the
<a href="http://www.gnu.org/licenses/fdl.html">GNU Free Documentation
License version 1.3</a> as published by the Free Software Foundation.</p>
<p>
Documentation sources may be obtained from <a href="http://www.qt-project.org">
www.qt-project.org</a>.</p>
<br />
<p>
Nokia, Qt and their respective logos are trademarks of Nokia Corporation
in Finland and/or other countries worldwide. All other trademarks are property
of their respective owners. <a title="Privacy Policy"
href="http://en.gitorious.org/privacy_policy/">Privacy Policy</a></p>
</div>
</body>
</html>
|
