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
|
/*
* The Mana World
* Copyright 2004 The Mana World Development Team
*
* This file is part of The Mana World.
*
* The Mana World 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.
*
* The Mana World 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 The Mana World; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* $Id$
*/
#include "inventory.h"
#include <algorithm>
#include "item.h"
struct SlotUsed : public std::unary_function<Item, bool>
{
bool operator()(const Item &item) const {
return (item.getId() && item.getQuantity());
}
};
Inventory::Inventory()
{
mItems = new Item[INVENTORY_SIZE];
for (int i = 0; i < INVENTORY_SIZE; i++) {
mItems[i].setInvIndex(i);
}
}
Inventory::~Inventory()
{
delete [] mItems;
}
Item* Inventory::getItem(int index)
{
if (index < 0 || index >= INVENTORY_SIZE)
{
return 0;
}
return &mItems[index];
}
void Inventory::addItem(int id, int quantity)
{
addItem(getFreeSlot(), id, quantity);
}
void Inventory::addItem(int index, int id, int quantity)
{
mItems[index].setId(id);
mItems[index].increaseQuantity(quantity);
}
void Inventory::clear()
{
for (int i = 0; i < INVENTORY_SIZE; i++) {
removeItemIndex(i);
}
}
void Inventory::removeItem(int id)
{
for (int i = 0; i < INVENTORY_SIZE; i++) {
if (mItems[i].getId() == id) {
removeItemIndex(i);
}
}
}
void Inventory::removeItemIndex(int index)
{
mItems[index].setId(0);
mItems[index].setQuantity(0);
}
bool Inventory::contains(Item *item) const
{
for (int i = 0; i < INVENTORY_SIZE; i++) {
if (mItems[i].getId() == item->getId()) {
return true;
}
}
return false;
}
int Inventory::getFreeSlot() const
{
Item *i = std::find_if(mItems, 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;
}
|
