piece.h

/*
    This file is part of Cute Chess.

    Cute Chess is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    Cute Chess is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with Cute Chess.  If not, see <http://www.gnu.org/licenses/>.
*/

#ifndef PIECE_H
#define PIECE_H

#include <QtGlobal>
#include "side.h"

namespace Chess {

class Piece
{
    public:
        static const int NoPiece = 0;
        static const int WallPiece = 100;

        Piece(int type = NoPiece);
        Piece(Side side, int type);

        bool operator==(const Piece& other) const;
        bool operator!=(const Piece& other) const;
        bool operator<(const Piece& other) const;
        bool operator>(const Piece& other) const;

        bool isEmpty() const;
        bool isValid() const;
        bool isWall() const;

        Side side() const;
        int type() const;

        void setSide(Side side);
        void setType(int type);

    private:
        quint16 m_data;
};


inline Piece::Piece(int type)
    : m_data(type | (Side::NoSide << 10))
{
}

inline Piece::Piece(Side side, int type)
    : m_data(type | (side << 10))
{
    Q_ASSERT(!side.isNull());
    Q_ASSERT(type != WallPiece);
    Q_ASSERT(type != NoPiece);
}

inline bool Piece::operator==(const Piece& other) const
{
    return m_data == other.m_data;
}

inline bool Piece::operator!=(const Piece& other) const
{
    return m_data != other.m_data;
}

inline bool Piece::operator<(const Piece& other) const
{
    return m_data < other.m_data;
}

inline bool Piece::operator>(const Piece& other) const
{
    return m_data > other.m_data;
}

inline bool Piece::isEmpty() const
{
    return type() == NoPiece;
}

inline bool Piece::isValid() const
{
    return !side().isNull();
}

inline bool Piece::isWall() const
{
    return type() == WallPiece;
}

inline Side Piece::side() const
{
    return Side(Side::Type(m_data >> 10));
}

inline int Piece::type() const
{
    return m_data & 0x3FF;
}

inline void Piece::setSide(Side side)
{
    m_data = type() | (side << 10);
}

inline void Piece::setType(int type)
{
    m_data = type | (m_data & 0xC00);
}

} // namespace Chess
#endif // PIECE_H