ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/shop.C
(Generate patch)

Comparing deliantra/server/server/shop.C (file contents):
Revision 1.36 by root, Thu May 17 14:14:55 2007 UTC vs.
Revision 1.44 by root, Thu Nov 8 19:43:28 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * 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
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25#include <global.h> 24#include <global.h>
26#include <spells.h> 25#include <spells.h>
27#include <skills.h> 26#include <skills.h>
… …
34 * 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
35 * therefore making this number higher, makes specialisation less effective. 34 * therefore making this number higher, makes specialisation less effective.
36 * 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,
37 * (though not useful) effects. 36 * (though not useful) effects.
38 */ 37 */
39#define SPECIALISATION_EFFECT 0.5 38#define SPECIALISATION_EFFECT .5
40 39
41/* price a shopkeeper will give someone they neither like nor dislike */ 40// price a shopkeeper will give someone that is not of their race
42#define NEUTRAL_RATIO 0.8 41#define DISLIKE_RATIO 0.8
43 42
44static void pay_from_container (object *pl, object *pouch, sint64 &to_pay); 43static void pay_from_container (object *pl, object *pouch, sint64 &to_pay);
45static sint64 value_limit (sint64 val, int quantity, const object *who, int isshop); 44static sint64 value_limit (sint64 val, int quantity, const object *who, int isshop);
46static double shop_specialisation_ratio (const object *item, const maptile *map); 45static double shop_specialisation_ratio (const object *item, const maptile *map);
47static double shop_greed (const maptile *map); 46static double shop_greed (const maptile *map);
… …
131 if (tmp->arch != NULL) 130 if (tmp->arch != NULL)
132 { 131 {
133 if (flag == F_BUY) 132 if (flag == F_BUY)
134 { 133 {
135 LOG (llevError, "Asking for buy-value of unidentified object.\n"); 134 LOG (llevError, "Asking for buy-value of unidentified object.\n");
136 val = tmp->arch->clone.value * 50 * number; 135 val = tmp->arch->value * 50 * number;
137 } 136 }
138 else 137 else
139 { /* Trying to sell something, or get true value */ 138 { /* Trying to sell something, or get true value */
140 if (tmp->type == POTION) 139 if (tmp->type == POTION)
141 val = number * 40; /* Don't want to give anything away */ 140 val = number * 40; /* Don't want to give anything away */
… …
143 { 142 {
144 /* 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
145 * unknown objects 144 * unknown objects
146 */ 145 */
147 if (QUERY_FLAG (tmp, FLAG_BEEN_APPLIED)) 146 if (QUERY_FLAG (tmp, FLAG_BEEN_APPLIED))
148 val = number * tmp->arch->clone.value * 2 / 3; 147 val = number * tmp->arch->value * 2 / 3;
149 else 148 else
150 val = number * tmp->arch->clone.value / 3; 149 val = number * tmp->arch->value / 3;
151 } 150 }
152 } 151 }
153 } 152 }
154 else 153 else
155 { /* No archetype with this object */ 154 { /* No archetype with this object */
… …
166 165
167 /* 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
168 * identified, AND the object is magical and the archetype is non 167 * identified, AND the object is magical and the archetype is non
169 * magical, then change values accordingly. The tmp->arch==NULL is 168 * magical, then change values accordingly. The tmp->arch==NULL is
170 * 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
171 * tmp->arch->clone.magic for any magic. The check for archetype 170 * tmp->arch->magic for any magic. The check for archetype
172 * 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
173 * default magical. This is because the archetype value should have 172 * default magical. This is because the archetype value should have
174 * already figured in that value. 173 * already figured in that value.
175 */ 174 */
176 if ((QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified || 175 if ((QUERY_FLAG (tmp, FLAG_IDENTIFIED) || !need_identify (tmp) || identified ||
177 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))
178 { 177 {
179 if (tmp->magic > 0) 178 if (tmp->magic > 0)
180 val *= (3 * tmp->magic * tmp->magic * tmp->magic); 179 val *= (3 * tmp->magic * tmp->magic * tmp->magic);
181 else 180 else
182 /* Note that tmp->magic is negative, so that this 181 /* Note that tmp->magic is negative, so that this
… …
332 coin = archetype::find (coins[*cointype]); 331 coin = archetype::find (coins[*cointype]);
333 if (coin == NULL) 332 if (coin == NULL)
334 return NULL; 333 return NULL;
335 *cointype += 1; 334 *cointype += 1;
336 } 335 }
337 while (coin->clone.value > c); 336 while (coin->value > c);
338 337
339 return coin; 338 return coin;
340} 339}
341 340
342/* 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
… …
358 357
359 coin = find_next_coin (cost, &cointype); 358 coin = find_next_coin (cost, &cointype);
360 if (coin == NULL) 359 if (coin == NULL)
361 return "nothing"; 360 return "nothing";
362 361
363 num = cost / coin->clone.value; 362 num = cost / coin->value;
364 /* so long as nrof is 32 bit, this is true. 363 /* so long as nrof is 32 bit, this is true.
365 * 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
366 * is basically true. 365 * is basically true.
367 */ 366 */
368 if ((cost / coin->clone.value) > UINT32_MAX) 367 if ((cost / coin->value) > UINT32_MAX)
369 { 368 {
370 strcpy (buf, "an unimaginable sum of money"); 369 strcpy (buf, "an unimaginable sum of money");
371 return buf; 370 return buf;
372 } 371 }
373 372
374 cost -= num * (sint64)coin->clone.value; 373 cost -= num * (sint64)coin->value;
375 374
376 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);
377 376
378 next_coin = find_next_coin (cost, &cointype); 377 next_coin = find_next_coin (cost, &cointype);
379 if (next_coin == NULL || approx) 378 if (next_coin == NULL || approx)
380 return buf; 379 return buf;
381 380
382 coin = next_coin; 381 coin = next_coin;
383 num = cost / coin->clone.value; 382 num = cost / coin->value;
384 cost -= num * (sint64)coin->clone.value; 383 cost -= num * (sint64)coin->value;
385 384
386 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);
387 386
388 return buf; 387 return buf;
389} 388}
390 389
391const char * 390const char *
… …
421 archetype *coin = find_next_coin (real_value, &cointype); 420 archetype *coin = find_next_coin (real_value, &cointype);
422 421
423 if (coin == NULL) 422 if (coin == NULL)
424 return "nothing"; 423 return "nothing";
425 424
426 num = real_value / coin->clone.value; 425 num = real_value / coin->value;
427 if (num == 1) 426 if (num == 1)
428 sprintf (buf, "about one %s", &coin->clone.name); 427 sprintf (buf, "about one %s", &coin->object::name);
429 else if (num < 5) 428 else if (num < 5)
430 sprintf (buf, "a few %s", &coin->clone.name_pl); 429 sprintf (buf, "a few %s", &coin->object::name_pl);
431 else if (num < 10) 430 else if (num < 10)
432 sprintf (buf, "several %s", &coin->clone.name_pl); 431 sprintf (buf, "several %s", &coin->object::name_pl);
433 else if (num < 25) 432 else if (num < 25)
434 sprintf (buf, "a moderate amount of %s", &coin->clone.name_pl); 433 sprintf (buf, "a moderate amount of %s", &coin->object::name_pl);
435 else if (num < 100) 434 else if (num < 100)
436 sprintf (buf, "lots of %s", &coin->clone.name_pl); 435 sprintf (buf, "lots of %s", &coin->object::name_pl);
437 else if (num < 1000) 436 else if (num < 1000)
438 sprintf (buf, "a great many %s", &coin->clone.name_pl); 437 sprintf (buf, "a great many %s", &coin->object::name_pl);
439 else 438 else
440 sprintf (buf, "a vast quantity of %s", &coin->clone.name_pl); 439 sprintf (buf, "a vast quantity of %s", &coin->object::name_pl);
441 return buf; 440 return buf;
442 } 441 }
443 } 442 }
444 } 443 }
445 444
… …
581 580
582 if (tmp->type == MONEY) 581 if (tmp->type == MONEY)
583 { 582 {
584 for (i = 0; i < NUM_COINS; i++) 583 for (i = 0; i < NUM_COINS; i++)
585 { 584 {
586 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))
587 { 586 {
588 // 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.
589 if (coin_objs [i]) 588 if (coin_objs [i])
590 { 589 {
591 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]);
… …
607 break; 606 break;
608 } 607 }
609 } 608 }
610 609
611 if (i == NUM_COINS) 610 if (i == NUM_COINS)
612 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);
613 } 612 }
614 } 613 }
615 614
616 /* 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. */
617 /* 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 */
… …
787{ 786{
788 int count = 0; 787 int count = 0;
789 archetype *at = 0; 788 archetype *at = 0;
790 object *pouch = 0, *tmp = 0; 789 object *pouch = 0, *tmp = 0;
791 790
792 for (count = 0; coins[count] != NULL; count++) 791 for (count = 0; coins[count]; count++)
793 { 792 {
794 at = archetype::find (coins[count]); 793 at = archetype::find (coins[count]);
795 794
796 if (at == NULL) 795 if (at == NULL)
797 LOG (llevError, "Could not find %s archetype\n", coins[count]); 796 LOG (llevError, "Could not find %s archetype\n", coins[count]);
798 else if ((amount / at->clone.value) > 0) 797 else if ((amount / at->value) > 0)
799 { 798 {
800 for (pouch = pl->inv; pouch; pouch = pouch->below) 799 for (pouch = pl->inv; pouch; pouch = pouch->below)
801 { 800 {
802 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"))
803 { 802 {
804 int w = at->clone.weight * (100 - pouch->stats.Str) / 100; 803 int w = at->weight * (100 - pouch->stats.Str) / 100;
805 int n = amount / at->clone.value; 804 int n = amount / at->value;
806 805
807 if (w == 0) 806 if (w == 0)
808 w = 1; /* Prevent divide by zero */ 807 w = 1; /* Prevent divide by zero */
809 808
810 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))
… …
822 esrv_send_item (pl, pl); 821 esrv_send_item (pl, pl);
823 } 822 }
824 } 823 }
825 } 824 }
826 825
827 if (amount / at->clone.value > 0) 826 if (amount / at->value > 0)
828 { 827 {
829 tmp = arch_to_object (at); 828 tmp = arch_to_object (at);
830 tmp->nrof = amount / tmp->value; 829 tmp->nrof = amount / tmp->value;
831 amount -= tmp->nrof * tmp->value; 830 amount -= tmp->nrof * tmp->value;
832 tmp = insert_ob_in_ob (tmp, pl); 831 tmp = insert_ob_in_ob (tmp, pl);
… …
910 change_exp (pl, extra_gain / 10, "bargaining", SK_EXP_NONE); 909 change_exp (pl, extra_gain / 10, "bargaining", SK_EXP_NONE);
911 910
912 pay_player (pl, amount); 911 pay_player (pl, amount);
913 912
914 new_draw_info_format (NDI_UNIQUE, 0, pl, "You receive %s for %s.", query_cost_string (op, pl, F_SELL | F_SHOP), query_name (op)); 913 new_draw_info_format (NDI_UNIQUE, 0, pl, "You receive %s for %s.", query_cost_string (op, pl, F_SELL | F_SHOP), query_name (op));
914 pl->play_sound (sound_find ("shop_sell"));
915 915
916 SET_FLAG (op, FLAG_UNPAID); 916 SET_FLAG (op, FLAG_UNPAID);
917 identify (op); 917 identify (op);
918} 918}
919 919
920
921/* 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
922 * 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,
923 * returned value is between (2*SPECIALISATION_EFFECT-1) and 1 and in any 922 * returned value is between SPECIALISATION_EFFECT and 1.
924 * event is never less than 0.1 (calling functions divide by it)
925 */ 923 */
926static double 924static double
927shop_specialisation_ratio (const object *item, const maptile *map) 925shop_specialisation_ratio (const object *item, const maptile *map)
928{ 926{
929 shopitems *items = map->shopitems; 927 shopitems *items = map->shopitems;
930 double ratio = SPECIALISATION_EFFECT, likedness = 0.001; 928 double likedness = 0.;
931 int i; 929 int i;
932 930
933 if (item == NULL) 931 if (item == NULL)
934 { 932 {
935 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);
… …
941 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");
942 /* 940 /*
943 * 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
944 * 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.."
945 */ 943 */
946 return ratio; 944 return SPECIALISATION_EFFECT;
947 } 945 }
948 946
949 if (map->shopitems) 947 if (map->shopitems)
950 { 948 {
951 for (i = 0; i < items[0].index; i++) 949 for (i = 0; i < items[0].index; i++)
… …
963 { 961 {
964 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);
965 likedness = -1.0; 963 likedness = -1.0;
966 } 964 }
967 965
968 ratio = ratio + (1.0 - ratio) * likedness; 966 return lerp (likedness, -1., 1., SPECIALISATION_EFFECT, 1.);
969
970 if (ratio <= 0.1)
971 ratio = 0.1; /* if the ratio were much lower than this, we would get silly prices */
972
973 return ratio;
974} 967}
975 968
976/*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. */
977static double 970static double
978shop_greed (const maptile *map) 971shop_greed (const maptile *map)
979{ 972{
980 double greed = 1.0;
981
982 if (map->shopgreed)
983 return map->shopgreed; 973 return map->shopgreed
984 return greed; 974 ? map->shopgreed
975 : 1.;
985} 976}
986 977
987/* 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.
988 * 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.
989 */ 980 */
990double 981double
991shopkeeper_approval (const maptile *map, const object *player) 982shopkeeper_approval (const maptile *map, const object *player)
992{ 983{
993 double approval = 1.0; 984 return map->shoprace && player->race != map->shoprace
994 985 ? DISLIKE_RATIO
995 if (map->shoprace) 986 : 1.;
996 {
997 approval = NEUTRAL_RATIO;
998 if (player->race && !strcmp (player->race, map->shoprace))
999 approval = 1.0;
1000 }
1001
1002 return approval;
1003} 987}
1004 988
1005/* 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
1006 * 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
1007 * 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
… …
1294 if (floor->type == SHOP_FLOOR) 1278 if (floor->type == SHOP_FLOOR)
1295 return true; 1279 return true;
1296 1280
1297 return false; 1281 return false;
1298} 1282}
1283

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines