1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | 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 |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
|
|
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | #include <global.h> |
24 | #include <global.h> |
25 | #include <spells.h> |
25 | #include <spells.h> |
26 | #include <skills.h> |
26 | #include <skills.h> |
27 | #include <living.h> |
27 | #include <living.h> |
28 | #include <newclient.h> |
|
|
29 | #ifndef __CEXTRACT__ |
|
|
30 | # include <sproto.h> |
28 | #include <sproto.h> |
31 | #endif |
|
|
32 | #include <math.h> |
29 | #include <math.h> |
33 | |
30 | |
34 | /* 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 |
35 | * 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 |
36 | * 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 |
… | |
… | |
133 | if (tmp->arch != NULL) |
130 | if (tmp->arch != NULL) |
134 | { |
131 | { |
135 | if (flag == F_BUY) |
132 | if (flag == F_BUY) |
136 | { |
133 | { |
137 | LOG (llevError, "Asking for buy-value of unidentified object.\n"); |
134 | LOG (llevError, "Asking for buy-value of unidentified object.\n"); |
138 | val = tmp->arch->clone.value * 50 * number; |
135 | val = tmp->arch->value * 50 * number; |
139 | } |
136 | } |
140 | else |
137 | else |
141 | { /* Trying to sell something, or get true value */ |
138 | { /* Trying to sell something, or get true value */ |
142 | if (tmp->type == POTION) |
139 | if (tmp->type == POTION) |
143 | val = number * 40; /* Don't want to give anything away */ |
140 | val = number * 40; /* Don't want to give anything away */ |
… | |
… | |
145 | { |
142 | { |
146 | /* 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 |
147 | * unknown objects |
144 | * unknown objects |
148 | */ |
145 | */ |
149 | if (QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) |
146 | if (QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) |
150 | val = number * tmp->arch->clone.value * 2 / 3; |
147 | val = number * tmp->arch->value * 2 / 3; |
151 | else |
148 | else |
152 | val = number * tmp->arch->clone.value / 3; |
149 | val = number * tmp->arch->value / 3; |
153 | } |
150 | } |
154 | } |
151 | } |
155 | } |
152 | } |
156 | else |
153 | else |
157 | { /* No archetype with this object */ |
154 | { /* No archetype with this object */ |
… | |
… | |
168 | |
165 | |
169 | /* 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 |
170 | * identified, AND the object is magical and the archetype is non |
167 | * identified, AND the object is magical and the archetype is non |
171 | * magical, then change values accordingly. The tmp->arch==NULL is |
168 | * magical, then change values accordingly. The tmp->arch==NULL is |
172 | * 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 |
173 | * tmp->arch->clone.magic for any magic. The check for archetype |
170 | * tmp->arch->magic for any magic. The check for archetype |
174 | * 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 |
175 | * default magical. This is because the archetype value should have |
172 | * default magical. This is because the archetype value should have |
176 | * already figured in that value. |
173 | * already figured in that value. |
177 | */ |
174 | */ |
178 | if ((QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified || |
175 | if ((QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified || |
179 | 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)) |
180 | { |
177 | { |
181 | if (tmp->magic > 0) |
178 | if (tmp->magic > 0) |
182 | val *= (3 * tmp->magic * tmp->magic * tmp->magic); |
179 | val *= (3 * tmp->magic * tmp->magic * tmp->magic); |
183 | else |
180 | else |
184 | /* Note that tmp->magic is negative, so that this |
181 | /* Note that tmp->magic is negative, so that this |
… | |
… | |
250 | * the rest will come from the level in bargaining skill |
247 | * the rest will come from the level in bargaining skill |
251 | */ |
248 | */ |
252 | const double cha_ratio = 0.40; |
249 | const double cha_ratio = 0.40; |
253 | |
250 | |
254 | 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); |
255 | |
|
|
256 | 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.); |
257 | |
|
|
258 | diff = .02 + (.80 - .02) * diff; |
253 | diff = .02 + (.80 - .02) * diff; |
259 | |
254 | |
260 | if (flag == F_BUY) |
255 | if (flag == F_BUY) |
261 | val += (val * diff); |
256 | val += val * diff; |
262 | else if (flag == F_SELL) |
257 | else if (flag == F_SELL) |
263 | val -= (val * diff); |
258 | val -= val * diff; |
264 | |
259 | |
265 | // 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 |
266 | // then the range is adjusted randomly around the correct value |
261 | // then the range is adjusted randomly around the correct value |
267 | if (approximate) |
262 | if (approximate) |
268 | approx_range = sint64 (val / sqrt (lev_identify * 3 + 1)); |
263 | approx_range = sint64 (val / sqrt (lev_identify * 3 + 1)); |
269 | } |
264 | } |
270 | |
265 | |
271 | /* 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 |
272 | * overflow of diff above. That shoudl only happen if |
267 | * overflow of diff above. That should only happen if |
273 | * we are selling objects - in that case, the person just |
268 | * we are selling objects - in that case, the person just |
274 | * gets no money. |
269 | * gets no money. |
275 | */ |
270 | */ |
276 | if ((sint64) val < 0) |
271 | if ((sint64) val < 0) |
277 | val = 0; |
272 | val = 0; |
… | |
… | |
305 | if (QUERY_FLAG (tmp, FLAG_PLAYER_SOLD)) |
300 | if (QUERY_FLAG (tmp, FLAG_PLAYER_SOLD)) |
306 | 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)); |
307 | else |
302 | else |
308 | 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))); |
309 | } |
304 | } |
|
|
305 | |
310 | /* 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 |
311 | * 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 |
312 | * pointful, and could give fun with rounding. |
308 | * pointful, and could give fun with rounding. |
313 | */ |
309 | */ |
314 | if (who->map->path != NULL && val > 50) |
310 | //TODO: why use cosf at all, just % and scale linearly, gives more even distribution |
315 | 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)); |
316 | } |
313 | } |
|
|
314 | |
317 | return (sint64) val; |
315 | return (sint64) val; |
318 | } |
316 | } |
319 | |
317 | |
320 | /* 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 |
321 | * cointype placement. |
319 | * cointype placement. |
… | |
… | |
333 | coin = archetype::find (coins[*cointype]); |
331 | coin = archetype::find (coins[*cointype]); |
334 | if (coin == NULL) |
332 | if (coin == NULL) |
335 | return NULL; |
333 | return NULL; |
336 | *cointype += 1; |
334 | *cointype += 1; |
337 | } |
335 | } |
338 | while (coin->clone.value > c); |
336 | while (coin->value > c); |
339 | |
337 | |
340 | return coin; |
338 | return coin; |
341 | } |
339 | } |
342 | |
340 | |
343 | /* 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 |
… | |
… | |
359 | |
357 | |
360 | coin = find_next_coin (cost, &cointype); |
358 | coin = find_next_coin (cost, &cointype); |
361 | if (coin == NULL) |
359 | if (coin == NULL) |
362 | return "nothing"; |
360 | return "nothing"; |
363 | |
361 | |
364 | num = cost / coin->clone.value; |
362 | num = cost / coin->value; |
365 | /* so long as nrof is 32 bit, this is true. |
363 | /* so long as nrof is 32 bit, this is true. |
366 | * 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 |
367 | * is basically true. |
365 | * is basically true. |
368 | */ |
366 | */ |
369 | if ((cost / coin->clone.value) > UINT32_MAX) |
367 | if ((cost / coin->value) > UINT32_MAX) |
370 | { |
368 | { |
371 | strcpy (buf, "an unimaginable sum of money"); |
369 | strcpy (buf, "an unimaginable sum of money"); |
372 | return buf; |
370 | return buf; |
373 | } |
371 | } |
374 | |
372 | |
375 | cost -= num * (sint64)coin->clone.value; |
373 | cost -= num * (sint64)coin->value; |
376 | |
374 | |
377 | 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); |
378 | |
376 | |
379 | next_coin = find_next_coin (cost, &cointype); |
377 | next_coin = find_next_coin (cost, &cointype); |
380 | if (next_coin == NULL || approx) |
378 | if (next_coin == NULL || approx) |
381 | return buf; |
379 | return buf; |
382 | |
380 | |
383 | coin = next_coin; |
381 | coin = next_coin; |
384 | num = cost / coin->clone.value; |
382 | num = cost / coin->value; |
385 | cost -= num * (sint64)coin->clone.value; |
383 | cost -= num * (sint64)coin->value; |
386 | |
384 | |
387 | 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); |
388 | |
386 | |
389 | return buf; |
387 | return buf; |
390 | } |
388 | } |
391 | |
389 | |
392 | const char * |
390 | const char * |
… | |
… | |
422 | archetype *coin = find_next_coin (real_value, &cointype); |
420 | archetype *coin = find_next_coin (real_value, &cointype); |
423 | |
421 | |
424 | if (coin == NULL) |
422 | if (coin == NULL) |
425 | return "nothing"; |
423 | return "nothing"; |
426 | |
424 | |
427 | num = real_value / coin->clone.value; |
425 | num = real_value / coin->value; |
428 | if (num == 1) |
426 | if (num == 1) |
429 | sprintf (buf, "about one %s", &coin->clone.name); |
427 | sprintf (buf, "about one %s", &coin->object::name); |
430 | else if (num < 5) |
428 | else if (num < 5) |
431 | sprintf (buf, "a few %s", &coin->clone.name_pl); |
429 | sprintf (buf, "a few %s", &coin->object::name_pl); |
432 | else if (num < 10) |
430 | else if (num < 10) |
433 | sprintf (buf, "several %s", &coin->clone.name_pl); |
431 | sprintf (buf, "several %s", &coin->object::name_pl); |
434 | else if (num < 25) |
432 | else if (num < 25) |
435 | sprintf (buf, "a moderate amount of %s", &coin->clone.name_pl); |
433 | sprintf (buf, "a moderate amount of %s", &coin->object::name_pl); |
436 | else if (num < 100) |
434 | else if (num < 100) |
437 | sprintf (buf, "lots of %s", &coin->clone.name_pl); |
435 | sprintf (buf, "lots of %s", &coin->object::name_pl); |
438 | else if (num < 1000) |
436 | else if (num < 1000) |
439 | sprintf (buf, "a great many %s", &coin->clone.name_pl); |
437 | sprintf (buf, "a great many %s", &coin->object::name_pl); |
440 | else |
438 | else |
441 | sprintf (buf, "a vast quantity of %s", &coin->clone.name_pl); |
439 | sprintf (buf, "a vast quantity of %s", &coin->object::name_pl); |
442 | return buf; |
440 | return buf; |
443 | } |
441 | } |
444 | } |
442 | } |
445 | } |
443 | } |
446 | |
444 | |
… | |
… | |
505 | |
503 | |
506 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
504 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
507 | 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"))) |
508 | pay_from_container (pl, pouch, to_pay); |
506 | pay_from_container (pl, pouch, to_pay); |
509 | |
507 | |
510 | fix_player (pl); |
508 | pl->update_stats (); |
511 | return 1; |
509 | return 1; |
512 | } |
510 | } |
513 | |
511 | |
514 | /* 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 |
515 | * 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 |
… | |
… | |
542 | |
540 | |
543 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
541 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
544 | 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"))) |
545 | pay_from_container (pl, pouch, to_pay); |
543 | pay_from_container (pl, pouch, to_pay); |
546 | |
544 | |
547 | if (settings.real_wiz == FALSE && QUERY_FLAG (pl, FLAG_WAS_WIZ)) |
545 | pl->update_stats (); |
548 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
549 | |
546 | |
550 | fix_player (pl); |
|
|
551 | return 1; |
547 | return 1; |
552 | } |
548 | } |
553 | |
549 | |
554 | /* 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 |
555 | * the player. |
551 | * the player. |
… | |
… | |
584 | |
580 | |
585 | if (tmp->type == MONEY) |
581 | if (tmp->type == MONEY) |
586 | { |
582 | { |
587 | for (i = 0; i < NUM_COINS; i++) |
583 | for (i = 0; i < NUM_COINS; i++) |
588 | { |
584 | { |
589 | if (tmp->value == tmp->arch->clone.value && !strcmp (coins[NUM_COINS - 1 - i], tmp->arch->name)) |
585 | if (tmp->value == tmp->arch->value && !strcmp (coins[NUM_COINS - 1 - i], tmp->arch->archname)) |
590 | { |
586 | { |
591 | // This should not happen, but if it does, just merge the two. |
587 | // This should not happen, but if it does, just merge the two. |
592 | if (coin_objs [i]) |
588 | if (coin_objs [i]) |
593 | { |
589 | { |
594 | 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 | break; |
606 | break; |
611 | } |
607 | } |
612 | } |
608 | } |
613 | |
609 | |
614 | if (i == NUM_COINS) |
610 | if (i == NUM_COINS) |
615 | 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); |
616 | } |
612 | } |
617 | } |
613 | } |
618 | |
614 | |
619 | /* 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. */ |
620 | /* 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 */ |
… | |
… | |
796 | { |
792 | { |
797 | at = archetype::find (coins[count]); |
793 | at = archetype::find (coins[count]); |
798 | |
794 | |
799 | if (at == NULL) |
795 | if (at == NULL) |
800 | LOG (llevError, "Could not find %s archetype\n", coins[count]); |
796 | LOG (llevError, "Could not find %s archetype\n", coins[count]); |
801 | else if ((amount / at->clone.value) > 0) |
797 | else if ((amount / at->value) > 0) |
802 | { |
798 | { |
803 | for (pouch = pl->inv; pouch; pouch = pouch->below) |
799 | for (pouch = pl->inv; pouch; pouch = pouch->below) |
804 | { |
800 | { |
805 | 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")) |
806 | { |
802 | { |
807 | int w = at->clone.weight * (100 - pouch->stats.Str) / 100; |
803 | int w = at->weight * (100 - pouch->stats.Str) / 100; |
808 | int n = amount / at->clone.value; |
804 | int n = amount / at->value; |
809 | |
805 | |
810 | if (w == 0) |
806 | if (w == 0) |
811 | w = 1; /* Prevent divide by zero */ |
807 | w = 1; /* Prevent divide by zero */ |
812 | |
808 | |
813 | 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)) |
… | |
… | |
825 | esrv_send_item (pl, pl); |
821 | esrv_send_item (pl, pl); |
826 | } |
822 | } |
827 | } |
823 | } |
828 | } |
824 | } |
829 | |
825 | |
830 | if (amount / at->clone.value > 0) |
826 | if (amount / at->value > 0) |
831 | { |
827 | { |
832 | tmp = arch_to_object (at); |
828 | tmp = arch_to_object (at); |
833 | tmp->nrof = amount / tmp->value; |
829 | tmp->nrof = amount / tmp->value; |
834 | amount -= tmp->nrof * tmp->value; |
830 | amount -= tmp->nrof * tmp->value; |
835 | tmp = insert_ob_in_ob (tmp, pl); |
831 | tmp = insert_ob_in_ob (tmp, pl); |
… | |
… | |
933 | double ratio = SPECIALISATION_EFFECT, likedness = 0.001; |
929 | double ratio = SPECIALISATION_EFFECT, likedness = 0.001; |
934 | int i; |
930 | int i; |
935 | |
931 | |
936 | if (item == NULL) |
932 | if (item == NULL) |
937 | { |
933 | { |
938 | LOG (llevError, "shop_specialisation_ratio: passed a NULL item for map %s\n", map->path); |
934 | LOG (llevError, "shop_specialisation_ratio: passed a NULL item for map %s\n", &map->path); |
939 | return 0; |
935 | return 0; |
940 | } |
936 | } |
941 | |
937 | |
942 | if (!item->type) |
938 | if (!item->type) |
943 | { |
939 | { |
… | |
… | |
956 | likedness = items[i].strength / 100.0; |
952 | likedness = items[i].strength / 100.0; |
957 | } |
953 | } |
958 | |
954 | |
959 | if (likedness > 1.0) |
955 | if (likedness > 1.0) |
960 | { /* someone has been rather silly with the map headers. */ |
956 | { /* someone has been rather silly with the map headers. */ |
961 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is above 100%%\n", item->type, map->path); |
957 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is above 100%%\n", item->type, &map->path); |
962 | likedness = 1.0; |
958 | likedness = 1.0; |
963 | } |
959 | } |
964 | |
960 | |
965 | if (likedness < -1.0) |
961 | if (likedness < -1.0) |
966 | { |
962 | { |
967 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is below -100%%\n", item->type, map->path); |
963 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is below -100%%\n", item->type, &map->path); |
968 | likedness = -1.0; |
964 | likedness = -1.0; |
969 | } |
965 | } |
970 | |
966 | |
971 | ratio = ratio + (1.0 - ratio) * likedness; |
967 | ratio = ratio + (1.0 - ratio) * likedness; |
972 | |
968 | |
… | |
… | |
1195 | } |
1191 | } |
1196 | SET_FLAG (tmp, FLAG_UNPAID); |
1192 | SET_FLAG (tmp, FLAG_UNPAID); |
1197 | } |
1193 | } |
1198 | |
1194 | |
1199 | void |
1195 | void |
1200 | shop_listing (object *op) |
1196 | shop_listing (object *sign, object *op) |
1201 | { |
1197 | { |
1202 | int i, j, numitems = 0, numallocated = 0, nx, ny; |
1198 | int i, j, numitems = 0, numallocated = 0, x1, x2, y1, y2; |
1203 | char *map_mark = (char *) calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); |
1199 | const char *shop_coords = get_ob_key_value (sign, "shop_coords"); |
1204 | object *stack; |
1200 | object *stack; |
1205 | shopinv *items; |
1201 | shopinv *items; |
1206 | |
1202 | |
1207 | /* Should never happen, but just in case a monster does apply a sign */ |
1203 | /* Should never happen, but just in case a monster does apply a sign */ |
1208 | if (op->type != PLAYER) |
1204 | if (op->type != PLAYER) |
1209 | return; |
1205 | return; |
1210 | |
1206 | |
1211 | new_draw_info (NDI_UNIQUE, 0, op, "\nThe shop contains:"); |
1207 | if (!(shop_coords && sscanf (shop_coords, "%d,%d,%d,%d", &x1, &y1, &x2, &y2))) |
|
|
1208 | { |
|
|
1209 | x1 = 0; |
|
|
1210 | y1 = 0; |
|
|
1211 | x2 = op->map->width - 1; |
|
|
1212 | y2 = op->map->height - 1; |
|
|
1213 | } |
1212 | |
1214 | |
1213 | magic_mapping_mark (op, map_mark, 3); |
|
|
1214 | items = (shopinv *) malloc (40 * sizeof (shopinv)); |
1215 | items = (shopinv *) malloc (40 * sizeof (shopinv)); |
1215 | numallocated = 40; |
1216 | numallocated = 40; |
1216 | |
1217 | |
1217 | /* Find all the appropriate items */ |
1218 | /* Find all the appropriate items */ |
1218 | for (i = 0; i < MAP_WIDTH (op->map); i++) |
1219 | for (i = x1; i <= x2; i++) |
1219 | { |
1220 | { |
1220 | for (j = 0; j < MAP_HEIGHT (op->map); j++) |
1221 | for (j = y1; j < y2; j++) |
1221 | { |
|
|
1222 | /* magic map code now centers the map on the object at MAGIC_MAP_HALF. |
|
|
1223 | * |
1222 | { |
1224 | */ |
1223 | if (is_in_shop (op->map, i, j)) |
1225 | nx = i - op->x + MAGIC_MAP_HALF; |
|
|
1226 | ny = j - op->y + MAGIC_MAP_HALF; |
|
|
1227 | /* unlikely, but really big shops could run into this issue */ |
|
|
1228 | if (nx < 0 || ny < 0 || nx > MAGIC_MAP_SIZE || ny > MAGIC_MAP_SIZE) |
|
|
1229 | continue; |
|
|
1230 | |
|
|
1231 | if (map_mark[nx + MAGIC_MAP_SIZE * ny] & FACE_FLOOR) |
|
|
1232 | { |
1224 | { |
1233 | stack = get_map_ob (op->map, i, j); |
1225 | stack = GET_MAP_OB (op->map, i, j); |
1234 | |
1226 | |
1235 | while (stack) |
1227 | while (stack) |
1236 | { |
1228 | { |
1237 | if (QUERY_FLAG (stack, FLAG_UNPAID)) |
1229 | if (QUERY_FLAG (stack, FLAG_UNPAID)) |
1238 | { |
1230 | { |
1239 | if (numitems == numallocated) |
1231 | if (numitems == numallocated) |
1240 | { |
1232 | { |
1241 | items = (shopinv *) realloc (items, sizeof (shopinv) * (numallocated + 10)); |
1233 | items = (shopinv *) realloc (items, sizeof (shopinv) * (numallocated + 10)); |
1242 | numallocated += 10; |
1234 | numallocated += 10; |
1243 | } |
1235 | } |
|
|
1236 | |
1244 | add_shop_item (stack, items, &numitems, &numallocated); |
1237 | add_shop_item (stack, items, &numitems, &numallocated); |
1245 | } |
1238 | } |
|
|
1239 | |
1246 | stack = stack->above; |
1240 | stack = stack->above; |
1247 | } |
1241 | } |
1248 | } |
1242 | } |
1249 | } |
1243 | } |
1250 | } |
1244 | } |
1251 | |
1245 | |
1252 | free (map_mark); |
|
|
1253 | |
|
|
1254 | if (numitems == 0) |
1246 | if (numitems == 0) |
1255 | { |
1247 | { |
1256 | new_draw_info (NDI_UNIQUE, 0, op, "The shop is currently empty.\n"); |
1248 | new_draw_info (NDI_UNIQUE, 0, op, "The shop is currently empty.\n"); |
1257 | free (items); |
1249 | free (items); |
1258 | return; |
1250 | return; |
1259 | } |
1251 | } |
1260 | |
1252 | |
1261 | qsort (items, numitems, sizeof (shopinv), (int (*)(const void *, const void *)) shop_sort); |
1253 | qsort (items, numitems, sizeof (shopinv), (int (*)(const void *, const void *)) shop_sort); |
|
|
1254 | |
|
|
1255 | new_draw_info (NDI_UNIQUE, 0, op, "\nThe shop contains:"); |
1262 | |
1256 | |
1263 | for (i = 0; i < numitems; i++) |
1257 | for (i = 0; i < numitems; i++) |
1264 | { |
1258 | { |
1265 | /* Collapse items of the same name together */ |
1259 | /* Collapse items of the same name together */ |
1266 | if ((i + 1) < numitems && !strcmp (items[i].item_real, items[i + 1].item_real)) |
1260 | if ((i + 1) < numitems && !strcmp (items[i].item_real, items[i + 1].item_real)) |
… | |
… | |
1275 | items[i].nrof ? items[i].nrof : 1, items[i].nrof == 1 ? items[i].item_sort : items[i].item_real); |
1269 | items[i].nrof ? items[i].nrof : 1, items[i].nrof == 1 ? items[i].item_sort : items[i].item_real); |
1276 | free (items[i].item_sort); |
1270 | free (items[i].item_sort); |
1277 | free (items[i].item_real); |
1271 | free (items[i].item_real); |
1278 | } |
1272 | } |
1279 | } |
1273 | } |
|
|
1274 | |
1280 | free (items); |
1275 | free (items); |
1281 | } |
1276 | } |
1282 | |
1277 | |
1283 | /* elmex: this function checks whether the object is in a shop */ |
1278 | /* elmex: this function checks whether the object is in a shop */ |
1284 | bool |
1279 | bool |
… | |
… | |
1292 | |
1287 | |
1293 | /* elmex: this function checks whether we are in a shop or not */ |
1288 | /* elmex: this function checks whether we are in a shop or not */ |
1294 | bool |
1289 | bool |
1295 | is_in_shop (maptile *map, int x, int y) |
1290 | is_in_shop (maptile *map, int x, int y) |
1296 | { |
1291 | { |
1297 | for (object *floor = get_map_ob (map, x, y); floor; floor = floor->above) |
1292 | for (object *floor = GET_MAP_OB (map, x, y); floor; floor = floor->above) |
1298 | if (floor->type == SHOP_FLOOR) |
1293 | if (floor->type == SHOP_FLOOR) |
1299 | return true; |
1294 | return true; |
1300 | |
1295 | |
1301 | return false; |
1296 | return false; |
1302 | } |
1297 | } |