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
|
/*
* mock_BonusBearer.cpp, part of VCMI engine
*
* Authors: listed in file AUTHORS in main folder
*
* License: GNU General Public License v2.0 or later
* Full text of license available in license.txt file, in main folder
*
*/
#include "StdInc.h"
#include "mock_BonusBearer.h"
BonusBearerMock::BonusBearerMock()
: treeVersion(1),
cachedLast(0)
{
}
BonusBearerMock::~BonusBearerMock() = default;
void BonusBearerMock::addNewBonus(const std::shared_ptr<Bonus> & b)
{
bonuses.push_back(b);
treeVersion++;
}
const TBonusListPtr BonusBearerMock::getAllBonuses(const CSelector & selector, const CSelector & limit, const CBonusSystemNode * root, const std::string & cachingStr) const
{
if(cachedLast != treeVersion)
{
bonuses.stackBonuses();
cachedLast = treeVersion;
}
auto ret = std::make_shared<BonusList>();
bonuses.getBonuses(*ret, selector, limit);
return ret;
}
int64_t BonusBearerMock::getTreeVersion() const
{
int64_t ret = treeVersion;
return ret << 32;
}
|
