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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/*
* The Mana World
* Copyright (C) 2004 The Mana World Development Team
*
* This file is part of The Mana World.
*
* 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
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "inventory.h"
#include <algorithm>
#include <cassert>
#include "item.h"
#include "log.h"
struct SlotUsed : public std::unary_function<Item*, bool>
{
bool operator()(const Item *item) const {
return item && item->getId() != -1 && item->getQuantity() > 0;
}
};
Inventory::Inventory()
{
mItems = new Item*[INVENTORY_SIZE];
std::fill_n(mItems, INVENTORY_SIZE, (Item*) 0);
}
Inventory::~Inventory()
{
for (int i = 0; i < INVENTORY_SIZE; i++)
delete mItems[i];
delete [] mItems;
}
Item* Inventory::getItem(int index) const
{
if (index < 0 || index >= INVENTORY_SIZE || !mItems[index] || mItems[index]->getQuantity() <= 0)
return 0;
return mItems[index];
}
Item* Inventory::findItem(int itemId) const
{
for (int i = 0; i < INVENTORY_SIZE; i++)
{
if (mItems[i] && mItems[i]->getId() == itemId)
return mItems[i];
}
return NULL;
}
void Inventory::addItem(int id, int quantity, bool equipment)
{
setItem(getFreeSlot(), id, quantity, equipment);
}
void Inventory::setItem(int index, int id, int quantity, bool equipment)
{
if (index < 0 || index >= INVENTORY_SIZE) {
logger->log("Warning: invalid inventory index: %d", index);
return;
}
/* TODO: Check where to reenable this code.
// Dont stack equipment other than arrows.
if (equipment && !(id == 1199 || id == 529))
mItems[index].setQuantity(quantity);
else
mItems[index].increaseQuantity(quantity);
*/
if (!mItems[index] && id > 0) {
Item *item = new Item(id, quantity, equipment);
item->setInvIndex(index);
mItems[index] = item;
} else if (id > 0) {
mItems[index]->setId(id);
mItems[index]->setQuantity(quantity);
mItems[index]->setEquipment(equipment);
} else if (mItems[index]) {
removeItemAt(index);
}
}
void Inventory::clear()
{
for (int i = 0; i < INVENTORY_SIZE; i++) {
removeItemAt(i);
}
}
void Inventory::removeItem(int id)
{
for (int i = 0; i < INVENTORY_SIZE; i++) {
if (mItems[i] && mItems[i]->getId() == id) {
removeItemAt(i);
}
}
}
void Inventory::removeItemAt(int index)
{
delete mItems[index];
mItems[index] = 0;
}
bool Inventory::contains(Item *item) const
{
for (int i = 0; i < INVENTORY_SIZE; i++) {
if (mItems[i] && mItems[i]->getId() == item->getId()) {
return true;
}
}
return false;
}
int Inventory::getFreeSlot() const
{
Item **i = std::find_if(mItems + 2, mItems + INVENTORY_SIZE,
std::not1(SlotUsed()));
return (i == mItems + INVENTORY_SIZE) ? -1 : (i - mItems);
}
int Inventory::getNumberOfSlotsUsed() const
{
return count_if(mItems, mItems + INVENTORY_SIZE, SlotUsed());
}
int Inventory::getLastUsedSlot() const
{
for (int i = INVENTORY_SIZE - 1; i >= 0; i--) {
if (SlotUsed()(mItems[i])) {
return i;
}
}
return -1;
}
int Inventory::getInventorySize() const
{
return INVENTORY_SIZE - 2;
}
|
