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
|
/* ResidualVM - A 3D game interpreter
*
* ResidualVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the AUTHORS
* 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 "engines/stark/resources/knowledgeset.h"
#include "engines/stark/formats/xrc.h"
#include "engines/stark/resources/item.h"
#include "engines/stark/services/stateprovider.h"
namespace Stark {
namespace Resources {
KnowledgeSet::~KnowledgeSet() {
}
KnowledgeSet::KnowledgeSet(Object *parent, byte subType, uint16 index, const Common::String &name) :
Object(parent, subType, index, name) {
_type = TYPE;
}
void KnowledgeSet::printData() {
}
Gfx::RenderEntryArray KnowledgeSet::getInventoryRenderEntries() {
Common::Array<Resources::Item *> inventoryItems = listChildren<Resources::Item>(Resources::Item::kItemInventory);
// First add the inventory items from old saves which don't have an order
Gfx::RenderEntryArray result;
for (uint i = 0; i < inventoryItems.size(); i++) {
// The first 4 elements are UI elements (Eye, Mouth, Hand, ...)
if (i < 4 || !inventoryItems[i]->isEnabled()) continue;
bool orderFound = false;
for (uint j = 0; j < _inventoryItemOrder.size(); j++) {
if (_inventoryItemOrder[j] == inventoryItems[i]->getIndex()) {
orderFound = true;
break;
}
}
if (!orderFound) {
result.push_back(inventoryItems[i]->getRenderEntry(Common::Point(0, 0)));
}
}
// Then add the inventory items for which an order has been recorded
for (uint i = 0; i < _inventoryItemOrder.size(); i++) {
for (uint j = 0; j < inventoryItems.size(); j++) {
if (inventoryItems[j]->isEnabled() && inventoryItems[j]->getIndex() == _inventoryItemOrder[i]) {
result.push_back(inventoryItems[j]->getRenderEntry(Common::Point(0, 0)));
}
}
}
return result;
}
void KnowledgeSet::addItem(InventoryItem *item) {
_inventoryItemOrder.push_back(item->getIndex());
}
void KnowledgeSet::removeItem(InventoryItem *item) {
Common::Array<uint16>::iterator it;
for (it = _inventoryItemOrder.begin(); it != _inventoryItemOrder.end(); it++) {
if (*it == item->getIndex()) {
_inventoryItemOrder.erase(it);
break;
}
}
}
void KnowledgeSet::saveLoad(ResourceSerializer *serializer) {
if (_subType == kInventory) {
serializer->syncArraySize(_inventoryItemOrder);
for (uint i = 0; i < _inventoryItemOrder.size(); i++) {
serializer->syncAsUint16LE(_inventoryItemOrder[i]);
}
}
}
} // End of namespace Resources
} // End of namespace Stark
|
