138 lines
4.5 KiB
C
138 lines
4.5 KiB
C
|
/////////////////////////////////////////////////////////////////////////////
|
||
|
// Name: region.h
|
||
|
// Purpose: wxRegion class
|
||
|
// Author: AUTHOR
|
||
|
// Modified by:
|
||
|
// Created: ??/??/98
|
||
|
// RCS-ID: $Id$
|
||
|
// Copyright: (c) AUTHOR
|
||
|
// Licence: wxWindows licence
|
||
|
/////////////////////////////////////////////////////////////////////////////
|
||
|
|
||
|
#ifndef _WX_REGION_H_
|
||
|
#define _WX_REGION_H_
|
||
|
|
||
|
#ifdef __GNUG__
|
||
|
#pragma interface "region.h"
|
||
|
#endif
|
||
|
|
||
|
#include "wx/list.h"
|
||
|
#include "wx/gdiobj.h"
|
||
|
#include "wx/gdicmn.h"
|
||
|
|
||
|
class WXDLLEXPORT wxRect;
|
||
|
class WXDLLEXPORT wxPoint;
|
||
|
|
||
|
enum wxRegionContain {
|
||
|
wxOutRegion = 0, wxPartRegion = 1, wxInRegion = 2
|
||
|
};
|
||
|
|
||
|
// So far, for internal use only
|
||
|
enum wxRegionOp {
|
||
|
wxRGN_AND, // Creates the intersection of the two combined regions.
|
||
|
wxRGN_COPY, // Creates a copy of the region identified by hrgnSrc1.
|
||
|
wxRGN_DIFF, // Combines the parts of hrgnSrc1 that are not part of hrgnSrc2.
|
||
|
wxRGN_OR, // Creates the union of two combined regions.
|
||
|
wxRGN_XOR // Creates the union of two combined regions except for any overlapping areas.
|
||
|
};
|
||
|
|
||
|
class WXDLLEXPORT wxRegion : public wxGDIObject {
|
||
|
DECLARE_DYNAMIC_CLASS(wxRegion);
|
||
|
friend class WXDLLEXPORT wxRegionIterator;
|
||
|
public:
|
||
|
wxRegion(long x, long y, long w, long h);
|
||
|
wxRegion(const wxPoint& topLeft, const wxPoint& bottomRight);
|
||
|
wxRegion(const wxRect& rect);
|
||
|
wxRegion();
|
||
|
~wxRegion();
|
||
|
|
||
|
//# Copying
|
||
|
inline wxRegion(const wxRegion& r)
|
||
|
{ Ref(r); }
|
||
|
inline wxRegion& operator = (const wxRegion& r)
|
||
|
{ Ref(r); return (*this); }
|
||
|
|
||
|
//# Modify region
|
||
|
// Clear current region
|
||
|
void Clear();
|
||
|
|
||
|
// Union rectangle or region with this.
|
||
|
inline bool Union(long x, long y, long width, long height) { return Combine(x, y, width, height, wxRGN_OR); }
|
||
|
inline bool Union(const wxRect& rect) { return Combine(rect, wxRGN_OR); }
|
||
|
inline bool Union(const wxRegion& region) { return Combine(region, wxRGN_OR); }
|
||
|
|
||
|
// Intersect rectangle or region with this.
|
||
|
inline bool Intersect(long x, long y, long width, long height) { return Combine(x, y, width, height, wxRGN_AND); }
|
||
|
inline bool Intersect(const wxRect& rect) { return Combine(rect, wxRGN_AND); }
|
||
|
inline bool Intersect(const wxRegion& region) { return Combine(region, wxRGN_AND); }
|
||
|
|
||
|
// Subtract rectangle or region from this:
|
||
|
// Combines the parts of 'this' that are not part of the second region.
|
||
|
inline bool Subtract(long x, long y, long width, long height) { return Combine(x, y, width, height, wxRGN_DIFF); }
|
||
|
inline bool Subtract(const wxRect& rect) { return Combine(rect, wxRGN_DIFF); }
|
||
|
inline bool Subtract(const wxRegion& region) { return Combine(region, wxRGN_DIFF); }
|
||
|
|
||
|
// XOR: the union of two combined regions except for any overlapping areas.
|
||
|
inline bool Xor(long x, long y, long width, long height) { return Combine(x, y, width, height, wxRGN_XOR); }
|
||
|
inline bool Xor(const wxRect& rect) { return Combine(rect, wxRGN_XOR); }
|
||
|
inline bool Xor(const wxRegion& region) { return Combine(region, wxRGN_XOR); }
|
||
|
|
||
|
//# Information on region
|
||
|
// Outer bounds of region
|
||
|
void GetBox(long& x, long& y, long&w, long &h) const;
|
||
|
wxRect GetBox() const ;
|
||
|
|
||
|
// Is region empty?
|
||
|
bool Empty() const;
|
||
|
inline bool IsEmpty() const { return Empty(); }
|
||
|
|
||
|
//# Tests
|
||
|
// Does the region contain the point (x,y)?
|
||
|
wxRegionContain Contains(long x, long y) const;
|
||
|
// Does the region contain the point pt?
|
||
|
wxRegionContain Contains(const wxPoint& pt) const;
|
||
|
// Does the region contain the rectangle (x, y, w, h)?
|
||
|
wxRegionContain Contains(long x, long y, long w, long h) const;
|
||
|
// Does the region contain the rectangle rect?
|
||
|
wxRegionContain Contains(const wxRect& rect) const;
|
||
|
|
||
|
// Internal
|
||
|
bool Combine(long x, long y, long width, long height, wxRegionOp op);
|
||
|
bool Combine(const wxRegion& region, wxRegionOp op);
|
||
|
bool Combine(const wxRect& rect, wxRegionOp op);
|
||
|
};
|
||
|
|
||
|
class WXDLLEXPORT wxRegionIterator : public wxObject {
|
||
|
DECLARE_DYNAMIC_CLASS(wxRegionIterator);
|
||
|
public:
|
||
|
wxRegionIterator();
|
||
|
wxRegionIterator(const wxRegion& region);
|
||
|
~wxRegionIterator();
|
||
|
|
||
|
void Reset() { m_current = 0; }
|
||
|
void Reset(const wxRegion& region);
|
||
|
|
||
|
operator bool () const { return m_current < m_numRects; }
|
||
|
bool HaveRects() const { return m_current < m_numRects; }
|
||
|
|
||
|
void operator ++ ();
|
||
|
void operator ++ (int);
|
||
|
|
||
|
long GetX() const;
|
||
|
long GetY() const;
|
||
|
long GetW() const;
|
||
|
long GetWidth() const { return GetW(); }
|
||
|
long GetH() const;
|
||
|
long GetHeight() const { return GetH(); }
|
||
|
wxRect GetRect() const { return wxRect(GetX(), GetY(), GetWidth(), GetHeight()); }
|
||
|
|
||
|
private:
|
||
|
long m_current;
|
||
|
long m_numRects;
|
||
|
wxRegion m_region;
|
||
|
wxRect* m_rects;
|
||
|
};
|
||
|
|
||
|
#endif
|
||
|
// _WX_REGION_H_
|