1 | |
|
|
2 | /* |
1 | /* |
3 | * static char *rcsid_shop_c = |
|
|
4 | * "$Id: shop.C,v 1.14 2006/09/12 19:20:08 root Exp $"; |
|
|
5 | */ |
|
|
6 | |
|
|
7 | /* |
|
|
8 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
9 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
11 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
12 | |
7 | * |
13 | This program is free software; you can redistribute it and/or modify |
8 | * This program 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 2 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, write to the Free Software |
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
26 | |
21 | * |
27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
28 | */ |
23 | */ |
29 | |
24 | |
30 | #include <global.h> |
25 | #include <global.h> |
31 | #include <spells.h> |
26 | #include <spells.h> |
32 | #include <skills.h> |
27 | #include <skills.h> |
33 | #include <living.h> |
28 | #include <living.h> |
34 | #include <newclient.h> |
|
|
35 | #ifndef __CEXTRACT__ |
|
|
36 | # include <sproto.h> |
29 | #include <sproto.h> |
37 | #endif |
|
|
38 | #include <math.h> |
30 | #include <math.h> |
39 | |
31 | |
40 | /* this is a measure of how effective store specialisation is. A general store |
32 | /* 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 |
33 | * 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 |
34 | * offer a range of prices around it such that the maximum price is always one |
… | |
… | |
49 | /* price a shopkeeper will give someone they neither like nor dislike */ |
41 | /* price a shopkeeper will give someone they neither like nor dislike */ |
50 | #define NEUTRAL_RATIO 0.8 |
42 | #define NEUTRAL_RATIO 0.8 |
51 | |
43 | |
52 | static void pay_from_container (object *pl, object *pouch, sint64 &to_pay); |
44 | static void pay_from_container (object *pl, object *pouch, sint64 &to_pay); |
53 | static sint64 value_limit (sint64 val, int quantity, const object *who, int isshop); |
45 | 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); |
46 | static double shop_specialisation_ratio (const object *item, const maptile *map); |
55 | static double shop_greed (const mapstruct *map); |
47 | static double shop_greed (const maptile *map); |
56 | |
48 | |
57 | #define NUM_COINS 4 /* number of coin types */ |
49 | #define NUM_COINS 4 /* number of coin types */ |
58 | static const char *const coins[] = { "royalty", "platinacoin", "goldcoin", "silvercoin", NULL }; |
50 | static const char *const coins[] = { "royalty", "platinacoin", "goldcoin", "silvercoin", NULL }; |
59 | |
51 | |
60 | /* Added F_TRUE flag to define.h to mean that the price should not |
52 | /* Added F_TRUE flag to define.h to mean that the price should not |
… | |
… | |
256 | * the rest will come from the level in bargaining skill |
248 | * the rest will come from the level in bargaining skill |
257 | */ |
249 | */ |
258 | const double cha_ratio = 0.40; |
250 | const double cha_ratio = 0.40; |
259 | |
251 | |
260 | diff = no_bargain ? 1.0 : 1. - pow (lev_bargain / (double) settings.max_level, 0.25); |
252 | diff = no_bargain ? 1.0 : 1. - pow (lev_bargain / (double) settings.max_level, 0.25); |
261 | |
|
|
262 | diff = (1. - cha_ratio) * diff + cha_ratio * (cha_bonus[who->stats.Cha] - 1.) / (cha_bonus[who->stats.Cha] + 1.); |
253 | diff = (1. - cha_ratio) * diff + cha_ratio * (cha_bonus[who->stats.Cha] - 1.) / (cha_bonus[who->stats.Cha] + 1.); |
263 | |
|
|
264 | diff = .02 + (.80 - .02) * diff; |
254 | diff = .02 + (.80 - .02) * diff; |
265 | |
255 | |
266 | if (flag == F_BUY) |
256 | if (flag == F_BUY) |
267 | val += (val * diff); |
257 | val += val * diff; |
268 | else if (flag == F_SELL) |
258 | else if (flag == F_SELL) |
269 | val -= (val * diff); |
259 | val -= val * diff; |
270 | |
260 | |
271 | // now find a price range. the less good we can judge, the larger the range is |
261 | // now find a price range. the less good we can judge, the larger the range is |
272 | // then the range is adjusted randomly around the correct value |
262 | // then the range is adjusted randomly around the correct value |
273 | if (approximate) |
263 | if (approximate) |
274 | approx_range = sint64 (val / sqrt (lev_identify * 3 + 1)); |
264 | approx_range = sint64 (val / sqrt (lev_identify * 3 + 1)); |
275 | } |
265 | } |
276 | |
266 | |
277 | /* I don't think this should really happen - if it does, it indicates and |
267 | /* I don't think this should really happen - if it does, it indicates and |
278 | * overflow of diff above. That shoudl only happen if |
268 | * overflow of diff above. That should only happen if |
279 | * we are selling objects - in that case, the person just |
269 | * we are selling objects - in that case, the person just |
280 | * gets no money. |
270 | * gets no money. |
281 | */ |
271 | */ |
282 | if ((sint64) val < 0) |
272 | if ((sint64) val < 0) |
283 | val = 0; |
273 | val = 0; |
… | |
… | |
311 | if (QUERY_FLAG (tmp, FLAG_PLAYER_SOLD)) |
301 | if (QUERY_FLAG (tmp, FLAG_PLAYER_SOLD)) |
312 | val = (val * shop_greed (who->map) * shop_specialisation_ratio (tmp, who->map) / shopkeeper_approval (who->map, who)); |
302 | val = (val * shop_greed (who->map) * shop_specialisation_ratio (tmp, who->map) / shopkeeper_approval (who->map, who)); |
313 | else |
303 | else |
314 | val = (val * shop_greed (who->map) / (shop_specialisation_ratio (tmp, who->map) * shopkeeper_approval (who->map, who))); |
304 | val = (val * shop_greed (who->map) / (shop_specialisation_ratio (tmp, who->map) * shopkeeper_approval (who->map, who))); |
315 | } |
305 | } |
|
|
306 | |
316 | /* we will also have an extra 0-5% variation between shops of the same type |
307 | /* we will also have an extra 0-5% variation between shops of the same type |
317 | * for valuable items (below a value of 50 this effect wouldn't be very |
308 | * for valuable items (below a value of 50 this effect wouldn't be very |
318 | * pointful, and could give fun with rounding. |
309 | * pointful, and could give fun with rounding. |
319 | */ |
310 | */ |
320 | if (who->map->path != NULL && val > 50) |
311 | //TODO: why use cosf at all, just % and scale linearly, gives more even distribution |
321 | val = (val + 0.05 * (sint64) val * cos (tmp->count + strlen (who->map->path))); |
312 | if (val > 50) |
|
|
313 | val += float (val) * .05f * cosf ((tmp->uuid.seq & 0xffff) * float (M_PI * 2. / 0x10000)); |
322 | } |
314 | } |
|
|
315 | |
323 | return (sint64) val; |
316 | return (sint64) val; |
324 | } |
317 | } |
325 | |
318 | |
326 | /* Find the coin type that is worth more the 'c'. Starts at the |
319 | /* Find the coin type that is worth more the 'c'. Starts at the |
327 | * cointype placement. |
320 | * cointype placement. |
… | |
… | |
334 | |
327 | |
335 | do |
328 | do |
336 | { |
329 | { |
337 | if (coins[*cointype] == NULL) |
330 | if (coins[*cointype] == NULL) |
338 | return NULL; |
331 | return NULL; |
339 | coin = find_archetype (coins[*cointype]); |
332 | coin = archetype::find (coins[*cointype]); |
340 | if (coin == NULL) |
333 | if (coin == NULL) |
341 | return NULL; |
334 | return NULL; |
342 | *cointype += 1; |
335 | *cointype += 1; |
343 | } |
336 | } |
344 | while (coin->clone.value > c); |
337 | while (coin->clone.value > c); |
… | |
… | |
511 | |
504 | |
512 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
505 | for (pouch = pl->inv; pouch && to_pay; pouch = pouch->below) |
513 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && (pouch->race == NULL || strstr (pouch->race, "gold"))) |
506 | if (pouch->type == CONTAINER && QUERY_FLAG (pouch, FLAG_APPLIED) && (pouch->race == NULL || strstr (pouch->race, "gold"))) |
514 | pay_from_container (pl, pouch, to_pay); |
507 | pay_from_container (pl, pouch, to_pay); |
515 | |
508 | |
516 | fix_player (pl); |
509 | pl->update_stats (); |
517 | return 1; |
510 | return 1; |
518 | } |
511 | } |
519 | |
512 | |
520 | /* DAMN: This is now a wrapper for pay_from_container, which is |
513 | /* DAMN: This is now a wrapper for pay_from_container, which is |
521 | * called for the player, then for each active container that can hold |
514 | * called for the player, then for each active container that can hold |
… | |
… | |
551 | pay_from_container (pl, pouch, to_pay); |
544 | pay_from_container (pl, pouch, to_pay); |
552 | |
545 | |
553 | if (settings.real_wiz == FALSE && QUERY_FLAG (pl, FLAG_WAS_WIZ)) |
546 | if (settings.real_wiz == FALSE && QUERY_FLAG (pl, FLAG_WAS_WIZ)) |
554 | SET_FLAG (op, FLAG_WAS_WIZ); |
547 | SET_FLAG (op, FLAG_WAS_WIZ); |
555 | |
548 | |
556 | fix_player (pl); |
549 | pl->update_stats (); |
557 | return 1; |
550 | return 1; |
558 | } |
551 | } |
559 | |
552 | |
560 | /* This pays for the item, and takes the proper amount of money off |
553 | /* This pays for the item, and takes the proper amount of money off |
561 | * the player. |
554 | * the player. |
… | |
… | |
596 | { |
589 | { |
597 | // This should not happen, but if it does, just merge the two. |
590 | // This should not happen, but if it does, just merge the two. |
598 | if (coin_objs [i]) |
591 | if (coin_objs [i]) |
599 | { |
592 | { |
600 | LOG (llevError, "%s has two money entries of (%s)\n", &pouch->name, coins[NUM_COINS - 1 - i]); |
593 | LOG (llevError, "%s has two money entries of (%s)\n", &pouch->name, coins[NUM_COINS - 1 - i]); |
601 | remove_ob (tmp); |
594 | tmp->remove (); |
602 | coin_objs[i]->nrof += tmp->nrof; |
595 | coin_objs[i]->nrof += tmp->nrof; |
603 | esrv_del_item (pl->contr, tmp->count); |
596 | esrv_del_item (pl->contr, tmp->count); |
604 | free_object (tmp); |
597 | tmp->destroy (); |
605 | } |
598 | } |
606 | else |
599 | else |
607 | { |
600 | { |
608 | remove_ob (tmp); |
601 | tmp->remove (); |
609 | |
602 | |
610 | if (pouch->type == PLAYER) |
603 | if (pouch->type == PLAYER) |
611 | esrv_del_item (pl->contr, tmp->count); |
604 | esrv_del_item (pl->contr, tmp->count); |
612 | |
605 | |
613 | coin_objs[i] = tmp; |
606 | coin_objs[i] = tmp; |
… | |
… | |
625 | /* Fill in any gaps in the coin_objs array - needed to make change. */ |
618 | /* Fill in any gaps in the coin_objs array - needed to make change. */ |
626 | /* Note that the coin_objs array goes from least value to greatest value */ |
619 | /* Note that the coin_objs array goes from least value to greatest value */ |
627 | for (i = 0; i < NUM_COINS; i++) |
620 | for (i = 0; i < NUM_COINS; i++) |
628 | if (!coin_objs[i]) |
621 | if (!coin_objs[i]) |
629 | { |
622 | { |
630 | at = find_archetype (coins[NUM_COINS - 1 - i]); |
623 | at = archetype::find (coins[NUM_COINS - 1 - i]); |
631 | |
624 | |
632 | if (at == NULL) |
625 | if (at == NULL) |
633 | LOG (llevError, "Could not find %s archetype\n", coins[NUM_COINS - 1 - i]); |
626 | LOG (llevError, "Could not find %s archetype\n", coins[NUM_COINS - 1 - i]); |
634 | |
627 | |
635 | coin_objs[i] = arch_to_object (at); |
628 | coin_objs[i] = arch_to_object (at); |
… | |
… | |
672 | |
665 | |
673 | if (pl->type != PLAYER) |
666 | if (pl->type != PLAYER) |
674 | esrv_send_item (pl, pl); |
667 | esrv_send_item (pl, pl); |
675 | } |
668 | } |
676 | else |
669 | else |
677 | free_object (coin_objs[i]); |
670 | coin_objs[i]->destroy (); |
678 | } |
671 | } |
679 | } |
672 | } |
680 | |
673 | |
681 | /* Checks all unpaid items in op's inventory, adds up all the money they |
674 | /* Checks all unpaid items in op's inventory, adds up all the money they |
682 | * have, and checks that they can actually afford what they want to buy. |
675 | * have, and checks that they can actually afford what they want to buy. |
… | |
… | |
687 | can_pay (object *pl) |
680 | can_pay (object *pl) |
688 | { |
681 | { |
689 | int unpaid_count = 0; |
682 | int unpaid_count = 0; |
690 | sint64 unpaid_price = 0; |
683 | sint64 unpaid_price = 0; |
691 | sint64 player_wealth = query_money (pl); |
684 | sint64 player_wealth = query_money (pl); |
692 | object *item; |
|
|
693 | |
685 | |
694 | if (!pl || pl->type != PLAYER) |
686 | if (!pl || pl->type != PLAYER) |
695 | { |
687 | { |
696 | LOG (llevError, "can_pay(): called against something that isn't a player\n"); |
688 | LOG (llevError, "can_pay(): called against something that isn't a player\n"); |
697 | return 0; |
689 | return 0; |
… | |
… | |
753 | return 0; |
745 | return 0; |
754 | } |
746 | } |
755 | else |
747 | else |
756 | { |
748 | { |
757 | object *tmp; |
749 | object *tmp; |
758 | tag_t c = op->count; |
|
|
759 | |
750 | |
760 | CLEAR_FLAG (op, FLAG_UNPAID); |
751 | CLEAR_FLAG (op, FLAG_UNPAID); |
761 | CLEAR_FLAG (op, FLAG_PLAYER_SOLD); |
752 | CLEAR_FLAG (op, FLAG_PLAYER_SOLD); |
762 | new_draw_info_format (NDI_UNIQUE, 0, op, "You paid %s for %s.", buf, query_name (op)); |
753 | new_draw_info_format (NDI_UNIQUE, 0, op, "You paid %s for %s.", buf, query_name (op)); |
763 | tmp = merge_ob (op, NULL); |
754 | tmp = merge_ob (op, NULL); |
764 | |
755 | |
765 | if (pl->type == PLAYER) |
756 | if (pl->type == PLAYER) |
766 | { |
757 | { |
767 | if (tmp) |
758 | if (tmp) |
768 | { /* it was merged */ |
759 | { /* it was merged */ |
769 | esrv_del_item (pl->contr, c); |
760 | esrv_del_item (pl->contr, op->count); |
770 | op = tmp; |
761 | op = tmp; |
771 | } |
762 | } |
772 | |
763 | |
773 | esrv_send_item (pl, op); |
764 | esrv_send_item (pl, op); |
774 | } |
765 | } |
… | |
… | |
800 | archetype *at = 0; |
791 | archetype *at = 0; |
801 | object *pouch = 0, *tmp = 0; |
792 | object *pouch = 0, *tmp = 0; |
802 | |
793 | |
803 | for (count = 0; coins[count] != NULL; count++) |
794 | for (count = 0; coins[count] != NULL; count++) |
804 | { |
795 | { |
805 | at = find_archetype (coins[count]); |
796 | at = archetype::find (coins[count]); |
806 | |
797 | |
807 | if (at == NULL) |
798 | if (at == NULL) |
808 | LOG (llevError, "Could not find %s archetype\n", coins[count]); |
799 | LOG (llevError, "Could not find %s archetype\n", coins[count]); |
809 | else if ((amount / at->clone.value) > 0) |
800 | else if ((amount / at->clone.value) > 0) |
810 | { |
801 | { |
… | |
… | |
846 | } |
837 | } |
847 | } |
838 | } |
848 | } |
839 | } |
849 | |
840 | |
850 | if (amount != 0) |
841 | if (amount != 0) |
851 | #ifndef WIN32 |
|
|
852 | LOG (llevError, "Warning - payment in pay_player () not zero: %llu\n", amount); |
842 | LOG (llevError, "Warning - payment in pay_player () not zero: %llu\n", amount); |
853 | #else |
|
|
854 | LOG (llevError, "Warning - payment in pay_player () not zero: %I64u\n", amount); |
|
|
855 | #endif |
|
|
856 | } |
843 | } |
857 | |
844 | |
858 | /* elmex: this is for the bank plugin :( */ |
845 | /* elmex: this is for the bank plugin :( */ |
859 | sint64 |
846 | sint64 |
860 | pay_player_arch (object *pl, const char *arch, sint64 amount) |
847 | pay_player_arch (object *pl, const char *arch, sint64 amount) |
861 | { |
848 | { |
862 | archetype *at = find_archetype (arch); |
849 | archetype *at = archetype::find (arch); |
863 | object *tmp = NULL; |
850 | object *tmp = NULL; |
864 | |
851 | |
865 | if (at == NULL) |
852 | if (at == NULL) |
866 | return 0; |
853 | return 0; |
867 | |
854 | |
… | |
… | |
937 | * item based on the shops specialisation. Does not take account of greed, |
924 | * item based on the shops specialisation. Does not take account of greed, |
938 | * returned value is between (2*SPECIALISATION_EFFECT-1) and 1 and in any |
925 | * returned value is between (2*SPECIALISATION_EFFECT-1) and 1 and in any |
939 | * event is never less than 0.1 (calling functions divide by it) |
926 | * event is never less than 0.1 (calling functions divide by it) |
940 | */ |
927 | */ |
941 | static double |
928 | static double |
942 | shop_specialisation_ratio (const object *item, const mapstruct *map) |
929 | shop_specialisation_ratio (const object *item, const maptile *map) |
943 | { |
930 | { |
944 | shopitems *items = map->shopitems; |
931 | shopitems *items = map->shopitems; |
945 | double ratio = SPECIALISATION_EFFECT, likedness = 0.001; |
932 | double ratio = SPECIALISATION_EFFECT, likedness = 0.001; |
946 | int i; |
933 | int i; |
947 | |
934 | |
948 | if (item == NULL) |
935 | if (item == NULL) |
949 | { |
936 | { |
950 | LOG (llevError, "shop_specialisation_ratio: passed a NULL item for map %s\n", map->path); |
937 | LOG (llevError, "shop_specialisation_ratio: passed a NULL item for map %s\n", &map->path); |
951 | return 0; |
938 | return 0; |
952 | } |
939 | } |
953 | |
940 | |
954 | if (!item->type) |
941 | if (!item->type) |
955 | { |
942 | { |
… | |
… | |
968 | likedness = items[i].strength / 100.0; |
955 | likedness = items[i].strength / 100.0; |
969 | } |
956 | } |
970 | |
957 | |
971 | if (likedness > 1.0) |
958 | if (likedness > 1.0) |
972 | { /* someone has been rather silly with the map headers. */ |
959 | { /* someone has been rather silly with the map headers. */ |
973 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is above 100%%\n", item->type, map->path); |
960 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is above 100%%\n", item->type, &map->path); |
974 | likedness = 1.0; |
961 | likedness = 1.0; |
975 | } |
962 | } |
976 | |
963 | |
977 | if (likedness < -1.0) |
964 | if (likedness < -1.0) |
978 | { |
965 | { |
979 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is below -100%%\n", item->type, map->path); |
966 | LOG (llevDebug, "shop_specialisation ratio: item type %d on map %s is below -100%%\n", item->type, &map->path); |
980 | likedness = -1.0; |
967 | likedness = -1.0; |
981 | } |
968 | } |
982 | |
969 | |
983 | ratio = ratio + (1.0 - ratio) * likedness; |
970 | ratio = ratio + (1.0 - ratio) * likedness; |
984 | |
971 | |
… | |
… | |
988 | return ratio; |
975 | return ratio; |
989 | } |
976 | } |
990 | |
977 | |
991 | /*returns the greed of the shop on map, or 1 if it isn't specified. */ |
978 | /*returns the greed of the shop on map, or 1 if it isn't specified. */ |
992 | static double |
979 | static double |
993 | shop_greed (const mapstruct *map) |
980 | shop_greed (const maptile *map) |
994 | { |
981 | { |
995 | double greed = 1.0; |
982 | double greed = 1.0; |
996 | |
983 | |
997 | if (map->shopgreed) |
984 | if (map->shopgreed) |
998 | return map->shopgreed; |
985 | return map->shopgreed; |
… | |
… | |
1001 | |
988 | |
1002 | /* Returns a double based on how much the shopkeeper approves of the player. |
989 | /* Returns a double based on how much the shopkeeper approves of the player. |
1003 | * this is based on the race of the shopkeeper and that of the player. |
990 | * this is based on the race of the shopkeeper and that of the player. |
1004 | */ |
991 | */ |
1005 | double |
992 | double |
1006 | shopkeeper_approval (const mapstruct *map, const object *player) |
993 | shopkeeper_approval (const maptile *map, const object *player) |
1007 | { |
994 | { |
1008 | double approval = 1.0; |
995 | double approval = 1.0; |
1009 | |
996 | |
1010 | if (map->shoprace) |
997 | if (map->shoprace) |
1011 | { |
998 | { |
… | |
… | |
1026 | */ |
1013 | */ |
1027 | static sint64 |
1014 | static sint64 |
1028 | value_limit (sint64 val, int quantity, const object *who, int isshop) |
1015 | value_limit (sint64 val, int quantity, const object *who, int isshop) |
1029 | { |
1016 | { |
1030 | sint64 newval, unit_price, tmpshopmax; |
1017 | sint64 newval, unit_price, tmpshopmax; |
1031 | mapstruct *map; |
1018 | maptile *map; |
1032 | |
1019 | |
1033 | unit_price = val / quantity; |
1020 | unit_price = val / quantity; |
1034 | |
1021 | |
1035 | if (!isshop || !who) |
1022 | if (!isshop || !who) |
1036 | { |
1023 | { |
… | |
… | |
1066 | |
1053 | |
1067 | /* gives a desciption of the shop on their current map to the player op. */ |
1054 | /* gives a desciption of the shop on their current map to the player op. */ |
1068 | int |
1055 | int |
1069 | describe_shop (const object *op) |
1056 | describe_shop (const object *op) |
1070 | { |
1057 | { |
1071 | mapstruct *map = op->map; |
1058 | maptile *map = op->map; |
1072 | |
1059 | |
1073 | /*shopitems *items=map->shopitems; */ |
1060 | /*shopitems *items=map->shopitems; */ |
1074 | int pos = 0, i; |
1061 | int pos = 0, i; |
1075 | double opinion = 0; |
1062 | double opinion = 0; |
1076 | char tmp[MAX_BUF] = "\0"; |
1063 | char tmp[MAX_BUF] = "\0"; |
… | |
… | |
1190 | case RING: |
1177 | case RING: |
1191 | case AMULET: |
1178 | case AMULET: |
1192 | case BRACERS: |
1179 | case BRACERS: |
1193 | case GIRDLE: |
1180 | case GIRDLE: |
1194 | sprintf (buf, "%s %s", query_base_name (tmp, 0), describe_item (tmp, NULL)); |
1181 | sprintf (buf, "%s %s", query_base_name (tmp, 0), describe_item (tmp, NULL)); |
1195 | items[*numitems].item_sort = strdup_local (buf); |
1182 | items[*numitems].item_sort = strdup (buf); |
1196 | sprintf (buf, "%s %s", query_name (tmp), describe_item (tmp, NULL)); |
1183 | sprintf (buf, "%s %s", query_name (tmp), describe_item (tmp, NULL)); |
1197 | items[*numitems].item_real = strdup_local (buf); |
1184 | items[*numitems].item_real = strdup (buf); |
1198 | (*numitems)++; |
1185 | (*numitems)++; |
1199 | break; |
1186 | break; |
1200 | #endif |
1187 | #endif |
1201 | |
1188 | |
1202 | default: |
1189 | default: |
1203 | items[*numitems].item_sort = strdup_local (query_base_name (tmp, 0)); |
1190 | items[*numitems].item_sort = strdup (query_base_name (tmp, 0)); |
1204 | items[*numitems].item_real = strdup_local (query_base_name (tmp, 1)); |
1191 | items[*numitems].item_real = strdup (query_base_name (tmp, 1)); |
1205 | (*numitems)++; |
1192 | (*numitems)++; |
1206 | break; |
1193 | break; |
1207 | } |
1194 | } |
1208 | SET_FLAG (tmp, FLAG_UNPAID); |
1195 | SET_FLAG (tmp, FLAG_UNPAID); |
1209 | } |
1196 | } |
1210 | |
1197 | |
1211 | void |
1198 | void |
1212 | shop_listing (object *op) |
1199 | shop_listing (object *sign, object *op) |
1213 | { |
1200 | { |
1214 | int i, j, numitems = 0, numallocated = 0, nx, ny; |
1201 | int i, j, numitems = 0, numallocated = 0, x1, x2, y1, y2; |
1215 | char *map_mark = (char *) calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); |
1202 | const char *shop_coords = get_ob_key_value (sign, "shop_coords"); |
1216 | object *stack; |
1203 | object *stack; |
1217 | shopinv *items; |
1204 | shopinv *items; |
1218 | |
1205 | |
1219 | /* Should never happen, but just in case a monster does apply a sign */ |
1206 | /* Should never happen, but just in case a monster does apply a sign */ |
1220 | if (op->type != PLAYER) |
1207 | if (op->type != PLAYER) |
1221 | return; |
1208 | return; |
1222 | |
1209 | |
1223 | new_draw_info (NDI_UNIQUE, 0, op, "\nThe shop contains:"); |
1210 | if (!(shop_coords && sscanf (shop_coords, "%d,%d,%d,%d", &x1, &y1, &x2, &y2))) |
|
|
1211 | { |
|
|
1212 | x1 = 0; |
|
|
1213 | y1 = 0; |
|
|
1214 | x2 = op->map->width - 1; |
|
|
1215 | y2 = op->map->height - 1; |
|
|
1216 | } |
1224 | |
1217 | |
1225 | magic_mapping_mark (op, map_mark, 3); |
|
|
1226 | items = (shopinv *) malloc (40 * sizeof (shopinv)); |
1218 | items = (shopinv *) malloc (40 * sizeof (shopinv)); |
1227 | numallocated = 40; |
1219 | numallocated = 40; |
1228 | |
1220 | |
1229 | /* Find all the appropriate items */ |
1221 | /* Find all the appropriate items */ |
1230 | for (i = 0; i < MAP_WIDTH (op->map); i++) |
1222 | for (i = x1; i <= x2; i++) |
1231 | { |
1223 | { |
1232 | for (j = 0; j < MAP_HEIGHT (op->map); j++) |
1224 | for (j = y1; j < y2; j++) |
1233 | { |
|
|
1234 | /* magic map code now centers the map on the object at MAGIC_MAP_HALF. |
|
|
1235 | * |
1225 | { |
1236 | */ |
1226 | if (is_in_shop (op->map, i, j)) |
1237 | nx = i - op->x + MAGIC_MAP_HALF; |
|
|
1238 | ny = j - op->y + MAGIC_MAP_HALF; |
|
|
1239 | /* unlikely, but really big shops could run into this issue */ |
|
|
1240 | if (nx < 0 || ny < 0 || nx > MAGIC_MAP_SIZE || ny > MAGIC_MAP_SIZE) |
|
|
1241 | continue; |
|
|
1242 | |
|
|
1243 | if (map_mark[nx + MAGIC_MAP_SIZE * ny] & FACE_FLOOR) |
|
|
1244 | { |
1227 | { |
1245 | stack = get_map_ob (op->map, i, j); |
1228 | stack = GET_MAP_OB (op->map, i, j); |
1246 | |
1229 | |
1247 | while (stack) |
1230 | while (stack) |
1248 | { |
1231 | { |
1249 | if (QUERY_FLAG (stack, FLAG_UNPAID)) |
1232 | if (QUERY_FLAG (stack, FLAG_UNPAID)) |
1250 | { |
1233 | { |
1251 | if (numitems == numallocated) |
1234 | if (numitems == numallocated) |
1252 | { |
1235 | { |
1253 | items = (shopinv *) realloc (items, sizeof (shopinv) * (numallocated + 10)); |
1236 | items = (shopinv *) realloc (items, sizeof (shopinv) * (numallocated + 10)); |
1254 | numallocated += 10; |
1237 | numallocated += 10; |
1255 | } |
1238 | } |
|
|
1239 | |
1256 | add_shop_item (stack, items, &numitems, &numallocated); |
1240 | add_shop_item (stack, items, &numitems, &numallocated); |
1257 | } |
1241 | } |
|
|
1242 | |
1258 | stack = stack->above; |
1243 | stack = stack->above; |
1259 | } |
1244 | } |
1260 | } |
1245 | } |
1261 | } |
1246 | } |
1262 | } |
1247 | } |
1263 | |
1248 | |
1264 | free (map_mark); |
|
|
1265 | |
|
|
1266 | if (numitems == 0) |
1249 | if (numitems == 0) |
1267 | { |
1250 | { |
1268 | new_draw_info (NDI_UNIQUE, 0, op, "The shop is currently empty.\n"); |
1251 | new_draw_info (NDI_UNIQUE, 0, op, "The shop is currently empty.\n"); |
1269 | free (items); |
1252 | free (items); |
1270 | return; |
1253 | return; |
1271 | } |
1254 | } |
1272 | |
1255 | |
1273 | qsort (items, numitems, sizeof (shopinv), (int (*)(const void *, const void *)) shop_sort); |
1256 | qsort (items, numitems, sizeof (shopinv), (int (*)(const void *, const void *)) shop_sort); |
|
|
1257 | |
|
|
1258 | new_draw_info (NDI_UNIQUE, 0, op, "\nThe shop contains:"); |
1274 | |
1259 | |
1275 | for (i = 0; i < numitems; i++) |
1260 | for (i = 0; i < numitems; i++) |
1276 | { |
1261 | { |
1277 | /* Collapse items of the same name together */ |
1262 | /* Collapse items of the same name together */ |
1278 | if ((i + 1) < numitems && !strcmp (items[i].item_real, items[i + 1].item_real)) |
1263 | if ((i + 1) < numitems && !strcmp (items[i].item_real, items[i + 1].item_real)) |
… | |
… | |
1287 | items[i].nrof ? items[i].nrof : 1, items[i].nrof == 1 ? items[i].item_sort : items[i].item_real); |
1272 | items[i].nrof ? items[i].nrof : 1, items[i].nrof == 1 ? items[i].item_sort : items[i].item_real); |
1288 | free (items[i].item_sort); |
1273 | free (items[i].item_sort); |
1289 | free (items[i].item_real); |
1274 | free (items[i].item_real); |
1290 | } |
1275 | } |
1291 | } |
1276 | } |
|
|
1277 | |
1292 | free (items); |
1278 | free (items); |
1293 | } |
1279 | } |
1294 | |
1280 | |
1295 | /* elmex: this function checks whether the object is in a shop */ |
1281 | /* elmex: this function checks whether the object is in a shop */ |
1296 | bool |
1282 | bool |
… | |
… | |
1302 | return is_in_shop (o->map, o->x, o->y); |
1288 | return is_in_shop (o->map, o->x, o->y); |
1303 | } |
1289 | } |
1304 | |
1290 | |
1305 | /* elmex: this function checks whether we are in a shop or not */ |
1291 | /* elmex: this function checks whether we are in a shop or not */ |
1306 | bool |
1292 | bool |
1307 | is_in_shop (mapstruct *map, int x, int y) |
1293 | is_in_shop (maptile *map, int x, int y) |
1308 | { |
1294 | { |
1309 | for (object *floor = get_map_ob (map, x, y); floor; floor = floor->above) |
1295 | for (object *floor = GET_MAP_OB (map, x, y); floor; floor = floor->above) |
1310 | if (floor->type == SHOP_FLOOR) |
1296 | if (floor->type == SHOP_FLOOR) |
1311 | return true; |
1297 | return true; |
1312 | |
1298 | |
1313 | return false; |
1299 | return false; |
1314 | } |
1300 | } |