summaryrefslogtreecommitdiffstats
path: root/doc/man/man3/tqbitarray.3qt
blob: 3b9e739f5a67ab21581584f939d5032832b859ee (plain)
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
'\" t
.TH QBitArray 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*-
.\" Copyright 1992-2007 Trolltech ASA.  All rights reserved.  See the
.\" license file included in the distribution for a complete license
.\" statement.
.\"
.ad l
.nh
.SH NAME
QBitArray \- Array of bits
.SH SYNOPSIS
All the functions in this class are reentrant when TQt is built with thread support.</p>
.PP
\fC#include <ntqbitarray.h>\fR
.PP
Inherits QByteArray.
.PP
.SS "Public Members"
.in +1c
.ti -1c
.BI "\fBQBitArray\fR ()"
.br
.ti -1c
.BI "\fBQBitArray\fR ( uint size )"
.br
.ti -1c
.BI "\fBQBitArray\fR ( const QBitArray & a )"
.br
.ti -1c
.BI "QBitArray & \fBoperator=\fR ( const QBitArray & a )"
.br
.ti -1c
.BI "uint \fBsize\fR () const"
.br
.ti -1c
.BI "bool \fBresize\fR ( uint size )"
.br
.ti -1c
.BI "bool \fBfill\fR ( bool v, int size = -1 )"
.br
.ti -1c
.BI "virtual void \fBdetach\fR ()"
.br
.ti -1c
.BI "QBitArray \fBcopy\fR () const"
.br
.ti -1c
.BI "bool \fBtestBit\fR ( uint index ) const"
.br
.ti -1c
.BI "void \fBsetBit\fR ( uint index )"
.br
.ti -1c
.BI "void \fBsetBit\fR ( uint index, bool value )"
.br
.ti -1c
.BI "void \fBclearBit\fR ( uint index )"
.br
.ti -1c
.BI "bool \fBtoggleBit\fR ( uint index )"
.br
.ti -1c
.BI "bool \fBat\fR ( uint index ) const"
.br
.ti -1c
.BI "QBitVal \fBoperator[]\fR ( int index )"
.br
.ti -1c
.BI "bool \fBoperator[]\fR ( int index ) const"
.br
.ti -1c
.BI "QBitArray & \fBoperator&=\fR ( const QBitArray & a )"
.br
.ti -1c
.BI "QBitArray & \fBoperator|=\fR ( const QBitArray & a )"
.br
.ti -1c
.BI "QBitArray & \fBoperator^=\fR ( const QBitArray & a )"
.br
.ti -1c
.BI "QBitArray \fBoperator~\fR () const"
.br
.in -1c
.SH RELATED FUNCTION DOCUMENTATION
.in +1c
.ti -1c
.BI "QBitArray \fBoperator&\fR ( const QBitArray & a1, const QBitArray & a2 )"
.br
.ti -1c
.BI "QBitArray \fBoperator|\fR ( const QBitArray & a1, const QBitArray & a2 )"
.br
.ti -1c
.BI "QBitArray \fBoperator^\fR ( const QBitArray & a1, const QBitArray & a2 )"
.br
.ti -1c
.BI "QDataStream & \fBoperator<<\fR ( QDataStream & s, const QBitArray & a )"
.br
.ti -1c
.BI "QDataStream & \fBoperator>>\fR ( QDataStream & s, QBitArray & a )"
.br
.in -1c
.SH DESCRIPTION
The QBitArray class provides an array of bits.
.PP
Because QBitArray is a QMemArray, it uses explicit sharing with a reference count.
.PP
A QBitArray is a special byte array that can access individual bits and perform bit-operations (AND, OR, XOR and NOT) on entire arrays or bits.
.PP
Bits can be manipulated by the setBit() and clearBit() functions, but it is also possible to use the indexing [] operator to test and set individual bits. The [] operator is a little slower than setBit() and clearBit() because some tricks are required to implement single-bit assignments.
.PP
Example:
.PP
.nf
.br
    QBitArray a(3);
.br
    a.setBit( 0 );
.br
    a.clearBit( 1 );
.br
    a.setBit( 2 );     // a = [1 0 1]
.br
.br
    QBitArray b(3);
.br
    b[0] = 1;
.br
    b[1] = 1;
.br
    b[2] = 0;          // b = [1 1 0]
.br
.br
    QBitArray c;
.br
    c = ~a & b;        // c = [0 1 0]
