blob: f19359e9e58f36d247b6a407eca4a467d7f2bb6b (
plain)
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
|
#include <algorithm>
#include <quest.hpp>
int QuestHandler::assign(std::string title,std::string desc,std::string req) {
Quest tmp;
char *tok;
tmp.title = title;
tmp.desc = desc;
tok = strtok(&req[0], "\n\r\t,");
tmp.need.emplace_back("", 0);
while (tok) {
if (!tmp.need.back().first.empty()) {
tmp.need.back().second = atoi(tok);
tmp.need.emplace_back("", 0);
} else
tmp.need.back().first = tok;
tok = strtok(NULL, "\n\r\t,");
}
tmp.need.pop_back();
current.push_back(tmp);
return 0;
}
int QuestHandler::drop(std::string title) {
current.erase(std::remove_if (current.begin(),
current.end(),
[&](Quest q) { return q.title == title; }),
current.end());
return 0;
}
int QuestHandler::finish(std::string t) {
for (auto c = current.begin(); c != current.end(); c++) {
if ((*c).title == t) {
//for (auto &n : (*c).need) {
//if (player->inv->hasItem(n.first) < n.second)
return 0;
//}
//for (auto &n : (*c).need)
//player->inv->takeItem(n.first, n.second);
//current.erase(c);
//return 1;
}
}
return 0;
}
bool QuestHandler::hasQuest(std::string t) {
for (auto &c : current) {
if (c.title == t)
return true;
}
return false;
}
|
