~wxRegionRefData() {}
- // default assignment and comparision operators are OK
+ // default assignment and comparison operators are OK
wxRect m_rect;
};
bool wxRegion::DoUnionWithRegion(const wxRegion& region)
{
- wxCHECK_MSG( region.Ok(), false, "invalid region" );
+ wxCHECK_MSG( region.IsOk(), false, "invalid region" );
return DoUnionWithRect(M_REGION_OF(region)->m_rect);
}
bool wxRegion::DoIntersect(const wxRegion& region)
{
- wxCHECK_MSG( region.Ok(), false, "invalid region" );
+ wxCHECK_MSG( region.IsOk(), false, "invalid region" );
AllocExclusive();
M_REGION->m_rect.Intersect(M_REGION_OF(region)->m_rect);
bool wxRegion::DoSubtract(const wxRegion& region)
{
- wxCHECK_MSG( region.Ok(), false, "invalid region" );
- wxCHECK_MSG( Ok(), false, "invalid region" );
+ wxCHECK_MSG( region.IsOk(), false, "invalid region" );
+ wxCHECK_MSG( IsOk(), false, "invalid region" );
const wxRect& rect = M_REGION_OF(region)->m_rect;
}
else if ( !M_REGION->m_rect.Intersects(rect) )
{
- // the rectangles are disjoint, so substracting has no effect
+ // the rectangles are disjoint, so subtracting has no effect
return true;
}
else
bool wxRegion::DoXor(const wxRegion& region)
{
- wxCHECK_MSG( region.Ok(), false, "invalid region" );
+ wxCHECK_MSG( region.IsOk(), false, "invalid region" );
wxFAIL_MSG( "Xor not implemented" );
return false;
}
wxRegionContain wxRegion::DoContainsPoint(wxCoord x, wxCoord y) const
{
- wxCHECK_MSG( Ok(), wxOutRegion, "invalid region" );
+ wxCHECK_MSG( IsOk(), wxOutRegion, "invalid region" );
if (M_REGION->m_rect.Contains(x, y))
return wxInRegion;
wxRegionContain wxRegion::DoContainsRect(const wxRect& rect) const
{
- wxCHECK_MSG( Ok(), wxOutRegion, "invalid region" );
+ wxCHECK_MSG( IsOk(), wxOutRegion, "invalid region" );
// 1) is the rectangle entirely covered by the region?
if (M_REGION->m_rect.Contains(rect))