.br
.fi
.PP
When a QBitArray is constructed the bits are uninitialized. Use fill() to set all the bits to 0 or 1. The array can be resized with resize() and copied with copy(). Bits can be set with setBit() and cleared with clearBit(). Bits can be toggled with toggleBit(). A bit's value can be obtained with testBit() and with at().
.PP
QBitArray supports the & (AND), | (OR), ^ (XOR) and ~ (NOT) operators.
.PP
See also Collection Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes.
.SH MEMBER FUNCTION DOCUMENTATION
.SH "QBitArray::QBitArray ()"
Constructs an empty bit array.
.SH "QBitArray::QBitArray ( uint size )"
Constructs a bit array of \fIsize\fR bits. The bits are uninitialized.
.PP
See also fill().
.SH "QBitArray::QBitArray ( const QBitArray & a )"
Constructs a shallow copy of \fIa\fR.
.SH "bool QBitArray::at ( uint index ) const"
Returns the value (0 or 1) of the bit at position \fIindex\fR.
.PP
See also operator[]().
.SH "void QBitArray::clearBit ( uint index )"
Clears the bit at position \fIindex\fR, i.e. sets it to 0.
.PP
See also setBit() and toggleBit().
.SH "QBitArray QBitArray::copy () const"
Returns a deep copy of the bit array.
.PP
See also detach().
.SH "void QBitArray::detach ()\fC [virtual]\fR"
Detaches from shared bit array data and makes sure that this bit array is the only one referring to the data.
.PP
If multiple bit arrays share common data, this bit array dereferences the data and gets a copy of the data. Nothing happens if there is only a single reference.
.PP
See also copy().
.PP
Reimplemented from QMemArray.
.SH "bool QBitArray::fill ( bool v, int size = -1 )"
Fills the bit array with \fIv\fR (1's if \fIv\fR is TRUE, or 0's if \fIv\fR is FALSE).
.PP
fill() resizes the bit array to \fIsize\fR bits if \fIsize\fR is nonnegative.
.PP
Returns FALSE if a nonnegative \fIsize\fR was specified and the bit array could not be resized; otherwise returns TRUE.
.PP
See also resize().
.SH "QBitArray & QBitArray::operator&= ( const QBitArray & a )"
Performs the AND operation between all bits in this bit array and \fIa\fR. Returns a reference to this bit array.
.PP
The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0.
.PP
.nf
.br
    QBitArray a( 3 ), b( 2 );
.br
    a[0] = 1;  a[1] = 0;  a[2] = 1;     // a = [1 0 1]
.br
    b[0] = 1;  b[1] = 0;                // b = [1 0]
.br
    a &= b;                             // a = [1 0 0]
.br
.fi
.PP
See also operator|=(), operator^=(), and operator~().
.SH "QBitArray & QBitArray::operator= ( const QBitArray & a )"
Assigns a shallow copy of \fIa\fR to this bit array and returns a reference to this array.
.SH "QBitVal QBitArray::operator[] ( int index )"
Implements the [] operator for bit arrays.
.PP
The returned QBitVal is a context object. It makes it possible to get and set a single bit value by its \fIindex\fR position.
.PP
Example:
.PP
.nf
.br
    QBitArray a( 3 );
.br
    a[0] = 0;
.br
    a[1] = 1;
.br
    a[2] = a[0] ^ a[1];
.br
.fi
.PP
The functions testBit(), setBit() and clearBit() are faster.
.PP
See also at().
.SH "bool QBitArray::operator[] ( int index ) const"
This is an overloaded member function, provided for convenience. It behaves essentially like the above function.
.PP
Implements the [] operator for constant bit arrays.
.SH "QBitArray & QBitArray::operator^= ( const QBitArray & a )"
Performs the XOR operation between all bits in this bit array and \fIa\fR. Returns a reference to this bit array.
.PP
The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0.
.PP
.nf
.br
    QBitArray a( 3 ), b( 2 );
.br
    a[0] = 1;  a[1] = 0;  a[2] = 1;     // a = [1 0 1]
.br
    b[0] = 1;  b[1] = 0;                // b = [1 0]
.br
    a ^= b;                             // a = [0 0 1]
.br
.fi
.PP
See also operator&=(), operator|=(), and operator~().
.SH "QBitArray & QBitArray::operator|= ( const QBitArray & a )"
Performs the OR operation between all bits in this bit array and \fIa\fR. Returns a reference to this bit array.
.PP
The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0.
.PP
.nf
.br
    QBitArray a( 3 ), b( 2 );
