/****************************************************************************+
−
**+
−
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).+
−
** All rights reserved.+
−
** Contact: Nokia Corporation (qt-info@nokia.com)+
−
**+
−
** This file is part of the examples of the Qt Toolkit.+
−
**+
−
** $QT_BEGIN_LICENSE:LGPL$+
−
** No Commercial Usage+
−
** This file contains pre-release code and may not be distributed.+
−
** You may use this file in accordance with the terms and conditions+
−
** contained in the Technology Preview License Agreement accompanying+
−
** this package.+
−
**+
−
** GNU Lesser General Public License Usage+
−
** Alternatively, this file may be used under the terms of the GNU Lesser+
−
** General Public License version 2.1 as published by the Free Software+
−
** Foundation and appearing in the file LICENSE.LGPL included in the+
−
** packaging of this file.  Please review the following information to+
−
** ensure the GNU Lesser General Public License version 2.1 requirements+
−
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.+
−
**+
−
** In addition, as a special exception, Nokia gives you certain additional+
−
** rights.  These rights are described in the Nokia Qt LGPL Exception+
−
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.+
−
**+
−
** If you have questions regarding the use of this file, please contact+
−
** Nokia at qt-info@nokia.com.+
−
**+
−
**+
−
**+
−
**+
−
**+
−
**+
−
**+
−
**+
−
** $QT_END_LICENSE$+
−
**+
−
****************************************************************************/+
−
+
−
#include <QtCore>+
−
+
−
#include <stdlib.h>+
−
+
−
#include "tetrixpiece.h"+
−
+
−
//! [0]+
−
void TetrixPiece::setRandomShape()+
−
{+
−
    setShape(TetrixShape(qrand() % 7 + 1));+
−
}+
−
//! [0]+
−
+
−
//! [1]+
−
void TetrixPiece::setShape(TetrixShape shape)+
−
{+
−
    static const int coordsTable[8][4][2] = {+
−
        { { 0, 0 },   { 0, 0 },   { 0, 0 },   { 0, 0 } },+
−
        { { 0, -1 },  { 0, 0 },   { -1, 0 },  { -1, 1 } },+
−
        { { 0, -1 },  { 0, 0 },   { 1, 0 },   { 1, 1 } },+
−
        { { 0, -1 },  { 0, 0 },   { 0, 1 },   { 0, 2 } },+
−
        { { -1, 0 },  { 0, 0 },   { 1, 0 },   { 0, 1 } },+
−
        { { 0, 0 },   { 1, 0 },   { 0, 1 },   { 1, 1 } },+
−
        { { -1, -1 }, { 0, -1 },  { 0, 0 },   { 0, 1 } },+
−
        { { 1, -1 },  { 0, -1 },  { 0, 0 },   { 0, 1 } }+
−
    };+
−
+
−
    for (int i = 0; i < 4 ; i++) {+
−
        for (int j = 0; j < 2; ++j)+
−
            coords[i][j] = coordsTable[shape][i][j];+
−
    }+
−
    pieceShape = shape;+
−
//! [1] //! [2]+
−
}+
−
//! [2]+
−
+
−
//! [3]+
−
int TetrixPiece::minX() const+
−
{+
−
    int min = coords[0][0];+
−
    for (int i = 1; i < 4; ++i)+
−
        min = qMin(min, coords[i][0]);+
−
    return min;+
−
}+
−
+
−
int TetrixPiece::maxX() const+
−
//! [3] //! [4]+
−
{+
−
    int max = coords[0][0];+
−
    for (int i = 1; i < 4; ++i)+
−
        max = qMax(max, coords[i][0]);+
−
    return max;+
−
}+
−
//! [4]+
−
+
−
//! [5]+
−
int TetrixPiece::minY() const+
−
{+
−
    int min = coords[0][1];+
−
    for (int i = 1; i < 4; ++i)+
−
        min = qMin(min, coords[i][1]);+
−
    return min;+
−
}+
−
+
−
int TetrixPiece::maxY() const+
−
//! [5] //! [6]+
−
{+
−
    int max = coords[0][1];+
−
    for (int i = 1; i < 4; ++i)+
−
        max = qMax(max, coords[i][1]);+
−
    return max;+
−
}+
−
//! [6]+
−
+
−
//! [7]+
−
TetrixPiece TetrixPiece::rotatedLeft() const+
−
{+
−
    if (pieceShape == SquareShape)+
−
        return *this;+
−
+
−
    TetrixPiece result;+
−
    result.pieceShape = pieceShape;+
−
    for (int i = 0; i < 4; ++i) {+
−
        result.setX(i, y(i));+
−
        result.setY(i, -x(i));+
−
    }+
−
//! [7]+
−
    return result;+
−
}+
−
+
−
//! [9]+
−
TetrixPiece TetrixPiece::rotatedRight() const+
−
{+
−
    if (pieceShape == SquareShape)+
−
        return *this;+
−
+
−
    TetrixPiece result;+
−
    result.pieceShape = pieceShape;+
−
    for (int i = 0; i < 4; ++i) {+
−
        result.setX(i, -y(i));+
−
        result.setY(i, x(i));+
−
    }+
−
//! [9]+
−
    return result;+
−
}+
−