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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "mutationofjb/inventory.h"
#include "common/algorithm.h"
#include "common/debug.h"
namespace MutationOfJB {
static const uint VISIBLE_ITEMS = 6;
const Inventory::Items &Inventory::getItems() const {
return _items;
}
bool Inventory::hasItem(const Common::String &item) const {
Items::const_iterator it = find(_items.begin(), _items.end(), item);
return (it != _items.end());
}
void Inventory::addItem(const Common::String &item) {
_items.push_back(item);
if (_items.size() > VISIBLE_ITEMS) {
rotateItemsRight(VISIBLE_ITEMS);
}
}
void Inventory::removeItem(const Common::String &item) {
Items::iterator it = find(_items.begin(), _items.end(), item);
if (it == _items.end()) {
debug("Item '%s' not in inventory.", item.c_str());
return;
}
_items.remove_at(it - _items.begin());
}
void Inventory::removeAllItems() {
_items.clear();
}
void Inventory::rotateItemsRight(uint n) {
if (_items.size() < 2) {
return;
}
n %= _items.size();
reverseItems(0, _items.size() - 1);
reverseItems(0, n - 1);
reverseItems(n, _items.size() - 1);
}
void Inventory::rotateItemsLeft(uint n) {
if (_items.size() < 2) {
return;
}
n %= _items.size();
reverseItems(0, _items.size() - 1);
reverseItems(_items.size() - n, _items.size() - 1);
reverseItems(0, _items.size() - n - 1);
}
void Inventory::reverseItems(uint from, uint to) {
assert(from <= to);
if (from == to) {
return;
}
const uint size = to - from + 1;
for (uint i = 0; i < size / 2; ++i) {
SWAP(_items[i], _items[size - i - 1]);
}
}
}
|