.br
    a[0] = 1;  a[1] = 0;  a[2] = 1;     // a = [1 0 1]
.br
    b[0] = 1;  b[1] = 0;                // b = [1 0]
.br
    a |= b;                             // a = [1 0 1]
.br
.fi
.PP
See also operator&=(), operator^=(), and operator~().
.SH "QBitArray QBitArray::operator~ () const"
Returns a bit array that contains the inverted bits of this bit array.
.PP
Example:
.PP
.nf
.br
    QBitArray a( 3 ), b;
.br
    a[0] = 1;  a[1] = 0; a[2] = 1;      // a = [1 0 1]
.br
    b = ~a;                             // b = [0 1 0]
.br
.fi
.SH "bool QBitArray::resize ( uint size )"
Resizes the bit array to \fIsize\fR bits and returns TRUE if the bit array could be resized; otherwise returns FALSE. The array becomes a null array if \fIsize\fR == 0.
.PP
If the array is expanded, the new bits are set to 0.
.PP
See also size().
.SH "void QBitArray::setBit ( uint index, bool value )"
Sets the bit at position \fIindex\fR to \fIvalue\fR.
.PP
Equivalent to:
.PP
.nf
.br
    if ( value )
.br
        setBit( index );
.br
    else
.br
        clearBit( index );
.br
.fi
.PP
See also clearBit() and toggleBit().
.SH "void QBitArray::setBit ( uint index )"
This is an overloaded member function, provided for convenience. It behaves essentially like the above function.
.PP
Sets the bit at position \fIindex\fR to 1.
.PP
See also clearBit() and toggleBit().
.SH "uint QBitArray::size () const"
Returns the bit array's size (number of bits).
.PP
See also resize().
.SH "bool QBitArray::testBit ( uint index ) const"
Returns TRUE if the bit at position \fIindex\fR is set, i.e. is 1; otherwise returns FALSE.
.PP
See also setBit() and clearBit().
.SH "bool QBitArray::toggleBit ( uint index )"
Toggles the bit at position \fIindex\fR.
.PP
If the previous value was 0, the new value will be 1. If the previous value was 1, the new value will be 0.
.PP
See also setBit() and clearBit().
.SH RELATED FUNCTION DOCUMENTATION
.SH "QBitArray operator& ( const QBitArray & a1, const QBitArray & a2 )"
Returns the AND result between the bit arrays \fIa1\fR and \fIa2\fR.
.PP
The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0.
.PP
See also QBitArray::operator&=().
.SH "QDataStream & operator<< ( QDataStream & s, const QBitArray & a )"
Writes bit array \fIa\fR to stream \fIs\fR.
.PP
See also Format of the QDataStream operators.
.SH "QDataStream & operator>> ( QDataStream & s, QBitArray & a )"
Reads a bit array into \fIa\fR from stream \fIs\fR.
.PP
See also Format of the QDataStream operators.
.SH "QBitArray operator^ ( const QBitArray & a1, const QBitArray & a2 )"
Returns the XOR result between the bit arrays \fIa1\fR and \fIa2\fR.
.PP
The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0.
.PP
See also QBitArray::operator^().
.SH "QBitArray operator| ( const QBitArray & a1, const QBitArray & a2 )"
Returns the OR result between the bit arrays \fIa1\fR and \fIa2\fR.
.PP
The result has the length of the longest of the two bit arrays, with any missing bits (i.e. if one array is shorter than the other), taken to be 0.
.PP
See also QBitArray::operator|=().

.SH "SEE ALSO"
.BR http://doc.trolltech.com/ntqbitarray.html
.BR http://www.trolltech.com/faq/tech.html
.SH COPYRIGHT
Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com.  See the
license file included in the distribution for a complete license
statement.
.SH AUTHOR
Generated automatically from the source code.
.SH BUGS
If you find a bug in Qt, please report it as described in
.BR http://doc.trolltech.com/bughowto.html .
Good bug reports help us to help you. Thank you.
.P
The definitive TQt documentation is provided in HTML format; it is
located at $QTDIR/doc/html and can be read using TQt Assistant or with
a web browser. This man page is provided as a convenience for those
users who prefer man pages, although this format is not officially
supported by Trolltech. 
.P
If you find errors in this manual page, please report them to
.BR qt-bugs@trolltech.com .
Please include the name of the manual page (tqbitarray.3qt) and the Qt
version (3.3.8).