#define vlen2(v) (_vlen2 = (v), dotproduct(_vlen2, _vlen2))
#if 1
-noref float _vdist_f;
/** Vector distance comparison, avoids sqrt() */
-#define vdist(v, cmp, f) (vlen2(v) cmp (_vdist_f = (f), _vdist_f * _vdist_f))
+#define vdist(v, cmp, f) (vlen2(v) cmp ((f) ** 2))
#else
#define vdist(v, cmp, f) (vlen(v) cmp (f))
#endif
ERASEABLE
float boxinsidebox(vector smins, vector smaxs, vector bmins, vector bmaxs) { return smins.x >= bmins.x && smaxs.x <= bmaxs.x && smins.y >= bmins.y && smaxs.y <= bmaxs.y && smins.z >= bmins.z && smaxs.z <= bmaxs.z; }
+#define pointinsidebox(point, bmins, bmaxs) boxinsidebox(point, point, bmins, bmaxs)
+
#define PITCH(v) ((v).x)
#define YAW(v) ((v).y)
#define ROLL(v) ((v).z)
ERASEABLE
vector NearestPointOnBox(entity box, vector org)
{
- vector m1 = box.mins + box.origin;
- vector m2 = box.maxs + box.origin;
+ vector mi = box.mins + box.origin;
+ vector ma = box.maxs + box.origin;
return vec3(
- bound(m1.x, org.x, m2.x),
- bound(m1.y, org.y, m2.y),
- bound(m1.z, org.z, m2.z)
+ bound(mi.x, org.x, ma.x),
+ bound(mi.y, org.y, ma.y),
+ bound(mi.z, org.z, ma.z)
);
}
+
+ERASEABLE
+vector NearestPointOnBoundingBox(vector mi, vector ma, vector org)
+{
+ return vec3(
+ bound(mi.x, org.x, ma.x),
+ bound(mi.y, org.y, ma.y),
+ bound(mi.z, org.z, ma.z)
+ );
+}
+
+// bones_was_here: rounding bbox to nearest perfect floats prevents obscure collision bugs like #2742
+// FIXME: QC shouldn't need to work around tracebox potentially returning a tiny trace_fraction when the move should have been blocked.
+// Tiny values are valid in some situations and can't simply be ignored.
+#define PFLOAT (1/1024) // 1/32 1/64 etc also work
+#define RPFLOAT(a) (a=rint(a/PFLOAT)*PFLOAT)
+ERASEABLE
+vector RoundPerfectVector(vector v)
+{
+ RPFLOAT(v.x); RPFLOAT(v.y); RPFLOAT(v.z);
+ return v;
+}
+
#endif