Mercurial > molko

annotate librpg/rpg/inventory.c @ 169:eb0a7ab71023

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
misc: extreme cleanup, closes #2506 While here, remove unneeded stuff.
author David Demelier <markand@malikania.fr>
date Tue, 20 Oct 2020 17:39:13 +0200
parents c577c15df07f
children ce789473567e
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
85
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
1 /*
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
2 * inventory.c -- inventory of items
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
3 *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
4 * Copyright (c) 2020 David Demelier <markand@malikania.fr>
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
5 *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
6 * Permission to use, copy, modify, and/or distribute this software for any
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
7 * purpose with or without fee is hereby granted, provided that the above
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
8 * copyright notice and this permission notice appear in all copies.
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
9 *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
17 */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
18
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
19 #include <assert.h>
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
20 #include <stddef.h>
110
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
21 #include <stdlib.h>
85
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
22 #include <string.h>
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
23
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
24 #include "inventory.h"
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
25 #include "item.h"
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
26
110
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
27 #define INVENTORY_TOTAL (INVENTORY_ROWS_MAX * INVENTORY_COLS_MAX)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
28
85
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
29 static bool
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
30 can_be_used(struct inventory_slot *slot, const struct item *item)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
31 {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
32 assert(item);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
33
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
34 /* Empty slot. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
35 if (!slot->item)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
36 return false;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
37
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
38 /* Not same object. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
39 if (strcmp(slot->item->name, item->name) != 0)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
40 return false;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
41
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
42 /* No space in this slot. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
43 if (slot->amount >= slot->item->stackable)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
44 return false;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
45
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
46 return true;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
47 }
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
48
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
49 static struct inventory_slot *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
50 find(struct inventory *iv, const struct item *item)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
51 {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
52 assert(iv);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
53 assert(item);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
54
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
55 /* First pass: find an entry with the same item. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
56 for (unsigned int r = 0; r < INVENTORY_ROWS_MAX; ++r)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
57 for (unsigned int c = 0; c < INVENTORY_COLS_MAX; ++c)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
58 if (can_be_used(&iv->items[r][c], item))
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
59 return &iv->items[r][c];
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
60
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
61 /* Second pass: try to find an empty slot. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
62 for (unsigned int r = 0; r < INVENTORY_ROWS_MAX; ++r)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
63 for (unsigned int c = 0; c < INVENTORY_COLS_MAX; ++c)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
64 if (!iv->items[r][c].item)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
65 return &iv->items[r][c];
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
66
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
67 return NULL;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
68 }
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
69
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
70 static unsigned
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
71 provide(struct inventory_slot *slot, struct item *item, unsigned int amount)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
72 {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
73 assert(slot);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
74
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
75 unsigned int avail;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
76
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
77 /* The slot may be empty, make sure it contains this item. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
78 slot->item = item;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
79
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
80 /*
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
81 * Example:
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
82 *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
83 * The slot has already 10 items.
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
84 * The slot item is stackble up to 64 items.
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
85 *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
86 * When pushing:
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
87 *
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
88 * 80: 54 pushed, 26 left
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
89 * 30: 30 pushed, 0 left.
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
90 */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
91 avail = slot->item->stackable - slot->amount;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
92
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
93 if (amount > avail) {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
94 slot->amount += avail;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
95 amount -= avail;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
96 } else {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
97 slot->amount += amount;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
98 amount = 0;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
99 }
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
100
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
101 return amount;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
102 }
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
103
110
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
104 static bool
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
105 merge(struct inventory_slot *slot, struct inventory_slot *other)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
106 {
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
107 assert(slot);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
108 assert(slot->item);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
109 assert(other);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
110
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
111 /* Not compatible, return false to let the sorting continue. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
112 if (slot->item != other->item)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
113 return false;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
114
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
115 while (slot->amount < slot->item->stackable && other->amount) {
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
116 slot->amount++;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
117 other->amount--;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
118 }
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
119
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
120 /* No more amount in the other slot, empty it. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
121 if (other->amount == 0U)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
122 memset(other, 0, sizeof (*other));
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
123
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
124 return slot->amount >= slot->item->stackable;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
125 }
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
126
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
127 static void
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
128 sort(struct inventory *iv, struct inventory_slot *slot, int r, int c)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
129 {
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
130 assert(slot);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
131 assert(slot->item);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
132
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
133 /* Merge until the end of thiw row. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
134 for (c = c + 1; c < INVENTORY_COLS_MAX; ++c)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
135 if (merge(slot, &iv->items[r][c]))
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
136 return;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
137
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
138 /* Merge the next rows. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
139 for (r = r + 1; r < INVENTORY_ROWS_MAX; ++r)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
140 for (c = 0; c < INVENTORY_COLS_MAX; ++c)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
141 if (merge(slot, &iv->items[r][c]))
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
142 return;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
143 }
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
144
85
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
145 unsigned int
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
146 inventory_push(struct inventory *iv, struct item *item, unsigned int amount)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
147 {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
148 assert(iv);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
149 assert(item);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
150
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
151 while (amount) {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
152 struct inventory_slot *slot;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
153
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
154 if (!(slot = find(iv, item)))
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
155 break;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
156
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
157 /* Add as much as we can in this slot. */
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
158 amount = provide(slot, item, amount);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
159 }
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
160
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
161 return amount;
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
162 }
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
163
110
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
164 static int
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
165 compare_slot(const void *v1, const void *v2)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
166 {
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
167 const struct inventory_slot *slot1 = v1;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
168 const struct inventory_slot *slot2 = v2;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
169 int cmp;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
170
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
171 /* Two null slots compare equal. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
172 if (!slot1->item && !slot2->item)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
173 return 0;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
174
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
175 /* Null left should be moved after. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
176 if (!slot1->item)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
177 return 1;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
178
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
179 /* Null right slots should be moved after. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
180 if (!slot2->item)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
181 return -1;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
182
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
183 /* If they are identical, use amount to sort. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
184 if ((cmp = strcmp(slot1->item->name, slot2->item->name)) == 0)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
185 return (long long int)slot2->amount - (long long int)slot1->amount;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
186
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
187 return cmp;
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
188 }
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
189
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
190 void
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
191 inventory_sort(struct inventory *iv)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
192 {
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
193 assert(iv);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
194
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
195 for (int r = 0; r < INVENTORY_ROWS_MAX; ++r)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
196 for (int c = 0; c < INVENTORY_COLS_MAX; ++c)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
197 if (iv->items[r][c].item)
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
198 sort(iv, &iv->items[r][c], r, c);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
199
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
200 /* Sort by names AND by amount. */
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
201 qsort(iv->items, INVENTORY_TOTAL, sizeof (struct inventory_slot), compare_slot);
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
202 }
d3bc14c1e243 inventory: add sorting algorithms
David Demelier <markand@malikania.fr>
parents: 87
diff changeset
203
85
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
204 void
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
205 inventory_clear(struct inventory *iv)
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
206 {
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
207 assert(iv);
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
208
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
209 memset(iv, 0, sizeof (*iv));
34e91215ec5a core: implement basic parts of inventories, closes #2483
David Demelier <markand@malikania.fr>
parents:
diff changeset
210 }