|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 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 examples 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 #include <QtCore> |
|
43 |
|
44 #include <stdlib.h> |
|
45 |
|
46 #include "tetrixpiece.h" |
|
47 |
|
48 //! [0] |
|
49 void TetrixPiece::setRandomShape() |
|
50 { |
|
51 setShape(TetrixShape(qrand() % 7 + 1)); |
|
52 } |
|
53 //! [0] |
|
54 |
|
55 //! [1] |
|
56 void TetrixPiece::setShape(TetrixShape shape) |
|
57 { |
|
58 static const int coordsTable[8][4][2] = { |
|
59 { { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 } }, |
|
60 { { 0, -1 }, { 0, 0 }, { -1, 0 }, { -1, 1 } }, |
|
61 { { 0, -1 }, { 0, 0 }, { 1, 0 }, { 1, 1 } }, |
|
62 { { 0, -1 }, { 0, 0 }, { 0, 1 }, { 0, 2 } }, |
|
63 { { -1, 0 }, { 0, 0 }, { 1, 0 }, { 0, 1 } }, |
|
64 { { 0, 0 }, { 1, 0 }, { 0, 1 }, { 1, 1 } }, |
|
65 { { -1, -1 }, { 0, -1 }, { 0, 0 }, { 0, 1 } }, |
|
66 { { 1, -1 }, { 0, -1 }, { 0, 0 }, { 0, 1 } } |
|
67 }; |
|
68 |
|
69 for (int i = 0; i < 4 ; i++) { |
|
70 for (int j = 0; j < 2; ++j) |
|
71 coords[i][j] = coordsTable[shape][i][j]; |
|
72 } |
|
73 pieceShape = shape; |
|
74 //! [1] //! [2] |
|
75 } |
|
76 //! [2] |
|
77 |
|
78 //! [3] |
|
79 int TetrixPiece::minX() const |
|
80 { |
|
81 int min = coords[0][0]; |
|
82 for (int i = 1; i < 4; ++i) |
|
83 min = qMin(min, coords[i][0]); |
|
84 return min; |
|
85 } |
|
86 |
|
87 int TetrixPiece::maxX() const |
|
88 //! [3] //! [4] |
|
89 { |
|
90 int max = coords[0][0]; |
|
91 for (int i = 1; i < 4; ++i) |
|
92 max = qMax(max, coords[i][0]); |
|
93 return max; |
|
94 } |
|
95 //! [4] |
|
96 |
|
97 //! [5] |
|
98 int TetrixPiece::minY() const |
|
99 { |
|
100 int min = coords[0][1]; |
|
101 for (int i = 1; i < 4; ++i) |
|
102 min = qMin(min, coords[i][1]); |
|
103 return min; |
|
104 } |
|
105 |
|
106 int TetrixPiece::maxY() const |
|
107 //! [5] //! [6] |
|
108 { |
|
109 int max = coords[0][1]; |
|
110 for (int i = 1; i < 4; ++i) |
|
111 max = qMax(max, coords[i][1]); |
|
112 return max; |
|
113 } |
|
114 //! [6] |
|
115 |
|
116 //! [7] |
|
117 TetrixPiece TetrixPiece::rotatedLeft() const |
|
118 { |
|
119 if (pieceShape == SquareShape) |
|
120 return *this; |
|
121 |
|
122 TetrixPiece result; |
|
123 result.pieceShape = pieceShape; |
|
124 for (int i = 0; i < 4; ++i) { |
|
125 result.setX(i, y(i)); |
|
126 result.setY(i, -x(i)); |
|
127 } |
|
128 //! [7] |
|
129 return result; |
|
130 } |
|
131 |
|
132 //! [9] |
|
133 TetrixPiece TetrixPiece::rotatedRight() const |
|
134 { |
|
135 if (pieceShape == SquareShape) |
|
136 return *this; |
|
137 |
|
138 TetrixPiece result; |
|
139 result.pieceShape = pieceShape; |
|
140 for (int i = 0; i < 4; ++i) { |
|
141 result.setX(i, -y(i)); |
|
142 result.setY(i, x(i)); |
|
143 } |
|
144 //! [9] |
|
145 return result; |
|
146 } |