split up mleaf_t's minmaxs into two arrays

This commit is contained in:
Bill Currie 2001-08-03 23:54:09 +00:00
parent 1e1cb06a1f
commit f9e85cdf8a
2 changed files with 5 additions and 3 deletions

View file

@ -187,7 +187,9 @@ typedef struct mleaf_s
int contents; // wil be a negative contents number
int visframe; // node needs to be traversed if current
float minmaxs[6]; // for bounding box culling
// for bounding box culling
float mins[3];
float maxs[3];
struct mnode_s *parent;

View file

@ -622,8 +622,8 @@ Mod_LoadLeafs (lump_t *l)
isnotmap = false;
for (i = 0; i < count; i++, in++, out++) {
for (j = 0; j < 3; j++) {
out->minmaxs[j] = LittleShort (in->mins[j]);
out->minmaxs[3 + j] = LittleShort (in->maxs[j]);
out->mins[j] = LittleShort (in->mins[j]);
out->maxs[j] = LittleShort (in->maxs[j]);
}
p = LittleLong (in->contents);