---

solution_holder.h

/*
 *   EasySok --- A(nother) sokoban game for KDE.
 *
 *   Copyright (C) 2001 by Ralf Schmelter (ralfs@pc2a.chemie.uni-dortmund.de).
 *
 *   This program is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License version 2 as
 *   published by the Free Software Foundation.
 *
 *   This program 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 this program; if not, write to the Free Software
 *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */


#ifndef EASYSOK_SOLUTION_HOLDER_INC_GUARD_H
#define EASYSOK_SOLUTION_HOLDER_INC_GUARD_H


#include <map>
#include <vector>

#include <qdatetime.h>
#include <qstring.h>
#include <qstringlist.h>

#include "compressed_map.h"
#include "movements.h"




class SolutionHolder
{

public:

    static void load();


    static void save();


    static int getIndexForMap(CompressedMap const & map);


    static bool hasSolution(CompressedMap const & map);


    static bool hasSolution(int index);


    static int numberOfSolutions(CompressedMap const & map);


    static int numberOfSolutions(int index);


    static Movements const & movements(CompressedMap const & map, int solution);


    static Movements const & movements(int index, int solution);


    static int pushesInSolution(CompressedMap const & map, int solution);


    static int pushesInSolution(int index, int solution);


    static int linearPushesInSolution(CompressedMap const & map, int solution);


    static int linearPushesInSolution(int index, int solution);


    static int gemChangesInSolution(CompressedMap const & map, int solution);


    static int gemChangesInSolution(int index, int solution);


    static int movesInSolution(CompressedMap const & map, int solution);


    static int movesInSolution(int index, int solution);


    static QDateTime const & dateOfSolution(CompressedMap const & map, int solution);


    static QDateTime const & dateOfSolution(int index, int solution);


    static QString const & infoOfSolution(CompressedMap const & map, int solution);


    static QString const & infoOfSolution(int index, int solution);


    static int addSolution(CompressedMap const & map, Movements const & moves,
                           int number_of_pushes, int number_of_linear_pushes,
                           int number_of_gem_changes, int number_of_moves, QString const & info);


    static int addSolution(int index, Movements const & moves,
                           int number_of_pushes, int number_of_linear_pushes,
                           int number_of_gem_changes, int number_of_moves, QString const & info);


    static int addSolution(CompressedMap const & map, Movements const & moves, int number_of_pushes,
                           int number_of_linear_pushes, int number_of_gem_changes,
                           int number_of_moves, QString const & info, QDateTime const & date_time);


    static int addSolution(int index, Movements const & moves, int number_of_pushes,
                           int number_of_linear_pushes, int number_of_gem_changes,
                           int number_of_moves, QString const & info, QDateTime const & date_time);


    static void changeSolutionInfo(CompressedMap const & map, int solution, QString const & info);


    static void changeSolutionInfo(int index, int solution, QString const & info);


    static void deleteSolution(CompressedMap const & map, int solution);


    static void deleteSolution(int index, int solution);


    static bool hasLastAttempt(CompressedMap const & map);


    static Movements const & lastAttempt(CompressedMap const & map);


    static Movements const & lastAttempt(int index);


    static void setLastAttempt(CompressedMap const & map, Movements const & movements);


    static void setLastAttempt(int index, Movements const & movements);


private:

    static std::map<CompressedMap, int> s_map_indices;


    static std::vector<std::vector<Movements> > s_solutions;


    static std::vector<Movements> s_last_attempts;


    static std::vector<std::vector<int> > s_pushes;


    static std::vector<std::vector<int> > s_moves;


    static std::vector<std::vector<int> > s_linear_pushes;


    static std::vector<std::vector<int> > s_gem_changes;


    static std::vector<std::vector<QDateTime> > s_dates;


    static std::vector<QStringList > s_infos;


    static bool s_was_modified;
};


#endif

---