1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2016 The Qt Company Ltd. |
4 | ** Contact: https://www.qt.io/licensing/ |
5 | ** |
6 | ** This file is part of the examples of the Qt Toolkit. |
7 | ** |
8 | ** $QT_BEGIN_LICENSE:BSD$ |
9 | ** Commercial License Usage |
10 | ** Licensees holding valid commercial Qt licenses may use this file in |
11 | ** accordance with the commercial license agreement provided with the |
12 | ** Software or, alternatively, in accordance with the terms contained in |
13 | ** a written agreement between you and The Qt Company. For licensing terms |
14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://www.qt.io/contact-us. |
16 | ** |
17 | ** BSD License Usage |
18 | ** Alternatively, you may use this file under the terms of the BSD license |
19 | ** as follows: |
20 | ** |
21 | ** "Redistribution and use in source and binary forms, with or without |
22 | ** modification, are permitted provided that the following conditions are |
23 | ** met: |
24 | ** * Redistributions of source code must retain the above copyright |
25 | ** notice, this list of conditions and the following disclaimer. |
26 | ** * Redistributions in binary form must reproduce the above copyright |
27 | ** notice, this list of conditions and the following disclaimer in |
28 | ** the documentation and/or other materials provided with the |
29 | ** distribution. |
30 | ** * Neither the name of The Qt Company Ltd nor the names of its |
31 | ** contributors may be used to endorse or promote products derived |
32 | ** from this software without specific prior written permission. |
33 | ** |
34 | ** |
35 | ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
36 | ** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
37 | ** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
38 | ** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
39 | ** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
40 | ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
41 | ** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
42 | ** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
43 | ** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
44 | ** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
45 | ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE." |
46 | ** |
47 | ** $QT_END_LICENSE$ |
48 | ** |
49 | ****************************************************************************/ |
50 | |
51 | #include "tetrixpiece.h" |
52 | |
53 | #include <QtCore> |
54 | |
55 | //! [0] |
56 | void TetrixPiece::setRandomShape() |
57 | { |
58 | setShape(TetrixShape(QRandomGenerator::global()->bounded(highest: 7) + 1)); |
59 | } |
60 | //! [0] |
61 | |
62 | //! [1] |
63 | void TetrixPiece::setShape(TetrixShape shape) |
64 | { |
65 | static constexpr int coordsTable[8][4][2] = { |
66 | { { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 } }, |
67 | { { 0, -1 }, { 0, 0 }, { -1, 0 }, { -1, 1 } }, |
68 | { { 0, -1 }, { 0, 0 }, { 1, 0 }, { 1, 1 } }, |
69 | { { 0, -1 }, { 0, 0 }, { 0, 1 }, { 0, 2 } }, |
70 | { { -1, 0 }, { 0, 0 }, { 1, 0 }, { 0, 1 } }, |
71 | { { 0, 0 }, { 1, 0 }, { 0, 1 }, { 1, 1 } }, |
72 | { { -1, -1 }, { 0, -1 }, { 0, 0 }, { 0, 1 } }, |
73 | { { 1, -1 }, { 0, -1 }, { 0, 0 }, { 0, 1 } } |
74 | }; |
75 | |
76 | for (int i = 0; i < 4 ; i++) { |
77 | for (int j = 0; j < 2; ++j) |
78 | coords[i][j] = coordsTable[shape][i][j]; |
79 | } |
80 | pieceShape = shape; |
81 | //! [1] //! [2] |
82 | } |
83 | //! [2] |
84 | |
85 | //! [3] |
86 | int TetrixPiece::minX() const |
87 | { |
88 | int min = coords[0][0]; |
89 | for (int i = 1; i < 4; ++i) |
90 | min = qMin(a: min, b: coords[i][0]); |
91 | return min; |
92 | } |
93 | |
94 | int TetrixPiece::maxX() const |
95 | //! [3] //! [4] |
96 | { |
97 | int max = coords[0][0]; |
98 | for (int i = 1; i < 4; ++i) |
99 | max = qMax(a: max, b: coords[i][0]); |
100 | return max; |
101 | } |
102 | //! [4] |
103 | |
104 | //! [5] |
105 | int TetrixPiece::minY() const |
106 | { |
107 | int min = coords[0][1]; |
108 | for (int i = 1; i < 4; ++i) |
109 | min = qMin(a: min, b: coords[i][1]); |
110 | return min; |
111 | } |
112 | |
113 | int TetrixPiece::maxY() const |
114 | //! [5] //! [6] |
115 | { |
116 | int max = coords[0][1]; |
117 | for (int i = 1; i < 4; ++i) |
118 | max = qMax(a: max, b: coords[i][1]); |
119 | return max; |
120 | } |
121 | //! [6] |
122 | |
123 | //! [7] |
124 | TetrixPiece TetrixPiece::rotatedLeft() const |
125 | { |
126 | if (pieceShape == SquareShape) |
127 | return *this; |
128 | |
129 | TetrixPiece result; |
130 | result.pieceShape = pieceShape; |
131 | for (int i = 0; i < 4; ++i) { |
132 | result.setX(index: i, x: y(index: i)); |
133 | result.setY(index: i, y: -x(index: i)); |
134 | } |
135 | //! [7] |
136 | return result; |
137 | } |
138 | |
139 | //! [9] |
140 | TetrixPiece TetrixPiece::rotatedRight() const |
141 | { |
142 | if (pieceShape == SquareShape) |
143 | return *this; |
144 | |
145 | TetrixPiece result; |
146 | result.pieceShape = pieceShape; |
147 | for (int i = 0; i < 4; ++i) { |
148 | result.setX(index: i, x: -y(index: i)); |
149 | result.setY(index: i, y: x(index: i)); |
150 | } |
151 | //! [9] |
152 | return result; |
153 | } |
154 | |