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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
|
/*
* The ManaPlus Client
* Copyright (C) 2004-2009 The Mana World Development Team
* Copyright (C) 2009-2010 The Mana Developers
* Copyright (C) 2011-2015 The ManaPlus Developers
*
* This file is part of The ManaPlus Client.
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#include "inventory.h"
#include "item.h"
#include "logger.h"
#include "enums/simpletypes.h"
#include "net/inventoryhandler.h"
#include "resources/iteminfo.h"
#include "listeners/inventorylistener.h"
#include "utils/delete2.h"
#include "utils/gettext.h"
#include "utils/stringutils.h"
#include <algorithm>
#include <functional>
#include <string>
#include "debug.h"
namespace
{
struct SlotUsed final
{
bool operator()(const Item *const item) const
{
return item && item->mId >= 0 && item->mQuantity > 0;
}
typedef Item *argument_type;
};
} // namespace
Inventory::Inventory(const InventoryType::Type type, const int size1) :
mInventoryListeners(),
mType(type),
mSize(size1 == -1 ? static_cast<unsigned>(
inventoryHandler->getSize(type))
: static_cast<unsigned>(size1)),
mItems(new Item*[mSize]),
mUsed(0)
{
std::fill_n(mItems, mSize, static_cast<Item*>(nullptr));
}
Inventory::~Inventory()
{
for (unsigned i = 0; i < mSize; i++)
delete mItems[i];
delete [] mItems;
mItems = nullptr;
}
Item *Inventory::getItem(const int index) const
{
if (index < 0 || index >= static_cast<int>(mSize) || !mItems[index]
|| mItems[index]->mQuantity <= 0)
{
return nullptr;
}
return mItems[index];
}
Item *Inventory::findItem(const int itemId, const unsigned char color) const
{
for (unsigned i = 0; i < mSize; i++)
{
Item *const item = mItems[i];
if (item && item->mId == itemId)
{
if (color == 0 || item->mColor == color
|| (color == 1 && item->mColor <= 1))
{
return item;
}
}
}
return nullptr;
}
int Inventory::addItem(const int id,
const int type,
const int quantity,
const uint8_t refine,
const uint8_t color,
const Identified identified,
const Damaged damaged,
const Favorite favorite,
const Equipm equipment,
const bool equipped)
{
const int slot = getFreeSlot();
setItem(slot, id, type, quantity, refine, color,
identified, damaged, favorite, equipment, equipped);
return slot;
}
void Inventory::setItem(const int index,
const int id,
const int type,
const int quantity,
const uint8_t refine,
const unsigned char color,
const Identified identified,
const Damaged damaged,
const Favorite favorite,
const Equipm equipment,
const bool equipped)
{
if (index < 0 || index >= static_cast<int>(mSize))
{
logger->log("Warning: invalid inventory index: %d", index);
return;
}
Item *const item1 = mItems[index];
if (!item1 && id > 0)
{
Item *const item = new Item(id, type, quantity, refine, color,
identified, damaged, favorite, equipment, equipped);
item->setInvIndex(index);
mItems[index] = item;
mUsed++;
distributeSlotsChangedEvent();
}
else if (id > 0 && item1)
{
item1->setId(id, color);
item1->setQuantity(quantity);
item1->setRefine(refine);
item1->setEquipment(equipment);
item1->setIdentified(identified);
item1->setDamaged(damaged);
item1->setFavorite(favorite);
}
else if (item1)
{
removeItemAt(index);
}
}
void Inventory::setCards(const int index,
const int *const cards,
const int size) const
{
if (index < 0 || index >= static_cast<int>(mSize))
{
logger->log("Warning: invalid inventory index: %d", index);
return;
}
Item *const item1 = mItems[index];
item1->setCards(cards, size);
}
void Inventory::clear()
{
for (unsigned i = 0; i < mSize; i++)
removeItemAt(i);
}
void Inventory::removeItem(const int id)
{
for (unsigned i = 0; i < mSize; i++)
{
const Item *const item = mItems[i];
if (item && item->mId == id)
removeItemAt(i);
}
}
void Inventory::removeItemAt(const int index)
{
delete2(mItems[index]);
mUsed--;
if (mUsed < 0) // Already at 0, no need to distribute event
mUsed = 0;
else
distributeSlotsChangedEvent();
}
bool Inventory::contains(const Item *const item) const
{
if (!item)
return false;
const int id = item->mId;
for (unsigned i = 0; i < mSize; i++)
{
const Item *const item1 = mItems[i];
if (item1 && item1->mId == id)
return true;
}
return false;
}
int Inventory::getFreeSlot() const
{
Item **const i = std::find_if(mItems, mItems + mSize,
std::not1(SlotUsed()));
return (i == mItems + mSize) ? -1
: static_cast<int>(i - mItems);
}
int Inventory::getLastUsedSlot() const
{
for (int i = mSize - 1; i >= 0; i--)
{
if (SlotUsed()(mItems[i]))
return i;
}
return -1;
}
void Inventory::addInventoyListener(InventoryListener* const listener)
{
mInventoryListeners.push_back(listener);
}
void Inventory::removeInventoyListener(InventoryListener* const listener)
{
mInventoryListeners.remove(listener);
}
void Inventory::distributeSlotsChangedEvent()
{
FOR_EACH (InventoryListenerList::const_iterator, i, mInventoryListeners)
(*i)->slotsChanged(this);
}
const Item *Inventory::findItemBySprite(std::string spritePath,
const Gender::Type gender,
const int race) const
{
spritePath = removeSpriteIndex(spritePath);
const std::string spritePathShort = extractNameFromSprite(spritePath);
int partialIndex = -1;
for (unsigned i = 0; i < mSize; i++)
{
const Item *const item = mItems[i];
if (item)
{
std::string path = item->getInfo().getSprite(gender, race);
if (!path.empty())
{
path = removeSpriteIndex(path);
if (spritePath == path)
return item;
path = extractNameFromSprite(path);
if (spritePathShort == path)
partialIndex = i;
}
}
}
if (partialIndex != -1)
return mItems[partialIndex];
return nullptr;
}
std::string Inventory::getName() const
{
switch (mType)
{
case InventoryType::INVENTORY:
case InventoryType::VENDING:
case InventoryType::TYPE_END:
default:
{
// TRANSLATORS: inventory type name
return N_("Inventory");
}
case InventoryType::STORAGE:
{
// TRANSLATORS: inventory type name
return N_("Storage");
}
case InventoryType::CART:
{
// TRANSLATORS: inventory type name
return N_("Cart");
}
case InventoryType::NPC:
{
// TRANSLATORS: inventory type name
return N_("Npc");
}
case InventoryType::TRADE:
{
// TRANSLATORS: inventory type name
return N_("Trade");
}
}
}
void Inventory::resize(const unsigned int newSize)
{
clear();
if (mSize == newSize)
return;
for (unsigned i = 0; i < mSize; i++)
delete mItems[i];
delete [] mItems;
mSize = newSize;
mItems = new Item*[static_cast<size_t>(mSize)];
std::fill_n(mItems, mSize, static_cast<Item*>(nullptr));
}
|