blob: dc1188e05d0e78b1f2a4c7f3410a8dd799dae285 (
plain) (
blame)
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
|
/*
* The Mana Client
* Copyright (C) 2004-2009 The Mana World Development Team
* Copyright (C) 2009-2012 The Mana Developers
*
* This file is part of The Mana 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/>.
*/
#ifndef SHOPITEM_H
#define SHOPITEM_H
#include "item.h"
#include <stack>
/**
* Represents an item in a shop inventory. It can store quantity and inventory
* indices of duplicate entries in the shop as well.
*/
class ShopItem : public Item
{
public:
/**
* Constructor. Creates a new ShopItem.
*
* @param inventoryIndex the inventory index of the item
* @param id the id of the item
* @param quantity number of available copies of the item
* @param price price of the item
*/
ShopItem(int inventoryIndex, int id, int quantity, int price);
~ShopItem() override;
/**
* Add a duplicate. Id and price will be taken from this item.
*
* @param inventoryIndex the inventory index of the item
* @param quantity number of available copies of the item
*/
void addDuplicate(int inventoryIndex, int quantity);
/**
* Gets the quantity of the currently topmost duplicate.
*
* @return the quantity of the currently topmost duplicate
*/
int getCurrentQuantity() const
{
return mDuplicates.empty() ? 0 : mDuplicates.top().quantity;
}
/**
* Gets the inventory index of the currently topmost duplicate.
*
* @return the inventory index of the currently topmost duplicate
*/
int getCurrentInvIndex() const
{
return mDuplicates.empty() ? mInvIndex :
mDuplicates.top().inventoryIndex;
}
/**
* Reduces the quantity of the topmost duplicate by the specified
* amount. Also reduces the total quantity of this DuplicateItem.
* Empty duplicates are automatically removed.
*
* If the amount is bigger than the quantity of the current topmost,
* only sell as much as possible. Returns the amount actually sold (do
* not ignore the return value!)
*
* @return the amount, that actually was sold.
*/
int sellCurrentDuplicate(int quantity);
/**
* Gets the price of the item.
*
* @return the price of the item
*/
int getPrice() const
{ return mPrice; }
/**
* Gets the display name for the item in the shop list.
*
* @return the display name for the item in the shop list
*/
const std::string &getDisplayName() const
{ return mDisplayName; }
protected:
int mPrice;
std::string mDisplayName;
/**
* Struct to keep track of duplicates.
*/
struct DuplicateItem
{
int inventoryIndex;
int quantity;
};
std::stack<DuplicateItem> mDuplicates; /** <-- Stores duplicates */
};
#endif
|
