Class RectF

Engine/source/math/mRect.h:77–131

};

class RectF
{
  public:
   Point2F  point;
   Point2F  extent;

  public:
   RectF() { }
   RectF(const Point2F& in_rMin,
         const Point2F& in_rExtent);
   RectF(const F32 in_left,  const F32 in_top,
         const F32 in_width, const F32 in_height);

   void set(const Point2F& in_rMin, const Point2F& in_rExtent);
   void set(const F32 in_left,  const F32 in_top,
      const F32 in_width, const F32 in_height);

   void inset(F32 x, F32 y);

   /// Return distance of the reference point to the rectangle.
   F32 getDistanceToPoint( const Point2F &refPt ) const;

   /// Return the squared distance of the reference point to the rectangle.
   F32 getSqDistanceToPoint( const Point2F &refPt ) const;

   bool intersect(const RectF& clipRect);
   bool pointInRect(const Point2F& pt) const;
   bool overlaps(const RectF&) const;
   bool contains(const Point2F &p) const
   {
      Point2F minkowskiP = p - point;

      // If we're beyond origin...
      if(minkowskiP.x < 0 || minkowskiP.y < 0)
         return false;

      // Or past extent...
      if(minkowskiP.x > extent.x || minkowskiP.y > extent.y)
         return false;

      // Otherwise we're ok.
      return true;
   }

   bool contains(const RectF& R) const;

   void unionRects( const RectF &rect );

   F32 len_x() const;
   F32 len_y() const;

   bool isValidRect() const { return (extent.x > 0.0f && extent.y > 0.0f); }
   inline bool intersectTriangle(const Point2F &a, const Point2F &b, const Point2F &c);

};

class RectD
{