ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/deliantra/server/server/shop.C

Comparing deliantra/server/server/shop.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:04 2006 UTC vs.
Revision 1.46 by root, Wed Apr 9 14:36:47 2008 UTC

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

Diff Legend

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