*/
#include <CRect.hpp>
#include <algorithm>
+#include <acess/sys.h>
namespace AxWin {
m_y2 = m_y + m_h;
}
+void CRect::Resize(int NewW, int NewH)
+{
+ m_w = NewW;
+ m_h = NewH;
+ m_x2 = m_x + m_w;
+ m_y2 = m_y + m_h;
+}
+
bool CRect::HasIntersection(const CRect& other) const
{
// If other's origin is past our far corner
int x2 = ::std::min(m_x2, other.m_x2);
int y2 = ::std::min(m_y2, other.m_y2);
- if( x1 <= x2 || y2 <= y1 )
+ if( x2 <= x1 || y2 <= y1 )
return CRect();
- return CRect(x1, y1, x2-x1, y2-y2);
+ return CRect(x1, y1, x2-x1, y2-y1);
}
CRect CRect::RelativeIntersection(const CRect& area)