1 | /****************************************************************************
|
---|
2 | **
|
---|
3 | ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
---|
4 | ** All rights reserved.
|
---|
5 | ** Contact: Nokia Corporation ([email protected])
|
---|
6 | **
|
---|
7 | ** This file is part of the documentation of the Qt Toolkit.
|
---|
8 | **
|
---|
9 | ** $QT_BEGIN_LICENSE:BSD$
|
---|
10 | ** You may use this file under the terms of the BSD license as follows:
|
---|
11 | **
|
---|
12 | ** "Redistribution and use in source and binary forms, with or without
|
---|
13 | ** modification, are permitted provided that the following conditions are
|
---|
14 | ** met:
|
---|
15 | ** * Redistributions of source code must retain the above copyright
|
---|
16 | ** notice, this list of conditions and the following disclaimer.
|
---|
17 | ** * Redistributions in binary form must reproduce the above copyright
|
---|
18 | ** notice, this list of conditions and the following disclaimer in
|
---|
19 | ** the documentation and/or other materials provided with the
|
---|
20 | ** distribution.
|
---|
21 | ** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
|
---|
22 | ** the names of its contributors may be used to endorse or promote
|
---|
23 | ** products derived from this software without specific prior written
|
---|
24 | ** permission.
|
---|
25 | **
|
---|
26 | ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
---|
27 | ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
---|
28 | ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
---|
29 | ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
---|
30 | ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
---|
31 | ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
---|
32 | ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
33 | ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
34 | ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
35 | ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
---|
36 | ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
---|
37 | ** $QT_END_LICENSE$
|
---|
38 | **
|
---|
39 | ****************************************************************************/
|
---|
40 |
|
---|
41 | //! [0]
|
---|
42 | foreach (variable, container)
|
---|
43 | statement;
|
---|
44 | //! [0]
|
---|
45 |
|
---|
46 |
|
---|
47 | //! [1]
|
---|
48 | QList<QString> list;
|
---|
49 | ...
|
---|
50 | foreach (const QString &str, list)
|
---|
51 | cout << str.ascii() << endl;
|
---|
52 | //! [1]
|
---|
53 |
|
---|
54 |
|
---|
55 | //! [2]
|
---|
56 | QString str;
|
---|
57 | foreach (str, list)
|
---|
58 | cout << str.ascii() << endl;
|
---|
59 | //! [2]
|
---|
60 |
|
---|
61 |
|
---|
62 | //! [3]
|
---|
63 | // forward // backward
|
---|
64 | QList<QString> list; QList<QString> list;
|
---|
65 | ... ...
|
---|
66 | QListIterator<QString> i(list); QListIterator<QString> i(list);
|
---|
67 | while (i.hasNext()) i.toBack();
|
---|
68 | cout << i.next().ascii() << endl; while (i.hasPrev())
|
---|
69 | cout << i.prev().ascii() << endl;
|
---|
70 | //! [3]
|
---|
71 |
|
---|
72 |
|
---|
73 | //! [4]
|
---|
74 | // forward // backward
|
---|
75 | QMutableListIterator<int> i(list); QMutableListIterator<int> i(list);
|
---|
76 | while (i.hasNext()) i.toBack();
|
---|
77 | if (i.next() > 128) while (i.hasPrev())
|
---|
78 | i.setValue(128); if (i.prev() > 128)
|
---|
79 | i.setValue(128);
|
---|
80 | //! [4]
|
---|
81 |
|
---|
82 |
|
---|
83 | //! [5]
|
---|
84 | // forward // backward
|
---|
85 | QMutableListIterator<int> i(list); QMutableListIterator<int> i(list);
|
---|
86 | while (i.hasNext()) i.toBack();
|
---|
87 | if (i.next() % 2 != 0) while (i.hasPrev())
|
---|
88 | i.remove(); if (i.prev() % 2 != 0)
|
---|
89 | i.remove();
|
---|
90 | //! [5]
|
---|
91 |
|
---|
92 |
|
---|
93 | //! [6]
|
---|
94 | // STL-style // Java-style
|
---|
95 | QMap<int, QWidget *>::const_iterator i; QMapIterator<int, QWidget *> i(map);
|
---|
96 | for (i = map.begin(); i != map.end(); ++i) while (i.findNext(widget))
|
---|
97 | if (i.value() == widget) cout << "Found widget " << widget
|
---|
98 | cout << "Found widget " << widget << " under key "
|
---|
99 | << " under key " << i.key() << endl;
|
---|
100 | << i.key() << endl;
|
---|
101 | //! [6]
|
---|
102 |
|
---|
103 |
|
---|
104 | //! [7]
|
---|
105 | // STL-style // Java-style
|
---|
106 | QList<int>::iterator i = list.begin(); QMutableListIterator<int> i(list);
|
---|
107 | while (i != list.end()) { while (i.hasNext()) {
|
---|
108 | if (*i == 0) { int val = i.next();
|
---|
109 | i = list.erase(i); if (val < 0)
|
---|
110 | } else { i.setValue(-val);
|
---|
111 | if (*i < 0) else if (val == 0)
|
---|
112 | *i = -*i; i.remove();
|
---|
113 | ++i; }
|
---|
114 | }
|
---|
115 | }
|
---|
116 | //! [7]
|
---|
117 |
|
---|
118 |
|
---|
119 | //! [8]
|
---|
120 | QList<double> list;
|
---|
121 | ...
|
---|
122 | for (int i = 0; i < list.size(); ++i) {
|
---|
123 | if (list[i] < 0.0)
|
---|
124 | list[i] = 0.0;
|
---|
125 | }
|
---|
126 | //! [8]
|
---|
127 |
|
---|
128 |
|
---|
129 | //! [9]
|
---|
130 | QMap<QString, int> map;
|
---|
131 | ...
|
---|
132 | map.value("TIMEOUT", 30); // returns 30 if "TIMEOUT" isn't in the map
|
---|
133 | //! [9]
|
---|
134 |
|
---|
135 |
|
---|
136 | //! [10]
|
---|
137 | QMultiMap<QString, int> map;
|
---|
138 | ...
|
---|
139 | QList<int> values = map.values("TIMEOUT");
|
---|
140 | //! [10]
|
---|