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
|
/*
===========================================================================
blockattack - Block Attack - Rise of the Blocks
Copyright (C) 2005-2012 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
https://blockattack.net
===========================================================================
*/
#include "highscore.h"
#include "os.hpp"
#include "cereal/cereal.hpp"
#include "cereal/types/vector.hpp"
#include "cereal/archives/json.hpp"
#include "sago/SagoMisc.hpp"
#include <algorithm>
namespace cereal {
template<class Archive>
void save(Archive& archive, record const& m) {
archive( cereal::make_nvp("Name", m.name), cereal::make_nvp("Score", m.score) );
}
template<class Archive>
void load(Archive& archive, record& m) {
archive( cereal::make_nvp("Name", m.name), cereal::make_nvp("Score", m.score) );
}
}
/*
This sorts in reverse order. So the highest will be first
*/
bool record_sorter (const record& i,const record& j) {
return (i.score > j.score);
}
Highscore::Highscore(const std::string& type) {
this->type = type;
filename = type+".json.dat";
std::string readFileContent = sago::GetFileContent(filename.c_str());
if (readFileContent.length() > 0) {
try {
std::stringstream ss(readFileContent);
{
cereal::JSONInputArchive archive(ss);
archive(cereal::make_nvp("highscore", table));
}
}
catch (cereal::Exception& e) {
std::cerr << "Failed to read highscore " << filename << " due to formatting errors. Resetting the file. Reason: " <<
e.what() << "\n";
table.clear();
}
}
if (table.size() < top) {
for (int i = 0; i<top; i++) {
record r;
r.name = "Poul Sander";
r.score = 2000 - i*100;
table.push_back(r);
}
}
std::stable_sort(table.begin(), table.end(), record_sorter);
table.resize(top);
writeFile();
}
void Highscore::writeFile() {
std::stringstream ss;
{
cereal::JSONOutputArchive archive(ss);
archive(cereal::make_nvp("highscore", table));
}
sago::WriteFileContent(filename.c_str(), ss.str());
}
bool Highscore::isHighScore(int newScore) {
if (newScore>table.back().score) {
return true;
}
return false;
}
void Highscore::addScore(const std::string& newName, int newScore) {
record r;
r.name = newName;
r.score = newScore;
table.push_back(r);
std::stable_sort(table.begin(), table.end(), record_sorter);
table.resize(top);
Highscore::writeFile();
}
record Highscore::getScoreNumber(int room) {
record ret;
if (room < static_cast<int>(table.size()) ) {
ret = table.at(room);
}
return ret;
}
|
