|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the documentation of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 //! [0] |
|
43 #include <q3memarray.h> |
|
44 #include <stdio.h> |
|
45 |
|
46 Q3MemArray<int> fib( int num ) // returns fibonacci array |
|
47 { |
|
48 Q_ASSERT( num > 2 ); |
|
49 Q3MemArray<int> f( num ); // array of ints |
|
50 |
|
51 f[0] = f[1] = 1; |
|
52 for ( int i = 2; i < num; i++ ) |
|
53 f[i] = f[i-1] + f[i-2]; |
|
54 |
|
55 return f; |
|
56 } |
|
57 |
|
58 int main() |
|
59 { |
|
60 Q3MemArray<int> a = fib( 6 ); // get first 6 fibonaccis |
|
61 for ( int i = 0; i < a.size(); i++ ) |
|
62 qDebug( "%d: %d", i, a[i] ); |
|
63 |
|
64 qDebug( "1 is found %d times", a.contains(1) ); |
|
65 qDebug( "5 is found at index %d", a.find(5) ); |
|
66 |
|
67 return 0; |
|
68 } |
|
69 //! [0] |
|
70 |
|
71 |
|
72 //! [1] |
|
73 0: 1 |
|
74 1: 1 |
|
75 2: 2 |
|
76 3: 3 |
|
77 4: 5 |
|
78 5: 8 |
|
79 1 is found 2 times |
|
80 5 is found at index 4 |
|
81 //! [1] |
|
82 |
|
83 |
|
84 //! [2] |
|
85 // MyStruct may be padded to 4 or 8 bytes |
|
86 struct MyStruct |
|
87 { |
|
88 short i; // 2 bytes |
|
89 char c; // 1 byte |
|
90 }; |
|
91 |
|
92 Q3MemArray<MyStruct> a(1); |
|
93 a[0].i = 5; |
|
94 a[0].c = 't'; |
|
95 |
|
96 MyStruct x; |
|
97 x.i = '5'; |
|
98 x.c = 't'; |
|
99 int i = a.find( x ); // may return -1 if the pad bytes differ |
|
100 //! [2] |
|
101 |
|
102 |
|
103 //! [3] |
|
104 static char bindata[] = { 231, 1, 44, ... }; |
|
105 QByteArray a; |
|
106 a.setRawData( bindata, sizeof(bindata) ); // a points to bindata |
|
107 QDataStream s( a, IO_ReadOnly ); // open on a's data |
|
108 s >> <something>; // read raw bindata |
|
109 a.resetRawData( bindata, sizeof(bindata) ); // finished |
|
110 //! [3] |
|
111 |
|
112 |
|
113 //! [4] |
|
114 static char bindata[] = { 231, 1, 44, ... }; |
|
115 QByteArray a, b; |
|
116 a.setRawData( bindata, sizeof(bindata) ); // a points to bindata |
|
117 a.resize( 8 ); // will crash |
|
118 b = a; // will crash |
|
119 a[2] = 123; // might crash |
|
120 // forget to resetRawData: will crash |
|
121 //! [4] |