remove obsolete files

This commit is contained in:
nethack.allison
2006-01-06 22:28:29 +00:00
parent aea3c50163
commit 580b5e62f1
5 changed files with 0 additions and 141 deletions

View File

@@ -1,33 +0,0 @@
/* SCCS Id: @(#)edog.h 3.5 1997/10/23 */
/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/* NetHack may be freely redistributed. See license for details. */
#ifndef EDOG_H
#define EDOG_H
/* various types of food, the lower, the better liked. */
#define DOGFOOD 0
#define CADAVER 1
#define ACCFOOD 2
#define MANFOOD 3
#define APPORT 4
#define POISON 5
#define UNDEF 6
#define TABU 7
struct edog {
long droptime; /* moment dog dropped object */
unsigned dropdist; /* dist of drpped obj from @ */
int apport; /* amount of training */
long whistletime; /* last time he whistled */
long hungrytime; /* will get hungry at this time */
coord ogoal; /* previous goal location */
int abuse; /* track abuses to this pet */
int revivals; /* count pet deaths */
int mhpmax_penalty; /* while starving, points reduced */
Bitfield(killed_by_u, 1); /* you attempted to kill him */
};
#define EDOG(mon) ((struct edog *)&(mon)->mextra[0])
#endif /* EDOG_H */

View File

@@ -1,15 +0,0 @@
/* SCCS Id: @(#)emin.h 3.5 2005/11/02 */
/* Copyright (c) David Cohrs, 1990. */
/* NetHack may be freely redistributed. See license for details. */
#ifndef EMIN_H
#define EMIN_H
struct emin {
aligntyp min_align; /* alignment of minion */
boolean renegade; /* hostile co-aligned priest or Angel */
};
#define EMIN(mon) ((struct emin *)&(mon)->mextra[0])
#endif /* EMIN_H */

View File

@@ -1,21 +0,0 @@
/* SCCS Id: @(#)epri.h 3.5 2005/11/02 */
/* Copyright (c) Izchak Miller, 1989. */
/* NetHack may be freely redistributed. See license for details. */
#ifndef EPRI_H
#define EPRI_H
struct epri {
aligntyp shralign; /* alignment of priest's shrine */
/* leave as first field to match emin */
schar shroom; /* index in rooms */
coord shrpos; /* position of shrine */
d_level shrlevel; /* level (& dungeon) of shrine */
};
#define EPRI(mon) ((struct epri *)&(mon)->mextra[0])
/* note: roaming priests (no shrine) switch from ispriest to isminion
(and emin extension) */
#endif /* EPRI_H */

View File

@@ -1,45 +0,0 @@
/* SCCS Id: @(#)eshk.h 3.5 1997/05/01 */
/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/* NetHack may be freely redistributed. See license for details. */
#ifndef ESHK_H
#define ESHK_H
#define REPAIR_DELAY 5 /* minimum delay between shop damage & repair */
#define BILLSZ 200
struct bill_x {
unsigned bo_id;
boolean useup;
long price; /* price per unit */
long bquan; /* amount used up */
};
struct eshk {
long robbed; /* amount stolen by most recent customer */
long credit; /* amount credited to customer */
long debit; /* amount of debt for using unpaid items */
long loan; /* shop-gold picked (part of debit) */
int shoptype; /* the value of rooms[shoproom].rtype */
schar shoproom; /* index in rooms; set by inshop() */
schar unused; /* to force alignment for stupid compilers */
boolean following; /* following customer since he owes us sth */
boolean surcharge; /* angry shk inflates prices */
coord shk; /* usual position shopkeeper */
coord shd; /* position shop door */
d_level shoplevel; /* level (& dungeon) of his shop */
int billct; /* no. of entries of bill[] in use */
struct bill_x bill[BILLSZ];
struct bill_x *bill_p;
int visitct; /* nr of visits by most recent customer */
char customer[PL_NSIZ]; /* most recent customer */
char shknam[PL_NSIZ];
};
#define ESHK(mon) ((struct eshk *)&(mon)->mextra[0])
#define NOTANGRY(mon) ((mon)->mpeaceful)
#define ANGRY(mon) (!NOTANGRY(mon))
#endif /* ESHK_H */

View File

@@ -1,27 +0,0 @@
/* SCCS Id: @(#)vault.h 3.5 1997/05/01 */
/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/* NetHack may be freely redistributed. See license for details. */
#ifndef VAULT_H
#define VAULT_H
#define FCSIZ (ROWNO+COLNO)
struct fakecorridor {
xchar fx,fy,ftyp;
};
struct egd {
int fcbeg, fcend; /* fcend: first unused pos */
int vroom; /* room number of the vault */
xchar gdx, gdy; /* goal of guard's walk */
xchar ogx, ogy; /* guard's last position */
d_level gdlevel; /* level (& dungeon) guard was created in */
xchar warncnt; /* number of warnings to follow */
Bitfield(gddone,1); /* true iff guard has released player */
Bitfield(unused,7);
struct fakecorridor fakecorr[FCSIZ];
};
#define EGD(mon) ((struct egd *)&(mon)->mextra[0])
#endif /* VAULT_H */