1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/*
===========================================================================
blockattack - Block Attack - Rise of the Blocks
Copyright (C) 2005-2015 Poul Sander
This program 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 2 of the License, or
(at your option) any later version.
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, see http://www.gnu.org/licenses/
Source information and contacts persons can be found at
http://blockattack.net
===========================================================================
*/
#include "puzzlehandler.hpp"
#include <vector>
#include <iostream>
#include "stats.h"
#include <physfs.h> //Abstract file system. To use containers
#include "cereal/cereal.hpp"
#include "cereal/types/vector.hpp"
#include "cereal/archives/json.hpp"
#include "sago/SagoMisc.hpp"
using std::string;
using std::cerr;
using std::vector;
const int maxNrOfPuzzleStages = 50; //Maximum number of puzzle stages
static std::string puzzleSavePath;
static std::string puzzleName; //The filename of
static std::vector<bool> puzzleCleared(maxNrOfPuzzleStages); //vector that tells if puzzle cleared
static std::vector<int> nrOfMovesAllowed(maxNrOfPuzzleStages); //Moves to clear
static int puzzleLevels[maxNrOfPuzzleStages][6][12]; //Contains board layout;
static int nrOfPuzzles; //How many are there actually?
int PuzzleNumberOfMovesAllowed(int level) {
return nrOfMovesAllowed.at(level);
}
int PuzzleGetBrick(int level, int x, int y) {
return puzzleLevels[level][x][y];
}
int PuzzleGetNumberOfPuzzles() {
return nrOfPuzzles;
}
bool PuzzleIsCleared(int level) {
return puzzleCleared.at(level);
}
const std::string& PuzzleGetName() {
return puzzleName;
}
void PuzzleSetName(const std::string& name) {
puzzleName = name;
puzzleSavePath = name + ".json.save";
}
void LoadClearData() {
std::string readFileContent = sago::GetFileContent(puzzleSavePath.c_str());
if (readFileContent.length() > 0) {
std::stringstream ss(readFileContent);
{
try {
cereal::JSONInputArchive archive(ss);
archive(cereal::make_nvp("cleared", puzzleCleared));
}
catch (cereal::Exception& e) {
std::cerr << "Failed to read \"" << puzzleSavePath << "\". File will be regenerated. Reason: " << e.what() << "\n";
puzzleCleared.clear();
}
}
}
else {
puzzleCleared.clear();
}
puzzleCleared.resize(nrOfPuzzles);
}
void SaveClearData() {
std::stringstream ss;
{
cereal::JSONOutputArchive archive(ss);
archive(cereal::make_nvp("cleared", puzzleCleared));
}
sago::WriteFileContent(puzzleSavePath.c_str(), ss.str());
}
void PuzzleSetClear(int Level) {
if (puzzleCleared[Level]==false) {
Stats::getInstance()->addOne("puzzlesSolved");
}
puzzleCleared[Level] = true;
SaveClearData();
}
/*Loads all the puzzle levels*/
int LoadPuzzleStages( ) {
if (!PHYSFS_exists(((std::string)("puzzles/"+puzzleName)).c_str())) {
std::cerr << "Warning: File not in blockattack.data: " << ("puzzles/"+puzzleName) << "\n";
return -1; //file doesn't exist
}
std::string fileContent = sago::GetFileContent(((std::string)("puzzles/"+puzzleName)).c_str());
std::stringstream inFile(fileContent);
inFile >> nrOfPuzzles;
if (nrOfPuzzles>maxNrOfPuzzleStages) {
nrOfPuzzles=maxNrOfPuzzleStages;
}
if (nrOfPuzzles < 0) {
nrOfPuzzles = 0;
}
for (int k=0; k<nrOfPuzzles ; k++) {
inFile >> nrOfMovesAllowed.at(k);
for (int i=11; i>=0; i--)
for (int j=0; j<6; j++) {
inFile >> puzzleLevels[k][j][i];
}
}
LoadClearData();
return 0;
}
|
