tournamentpair.h

/*
    This file is part of Cute Chess.
    Copyright (C) 2008-2018 Cute Chess authors

    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 TOURNAMENTPAIR_H
#define TOURNAMENTPAIR_H

class LIB_EXPORT TournamentPair
{
    public:
        TournamentPair(int firstPlayer = -1,
                   int secondPlayer = -1);

        int firstPlayer() const;
        int secondPlayer() const;
        bool hasOriginalOrder() const;
        int leader() const;
        bool hasSamePlayers(const TournamentPair* other) const;
        bool isValid() const;
        int gamesStarted() const;
        void addStartedGame();
        int gamesFinished() const;
        int gamesInProgress() const;
        int scoreSum() const;
        int scoreDiff() const;
        int firstScore() const;
        void addFirstScore(int score);
        int secondScore() const;
        void addSecondScore(int score);
        void swapPlayers();

    private:
        struct Player
        {
            int index;
            int score;
        };

        Player m_first;
        Player m_second;
        int m_gamesStarted;
        bool m_hasOriginalOrder;
};

#endif // TOURNAMENTPAIR_H