Cuboid.h

Go to the documentation of this file.

#pragma once





// tolua_begin
class cCuboid
{
public:
    // p1 is expected to have the smaller of the coords; Sort() swaps coords to match this
    Vector3i p1, p2;

    cCuboid(void) {}
    cCuboid(Vector3i a_p1, Vector3i a_p2) : p1(a_p1), p2(a_p2) {}
    cCuboid(int a_X1, int a_Y1, int a_Z1) : p1(a_X1, a_Y1, a_Z1), p2(a_X1, a_Y1, a_Z1) {}

    #ifdef TOLUA_EXPOSITION  // tolua isn't aware of implicitly generated copy constructors
        cCuboid(const cCuboid & a_Cuboid);
    #endif

    // tolua_end
    // Exported in ManualBindings.cpp to support the old deprecated coord-based overload.

    void Assign(Vector3i a_Point1, Vector3i a_Point2);
    void Assign(const cCuboid & a_SrcCuboid) { *this = a_SrcCuboid; }

    // tolua_begin

    void Sort(void);

    int DifX(void) const { return p2.x - p1.x; }
    int DifY(void) const { return p2.y - p1.y; }
    int DifZ(void) const { return p2.z - p1.z; }

    int GetVolume(void) const;

    inline bool DoesIntersect(const cCuboid & a_Other) const
    {
        ASSERT(IsSorted());
        ASSERT(a_Other.IsSorted());

        // In order for cuboids to intersect, each of their coord intervals need to intersect
        return (
            DoIntervalsIntersect(p1.x, p2.x, a_Other.p1.x, a_Other.p2.x) &&
            DoIntervalsIntersect(p1.y, p2.y, a_Other.p1.y, a_Other.p2.y) &&
            DoIntervalsIntersect(p1.z, p2.z, a_Other.p1.z, a_Other.p2.z)
        );
    }

    // tolua_end
    // Exported in ManualBindings.cpp to support the old deprecated coord-based overload.

    bool IsInside(Vector3i v) const
    {
        return (
            (v.x >= p1.x) && (v.x <= p2.x) &&
            (v.y >= p1.y) && (v.y <= p2.y) &&
            (v.z >= p1.z) && (v.z <= p2.z)
        );
    }

    bool IsInside(Vector3d v) const
    {
        return (
            (v.x >= p1.x) && (v.x <= p2.x) &&
            (v.y >= p1.y) && (v.y <= p2.y) &&
            (v.z >= p1.z) && (v.z <= p2.z)
        );
    }

    // tolua_begin

    bool IsCompletelyInside(const cCuboid & a_Outer) const;

    // tolua_end

    void Move(Vector3i a_Offset);

    // tolua_begin

    void Expand(int a_SubMinX, int a_AddMaxX, int a_SubMinY, int a_AddMaxY, int a_SubMinZ, int a_AddMaxZ);

    void Clamp(const cCuboid & a_Limits);

    void ClampSize(Vector3i a_MaxSize);

    void ClampX(int a_MinX, int a_MaxX);

    void ClampY(int a_MinY, int a_MaxY);

    void ClampZ(int a_MinZ, int a_MaxZ);

    bool IsSorted(void) const;

    void Engulf(Vector3i a_Point);

    // tolua_end

    bool operator == (const cCuboid & aOther) const
    {
        return (
            (p1.x == aOther.p1.x) &&
            (p1.y == aOther.p1.y) &&
            (p1.z == aOther.p1.z) &&
            (p2.x == aOther.p2.x) &&
            (p2.y == aOther.p2.y) &&
            (p2.z == aOther.p2.z)
        );
    }

    bool operator != (const cCuboid & aOther) const
    {
        return !operator ==(aOther);
    }


    // tolua_begin

private:

    inline static bool DoIntervalsIntersect(int a_Min1, int a_Max1, int a_Min2, int a_Max2)
    {
        ASSERT(a_Min1 <= a_Max1);
        ASSERT(a_Min2 <= a_Max2);
        return ((a_Min1 <= a_Max2) && (a_Max1 >= a_Min2));
    }

} ;
// tolua_end