1 | |
|
|
2 | /* |
1 | /* |
3 | * static char *rcsid_shop_c = |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
4 | * "$Id: shop.C,v 1.10 2006/09/10 15:59:57 root Exp $"; |
3 | * |
5 | */ |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
6 | |
|
|
7 | /* |
|
|
8 | CrossFire, A Multiplayer game for X-windows |
|
|
9 | |
|
|
10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
11 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
12 | |
7 | * |
13 | This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
14 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
15 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
16 | (at your option) any later version. |
11 | * (at your option) any later version. |
17 | |
12 | * |
18 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
21 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
22 | |
17 | * |
23 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
24 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
26 | |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
|
|
28 | */ |
22 | */ |
29 | |
23 | |
30 | #include <global.h> |
24 | #include <global.h> |
31 | #include <spells.h> |
25 | #include <spells.h> |
32 | #include <skills.h> |
26 | #include <skills.h> |
33 | #include <living.h> |
27 | #include <living.h> |
34 | #include <newclient.h> |
|
|
35 | #ifndef __CEXTRACT__ |
|
|
36 | # include <sproto.h> |
28 | #include <sproto.h> |
37 | #endif |
|
|
38 | #include <math.h> |
29 | #include <math.h> |
39 | |
30 | |
40 | /* this is a measure of how effective store specialisation is. A general store |
31 | /* this is a measure of how effective store specialisation is. A general store |
41 | * will offer this proportion of the 'maximum' price, a specialised store will |
32 | * will offer this proportion of the 'maximum' price, a specialised store will |
42 | * offer a range of prices around it such that the maximum price is always one |
33 | * offer a range of prices around it such that the maximum price is always one |
43 | * therefore making this number higher, makes specialisation less effective. |
34 | * therefore making this number higher, makes specialisation less effective. |
44 | * setting this value above 1 or to a negative value would have interesting, |
35 | * setting this value above 1 or to a negative value would have interesting, |
45 | * (though not useful) effects. |
36 | * (though not useful) effects. |
46 | */ |
37 | */ |
47 | #define SPECIALISATION_EFFECT 0.5 |
38 | #define SPECIALISATION_EFFECT .5 |
48 | |
39 | |
49 | /* price a shopkeeper will give someone they neither like nor dislike */ |
40 | // price a shopkeeper will give someone that is not of their race |
50 | #define NEUTRAL_RATIO 0.8 |
41 | #define DISLIKE_RATIO 0.8 |
51 | |
42 | |
52 | static uint64 pay_from_container (object *pl, object *pouch, uint64 to_pay); |
43 | static void pay_from_container (object *pl, object *pouch, sint64 &to_pay); |
53 | static uint64 value_limit (uint64 val, int quantity, const object *who, int isshop); |
44 | static sint64 value_limit (sint64 val, int quantity, const object *who, int isshop); |
54 | static double shop_specialisation_ratio (const object *item, const mapstruct *map); |
45 | static double shop_specialisation_ratio (const object *item, const maptile *map); |
55 | static double shop_greed (const mapstruct *map); |
46 | static double shop_greed (const maptile *map); |
56 | |
47 | |
57 | #define NUM_COINS 4 /* number of coin types */ |
48 | #define NUM_COINS 4 /* number of coin types */ |
58 | static const char *const coins[] = { "royalty", "platinacoin", "goldcoin", "silvercoin", NULL }; |
49 | static const char *const coins[] = { "royalty", "platinacoin", "goldcoin", "silvercoin", NULL }; |
59 | |
50 | |
60 | /* Added F_TRUE flag to define.h to mean that the price should not |
51 | /* Added F_TRUE flag to define.h to mean that the price should not |
… | |
… | |
80 | * thus remained 0. |
71 | * thus remained 0. |
81 | * |
72 | * |
82 | * Mark Wedel (mwedel@pyramid.com) |
73 | * Mark Wedel (mwedel@pyramid.com) |
83 | */ |
74 | */ |
84 | |
75 | |
85 | static uint64 approx_range; |
76 | static sint64 approx_range; |
86 | |
77 | |
87 | uint64 |
78 | sint64 |
88 | query_cost (const object *tmp, object *who, int flag) |
79 | query_cost (const object *tmp, object *who, int flag) |
89 | { |
80 | { |
90 | double val; |
81 | double val; |
91 | int number; /* used to better calculate value */ |
82 | int number; /* used to better calculate value */ |
92 | int no_bargain; |
83 | int no_bargain; |
… | |
… | |
104 | approximate = flag & F_APPROX; |
95 | approximate = flag & F_APPROX; |
105 | shop = flag & F_SHOP; |
96 | shop = flag & F_SHOP; |
106 | flag &= ~(F_NO_BARGAIN | F_IDENTIFIED | F_NOT_CURSED | F_APPROX | F_SHOP); |
97 | flag &= ~(F_NO_BARGAIN | F_IDENTIFIED | F_NOT_CURSED | F_APPROX | F_SHOP); |
107 | |
98 | |
108 | if (tmp->type == MONEY) |
99 | if (tmp->type == MONEY) |
109 | return (tmp->nrof * tmp->value); |
100 | return tmp->nrof * tmp->value; |
|
|
101 | |
110 | if (tmp->type == GEM) |
102 | if (tmp->type == GEM) |
111 | { |
103 | { |
112 | if (flag == F_TRUE) |
104 | if (flag == F_TRUE) |
113 | return (tmp->nrof * tmp->value); |
105 | return (tmp->nrof * tmp->value); |
|
|
106 | |
114 | if (flag == F_BUY) |
107 | if (flag == F_BUY) |
115 | return (uint64) (1.03 * tmp->nrof * tmp->value); |
108 | return (sint64) (1.03 * tmp->nrof * tmp->value); |
|
|
109 | |
116 | if (flag == F_SELL) |
110 | if (flag == F_SELL) |
117 | return (uint64) (0.97 * tmp->nrof * tmp->value); |
111 | return (sint64) (0.97 * tmp->nrof * tmp->value); |
|
|
112 | |
118 | LOG (llevError, "Query_cost: Gem type with unknown flag : %d\n", flag); |
113 | LOG (llevError, "Query_cost: Gem type with unknown flag %d: %s\n", flag, tmp->debug_desc ()); |
119 | return 0; |
114 | return 0; |
120 | } |
115 | } |
|
|
116 | |
121 | number = tmp->nrof; |
117 | number = tmp->nrof; |
122 | if (number == 0) |
118 | if (number == 0) |
123 | number = 1; |
119 | number = 1; |
124 | if (QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified) |
120 | if (QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified) |
125 | { |
121 | { |
… | |
… | |
134 | if (tmp->arch != NULL) |
130 | if (tmp->arch != NULL) |
135 | { |
131 | { |
136 | if (flag == F_BUY) |
132 | if (flag == F_BUY) |
137 | { |
133 | { |
138 | LOG (llevError, "Asking for buy-value of unidentified object.\n"); |
134 | LOG (llevError, "Asking for buy-value of unidentified object.\n"); |
139 | val = tmp->arch->clone.value * 50 * number; |
135 | val = tmp->arch->value * 50 * number; |
140 | } |
136 | } |
141 | else |
137 | else |
142 | { /* Trying to sell something, or get true value */ |
138 | { /* Trying to sell something, or get true value */ |
143 | if (tmp->type == POTION) |
139 | if (tmp->type == POTION) |
144 | val = number * 40; /* Don't want to give anything away */ |
140 | val = number * 40; /* Don't want to give anything away */ |
… | |
… | |
146 | { |
142 | { |
147 | /* Get 2/3'rd value for applied objects, 1/3'rd for totally |
143 | /* Get 2/3'rd value for applied objects, 1/3'rd for totally |
148 | * unknown objects |
144 | * unknown objects |
149 | */ |
145 | */ |
150 | if (QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) |
146 | if (QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) |
151 | val = number * tmp->arch->clone.value * 2 / 3; |
147 | val = number * tmp->arch->value * 2 / 3; |
152 | else |
148 | else |
153 | val = number * tmp->arch->clone.value / 3; |
149 | val = number * tmp->arch->value / 3; |
154 | } |
150 | } |
155 | } |
151 | } |
156 | } |
152 | } |
157 | else |
153 | else |
158 | { /* No archetype with this object */ |
154 | { /* No archetype with this object */ |
… | |
… | |
169 | |
165 | |
170 | /* If the item has been applied or identifed or does not need to be |
166 | /* If the item has been applied or identifed or does not need to be |
171 | * identified, AND the object is magical and the archetype is non |
167 | * identified, AND the object is magical and the archetype is non |
172 | * magical, then change values accordingly. The tmp->arch==NULL is |
168 | * magical, then change values accordingly. The tmp->arch==NULL is |
173 | * really just a check to prevent core dumps for when it checks |
169 | * really just a check to prevent core dumps for when it checks |
174 | * tmp->arch->clone.magic for any magic. The check for archetype |
170 | * tmp->arch->magic for any magic. The check for archetype |
175 | * magic is to not give extra money for archetypes that are by |
171 | * magic is to not give extra money for archetypes that are by |
176 | * default magical. This is because the archetype value should have |
172 | * default magical. This is because the archetype value should have |
177 | * already figured in that value. |
173 | * already figured in that value. |
178 | */ |
174 | */ |
179 | if ((QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified || |
175 | if ((QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified || |
180 | QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) && tmp->magic && (tmp->arch == NULL || !tmp->arch->clone.magic)) |
176 | QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) && tmp->magic && (tmp->arch == NULL || !tmp->arch->magic)) |
181 | { |
177 | { |
182 | if (tmp->magic > 0) |
178 | if (tmp->magic > 0) |
183 | val *= (3 * tmp->magic * tmp->magic * tmp->magic); |
179 | val *= (3 * tmp->magic * tmp->magic * tmp->magic); |
184 | else |
180 | else |
185 | /* Note that tmp->magic is negative, so that this |
181 | /* Note that tmp->magic is negative, so that this |
… | |
… | |
200 | val /= 50; |
196 | val /= 50; |
201 | } |
197 | } |
202 | |
198 | |
203 | /* Limit amount of money you can get for really great items. */ |
199 | /* Limit amount of money you can get for really great items. */ |
204 | if (flag == F_SELL) |
200 | if (flag == F_SELL) |
205 | val = value_limit ((uint64) val, number, who, shop); |
201 | val = value_limit ((sint64) val, number, who, shop); |
206 | |
202 | |
207 | // use a nonlinear price adjustment. as my predecessor said, don't change |
203 | // use a nonlinear price adjustment. as my predecessor said, don't change |
208 | // the archetypes, its work required for balancing, and we don't care. |
204 | // the archetypes, its work required for balancing, and we don't care. |
209 | //val = pow (val, 1.05); |
205 | //val = pow (val, 1.05); |
210 | |
206 | |
… | |
… | |
224 | const typedata *tmptype; |
220 | const typedata *tmptype; |
225 | |
221 | |
226 | tmptype = get_typedata (tmp->type); |
222 | tmptype = get_typedata (tmp->type); |
227 | |
223 | |
228 | if (find_skill_by_number (who, SK_BARGAINING)) |
224 | if (find_skill_by_number (who, SK_BARGAINING)) |
229 | { |
|
|
230 | lev_bargain = find_skill_by_number (who, SK_BARGAINING)->level; |
225 | lev_bargain = find_skill_by_number (who, SK_BARGAINING)->level; |
231 | } |
226 | |
232 | if (tmptype) |
227 | if (tmptype) |
233 | { |
228 | { |
234 | idskill1 = tmptype->identifyskill; |
229 | idskill1 = tmptype->identifyskill; |
|
|
230 | |
235 | if (idskill1) |
231 | if (idskill1) |
236 | { |
232 | { |
237 | idskill2 = tmptype->identifyskill2; |
233 | idskill2 = tmptype->identifyskill2; |
|
|
234 | |
238 | if (find_skill_by_number (who, idskill1)) |
235 | if (find_skill_by_number (who, idskill1)) |
239 | { |
|
|
240 | lev_identify = find_skill_by_number (who, idskill1)->level; |
236 | lev_identify = find_skill_by_number (who, idskill1)->level; |
241 | } |
237 | |
242 | if (idskill2 && find_skill_by_number (who, idskill2)) |
238 | if (idskill2 && find_skill_by_number (who, idskill2)) |
243 | { |
|
|
244 | lev_identify += find_skill_by_number (who, idskill2)->level; |
239 | lev_identify += find_skill_by_number (who, idskill2)->level; |
245 | } |
|
|
246 | } |
240 | } |
247 | } |
241 | } |
248 | else |
242 | else |
249 | LOG (llevError, "Query_cost: item %s hasn't got a valid type\n", &tmp->name); |
243 | LOG (llevError, "Query_cost: item %s hasn't got a valid type\n", tmp->debug_desc ()); |
250 | |
244 | |
251 | /* ratio determines how much of the price modification |
245 | /* ratio determines how much of the price modification |
252 | * will come from the basic stat charisma |
246 | * will come from the basic stat charisma |
253 | * the rest will come from the level in bargaining skill |
247 | * the rest will come from the level in bargaining skill |
254 | */ |
248 | */ |
255 | const double cha_ratio = 0.40; |
249 | const double cha_ratio = 0.40; |
256 | |
250 | |
257 | diff = no_bargain ? 1.0 : 1. - pow (lev_bargain / (double) settings.max_level, 0.25); |
251 | diff = no_bargain ? 1.0 : 1. - pow (lev_bargain / (double) settings.max_level, 0.25); |
258 | |
|
|
259 | diff = (1. - cha_ratio) * diff + cha_ratio * (cha_bonus[who->stats.Cha] - 1.) / (cha_bonus[who->stats.Cha] + 1.); |
252 | diff = (1. - cha_ratio) * diff + cha_ratio * (cha_bonus[who->stats.Cha] - 1.) / (cha_bonus[who->stats.Cha] + 1.); |
260 | |
|
|
261 | diff = .02 + (.80 - .02) * diff; |
253 | diff = .02 + (.80 - .02) * diff; |
262 | |
254 | |
263 | if (flag == F_BUY) |
255 | if (flag == F_BUY) |
264 | val += (val * diff); |
256 | val += val * diff; |
265 | else if (flag == F_SELL) |
257 | else if (flag == F_SELL) |
266 | val -= (val * diff); |
258 | val -= val * diff; |
267 | |
259 | |
268 | // now find a price range. the less good we can judge, the larger the range is |
260 | // now find a price range. the less good we can judge, the larger the range is |
269 | // then the range is adjusted randomly around the correct value |
261 | // then the range is adjusted randomly around the correct value |
270 | if (approximate) |
262 | if (approximate) |
271 | approx_range = uint64 (val / sqrt (lev_identify * 3 + 1)); |
263 | approx_range = sint64 (val / sqrt (lev_identify * 3 + 1)); |
272 | } |
264 | } |
273 | |
265 | |
274 | /* I don't think this should really happen - if it does, it indicates and |
266 | /* I don't think this should really happen - if it does, it indicates and |
275 | * overflow of diff above. That shoudl only happen if |
267 | * overflow of diff above. That should only happen if |
276 | * we are selling objects - in that case, the person just |
268 | * we are selling objects - in that case, the person just |
277 | * gets no money. |
269 | * gets no money. |
278 | */ |
270 | */ |
279 | if ((sint64) val < 0) |
271 | if ((sint64) val < 0) |
280 | val = 0; |
272 | val = 0; |
… | |
… | |
308 | if (QUERY_FLAG (tmp, FLAG_PLAYER_SOLD)) |
300 | if (QUERY_FLAG (tmp, FLAG_PLAYER_SOLD)) |
309 | val = (val * shop_greed (who->map) * shop_specialisation_ratio (tmp, who->map) / shopkeeper_approval (who->map, who)); |
301 | val = (val * shop_greed (who->map) * shop_specialisation_ratio (tmp, who->map) / shopkeeper_approval (who->map, who)); |
310 | else |
302 | else |
311 | val = (val * shop_greed (who->map) / (shop_specialisation_ratio (tmp, who->map) * shopkeeper_approval (who->map, who))); |
303 | val = (val * shop_greed (who->map) / (shop_specialisation_ratio (tmp, who->map) * shopkeeper_approval (who->map, who))); |
312 | } |
304 | } |
|
|
305 | |
313 | /* we will also have an extra 0-5% variation between shops of the same type |
306 | /* we will also have an extra 0-5% variation between shops of the same type |
314 | * for valuable items (below a value of 50 this effect wouldn't be very |
307 | * for valuable items (below a value of 50 this effect wouldn't be very |
315 | * pointful, and could give fun with rounding. |
308 | * pointful, and could give fun with rounding. |
316 | */ |
309 | */ |
317 | if (who->map->path != NULL && val > 50) |
310 | //TODO: why use cosf at all, just % and scale linearly, gives more even distribution |
318 | val = (val + 0.05 * (sint64) val * cos (tmp->count + strlen (who->map->path))); |
311 | if (val > 50) |
|
|
312 | val += float (val) * .05f * cosf ((tmp->uuid.seq & 0xffff) * float (M_PI * 2. / 0x10000)); |
319 | } |
313 | } |
|
|
314 | |
320 | return (uint64) val; |
315 | return (sint64) val; |
321 | } |
316 | } |
322 | |
317 | |
323 | /* Find the coin type that is worth more the 'c'. Starts at the |
318 | /* Find the coin type that is worth more the 'c'. Starts at the |
324 | * cointype placement. |
319 | * cointype placement. |
325 | */ |
320 | */ |
326 | |
321 | |
327 | static archetype * |
322 | static archetype * |
328 | find_next_coin (uint64 c, int *cointype) |
323 | find_next_coin (sint64 c, int *cointype) |
329 | { |
324 | { |
330 | archetype *coin; |
325 | archetype *coin; |
331 | |
326 | |
332 | do |
327 | do |
333 | { |
328 | { |
334 | if (coins[*cointype] == NULL) |
329 | if (coins[*cointype] == NULL) |
335 | return NULL; |
330 | return NULL; |
336 | coin = find_archetype (coins[*cointype]); |
331 | coin = archetype::find (coins[*cointype]); |
337 | if (coin == NULL) |
332 | if (coin == NULL) |
338 | return NULL; |
333 | return NULL; |
339 | *cointype += 1; |
334 | *cointype += 1; |
340 | } |
335 | } |
341 | while ((uint64) coin->clone.value > c); |
336 | while (coin->value > c); |
342 | |
337 | |
343 | return coin; |
338 | return coin; |
344 | } |
339 | } |
345 | |
340 | |
346 | /* This returns a string of how much something is worth based on |
341 | /* This returns a string of how much something is worth based on |
… | |
… | |
352 | * coins, there are certainly issues - the easiest fix at that |
347 | * coins, there are certainly issues - the easiest fix at that |
353 | * time is to add a higher denomination (mithril piece with |
348 | * time is to add a higher denomination (mithril piece with |
354 | * 10,000 silver or something) |
349 | * 10,000 silver or something) |
355 | */ |
350 | */ |
356 | const char * |
351 | const char * |
357 | cost_string_from_value (uint64 cost, int approx) |
352 | cost_string_from_value (sint64 cost, int approx) |
358 | { |
353 | { |
359 | static char buf[MAX_BUF]; |
354 | static char buf[MAX_BUF]; |
360 | archetype *coin, *next_coin; |
355 | archetype *coin, *next_coin; |
361 | int num, cointype = 0; |
356 | int num, cointype = 0; |
362 | |
357 | |
363 | coin = find_next_coin (cost, &cointype); |
358 | coin = find_next_coin (cost, &cointype); |
364 | if (coin == NULL) |
359 | if (coin == NULL) |
365 | return "nothing"; |
360 | return "nothing"; |
366 | |
361 | |
367 | num = cost / coin->clone.value; |
362 | num = cost / coin->value; |
368 | /* so long as nrof is 32 bit, this is true. |
363 | /* so long as nrof is 32 bit, this is true. |
369 | * If it takes more coins than a person can possibly carry, this |
364 | * If it takes more coins than a person can possibly carry, this |
370 | * is basically true. |
365 | * is basically true. |
371 | */ |
366 | */ |
372 | if ((cost / coin->clone.value) > UINT32_MAX) |
367 | if ((cost / coin->value) > UINT32_MAX) |
373 | { |
368 | { |
374 | strcpy (buf, "an unimaginable sum of money"); |
369 | strcpy (buf, "an unimaginable sum of money"); |
375 | return buf; |
370 | return buf; |
376 | } |
371 | } |
377 | |
372 | |
378 | cost -= (uint64) num *(uint64) coin->clone.value; |
373 | cost -= num * (sint64)coin->value; |
379 | |
374 | |
380 | sprintf (buf, "%d %s", num, num > 1 ? &coin->clone.name_pl : &coin->clone.name); |
375 | sprintf (buf, "%d %s", num, num > 1 ? &coin->object::name_pl : &coin->object::name); |
381 | |
376 | |
382 | next_coin = find_next_coin (cost, &cointype); |
377 | next_coin = find_next_coin (cost, &cointype); |
383 | if (next_coin == NULL || approx) |
378 | if (next_coin == NULL || approx) |
384 | return buf; |
379 | return buf; |
385 | |
380 | |
386 | coin = next_coin; |
381 | coin = next_coin; |
387 | num = cost / coin->clone.value; |
382 | num = cost / coin->value; |
388 | cost -= (uint64) num *(uint64) coin->clone.value; |
383 | cost -= num * (sint64)coin->value; |
389 | |
384 | |
390 | sprintf (buf + strlen (buf), " and %d %s", num, num > 1 ? &coin->clone.name_pl : &coin->clone.name); |
385 | sprintf (buf + strlen (buf), " and %d %s", num, num > 1 ? &coin->object::name_pl : &coin->object::name); |
391 | |
386 | |
392 | return buf; |
387 | return buf; |
393 | } |
388 | } |
394 | |
389 | |
395 | const char * |
390 | const char * |
396 | query_cost_string (const object *tmp, object *who, int flag) |
391 | query_cost_string (const object *tmp, object *who, int flag) |
397 | { |
392 | { |
398 | uint64 real_value = query_cost (tmp, who, flag); |
393 | sint64 real_value = query_cost (tmp, who, flag); |
399 | int idskill1 = 0; |
394 | int idskill1 = 0; |
400 | int idskill2 = 0; |
395 | int idskill2 = 0; |
401 | const typedata *tmptype; |
396 | const typedata *tmptype; |
402 | |
397 | |
403 | tmptype = get_typedata (tmp->type); |
398 | tmptype = get_typedata (tmp->type); |
… | |
… | |
425 | archetype *coin = find_next_coin (real_value, &cointype); |
420 | archetype *coin = find_next_coin (real_value, &cointype); |
426 | |
421 | |
427 | if (coin == NULL) |
422 | if (coin == NULL) |
428 | return "nothing"; |
423 | return "nothing"; |
429 | |
424 | |
430 | num = real_value / coin->clone.value; |
425 | num = real_value / coin->value; |
431 | if (num == 1) |
426 | if (num == 1) |
432 | sprintf (buf, "about one %s", &coin->clone.name); |
427 | sprintf (buf, "about one %s", &coin->object::name); |
433 | else if (num < 5) |
428 | else if (num < 5) |
434 | sprintf (buf, "a few %s", &coin->clone.name_pl); |
429 | sprintf (buf, "a few %s", &coin->object::name_pl); |
435 | else if (num < 10) |
430 | else if (num < 10) |
436 | sprintf (buf, "several %s", &coin->clone.name_pl); |
431 | sprintf (buf, "several %s", &coin->object::name_pl); |
437 | else if (num < 25) |
432 | else if (num < 25) |
438 | sprintf (buf, "a moderate amount of %s", &coin->clone.name_pl); |
433 | sprintf (buf, "a moderate amount of %s", &coin->object::name_pl); |
439 | else if (num < 100) |
434 | else if (num < 100) |
440 | sprintf (buf, "lots of %s", &coin->clone.name_pl); |
435 | sprintf (buf, "lots of %s", &coin->object::name_pl); |
441 | else if (num < 1000) |
436 | else if (num < 1000) |
442 | sprintf (buf, "a great many %s", &coin->clone.name_pl); |
437 | sprintf (buf, "a great many %s", &coin->object::name_pl); |
443 | else |
438 | else |
444 | sprintf (buf, "a vast quantity of %s", &coin->clone.name_pl); |
439 | sprintf (buf, "a vast quantity of %s", &coin->object::name_pl); |
445 | return buf; |
440 | return buf; |
446 | } |
441 | } |
447 | } |
442 | } |
448 | } |
443 | } |
449 | |
444 | |
450 | int hash = ((unsigned int) tmp->count * 174364621) & 1023; |
445 | int hash = ((unsigned int) tmp->count * 174364621) & 1023; |
451 | |
446 | |
452 | if (approx_range) |
447 | if (approx_range) |
453 | { |
448 | { |
454 | uint64 lo = (sint64) real_value - (approx_range * hash >> 10); |
449 | sint64 lo = (sint64) real_value - (approx_range * hash >> 10); |
455 | static char buf[MAX_BUF]; |
450 | static char buf[MAX_BUF]; |
456 | |
451 | |
457 | sprintf (buf, "between %s", cost_string_from_value (lo, 1)); |
452 | sprintf (buf, "between %s", cost_string_from_value (lo, 1)); |
458 | sprintf (buf + strlen (buf), " and %s", cost_string_from_value (lo + approx_range, 1)); |
453 | sprintf (buf + strlen (buf), " and %s", cost_string_from_value (lo + approx_range, 1)); |
459 | |
454 | |
… | |
… | |
465 | } |
460 | } |
466 | |
461 | |
467 | /* This function finds out how much money the player is carrying, |
462 | /* This function finds out how much money the player is carrying, |
468 | * including what is in containers. |
463 | * including what is in containers. |
469 | */ |
464 | */ |
470 | uint64 |
465 | sint64 |
471 | query_money (const object *op) |
466 | query_money (const object *op) |
472 | { |
467 | { |
473 | object *tmp; |
468 | object *tmp; |
474 | uint64 total = 0; |
469 | sint64 total = 0; |
475 | |
470 | |
476 | if (op->type != PLAYER && op->type != CONTAINER) |
471 | if (op->type != PLAYER && op->type != CONTAINER) |
477 | { |
472 | { |
478 | LOG (llevError, "Query money called with non player/container\n"); |
473 | LOG (llevError, "Query money called with non player/container\n"); |
479 | return 0; |
474 | return 0; |
480 | } |
475 | } |
|
|
476 | |
481 | for (tmp = op->inv; tmp; tmp = tmp->below) |
477 | for (tmp = op->inv; tmp; tmp = tmp->below) |
482 | { |
|
|
483 | if (tmp->type == MONEY) |
478 | if (tmp->type == MONEY) |
484 | { |
|
|
485 | total += (uint64) tmp->nrof * (uint64) tmp->value; |
479 | total += tmp->nrof * (sint64)tmp->value; |
486 | } |
|
|
487 | else if (tmp->type == CONTAINER && QUERY_FLAG (tmp, FLAG_APPLIED) && (tmp->race == NULL || strstr (tmp->race, "gold"))) |
480 | else if (tmp->type == CONTAINER && QUERY_FLAG (tmp, FLAG_APPLIED) && (tmp->race == NULL || strstr (tmp->race, "gold"))) |
488 | { |
|
|
489 | total += query_money (tmp); |
481 | total += query_money (tmp); |
490 | } |
482 | |
491 | } |
|
|
492 | return total; |
483 | return total; |
493 | } |
484 | } |
494 | |
485 | |
495 | /* TCHIZE: This function takes the amount of money from the |
486 | /* TCHIZE: This function takes the amount of money from the |
496 | * the player inventory and from it's various pouches using the |
487 | * the player inventory and from it's various pouches using the |
497 | * pay_from_container function. |
488 | * pay_from_container function. |
498 | * returns 0 if not possible. 1 if success |
489 | * returns 0 if not possible. 1 if success |
499 | */ |
490 | */ |
500 | int |
491 | int |
501 | pay_for_amount (uint64 to_pay, object *pl) |
492 | pay_for_amount (sint64 to_pay, object *pl) |
502 | { |
493 | { |
503 | object *pouch; |
494 | object *pouch; |
504 | |
495 | |
505 | if (to_pay == 0) |
496 | if (to_pay == 0) |
506 | return 1; |
497 | return 1; |
|
|
498 | |
507 | if (to_pay > query_money (pl)) |
499 | if (to_pay > query_money (pl)) |
508 | return 0; |
500 | return 0; |
509 | |
501 | |
510 | to_pay = pay_from_container (pl, pl, to_pay); |
502 | pay_from_container (pl, pl, to_pay); |
511 | |
503 | |
512 | for (pouch = pl->inv; (pouch != NULL) && (to_pay > 0); pouch = pouch->below) |
504 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
513 | { |
|
|
514 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && (pouch->race == NULL || strstr (pouch->race, "gold"))) |
505 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && (pouch->race == NULL || strstr (pouch->race, "gold"))) |
515 | { |
|
|
516 | to_pay = pay_from_container (pl, pouch, to_pay); |
506 | pay_from_container (pl, pouch, to_pay); |
517 | } |
507 | |
518 | } |
508 | pl->update_stats (); |
519 | fix_player (pl); |
|
|
520 | return 1; |
509 | return 1; |
521 | } |
510 | } |
522 | |
511 | |
523 | /* DAMN: This is now a wrapper for pay_from_container, which is |
512 | /* DAMN: This is now a wrapper for pay_from_container, which is |
524 | * called for the player, then for each active container that can hold |
513 | * called for the player, then for each active container that can hold |
… | |
… | |
526 | * of the price was paid from. |
515 | * of the price was paid from. |
527 | */ |
516 | */ |
528 | int |
517 | int |
529 | pay_for_item (object *op, object *pl) |
518 | pay_for_item (object *op, object *pl) |
530 | { |
519 | { |
531 | uint64 to_pay = query_cost (op, pl, F_BUY | F_SHOP); |
520 | sint64 to_pay = query_cost (op, pl, F_BUY | F_SHOP); |
532 | object *pouch; |
521 | object *pouch; |
533 | uint64 saved_money; |
522 | sint64 saved_money; |
534 | |
523 | |
535 | if (to_pay == 0) |
524 | if (to_pay == 0) |
536 | return 1; |
525 | return 1; |
|
|
526 | |
537 | if (to_pay > query_money (pl)) |
527 | if (to_pay > query_money (pl)) |
538 | return 0; |
528 | return 0; |
539 | |
529 | |
540 | /* We compare the paid price with the one for a player |
530 | /* We compare the paid price with the one for a player |
541 | * without bargaining skill. |
531 | * without bargaining skill. |
… | |
… | |
544 | saved_money = query_cost (op, pl, F_BUY | F_NO_BARGAIN | F_SHOP) - to_pay; |
534 | saved_money = query_cost (op, pl, F_BUY | F_NO_BARGAIN | F_SHOP) - to_pay; |
545 | |
535 | |
546 | if (saved_money > 0) |
536 | if (saved_money > 0) |
547 | change_exp (pl, saved_money, "bargaining", SK_EXP_NONE); |
537 | change_exp (pl, saved_money, "bargaining", SK_EXP_NONE); |
548 | |
538 | |
549 | to_pay = pay_from_container (pl, pl, to_pay); |
539 | pay_from_container (pl, pl, to_pay); |
550 | |
540 | |
551 | for (pouch = pl->inv; (pouch != NULL) && (to_pay > 0); pouch = pouch->below) |
541 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
552 | { |
|
|
553 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && (pouch->race == NULL || strstr (pouch->race, "gold"))) |
542 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && (pouch->race == NULL || strstr (pouch->race, "gold"))) |
554 | { |
|
|
555 | to_pay = pay_from_container (pl, pouch, to_pay); |
543 | pay_from_container (pl, pouch, to_pay); |
556 | } |
544 | |
557 | } |
545 | pl->update_stats (); |
558 | if (settings.real_wiz == FALSE && QUERY_FLAG (pl, FLAG_WAS_WIZ)) |
546 | |
559 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
560 | fix_player (pl); |
|
|
561 | return 1; |
547 | return 1; |
562 | } |
548 | } |
563 | |
549 | |
564 | /* This pays for the item, and takes the proper amount of money off |
550 | /* This pays for the item, and takes the proper amount of money off |
565 | * the player. |
551 | * the player. |
… | |
… | |
573 | * |
559 | * |
574 | * pouch is the container (pouch or player) to remove the coins from. |
560 | * pouch is the container (pouch or player) to remove the coins from. |
575 | * to_pay is the required amount. |
561 | * to_pay is the required amount. |
576 | * returns the amount still missing after using "pouch". |
562 | * returns the amount still missing after using "pouch". |
577 | */ |
563 | */ |
578 | static uint64 |
564 | static void |
579 | pay_from_container (object *pl, object *pouch, uint64 to_pay) |
565 | pay_from_container (object *pl, object *pouch, sint64 &to_pay) |
580 | { |
566 | { |
581 | int count, i; |
567 | int count, i; |
582 | uint64 remain; |
568 | object *tmp, *next; |
583 | object *tmp, *coin_objs[NUM_COINS], *next; |
|
|
584 | archetype *at; |
569 | archetype *at; |
585 | |
570 | |
586 | if (pouch->type != PLAYER && pouch->type != CONTAINER) |
571 | if (pouch->type != PLAYER && pouch->type != CONTAINER) |
587 | return to_pay; |
572 | return; |
588 | |
573 | |
589 | remain = to_pay; |
574 | object *coin_objs[NUM_COINS] = { 0 }; |
590 | for (i = 0; i < NUM_COINS; i++) |
|
|
591 | coin_objs[i] = NULL; |
|
|
592 | |
575 | |
593 | /* This hunk should remove all the money objects from the player/container */ |
576 | /* This hunk should remove all the money objects from the player/container */ |
594 | for (tmp = pouch->inv; tmp; tmp = next) |
577 | for (tmp = pouch->inv; tmp; tmp = next) |
595 | { |
578 | { |
596 | next = tmp->below; |
579 | next = tmp->below; |
597 | |
580 | |
598 | if (tmp->type == MONEY) |
581 | if (tmp->type == MONEY) |
599 | { |
582 | { |
600 | for (i = 0; i < NUM_COINS; i++) |
583 | for (i = 0; i < NUM_COINS; i++) |
601 | { |
584 | { |
602 | if (!strcmp (coins[NUM_COINS - 1 - i], tmp->arch->name) && (tmp->value == tmp->arch->clone.value)) |
585 | if (tmp->value == tmp->arch->value && !strcmp (coins[NUM_COINS - 1 - i], tmp->arch->archname)) |
603 | { |
586 | { |
604 | |
|
|
605 | /* This should not happen, but if it does, just * |
587 | // This should not happen, but if it does, just merge the two. |
606 | * merge the two. */ |
|
|
607 | if (coin_objs[i] != NULL) |
588 | if (coin_objs [i]) |
608 | { |
589 | { |
609 | LOG (llevError, "%s has two money entries of (%s)\n", &pouch->name, coins[NUM_COINS - 1 - i]); |
590 | LOG (llevError, "%s has two money entries of (%s)\n", &pouch->name, coins[NUM_COINS - 1 - i]); |
610 | remove_ob (tmp); |
591 | tmp->remove (); |
611 | coin_objs[i]->nrof += tmp->nrof; |
592 | coin_objs[i]->nrof += tmp->nrof; |
612 | esrv_del_item (pl->contr, tmp->count); |
593 | esrv_del_item (pl->contr, tmp->count); |
613 | free_object (tmp); |
594 | tmp->destroy (); |
614 | } |
595 | } |
615 | else |
596 | else |
616 | { |
597 | { |
617 | remove_ob (tmp); |
598 | tmp->remove (); |
|
|
599 | |
618 | if (pouch->type == PLAYER) |
600 | if (pouch->type == PLAYER) |
619 | esrv_del_item (pl->contr, tmp->count); |
601 | esrv_del_item (pl->contr, tmp->count); |
|
|
602 | |
620 | coin_objs[i] = tmp; |
603 | coin_objs[i] = tmp; |
621 | } |
604 | } |
|
|
605 | |
622 | break; |
606 | break; |
623 | } |
607 | } |
624 | } |
608 | } |
|
|
609 | |
625 | if (i == NUM_COINS) |
610 | if (i == NUM_COINS) |
626 | LOG (llevError, "in pay_for_item: Did not find string match for %s\n", &tmp->arch->name); |
611 | LOG (llevError, "in pay_for_item: Did not find string match for %s\n", &tmp->arch->archname); |
627 | } |
612 | } |
628 | } |
613 | } |
629 | |
614 | |
630 | /* Fill in any gaps in the coin_objs array - needed to make change. */ |
615 | /* Fill in any gaps in the coin_objs array - needed to make change. */ |
631 | /* Note that the coin_objs array goes from least value to greatest value */ |
616 | /* Note that the coin_objs array goes from least value to greatest value */ |
632 | for (i = 0; i < NUM_COINS; i++) |
617 | for (i = 0; i < NUM_COINS; i++) |
633 | if (coin_objs[i] == NULL) |
618 | if (!coin_objs[i]) |
634 | { |
619 | { |
635 | at = find_archetype (coins[NUM_COINS - 1 - i]); |
620 | at = archetype::find (coins[NUM_COINS - 1 - i]); |
|
|
621 | |
636 | if (at == NULL) |
622 | if (at == NULL) |
637 | LOG (llevError, "Could not find %s archetype\n", coins[NUM_COINS - 1 - i]); |
623 | LOG (llevError, "Could not find %s archetype\n", coins[NUM_COINS - 1 - i]); |
|
|
624 | |
638 | coin_objs[i] = arch_to_object (at); |
625 | coin_objs[i] = arch_to_object (at); |
639 | coin_objs[i]->nrof = 0; |
626 | coin_objs[i]->nrof = 0; |
640 | } |
627 | } |
641 | |
628 | |
642 | for (i = 0; i < NUM_COINS; i++) |
629 | for (i = 0; i < NUM_COINS; i++) |
643 | { |
630 | { |
644 | int num_coins; |
631 | object &coin = *coin_objs[i]; |
|
|
632 | sint64 num_coins = min ((to_pay + coin.value - 1) / coin.value, coin.nrof); |
|
|
633 | to_pay -= num_coins * coin.value; |
645 | |
634 | |
646 | if (coin_objs[i]->nrof * coin_objs[i]->value > remain) |
|
|
647 | { |
|
|
648 | num_coins = remain / coin_objs[i]->value; |
|
|
649 | if ((uint64) num_coins * (uint64) coin_objs[i]->value < remain) |
|
|
650 | num_coins++; |
|
|
651 | } |
|
|
652 | else |
|
|
653 | { |
|
|
654 | num_coins = coin_objs[i]->nrof; |
|
|
655 | } |
|
|
656 | remain -= (sint64) num_coins *(sint64) coin_objs[i]->value; |
|
|
657 | |
|
|
658 | coin_objs[i]->nrof -= num_coins; |
635 | coin.nrof -= num_coins; |
659 | /* Now start making change. Start at the coin value |
636 | /* Now start making change. Start at the coin value |
660 | * below the one we just did, and work down to |
637 | * below the one we just did, and work down to |
661 | * the lowest value. |
638 | * the lowest value. |
662 | */ |
639 | */ |
663 | count = i - 1; |
640 | count = i - 1; |
|
|
641 | |
664 | while (remain < 0 && count >= 0) |
642 | while (to_pay < 0 && count >= 0) |
665 | { |
643 | { |
666 | num_coins = -remain / coin_objs[count]->value; |
644 | num_coins = (-to_pay) / coin_objs[count]->value; |
667 | coin_objs[count]->nrof += num_coins; |
645 | coin_objs[count]->nrof += num_coins; |
668 | remain += num_coins * coin_objs[count]->value; |
646 | to_pay += num_coins * coin_objs[count]->value; |
669 | count--; |
647 | count--; |
670 | } |
648 | } |
671 | } |
649 | } |
|
|
650 | |
672 | for (i = 0; i < NUM_COINS; i++) |
651 | for (i = 0; i < NUM_COINS; i++) |
673 | { |
652 | { |
674 | if (coin_objs[i]->nrof) |
653 | if (coin_objs[i]->nrof) |
675 | { |
654 | { |
676 | object *tmp = insert_ob_in_ob (coin_objs[i], pouch); |
655 | object *tmp = insert_ob_in_ob (coin_objs[i], pouch); |
677 | |
656 | |
678 | esrv_send_item (pl, tmp); |
657 | esrv_send_item (pl, tmp); |
679 | esrv_send_item (pl, pouch); |
658 | esrv_send_item (pl, pouch); |
|
|
659 | |
680 | if (pl != pouch) |
660 | if (pl != pouch) |
681 | esrv_update_item (UPD_WEIGHT, pl, pouch); |
661 | esrv_update_item (UPD_WEIGHT, pl, pouch); |
|
|
662 | |
682 | if (pl->type != PLAYER) |
663 | if (pl->type != PLAYER) |
683 | { |
|
|
684 | esrv_send_item (pl, pl); |
664 | esrv_send_item (pl, pl); |
685 | } |
|
|
686 | } |
665 | } |
687 | else |
666 | else |
688 | { |
667 | coin_objs[i]->destroy (); |
689 | free_object (coin_objs[i]); |
|
|
690 | } |
|
|
691 | } |
668 | } |
692 | return (remain); |
|
|
693 | } |
669 | } |
694 | |
670 | |
695 | /* Checks all unpaid items in op's inventory, adds up all the money they |
671 | /* Checks all unpaid items in op's inventory, adds up all the money they |
696 | * have, and checks that they can actually afford what they want to buy. |
672 | * have, and checks that they can actually afford what they want to buy. |
697 | * Returns 1 if they can, and 0 if they can't. also prints an appropriate message |
673 | * Returns 1 if they can, and 0 if they can't. also prints an appropriate message |
698 | * to the player |
674 | * to the player |
699 | */ |
675 | */ |
700 | |
|
|
701 | int |
676 | int |
702 | can_pay (object *pl) |
677 | can_pay (object *pl) |
703 | { |
678 | { |
704 | int unpaid_count = 0, i; |
679 | int unpaid_count = 0; |
705 | uint64 unpaid_price = 0; |
680 | sint64 unpaid_price = 0; |
706 | uint64 player_wealth = query_money (pl); |
681 | sint64 player_wealth = query_money (pl); |
707 | object *item; |
|
|
708 | uint32 coincount[NUM_COINS]; |
|
|
709 | |
682 | |
710 | if (!pl || pl->type != PLAYER) |
683 | if (!pl || pl->type != PLAYER) |
711 | { |
684 | { |
712 | LOG (llevError, "can_pay(): called against something that isn't a player\n"); |
685 | LOG (llevError, "can_pay(): called against something that isn't a player\n"); |
713 | return 0; |
686 | return 0; |
714 | } |
687 | } |
715 | for (i = 0; i < NUM_COINS; i++) |
688 | |
716 | coincount[i] = 0; |
689 | for (object::depth_iterator item = pl->begin (); item != pl->end (); ++item) |
717 | for (item = pl->inv; item;) |
690 | if (QUERY_FLAG (item, FLAG_UNPAID)) |
718 | { |
|
|
719 | if QUERY_FLAG |
|
|
720 | (item, FLAG_UNPAID) |
|
|
721 | { |
691 | { |
722 | unpaid_count++; |
692 | unpaid_count++; |
723 | unpaid_price += query_cost (item, pl, F_BUY | F_SHOP); |
693 | unpaid_price += query_cost (item, pl, F_BUY | F_SHOP); |
724 | } |
694 | } |
725 | /* merely converting the player's monetary wealth won't do, if we did that, |
695 | |
726 | * we could print the wrong numbers for the coins, so we count the money instead |
|
|
727 | */ |
|
|
728 | for (i = 0; i < NUM_COINS; i++) |
|
|
729 | if (!strcmp (coins[i], item->arch->name)) |
|
|
730 | coincount[i] += item->nrof; |
|
|
731 | if (item->inv) |
|
|
732 | item = item->inv; |
|
|
733 | else if (item->below) |
|
|
734 | item = item->below; |
|
|
735 | else if (item->env && item->env != pl && item->env->below) |
|
|
736 | item = item->env->below; |
|
|
737 | else |
|
|
738 | item = NULL; |
|
|
739 | } |
|
|
740 | if (unpaid_price > player_wealth) |
696 | if (unpaid_price > player_wealth) |
741 | { |
697 | { |
742 | char buf[MAX_BUF]; |
698 | char buf[MAX_BUF]; |
743 | char cost[MAX_BUF]; |
699 | char cost[MAX_BUF]; |
744 | char missing[MAX_BUF]; |
700 | char missing[MAX_BUF]; |
745 | |
701 | |
746 | sprintf (cost, "%s", cost_string_from_value (unpaid_price, 0)); |
702 | snprintf (cost, MAX_BUF, "%s", cost_string_from_value (unpaid_price, 0)); |
747 | sprintf (missing, "%s", cost_string_from_value (unpaid_price - player_wealth, 0)); |
703 | snprintf (missing, MAX_BUF, "%s", cost_string_from_value (unpaid_price - player_wealth, 0)); |
748 | |
704 | |
749 | sprintf (buf, "You have %d unpaid items that would cost you %s. You need another %s to be able to afford that.", |
705 | snprintf (buf, MAX_BUF, "You have %d unpaid items that would cost you %s. You need another %s to be able to afford that.", |
750 | unpaid_count, cost, missing); |
706 | unpaid_count, cost, missing); |
751 | new_draw_info (NDI_UNIQUE, 0, pl, buf); |
707 | new_draw_info (NDI_UNIQUE, 0, pl, buf); |
|
|
708 | |
752 | return 0; |
709 | return 0; |
753 | } |
710 | } |
754 | else |
711 | else |
755 | return 1; |
712 | return 1; |
756 | } |
713 | } |
757 | |
|
|
758 | |
714 | |
759 | /* Better get_payment, descends containers looking for |
715 | /* Better get_payment, descends containers looking for |
760 | * unpaid items, and pays for them. |
716 | * unpaid items, and pays for them. |
761 | * returns 0 if the player still has unpaid items. |
717 | * returns 0 if the player still has unpaid items. |
762 | * returns 1 if the player has paid for everything. |
718 | * returns 1 if the player has paid for everything. |
763 | * pl is the player buying the stuff. |
719 | * pl is the player buying the stuff. |
764 | * op is the object we are examining. If op has |
|
|
765 | * and inventory, we examine that. IF there are objects |
|
|
766 | * below op, we descend down. |
|
|
767 | */ |
720 | */ |
768 | int |
721 | int |
769 | get_payment (object *pl, object *op) |
722 | get_payment (object *pl) |
770 | { |
723 | { |
771 | char buf[MAX_BUF]; |
724 | for (;;) |
772 | int ret = 1; |
|
|
773 | |
|
|
774 | if (op != NULL && op->inv) |
|
|
775 | ret = get_payment (pl, op->inv); |
|
|
776 | |
|
|
777 | if (!ret) |
|
|
778 | return 0; |
|
|
779 | |
|
|
780 | if (op != NULL && op->below) |
|
|
781 | ret = get_payment (pl, op->below); |
|
|
782 | |
|
|
783 | if (!ret) |
|
|
784 | return 0; |
|
|
785 | |
|
|
786 | if (op != NULL && QUERY_FLAG (op, FLAG_UNPAID)) |
|
|
787 | { |
725 | { |
788 | strncpy (buf, query_cost_string (op, pl, F_BUY | F_SHOP), MAX_BUF); |
726 | next_item: |
789 | buf[MAX_BUF - 1] = '\0'; |
|
|
790 | if (!pay_for_item (op, pl)) |
|
|
791 | { |
|
|
792 | uint64 i = query_cost (op, pl, F_BUY | F_SHOP) - query_money (pl); |
|
|
793 | |
727 | |
794 | CLEAR_FLAG (op, FLAG_UNPAID); |
728 | for (object::depth_iterator op = pl->begin (); op != pl->end (); ++op) |
795 | new_draw_info_format (NDI_UNIQUE, 0, pl, "You lack %s to buy %s.", cost_string_from_value (i, 0), query_name (op)); |
|
|
796 | SET_FLAG (op, FLAG_UNPAID); |
|
|
797 | return 0; |
|
|
798 | } |
729 | { |
799 | else |
|
|
800 | { |
|
|
801 | object *tmp; |
|
|
802 | tag_t c = op->count; |
|
|
803 | |
|
|
804 | CLEAR_FLAG (op, FLAG_UNPAID); |
730 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
805 | CLEAR_FLAG (op, FLAG_PLAYER_SOLD); |
|
|
806 | new_draw_info_format (NDI_UNIQUE, 0, op, "You paid %s for %s.", buf, query_name (op)); |
|
|
807 | tmp = merge_ob (op, NULL); |
|
|
808 | if (pl->type == PLAYER) |
|
|
809 | { |
731 | { |
810 | if (tmp) |
732 | char buf[MAX_BUF]; |
811 | { /* it was merged */ |
733 | snprintf (buf, MAX_BUF, "%s", query_cost_string (op, pl, F_BUY | F_SHOP)); |
812 | esrv_del_item (pl->contr, c); |
734 | |
813 | op = tmp; |
735 | if (!pay_for_item (op, pl)) |
|
|
736 | { |
|
|
737 | sint64 i = query_cost (op, pl, F_BUY | F_SHOP) - query_money (pl); |
|
|
738 | |
|
|
739 | CLEAR_FLAG (op, FLAG_UNPAID); |
|
|
740 | new_draw_info_format (NDI_UNIQUE, 0, pl, "You lack %s to buy %s.", cost_string_from_value (i, 0), query_name (op)); |
|
|
741 | SET_FLAG (op, FLAG_UNPAID); |
|
|
742 | return 0; |
814 | } |
743 | } |
|
|
744 | else |
|
|
745 | { |
|
|
746 | object *tmp; |
|
|
747 | |
|
|
748 | CLEAR_FLAG (op, FLAG_UNPAID); |
|
|
749 | CLEAR_FLAG (op, FLAG_PLAYER_SOLD); |
|
|
750 | new_draw_info_format (NDI_UNIQUE, 0, op, "You paid %s for %s.", buf, query_name (op)); |
|
|
751 | tmp = merge_ob (op, NULL); |
|
|
752 | |
|
|
753 | if (pl->type == PLAYER) |
|
|
754 | { |
|
|
755 | if (tmp) |
|
|
756 | { /* it was merged */ |
|
|
757 | esrv_del_item (pl->contr, op->count); |
|
|
758 | op = tmp; |
|
|
759 | } |
|
|
760 | |
815 | esrv_send_item (pl, op); |
761 | esrv_send_item (pl, op); |
|
|
762 | } |
|
|
763 | |
|
|
764 | goto next_item; |
|
|
765 | } |
816 | } |
766 | } |
817 | } |
767 | } |
818 | } |
768 | |
819 | return 1; |
769 | return 1; |
|
|
770 | } |
820 | } |
771 | } |
821 | |
772 | |
822 | /* written by elmex: |
773 | /* written by elmex: |
823 | * moved this code from sell_item () here to have a function |
774 | * moved this code from sell_item () here to have a function |
824 | * that pays the player an amount. Mainly put the code here to |
775 | * that pays the player an amount. Mainly put the code here to |
… | |
… | |
829 | * or put it on the ground under the player. This way the player can still |
780 | * or put it on the ground under the player. This way the player can still |
830 | * go somewhere and unload the money at a safe place. |
781 | * go somewhere and unload the money at a safe place. |
831 | * |
782 | * |
832 | */ |
783 | */ |
833 | void |
784 | void |
834 | pay_player (object *pl, uint64 amount) |
785 | pay_player (object *pl, sint64 amount) |
835 | { |
786 | { |
836 | int count = 0; |
787 | int count = 0; |
837 | archetype *at = 0; |
788 | archetype *at = 0; |
838 | object *pouch = 0, *tmp = 0; |
789 | object *pouch = 0, *tmp = 0; |
839 | |
790 | |
840 | for (count = 0; coins[count] != NULL; count++) |
791 | for (count = 0; coins[count] != NULL; count++) |
841 | { |
792 | { |
842 | at = find_archetype (coins[count]); |
793 | at = archetype::find (coins[count]); |
843 | |
794 | |
844 | if (at == NULL) |
795 | if (at == NULL) |
845 | LOG (llevError, "Could not find %s archetype\n", coins[count]); |
796 | LOG (llevError, "Could not find %s archetype\n", coins[count]); |
846 | else if ((amount / at->clone.value) > 0) |
797 | else if ((amount / at->value) > 0) |
847 | { |
798 | { |
848 | for (pouch = pl->inv; pouch; pouch = pouch->below) |
799 | for (pouch = pl->inv; pouch; pouch = pouch->below) |
849 | { |
800 | { |
850 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && pouch->race && strstr (pouch->race, "gold")) |
801 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && pouch->race && strstr (pouch->race, "gold")) |
851 | { |
802 | { |
852 | int w = at->clone.weight * (100 - pouch->stats.Str) / 100; |
803 | int w = at->weight * (100 - pouch->stats.Str) / 100; |
853 | int n = amount / at->clone.value; |
804 | int n = amount / at->value; |
854 | |
805 | |
855 | if (w == 0) |
806 | if (w == 0) |
856 | w = 1; /* Prevent divide by zero */ |
807 | w = 1; /* Prevent divide by zero */ |
857 | |
808 | |
858 | if (n > 0 && (!pouch->weight_limit || pouch->carrying + w <= pouch->weight_limit)) |
809 | if (n > 0 && (!pouch->weight_limit || pouch->carrying + w <= pouch->weight_limit)) |
… | |
… | |
860 | if (pouch->weight_limit && (pouch->weight_limit - pouch->carrying) / w < n) |
811 | if (pouch->weight_limit && (pouch->weight_limit - pouch->carrying) / w < n) |
861 | n = (pouch->weight_limit - pouch->carrying) / w; |
812 | n = (pouch->weight_limit - pouch->carrying) / w; |
862 | |
813 | |
863 | tmp = arch_to_object (at); |
814 | tmp = arch_to_object (at); |
864 | tmp->nrof = n; |
815 | tmp->nrof = n; |
865 | amount -= (uint64) tmp->nrof * (uint64) tmp->value; |
816 | amount -= tmp->nrof * tmp->value; |
866 | tmp = insert_ob_in_ob (tmp, pouch); |
817 | tmp = insert_ob_in_ob (tmp, pouch); |
867 | esrv_send_item (pl, tmp); |
818 | esrv_send_item (pl, tmp); |
868 | esrv_send_item (pl, pouch); |
819 | esrv_send_item (pl, pouch); |
869 | esrv_update_item (UPD_WEIGHT, pl, pouch); |
820 | esrv_update_item (UPD_WEIGHT, pl, pouch); |
870 | esrv_send_item (pl, pl); |
821 | esrv_send_item (pl, pl); |
871 | } |
822 | } |
872 | } |
823 | } |
873 | } |
824 | } |
874 | |
825 | |
875 | if (amount / at->clone.value > 0) |
826 | if (amount / at->value > 0) |
876 | { |
827 | { |
877 | tmp = arch_to_object (at); |
828 | tmp = arch_to_object (at); |
878 | tmp->nrof = amount / tmp->value; |
829 | tmp->nrof = amount / tmp->value; |
879 | amount -= (uint64) tmp->nrof * (uint64) tmp->value; |
830 | amount -= tmp->nrof * tmp->value; |
880 | tmp = insert_ob_in_ob (tmp, pl); |
831 | tmp = insert_ob_in_ob (tmp, pl); |
881 | esrv_send_item (pl, tmp); |
832 | esrv_send_item (pl, tmp); |
882 | esrv_send_item (pl, pl); |
833 | esrv_send_item (pl, pl); |
883 | } |
834 | } |
884 | } |
835 | } |
885 | } |
836 | } |
886 | |
837 | |
887 | if (amount != 0) |
838 | if (amount != 0) |
888 | #ifndef WIN32 |
|
|
889 | LOG (llevError, "Warning - payment in pay_player () not zero: %llu\n", amount); |
839 | LOG (llevError, "Warning - payment in pay_player () not zero: %llu\n", amount); |
890 | #else |
|
|
891 | LOG (llevError, "Warning - payment in pay_player () not zero: %I64u\n", amount); |
|
|
892 | #endif |
|
|
893 | } |
840 | } |
894 | |
841 | |
895 | /* elmex: this is for the bank plugin :( */ |
842 | /* elmex: this is for the bank plugin :( */ |
896 | uint64 |
843 | sint64 |
897 | pay_player_arch (object *pl, const char *arch, uint64 amount) |
844 | pay_player_arch (object *pl, const char *arch, sint64 amount) |
898 | { |
845 | { |
899 | archetype *at = find_archetype (arch); |
846 | archetype *at = archetype::find (arch); |
900 | object *tmp = NULL; |
847 | object *tmp = NULL; |
901 | |
848 | |
902 | if (at == NULL) |
849 | if (at == NULL) |
903 | return 0; |
850 | return 0; |
904 | |
851 | |
… | |
… | |
922 | * remaining coins in character's inventory. |
869 | * remaining coins in character's inventory. |
923 | */ |
870 | */ |
924 | void |
871 | void |
925 | sell_item (object *op, object *pl) |
872 | sell_item (object *op, object *pl) |
926 | { |
873 | { |
927 | uint64 amount = query_cost (op, pl, F_SELL | F_SHOP), extra_gain; |
874 | sint64 amount = query_cost (op, pl, F_SELL | F_SHOP), extra_gain; |
928 | |
875 | |
929 | if (pl == NULL || pl->type != PLAYER) |
876 | if (pl == NULL || pl->type != PLAYER) |
930 | { |
877 | { |
931 | LOG (llevDebug, "Object other than player tried to sell something.\n"); |
878 | LOG (llevDebug, "Object other than player tried to sell something.\n"); |
932 | return; |
879 | return; |
… | |
… | |
970 | } |
917 | } |
971 | |
918 | |
972 | |
919 | |
973 | /* returns a double that is the ratio of the price that a shop will offer for |
920 | /* returns a double that is the ratio of the price that a shop will offer for |
974 | * item based on the shops specialisation. Does not take account of greed, |
921 | * item based on the shops specialisation. Does not take account of greed, |
975 | * returned value is between (2*SPECIALISATION_EFFECT-1) and 1 and in any |
922 | * returned value is between SPECIALISATION_EFFECT and 1. |
976 | * event is never less than 0.1 (calling functions divide by it) |
|
|
977 | */ |
923 | */ |
978 | static double |
924 | static double |
979 | shop_specialisation_ratio (const object *item, const mapstruct *map) |
925 | shop_specialisation_ratio (const object *item, const maptile *map) |
980 | { |
926 | { |
981 | shopitems *items = map->shopitems; |
927 | shopitems *items = map->shopitems; |
982 | double ratio = SPECIALISATION_EFFECT, likedness = 0.001; |
928 | double likedness = 0.; |
983 | int i; |
929 | int i; |
984 | |
930 | |
985 | if (item == NULL) |
931 | if (item == NULL) |
986 | { |
932 | { |
987 | LOG (llevError, "shop_specialisation_ratio: passed a NULL item for map %s\n", map->path); |
933 | LOG (llevError, "shop_specialisation_ratio: passed a NULL item for map %s\n", &map->path); |
988 | return 0; |
934 | return 0; |
989 | } |
935 | } |
|
|
936 | |
990 | if (!item->type) |
937 | if (!item->type) |
991 | { |
938 | { |
992 | LOG (llevError, "shop_specialisation_ratio: passed an item with an invalid type\n"); |
939 | LOG (llevError, "shop_specialisation_ratio: passed an item with an invalid type\n"); |
993 | /* |
940 | /* |
994 | * I'm not really sure what the /right/ thing to do here is, these types of |
941 | * I'm not really sure what the /right/ thing to do here is, these types of |
995 | * item shouldn't exist anyway, but returning the ratio is probably the best bet.." |
942 | * item shouldn't exist anyway, but returning the ratio is probably the best bet.." |
996 | */ |
943 | */ |
997 | return ratio; |
944 | return SPECIALISATION_EFFECT; |
998 | } |
945 | } |
|
|
946 | |
999 | if (map->shopitems) |
947 | if (map->shopitems) |
1000 | { |
948 | { |
1001 | for (i = 0; i < items[0].index; i++) |
949 | for (i = 0; i < items[0].index; i++) |
1002 | if (items[i].typenum == item->type || (!items[i].typenum && likedness == 0.001)) |
950 | if (items[i].typenum == item->type || (!items[i].typenum && likedness == 0.001)) |
1003 | likedness = items[i].strength / 100.0; |
951 | likedness = items[i].strength / 100.0; |
1004 | } |
952 | } |
|
|
953 | |
1005 | if (likedness > 1.0) |
954 | if (likedness > 1.0) |
1006 | { /* someone has been rather silly with the map headers. */ |
955 | { /* someone has been rather silly with the map headers. */ |
1007 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is above 100%%\n", item->type, map->path); |
956 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is above 100%%\n", item->type, &map->path); |
1008 | likedness = 1.0; |
957 | likedness = 1.0; |
1009 | } |
958 | } |
|
|
959 | |
1010 | if (likedness < -1.0) |
960 | if (likedness < -1.0) |
1011 | { |
961 | { |
1012 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is below -100%%\n", item->type, map->path); |
962 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is below -100%%\n", item->type, &map->path); |
1013 | likedness = -1.0; |
963 | likedness = -1.0; |
1014 | } |
964 | } |
1015 | ratio = ratio + (1.0 - ratio) * likedness; |
965 | |
1016 | if (ratio <= 0.1) |
966 | return lerp (likedness, -1., 1., SPECIALISATION_EFFECT, 1.); |
1017 | ratio = 0.1; /* if the ratio were much lower than this, we would get silly prices */ |
|
|
1018 | return ratio; |
|
|
1019 | } |
967 | } |
1020 | |
968 | |
1021 | /*returns the greed of the shop on map, or 1 if it isn't specified. */ |
969 | /*returns the greed of the shop on map, or 1 if it isn't specified. */ |
1022 | static double |
970 | static double |
1023 | shop_greed (const mapstruct *map) |
971 | shop_greed (const maptile *map) |
1024 | { |
972 | { |
1025 | double greed = 1.0; |
|
|
1026 | |
|
|
1027 | if (map->shopgreed) |
|
|
1028 | return map->shopgreed; |
973 | return map->shopgreed |
1029 | return greed; |
974 | ? map->shopgreed |
|
|
975 | : 1.; |
1030 | } |
976 | } |
1031 | |
977 | |
1032 | /* Returns a double based on how much the shopkeeper approves of the player. |
978 | /* Returns a double based on how much the shopkeeper approves of the player. |
1033 | * this is based on the race of the shopkeeper and that of the player. |
979 | * this is based on the race of the shopkeeper and that of the player. |
1034 | */ |
980 | */ |
1035 | double |
981 | double |
1036 | shopkeeper_approval (const mapstruct *map, const object *player) |
982 | shopkeeper_approval (const maptile *map, const object *player) |
1037 | { |
983 | { |
1038 | double approval = 1.0; |
984 | return map->shoprace && player->race != map->shoprace |
1039 | |
985 | ? DISLIKE_RATIO |
1040 | if (map->shoprace) |
986 | : 1.; |
1041 | { |
|
|
1042 | approval = NEUTRAL_RATIO; |
|
|
1043 | if (player->race && !strcmp (player->race, map->shoprace)) |
|
|
1044 | approval = 1.0; |
|
|
1045 | } |
|
|
1046 | return approval; |
|
|
1047 | } |
987 | } |
1048 | |
988 | |
1049 | /* limit the value of items based on the wealth of the shop. If the item is close |
989 | /* limit the value of items based on the wealth of the shop. If the item is close |
1050 | * to the maximum value a shop will offer, we start to reduce it, if the item is |
990 | * to the maximum value a shop will offer, we start to reduce it, if the item is |
1051 | * below the minimum value the shop is prepared to trade in, then we don't |
991 | * below the minimum value the shop is prepared to trade in, then we don't |
1052 | * want it and offer nothing. If it isn't a shop, check whether we should do generic |
992 | * want it and offer nothing. If it isn't a shop, check whether we should do generic |
1053 | * value reduction. |
993 | * value reduction. |
1054 | * |
994 | * |
1055 | */ |
995 | */ |
1056 | static uint64 |
996 | static sint64 |
1057 | value_limit (uint64 val, int quantity, const object *who, int isshop) |
997 | value_limit (sint64 val, int quantity, const object *who, int isshop) |
1058 | { |
998 | { |
1059 | uint64 newval, unit_price, tmpshopmax; |
999 | sint64 newval, unit_price, tmpshopmax; |
1060 | mapstruct *map; |
1000 | maptile *map; |
1061 | |
1001 | |
1062 | unit_price = val / quantity; |
1002 | unit_price = val / quantity; |
1063 | |
1003 | |
1064 | if (!isshop || !who) |
1004 | if (!isshop || !who) |
1065 | { |
1005 | { |
1066 | if (unit_price > 250000) |
1006 | if (unit_price > 250000) |
1067 | newval = (uint64) (250000. - pow (250000., .75) * 65. + pow (unit_price, .75) * 65.); |
1007 | newval = (sint64) (250000. - pow (250000., .75) * 65. + pow (unit_price, .75) * 65.); |
1068 | else |
1008 | else |
1069 | newval = unit_price; |
1009 | newval = unit_price; |
1070 | } |
1010 | } |
1071 | else |
1011 | else |
1072 | { |
1012 | { |
… | |
… | |
1095 | |
1035 | |
1096 | /* gives a desciption of the shop on their current map to the player op. */ |
1036 | /* gives a desciption of the shop on their current map to the player op. */ |
1097 | int |
1037 | int |
1098 | describe_shop (const object *op) |
1038 | describe_shop (const object *op) |
1099 | { |
1039 | { |
1100 | mapstruct *map = op->map; |
1040 | maptile *map = op->map; |
1101 | |
1041 | |
1102 | /*shopitems *items=map->shopitems; */ |
1042 | /*shopitems *items=map->shopitems; */ |
1103 | int pos = 0, i; |
1043 | int pos = 0, i; |
1104 | double opinion = 0; |
1044 | double opinion = 0; |
1105 | char tmp[MAX_BUF] = "\0"; |
1045 | char tmp[MAX_BUF] = "\0"; |
… | |
… | |
1109 | |
1049 | |
1110 | /*check if there is a shop specified for this map */ |
1050 | /*check if there is a shop specified for this map */ |
1111 | if (map->shopitems || map->shopgreed || map->shoprace || map->shopmin || map->shopmax) |
1051 | if (map->shopitems || map->shopgreed || map->shoprace || map->shopmin || map->shopmax) |
1112 | { |
1052 | { |
1113 | new_draw_info (NDI_UNIQUE, 0, op, "From looking at the nearby shop you determine that it trades in:"); |
1053 | new_draw_info (NDI_UNIQUE, 0, op, "From looking at the nearby shop you determine that it trades in:"); |
|
|
1054 | |
1114 | if (map->shopitems) |
1055 | if (map->shopitems) |
1115 | { |
|
|
1116 | for (i = 0; i < map->shopitems[0].index; i++) |
1056 | for (i = 0; i < map->shopitems[0].index; i++) |
|
|
1057 | if (map->shopitems[i].name && map->shopitems[i].strength > 10) |
1117 | { |
1058 | { |
1118 | if (map->shopitems[i].name && map->shopitems[i].strength > 10) |
|
|
1119 | { |
|
|
1120 | snprintf (tmp + pos, sizeof (tmp) - pos, "%s, ", map->shopitems[i].name_pl); |
1059 | snprintf (tmp + pos, sizeof (tmp) - pos, "%s, ", map->shopitems[i].name_pl); |
1121 | pos += strlen (tmp + pos); |
1060 | pos += strlen (tmp + pos); |
1122 | } |
|
|
1123 | } |
1061 | } |
1124 | } |
1062 | |
1125 | if (!pos) |
1063 | if (!pos) |
1126 | strcat (tmp, "a little of everything."); |
1064 | strcat (tmp, "a little of everything."); |
1127 | |
1065 | |
1128 | /* format the string into a list */ |
1066 | /* format the string into a list */ |
1129 | make_list_like (tmp); |
1067 | make_list_like (tmp); |
1130 | new_draw_info_format (NDI_UNIQUE, 0, op, "%s", tmp); |
1068 | new_draw_info_format (NDI_UNIQUE, 0, op, "%s", tmp); |
1131 | |
1069 | |
1132 | if (map->shopmax) |
1070 | if (map->shopmax) |
1133 | new_draw_info_format (NDI_UNIQUE, 0, op, "It won't trade for items above %s.", cost_string_from_value (map->shopmax, 0)); |
1071 | new_draw_info_format (NDI_UNIQUE, 0, op, "It won't trade for items above %s.", cost_string_from_value (map->shopmax, 0)); |
|
|
1072 | |
1134 | if (map->shopmin) |
1073 | if (map->shopmin) |
1135 | new_draw_info_format (NDI_UNIQUE, 0, op, "It won't trade in items worth less than %s.", cost_string_from_value (map->shopmin, 0)); |
1074 | new_draw_info_format (NDI_UNIQUE, 0, op, "It won't trade in items worth less than %s.", cost_string_from_value (map->shopmin, 0)); |
|
|
1075 | |
1136 | if (map->shopgreed) |
1076 | if (map->shopgreed) |
1137 | { |
1077 | { |
1138 | if (map->shopgreed > 2.0) |
1078 | if (map->shopgreed > 2.0) |
1139 | new_draw_info (NDI_UNIQUE, 0, op, "It tends to overcharge massively."); |
1079 | new_draw_info (NDI_UNIQUE, 0, op, "It tends to overcharge massively."); |
1140 | else if (map->shopgreed > 1.5) |
1080 | else if (map->shopgreed > 1.5) |
… | |
… | |
1142 | else if (map->shopgreed > 1.1) |
1082 | else if (map->shopgreed > 1.1) |
1143 | new_draw_info (NDI_UNIQUE, 0, op, "It tends to overcharge slightly."); |
1083 | new_draw_info (NDI_UNIQUE, 0, op, "It tends to overcharge slightly."); |
1144 | else if (map->shopgreed < 0.9) |
1084 | else if (map->shopgreed < 0.9) |
1145 | new_draw_info (NDI_UNIQUE, 0, op, "It tends to undercharge."); |
1085 | new_draw_info (NDI_UNIQUE, 0, op, "It tends to undercharge."); |
1146 | } |
1086 | } |
|
|
1087 | |
1147 | if (map->shoprace) |
1088 | if (map->shoprace) |
1148 | { |
1089 | { |
1149 | opinion = shopkeeper_approval (map, op); |
1090 | opinion = shopkeeper_approval (map, op); |
1150 | if (opinion > 0.8) |
1091 | if (opinion > 0.8) |
1151 | new_draw_info (NDI_UNIQUE, 0, op, "You think the shopkeeper likes you."); |
1092 | new_draw_info (NDI_UNIQUE, 0, op, "You think the shopkeeper likes you."); |
… | |
… | |
1158 | else |
1099 | else |
1159 | new_draw_info (NDI_UNIQUE, 0, op, "There is no shop nearby."); |
1100 | new_draw_info (NDI_UNIQUE, 0, op, "There is no shop nearby."); |
1160 | |
1101 | |
1161 | return 1; |
1102 | return 1; |
1162 | } |
1103 | } |
|
|
1104 | |
1163 | typedef struct shopinv |
1105 | struct shopinv |
1164 | { |
1106 | { |
1165 | char *item_sort; |
1107 | char *item_sort; |
1166 | char *item_real; |
1108 | char *item_real; |
1167 | uint16 type; |
1109 | uint16 type; |
1168 | uint32 nrof; |
1110 | uint32 nrof; |
1169 | } shopinv; |
1111 | }; |
1170 | |
1112 | |
1171 | /* There are a lot fo extra casts in here just to suppress warnings - it |
1113 | /* There are a lot fo extra casts in here just to suppress warnings - it |
1172 | * makes it look uglier than it really it. |
1114 | * makes it look uglier than it really it. |
1173 | * The format of the strings we get is type:name. So we first want to |
1115 | * The format of the strings we get is type:name. So we first want to |
1174 | * sort by type (numerical) - if the same type, then sort by name. |
1116 | * sort by type (numerical) - if the same type, then sort by name. |
… | |
… | |
1180 | |
1122 | |
1181 | if (s1->type < s2->type) |
1123 | if (s1->type < s2->type) |
1182 | return -1; |
1124 | return -1; |
1183 | if (s1->type > s2->type) |
1125 | if (s1->type > s2->type) |
1184 | return 1; |
1126 | return 1; |
|
|
1127 | |
1185 | /* the type is the same (what atoi gets), so do a strcasecmp to sort |
1128 | /* the type is the same (what atoi gets), so do a strcasecmp to sort |
1186 | * via alphabetical order |
1129 | * via alphabetical order |
1187 | */ |
1130 | */ |
1188 | return strcasecmp (s1->item_sort, s2->item_sort); |
1131 | return strcasecmp (s1->item_sort, s2->item_sort); |
1189 | } |
1132 | } |
… | |
… | |
1216 | case RING: |
1159 | case RING: |
1217 | case AMULET: |
1160 | case AMULET: |
1218 | case BRACERS: |
1161 | case BRACERS: |
1219 | case GIRDLE: |
1162 | case GIRDLE: |
1220 | sprintf (buf, "%s %s", query_base_name (tmp, 0), describe_item (tmp, NULL)); |
1163 | sprintf (buf, "%s %s", query_base_name (tmp, 0), describe_item (tmp, NULL)); |
1221 | items[*numitems].item_sort = strdup_local (buf); |
1164 | items[*numitems].item_sort = strdup (buf); |
1222 | sprintf (buf, "%s %s", query_name (tmp), describe_item (tmp, NULL)); |
1165 | sprintf (buf, "%s %s", query_name (tmp), describe_item (tmp, NULL)); |
1223 | items[*numitems].item_real = strdup_local (buf); |
1166 | items[*numitems].item_real = strdup (buf); |
1224 | (*numitems)++; |
1167 | (*numitems)++; |
1225 | break; |
1168 | break; |
1226 | #endif |
1169 | #endif |
1227 | |
1170 | |
1228 | default: |
1171 | default: |
1229 | items[*numitems].item_sort = strdup_local (query_base_name (tmp, 0)); |
1172 | items[*numitems].item_sort = strdup (query_base_name (tmp, 0)); |
1230 | items[*numitems].item_real = strdup_local (query_base_name (tmp, 1)); |
1173 | items[*numitems].item_real = strdup (query_base_name (tmp, 1)); |
1231 | (*numitems)++; |
1174 | (*numitems)++; |
1232 | break; |
1175 | break; |
1233 | } |
1176 | } |
1234 | SET_FLAG (tmp, FLAG_UNPAID); |
1177 | SET_FLAG (tmp, FLAG_UNPAID); |
1235 | } |
1178 | } |
1236 | |
1179 | |
1237 | void |
1180 | void |
1238 | shop_listing (object *op) |
1181 | shop_listing (object *sign, object *op) |
1239 | { |
1182 | { |
1240 | int i, j, numitems = 0, numallocated = 0, nx, ny; |
1183 | int i, j, numitems = 0, numallocated = 0, x1, x2, y1, y2; |
1241 | char *map_mark = (char *) calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); |
1184 | const char *shop_coords = get_ob_key_value (sign, "shop_coords"); |
1242 | object *stack; |
1185 | object *stack; |
1243 | shopinv *items; |
1186 | shopinv *items; |
1244 | |
1187 | |
1245 | /* Should never happen, but just in case a monster does apply a sign */ |
1188 | /* Should never happen, but just in case a monster does apply a sign */ |
1246 | if (op->type != PLAYER) |
1189 | if (op->type != PLAYER) |
1247 | return; |
1190 | return; |
1248 | |
1191 | |
1249 | new_draw_info (NDI_UNIQUE, 0, op, "\nThe shop contains:"); |
1192 | if (!(shop_coords && sscanf (shop_coords, "%d,%d,%d,%d", &x1, &y1, &x2, &y2))) |
|
|
1193 | { |
|
|
1194 | x1 = 0; |
|
|
1195 | y1 = 0; |
|
|
1196 | x2 = op->map->width - 1; |
|
|
1197 | y2 = op->map->height - 1; |
|
|
1198 | } |
1250 | |
1199 | |
1251 | magic_mapping_mark (op, map_mark, 3); |
|
|
1252 | items = (shopinv *) malloc (40 * sizeof (shopinv)); |
1200 | items = (shopinv *) malloc (40 * sizeof (shopinv)); |
1253 | numallocated = 40; |
1201 | numallocated = 40; |
1254 | |
1202 | |
1255 | /* Find all the appropriate items */ |
1203 | /* Find all the appropriate items */ |
1256 | for (i = 0; i < MAP_WIDTH (op->map); i++) |
1204 | for (i = x1; i <= x2; i++) |
1257 | { |
1205 | { |
1258 | for (j = 0; j < MAP_HEIGHT (op->map); j++) |
1206 | for (j = y1; j < y2; j++) |
1259 | { |
|
|
1260 | /* magic map code now centers the map on the object at MAGIC_MAP_HALF. |
|
|
1261 | * |
1207 | { |
1262 | */ |
1208 | if (is_in_shop (op->map, i, j)) |
1263 | nx = i - op->x + MAGIC_MAP_HALF; |
|
|
1264 | ny = j - op->y + MAGIC_MAP_HALF; |
|
|
1265 | /* unlikely, but really big shops could run into this issue */ |
|
|
1266 | if (nx < 0 || ny < 0 || nx > MAGIC_MAP_SIZE || ny > MAGIC_MAP_SIZE) |
|
|
1267 | continue; |
|
|
1268 | |
|
|
1269 | if (map_mark[nx + MAGIC_MAP_SIZE * ny] & FACE_FLOOR) |
|
|
1270 | { |
1209 | { |
1271 | stack = get_map_ob (op->map, i, j); |
1210 | stack = GET_MAP_OB (op->map, i, j); |
1272 | |
1211 | |
1273 | while (stack) |
1212 | while (stack) |
1274 | { |
1213 | { |
1275 | if (QUERY_FLAG (stack, FLAG_UNPAID)) |
1214 | if (QUERY_FLAG (stack, FLAG_UNPAID)) |
1276 | { |
1215 | { |
1277 | if (numitems == numallocated) |
1216 | if (numitems == numallocated) |
1278 | { |
1217 | { |
1279 | items = (shopinv *) realloc (items, sizeof (shopinv) * (numallocated + 10)); |
1218 | items = (shopinv *) realloc (items, sizeof (shopinv) * (numallocated + 10)); |
1280 | numallocated += 10; |
1219 | numallocated += 10; |
1281 | } |
1220 | } |
|
|
1221 | |
1282 | add_shop_item (stack, items, &numitems, &numallocated); |
1222 | add_shop_item (stack, items, &numitems, &numallocated); |
1283 | } |
1223 | } |
|
|
1224 | |
1284 | stack = stack->above; |
1225 | stack = stack->above; |
1285 | } |
1226 | } |
1286 | } |
1227 | } |
1287 | } |
1228 | } |
1288 | } |
1229 | } |
1289 | free (map_mark); |
1230 | |
1290 | if (numitems == 0) |
1231 | if (numitems == 0) |
1291 | { |
1232 | { |
1292 | new_draw_info (NDI_UNIQUE, 0, op, "The shop is currently empty.\n"); |
1233 | new_draw_info (NDI_UNIQUE, 0, op, "The shop is currently empty.\n"); |
1293 | free (items); |
1234 | free (items); |
1294 | return; |
1235 | return; |
1295 | } |
1236 | } |
|
|
1237 | |
1296 | qsort (items, numitems, sizeof (shopinv), (int (*)(const void *, const void *)) shop_sort); |
1238 | qsort (items, numitems, sizeof (shopinv), (int (*)(const void *, const void *)) shop_sort); |
|
|
1239 | |
|
|
1240 | new_draw_info (NDI_UNIQUE, 0, op, "\nThe shop contains:"); |
1297 | |
1241 | |
1298 | for (i = 0; i < numitems; i++) |
1242 | for (i = 0; i < numitems; i++) |
1299 | { |
1243 | { |
1300 | /* Collapse items of the same name together */ |
1244 | /* Collapse items of the same name together */ |
1301 | if ((i + 1) < numitems && !strcmp (items[i].item_real, items[i + 1].item_real)) |
1245 | if ((i + 1) < numitems && !strcmp (items[i].item_real, items[i + 1].item_real)) |
… | |
… | |
1310 | items[i].nrof ? items[i].nrof : 1, items[i].nrof == 1 ? items[i].item_sort : items[i].item_real); |
1254 | items[i].nrof ? items[i].nrof : 1, items[i].nrof == 1 ? items[i].item_sort : items[i].item_real); |
1311 | free (items[i].item_sort); |
1255 | free (items[i].item_sort); |
1312 | free (items[i].item_real); |
1256 | free (items[i].item_real); |
1313 | } |
1257 | } |
1314 | } |
1258 | } |
|
|
1259 | |
1315 | free (items); |
1260 | free (items); |
1316 | } |
1261 | } |
1317 | |
1262 | |
1318 | /* elmex: this function checks whether the object is in a shop */ |
1263 | /* elmex: this function checks whether the object is in a shop */ |
1319 | bool |
1264 | bool |
… | |
… | |
1325 | return is_in_shop (o->map, o->x, o->y); |
1270 | return is_in_shop (o->map, o->x, o->y); |
1326 | } |
1271 | } |
1327 | |
1272 | |
1328 | /* elmex: this function checks whether we are in a shop or not */ |
1273 | /* elmex: this function checks whether we are in a shop or not */ |
1329 | bool |
1274 | bool |
1330 | is_in_shop (mapstruct *map, int x, int y) |
1275 | is_in_shop (maptile *map, int x, int y) |
1331 | { |
1276 | { |
1332 | for (object *floor = get_map_ob (map, x, y); floor; floor = floor->above) |
1277 | for (object *floor = GET_MAP_OB (map, x, y); floor; floor = floor->above) |
1333 | if (floor->type == SHOP_FLOOR) |
1278 | if (floor->type == SHOP_FLOOR) |
1334 | return true; |
1279 | return true; |
1335 | |
1280 | |
1336 | return false; |
1281 | return false; |
1337 | } |
1282 | } |