-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathCampaignProgress.cpp
133 lines (107 loc) · 2.44 KB
/
CampaignProgress.cpp
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
#include "CampaignProgress.h"
#include <fstream>
using namespace std;
CampaignProgress::CampaignProgress()
{
// nothing todo?
}
CampaignProgress::~CampaignProgress()
{
// nothing todo?
mProgressList.clear();
}
int CampaignProgress::loadProgress(std::string source)
{
ifstream fin(source);
/* find out number of levels (lines) */
int levels = 0;
static char tmpChar[256];
fin.tellg();
while(fin.getline(tmpChar, 255))
levels++;
/* reset position */
fin.close();
fin.open(source);
LevelProgress progress;
mProgressList.clear();
for(int i = 0; i < levels; i++)
{
fin >> progress.name >> progress.playable >> progress.bestTime >> progress.tries;
mProgressList.push_back(progress);
}
fin.close();
return 1;
}
int CampaignProgress::saveProgress(std::string source)
{
ofstream fout(source);
for(int i = 0; i < mProgressList.size(); i++)
{
fout << mProgressList[i].name << " " << mProgressList[i].playable << " " << mProgressList[i].bestTime << " ";
fout << mProgressList[i].tries << endl;
}
fout.close();
return 1;
}
LevelProgress CampaignProgress::getProgress(std::string levelName)
{
for(int i = 0; i < mProgressList.size(); i++)
{
if(mProgressList[i].name == levelName)
return mProgressList[i];
}
LevelProgress tmp;
tmp.name = "ERROR";
return tmp;
}
int CampaignProgress::setProgress(std::string levelName, bool b)
{
for(int i = 0; i < mProgressList.size(); i++)
{
if(mProgressList[i].name == levelName) {
mProgressList[i].playable = b;
saveProgress("levels\\campaign\\campaign_progress.txt");
return 1;
}
}
return 0;
}
double CampaignProgress::getBestTime(std::string levelName)
{
for(int i = 0; i < mProgressList.size(); i++)
{
if(mProgressList[i].name == levelName)
return mProgressList[i].bestTime;
}
return 0;
}
void CampaignProgress::setBestTime(std::string levelName, double d)
{
for(int i = 0; i < mProgressList.size(); i++)
{
if(mProgressList[i].name == levelName) {
mProgressList[i].bestTime = d;
saveProgress("levels\\campaign\\campaign_progress.txt");
break;
}
}
}
void CampaignProgress::addTry(std::string levelName)
{
for(int i = 0; i < mProgressList.size(); i++)
{
if(mProgressList[i].name == levelName) {
mProgressList[i].tries++;
saveProgress("levels\\campaign\\campaign_progress.txt");
break;
}
}
}
int CampaignProgress::getLevels(void)
{
return mProgressList.size();
}
std::vector<LevelProgress> CampaignProgress::getList(void)
{
return mProgressList;
}