Source:NetHack 3.2.0/eshk.h

Below is the full text to eshk.h from the source code of NetHack 3.2.0. To link to a particular line, write [[NetHack 3.2.0/eshk.h#line123 ]], for example.

Warning! This is the source code from an old release. For the latest release, see Source code

1.   /*	SCCS Id: @(#)eshk.h	3.2	93/01/06	*/ 2.   /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */ 3.    /* NetHack may be freely redistributed. See license for details. */ 4.     5.    #ifndef ESHK_H 6.   #define ESHK_H 7.    8.    #define REPAIR_DELAY	5	/* minimum delay between shop damage & repair */ 9.    10.   #define BILLSZ	200 11.   12.   struct bill_x { 13.  	unsigned bo_id; 14.  	boolean useup; 15.  	long price;		/* price per unit */ 16.  	long bquan;		/* amount used up */ 17.  };  18.    19.   #ifndef DUNGEON_H 20.  #include "dungeon.h"  21. #endif 22.   23.   struct eshk { 24.  	long robbed;		/* amount stolen by most recent customer */ 25.  	long credit;		/* amount credited to customer */ 26.  	long debit;		/* amount of debt for using unpaid items */ 27.  	long loan;		/* shop-gold picked (part of debit) */ 28.  	int shoptype;		/* the value of rooms[shoproom].rtype */ 29.  	schar shoproom;		/* index in rooms; set by inshop */ 30.  	boolean following;	/* following customer since he owes us sth */ 31.  	boolean surcharge;	/* angry shk inflates prices */ 32.  	coord shk;		/* usual position shopkeeper */ 33.  	coord shd;		/* position shop door */ 34.  	d_level shoplevel;	/* level (& dungeon) of his shop */ 35.  	int billct;		/* no. of entries of bill[] in use */ 36.  	struct bill_x bill[BILLSZ]; 37.  	struct bill_x *bill_p; 38.  	int visitct;		/* nr of visits by most recent customer */ 39.  	char customer[PL_NSIZ];	/* most recent customer */ 40.  	char shknam[PL_NSIZ]; 41.  };  42.    43.   #define ESHK(mon)	((struct eshk *)&(mon)->mextra[0]) 44.   45.   #define NOTANGRY(mon)	((mon)->mpeaceful) 46.  #define ANGRY(mon)	(!NOTANGRY(mon)) 47.   48.   #endif /* ESHK_H */