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