src/gtk/region.cpp

/////////////////////////////////////////////////////////////////////////////
// Name:        region.cpp
// Purpose:
// Author:      Robert Roebling
// Id:          $Id$
// Copyright:   (c) 1998 Robert Roebling
// Licence:   	wxWindows licence
/////////////////////////////////////////////////////////////////////////////


#ifdef __GNUG__
#pragma implementation "region.h"
#endif

#include "wx/region.h"

//-----------------------------------------------------------------------------
// wxRegion
//-----------------------------------------------------------------------------

class wxRegionRefData: public wxObjectRefData
{
  public:

    wxRegionRefData(void);
    ~wxRegionRefData(void);

  public:

    GdkRegion  *m_region;
    wxList      m_rects;
};

wxRegionRefData::wxRegionRefData(void)
{
  m_region = (GdkRegion *) NULL;
}

wxRegionRefData::~wxRegionRefData(void)
{
  if (m_region) gdk_region_destroy( m_region );

  wxNode *node = m_rects.First();
  while (node)
  {
    wxRect *r = (wxRect*)node->Data();
    delete r;
    node = node->Next();
  }
}

//-----------------------------------------------------------------------------

#define M_REGIONDATA ((wxRegionRefData *)m_refData)

IMPLEMENT_DYNAMIC_CLASS(wxRegion,wxGDIObject);

wxRegion::wxRegion( long x, long y, long w, long h )
{
  m_refData = new wxRegionRefData();
  GdkRegion *reg = gdk_region_new();
  GdkRectangle rect;
  rect.x = x;
  rect.y = y;
  rect.width = w;
  rect.height = h;
  M_REGIONDATA->m_region = gdk_region_union_with_rect( reg, &rect );
  gdk_region_destroy( reg );
  M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(x,y,w,h) );
}

wxRegion::wxRegion( const wxPoint& topLeft, const wxPoint& bottomRight )
{
  m_refData = new wxRegionRefData();
  GdkRegion *reg = gdk_region_new();
  GdkRectangle rect;
  rect.x = topLeft.x;
  rect.y = topLeft.y;
  rect.width = bottomRight.x - rect.x;
  rect.height = bottomRight.y - rect.y;
  M_REGIONDATA->m_region = gdk_region_union_with_rect( reg, &rect );
  gdk_region_destroy( reg );
  M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(topLeft,bottomRight) );
}

wxRegion::wxRegion( const wxRect& rect )
{
  m_refData = new wxRegionRefData();
  GdkRegion *reg = gdk_region_new();
  GdkRectangle g_rect;
  g_rect.x = rect.x;
  g_rect.y = rect.y;
  g_rect.width = rect.width;
  g_rect.height = rect.height;
  M_REGIONDATA->m_region = gdk_region_union_with_rect( reg, &g_rect );
  gdk_region_destroy( reg );

  wxNode *node = M_REGIONDATA->m_rects.First();
  while (node)
  {
    wxRect *r = (wxRect*)node->Data();
    M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(r->x,r->y,r->width,r->height) );
    node = node->Next();
  }
}

wxRegion::wxRegion(void)
{
  m_refData = new wxRegionRefData();
  M_REGIONDATA->m_region = gdk_region_new();
}

wxRegion::~wxRegion(void)
{
}

void wxRegion::Clear(void)
{
  UnRef();
  m_refData = new wxRegionRefData();
  M_REGIONDATA->m_region = gdk_region_new();
}

bool wxRegion::Union( long x, long y, long width, long height )
{
  GdkRectangle rect;
  rect.x = x;
  rect.y = y;
  rect.width = width;
  rect.height = height;
  GdkRegion *reg = gdk_region_union_with_rect( M_REGIONDATA->m_region, &rect );
  gdk_region_destroy( M_REGIONDATA->m_region );
  M_REGIONDATA->m_region = reg;
  M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(x,y,width,height) );
  return TRUE;
}

bool wxRegion::Union( const wxRect& rect )
{
  GdkRectangle g_rect;
  g_rect.x = rect.x;
  g_rect.y = rect.y;
  g_rect.width = rect.width;
  g_rect.height = rect.height;
  GdkRegion *reg = gdk_region_union_with_rect( M_REGIONDATA->m_region, &g_rect );
  gdk_region_destroy( M_REGIONDATA->m_region );
  M_REGIONDATA->m_region = reg;
  M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(rect.x,rect.y,rect.width,rect.height) );
  return TRUE;
}

bool wxRegion::Union( const wxRegion& region )
{
  GdkRegion *reg = gdk_regions_union( M_REGIONDATA->m_region, region.GetRegion() );
  gdk_region_destroy( M_REGIONDATA->m_region );
  M_REGIONDATA->m_region = reg;

  wxNode *node = region.GetRectList()->First();
  while (node)
  {
    wxRect *r = (wxRect*)node->Data();
    M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(r->x,r->y,r->width,r->height) );
    node = node->Next();
  }

  return TRUE;
}

bool wxRegion::Intersect( long x, long y, long width, long height )
{
  wxRegion reg( x, y, width, height );
  Intersect( reg );
  return TRUE;
}

bool wxRegion::Intersect( const wxRect& rect )
{
  wxRegion reg( rect );
  Intersect( reg );
  return TRUE;
}

bool wxRegion::Intersect( const wxRegion& region )
{
  GdkRegion *reg = gdk_regions_intersect( M_REGIONDATA->m_region, region.GetRegion() );
  gdk_region_destroy( M_REGIONDATA->m_region );
  M_REGIONDATA->m_region = reg;
  return TRUE;
}

bool wxRegion::Subtract( long x, long y, long width, long height )
{
  wxRegion reg( x, y, width, height );
  Subtract( reg );
  return TRUE;
}

bool wxRegion::Subtract( const wxRect& rect )
{
  wxRegion reg( rect );
  Subtract( reg );
  return TRUE;
}

bool wxRegion::Subtract( const wxRegion& region )
{
  GdkRegion *reg = gdk_regions_subtract( M_REGIONDATA->m_region, region.GetRegion() );
  gdk_region_destroy( M_REGIONDATA->m_region );
  M_REGIONDATA->m_region = reg;
  return TRUE;
}

bool wxRegion::Xor( long x, long y, long width, long height )
{
  wxRegion reg( x, y, width, height );
  Xor( reg );
  return TRUE;
}

bool wxRegion::Xor( const wxRect& rect )
{
  wxRegion reg( rect );
  Xor( reg );
  return TRUE;
}

bool wxRegion::Xor( const wxRegion& region )
{
  GdkRegion *reg = gdk_regions_xor( M_REGIONDATA->m_region, region.GetRegion() );
  gdk_region_destroy( M_REGIONDATA->m_region );
  M_REGIONDATA->m_region = reg;

  wxNode *node = region.GetRectList()->First();
  while (node)
  {
    wxRect *r = (wxRect*)node->Data();
    M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(r->x,r->y,r->width,r->height) );
    node = node->Next();
  }

  return TRUE;
}

void wxRegion::GetBox( long& x, long& y, long&w, long &h ) const
{
  x = 0;
  y = 0;
  w = -1;
  h = -1;
  wxNode *node = GetRectList()->First();
  while (node)
  {
    wxRect *r = (wxRect*)node->Data();
    if (node == GetRectList()->First())
    {
      x = r->x;
      y = r->y;
      w = r->width;
      h = r->height;
    }
    else
    {
      if (r->x < x)
      {
        x = r->x;
        w += x - r->x;
      }
      if (r->y < y)
      {
        y = r->y;
        h += y - r->y;
      }
      if (r->width+r->x > x+w)
      {
        w = r->x + r->width - x;
      }
      if (r->height+r->y > y+h)
      {
        h = r->y + r->height - y;
      }
    }
    node = node->Next();
  }
}

wxRect wxRegion::GetBox(void) const
{
  long x = 0;
  long y = 0;
  long w = -1;
  long h = -1;
  GetBox( x, y, w, h );
  return wxRect( x, y, w, h );
}

bool wxRegion::Empty(void) const
{
  return gdk_region_empty( M_REGIONDATA->m_region );
}

wxRegionContain wxRegion::Contains( long x, long y ) const
{
  if (gdk_region_point_in( M_REGIONDATA->m_region, x, y ))
    return wxInRegion;
  else
    return wxOutRegion;
}

wxRegionContain wxRegion::Contains( long x, long y, long w, long h ) const
{
  GdkRectangle rect;
  rect.x = x;
  rect.y = y;
  rect.width = w;
  rect.height = h;
  GdkOverlapType res = gdk_region_rect_in( M_REGIONDATA->m_region, &rect );
  switch (res)
  {
   case GDK_OVERLAP_RECTANGLE_IN:   return wxInRegion;
   case GDK_OVERLAP_RECTANGLE_OUT:  return wxOutRegion;
   case GDK_OVERLAP_RECTANGLE_PART: return wxPartRegion;
  }
  return wxOutRegion;
}

wxRegionContain wxRegion::Contains(const wxPoint& pt) const
{
  return Contains( pt.x, pt.y );
}

wxRegionContain wxRegion::Contains(const wxRect& rect) const
{
  return Contains( rect.x, rect.y, rect.width, rect.height );
}

GdkRegion *wxRegion::GetRegion(void) const
{
  return M_REGIONDATA->m_region;
}

wxList *wxRegion::GetRectList() const
{
  return &(M_REGIONDATA->m_rects);
}

//-----------------------------------------------------------------------------
// wxRegion
//-----------------------------------------------------------------------------

IMPLEMENT_DYNAMIC_CLASS(wxRegionIterator,wxObject);

wxRegionIterator::wxRegionIterator(void)
{
  m_current = 0;
}

wxRegionIterator::wxRegionIterator( const wxRegion& region )
{
  m_region = region;
  m_current = 0;
}

void wxRegionIterator::Reset( const wxRegion& region )
{
  m_region = region;
  m_current = 0;
}

wxRegionIterator::operator bool (void) const
{
  return m_current < m_region.GetRectList()->Number();
}

bool wxRegionIterator::HaveRects(void) const
{
  return m_current < m_region.GetRectList()->Number();
}

void wxRegionIterator::operator ++ (void)
{
  if (m_current < m_region.GetRectList()->Number()) ++m_current;
}

void wxRegionIterator::operator ++ (int)
{
  if (m_current < m_region.GetRectList()->Number()) ++m_current;
}

long wxRegionIterator::GetX(void) const
{
  wxNode *node = m_region.GetRectList()->Nth( m_current );
  if (!node) return 0;
  wxRect *r = (wxRect*)node->Data();
  return r->x;
}

long wxRegionIterator::GetY(void) const
{
  wxNode *node = m_region.GetRectList()->Nth( m_current );
  if (!node) return 0;
  wxRect *r = (wxRect*)node->Data();
  return r->y;
}

long wxRegionIterator::GetW(void) const
{
  wxNode *node = m_region.GetRectList()->Nth( m_current );
  if (!node) return 0;
  wxRect *r = (wxRect*)node->Data();
  return r->width;
}

long wxRegionIterator::GetH(void) const
{
  wxNode *node = m_region.GetRectList()->Nth( m_current );
  if (!node) return 0;
  wxRect *r = (wxRect*)node->Data();
  return r->height;
}
Commit	Line	Data
	1	/////////////////////////////////////////////////////////////////////////////
	2	// Name: region.cpp
	3	// Purpose:
	4	// Author: Robert Roebling
	5	// Id: $Id$
	6	// Copyright: (c) 1998 Robert Roebling
	7	// Licence: wxWindows licence
	8	/////////////////////////////////////////////////////////////////////////////
	9
	10
	11	#ifdef __GNUG__
	12	#pragma implementation "region.h"
	13	#endif
	14
	15	#include "wx/region.h"
	16
	17	//-----------------------------------------------------------------------------
	18	// wxRegion
	19	//-----------------------------------------------------------------------------
	20
	21	class wxRegionRefData: public wxObjectRefData
	22	{
	23	public:
	24
	25	wxRegionRefData(void);
	26	~wxRegionRefData(void);
	27
	28	public:
	29
	30	GdkRegion *m_region;
	31	wxList m_rects;
	32	};
	33
	34	wxRegionRefData::wxRegionRefData(void)
	35	{
	36	m_region = (GdkRegion *) NULL;
	37	}
	38
	39	wxRegionRefData::~wxRegionRefData(void)
	40	{
	41	if (m_region) gdk_region_destroy( m_region );
	42
	43	wxNode *node = m_rects.First();
	44	while (node)
	45	{
	46	wxRect r = (wxRect)node->Data();
	47	delete r;
	48	node = node->Next();
	49	}
	50	}
	51
	52	//-----------------------------------------------------------------------------
	53
	54	#define M_REGIONDATA ((wxRegionRefData *)m_refData)
	55
	56	IMPLEMENT_DYNAMIC_CLASS(wxRegion,wxGDIObject);
	57
	58	wxRegion::wxRegion( long x, long y, long w, long h )
	59	{
	60	m_refData = new wxRegionRefData();
	61	GdkRegion *reg = gdk_region_new();
	62	GdkRectangle rect;
	63	rect.x = x;
	64	rect.y = y;
	65	rect.width = w;
	66	rect.height = h;
	67	M_REGIONDATA->m_region = gdk_region_union_with_rect( reg, &rect );
	68	gdk_region_destroy( reg );
	69	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(x,y,w,h) );
	70	}
	71
	72	wxRegion::wxRegion( const wxPoint& topLeft, const wxPoint& bottomRight )
	73	{
	74	m_refData = new wxRegionRefData();
	75	GdkRegion *reg = gdk_region_new();
	76	GdkRectangle rect;
	77	rect.x = topLeft.x;
	78	rect.y = topLeft.y;
	79	rect.width = bottomRight.x - rect.x;
	80	rect.height = bottomRight.y - rect.y;
	81	M_REGIONDATA->m_region = gdk_region_union_with_rect( reg, &rect );
	82	gdk_region_destroy( reg );
	83	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(topLeft,bottomRight) );
	84	}
	85
	86	wxRegion::wxRegion( const wxRect& rect )
	87	{
	88	m_refData = new wxRegionRefData();
	89	GdkRegion *reg = gdk_region_new();
	90	GdkRectangle g_rect;
	91	g_rect.x = rect.x;
	92	g_rect.y = rect.y;
	93	g_rect.width = rect.width;
	94	g_rect.height = rect.height;
	95	M_REGIONDATA->m_region = gdk_region_union_with_rect( reg, &g_rect );
	96	gdk_region_destroy( reg );
	97
	98	wxNode *node = M_REGIONDATA->m_rects.First();
	99	while (node)
	100	{
	101	wxRect r = (wxRect)node->Data();
	102	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(r->x,r->y,r->width,r->height) );
	103	node = node->Next();
	104	}
	105	}
	106
	107	wxRegion::wxRegion(void)
	108	{
	109	m_refData = new wxRegionRefData();
	110	M_REGIONDATA->m_region = gdk_region_new();
	111	}
	112
	113	wxRegion::~wxRegion(void)
	114	{
	115	}
	116
	117	void wxRegion::Clear(void)
	118	{
	119	UnRef();
	120	m_refData = new wxRegionRefData();
	121	M_REGIONDATA->m_region = gdk_region_new();
	122	}
	123
	124	bool wxRegion::Union( long x, long y, long width, long height )
	125	{
	126	GdkRectangle rect;
	127	rect.x = x;
	128	rect.y = y;
	129	rect.width = width;
	130	rect.height = height;
	131	GdkRegion *reg = gdk_region_union_with_rect( M_REGIONDATA->m_region, &rect );
	132	gdk_region_destroy( M_REGIONDATA->m_region );
	133	M_REGIONDATA->m_region = reg;
	134	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(x,y,width,height) );
	135	return TRUE;
	136	}
	137
	138	bool wxRegion::Union( const wxRect& rect )
	139	{
	140	GdkRectangle g_rect;
	141	g_rect.x = rect.x;
	142	g_rect.y = rect.y;
	143	g_rect.width = rect.width;
	144	g_rect.height = rect.height;
	145	GdkRegion *reg = gdk_region_union_with_rect( M_REGIONDATA->m_region, &g_rect );
	146	gdk_region_destroy( M_REGIONDATA->m_region );
	147	M_REGIONDATA->m_region = reg;
	148	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(rect.x,rect.y,rect.width,rect.height) );
	149	return TRUE;
	150	}
	151
	152	bool wxRegion::Union( const wxRegion& region )
	153	{
	154	GdkRegion *reg = gdk_regions_union( M_REGIONDATA->m_region, region.GetRegion() );
	155	gdk_region_destroy( M_REGIONDATA->m_region );
	156	M_REGIONDATA->m_region = reg;
	157
	158	wxNode *node = region.GetRectList()->First();
	159	while (node)
	160	{
	161	wxRect r = (wxRect)node->Data();
	162	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(r->x,r->y,r->width,r->height) );
	163	node = node->Next();
	164	}
	165
	166	return TRUE;
	167	}
	168
	169	bool wxRegion::Intersect( long x, long y, long width, long height )
	170	{
	171	wxRegion reg( x, y, width, height );
	172	Intersect( reg );
	173	return TRUE;
	174	}
	175
	176	bool wxRegion::Intersect( const wxRect& rect )
	177	{
	178	wxRegion reg( rect );
	179	Intersect( reg );
	180	return TRUE;
	181	}
	182
	183	bool wxRegion::Intersect( const wxRegion& region )
	184	{
	185	GdkRegion *reg = gdk_regions_intersect( M_REGIONDATA->m_region, region.GetRegion() );
	186	gdk_region_destroy( M_REGIONDATA->m_region );
	187	M_REGIONDATA->m_region = reg;
	188	return TRUE;
	189	}
	190
	191	bool wxRegion::Subtract( long x, long y, long width, long height )
	192	{
	193	wxRegion reg( x, y, width, height );
	194	Subtract( reg );
	195	return TRUE;
	196	}
	197
	198	bool wxRegion::Subtract( const wxRect& rect )
	199	{
	200	wxRegion reg( rect );
	201	Subtract( reg );
	202	return TRUE;
	203	}
	204
	205	bool wxRegion::Subtract( const wxRegion& region )
	206	{
	207	GdkRegion *reg = gdk_regions_subtract( M_REGIONDATA->m_region, region.GetRegion() );
	208	gdk_region_destroy( M_REGIONDATA->m_region );
	209	M_REGIONDATA->m_region = reg;
	210	return TRUE;
	211	}
	212
	213	bool wxRegion::Xor( long x, long y, long width, long height )
	214	{
	215	wxRegion reg( x, y, width, height );
	216	Xor( reg );
	217	return TRUE;
	218	}
	219
	220	bool wxRegion::Xor( const wxRect& rect )
	221	{
	222	wxRegion reg( rect );
	223	Xor( reg );
	224	return TRUE;
	225	}
	226
	227	bool wxRegion::Xor( const wxRegion& region )
	228	{
	229	GdkRegion *reg = gdk_regions_xor( M_REGIONDATA->m_region, region.GetRegion() );
	230	gdk_region_destroy( M_REGIONDATA->m_region );
	231	M_REGIONDATA->m_region = reg;
	232
	233	wxNode *node = region.GetRectList()->First();
	234	while (node)
	235	{
	236	wxRect r = (wxRect)node->Data();
	237	M_REGIONDATA->m_rects.Append( (wxObject*) new wxRect(r->x,r->y,r->width,r->height) );
	238	node = node->Next();
	239	}
	240
	241	return TRUE;
	242	}
	243
	244	void wxRegion::GetBox( long& x, long& y, long&w, long &h ) const
	245	{
	246	x = 0;
	247	y = 0;
	248	w = -1;
	249	h = -1;
	250	wxNode *node = GetRectList()->First();
	251	while (node)
	252	{
	253	wxRect r = (wxRect)node->Data();
	254	if (node == GetRectList()->First())
	255	{
	256	x = r->x;
	257	y = r->y;
	258	w = r->width;
	259	h = r->height;
	260	}
	261	else
	262	{
	263	if (r->x < x)
	264	{
	265	x = r->x;
	266	w += x - r->x;
	267	}
	268	if (r->y < y)
	269	{
	270	y = r->y;
	271	h += y - r->y;
	272	}
	273	if (r->width+r->x > x+w)
	274	{
	275	w = r->x + r->width - x;
	276	}
	277	if (r->height+r->y > y+h)
	278	{
	279	h = r->y + r->height - y;
	280	}
	281	}
	282	node = node->Next();
	283	}
	284	}
	285
	286	wxRect wxRegion::GetBox(void) const
	287	{
	288	long x = 0;
	289	long y = 0;
	290	long w = -1;
	291	long h = -1;
	292	GetBox( x, y, w, h );
	293	return wxRect( x, y, w, h );
	294	}
	295
	296	bool wxRegion::Empty(void) const
	297	{
	298	return gdk_region_empty( M_REGIONDATA->m_region );
	299	}
	300
	301	wxRegionContain wxRegion::Contains( long x, long y ) const
	302	{
	303	if (gdk_region_point_in( M_REGIONDATA->m_region, x, y ))
	304	return wxInRegion;
	305	else
	306	return wxOutRegion;
	307	}
	308
	309	wxRegionContain wxRegion::Contains( long x, long y, long w, long h ) const
	310	{
	311	GdkRectangle rect;
	312	rect.x = x;
	313	rect.y = y;
	314	rect.width = w;
	315	rect.height = h;
	316	GdkOverlapType res = gdk_region_rect_in( M_REGIONDATA->m_region, &rect );
	317	switch (res)
	318	{
	319	case GDK_OVERLAP_RECTANGLE_IN: return wxInRegion;
	320	case GDK_OVERLAP_RECTANGLE_OUT: return wxOutRegion;
	321	case GDK_OVERLAP_RECTANGLE_PART: return wxPartRegion;
	322	}
	323	return wxOutRegion;
	324	}
	325
	326	wxRegionContain wxRegion::Contains(const wxPoint& pt) const
	327	{
	328	return Contains( pt.x, pt.y );
	329	}
	330
	331	wxRegionContain wxRegion::Contains(const wxRect& rect) const
	332	{
	333	return Contains( rect.x, rect.y, rect.width, rect.height );
	334	}
	335
	336	GdkRegion *wxRegion::GetRegion(void) const
	337	{
	338	return M_REGIONDATA->m_region;
	339	}
	340
	341	wxList *wxRegion::GetRectList() const
	342	{
	343	return &(M_REGIONDATA->m_rects);
	344	}
	345
	346	//-----------------------------------------------------------------------------
	347	// wxRegion
	348	//-----------------------------------------------------------------------------
	349
	350	IMPLEMENT_DYNAMIC_CLASS(wxRegionIterator,wxObject);
	351
	352	wxRegionIterator::wxRegionIterator(void)
	353	{
	354	m_current = 0;
	355	}
	356
	357	wxRegionIterator::wxRegionIterator( const wxRegion& region )
	358	{
	359	m_region = region;
	360	m_current = 0;
	361	}
	362
	363	void wxRegionIterator::Reset( const wxRegion& region )
	364	{
	365	m_region = region;
	366	m_current = 0;
	367	}
	368
	369	wxRegionIterator::operator bool (void) const
	370	{
	371	return m_current < m_region.GetRectList()->Number();
	372	}
	373
	374	bool wxRegionIterator::HaveRects(void) const
	375	{
	376	return m_current < m_region.GetRectList()->Number();
	377	}
	378
	379	void wxRegionIterator::operator ++ (void)
	380	{
	381	if (m_current < m_region.GetRectList()->Number()) ++m_current;
	382	}
	383
	384	void wxRegionIterator::operator ++ (int)
	385	{
	386	if (m_current < m_region.GetRectList()->Number()) ++m_current;
	387	}
	388
	389	long wxRegionIterator::GetX(void) const
	390	{
	391	wxNode *node = m_region.GetRectList()->Nth( m_current );
	392	if (!node) return 0;
	393	wxRect r = (wxRect)node->Data();
	394	return r->x;
	395	}
	396
	397	long wxRegionIterator::GetY(void) const
	398	{
	399	wxNode *node = m_region.GetRectList()->Nth( m_current );
	400	if (!node) return 0;
	401	wxRect r = (wxRect)node->Data();
	402	return r->y;
	403	}
	404
	405	long wxRegionIterator::GetW(void) const
	406	{
	407	wxNode *node = m_region.GetRectList()->Nth( m_current );
	408	if (!node) return 0;
	409	wxRect r = (wxRect)node->Data();
	410	return r->width;
	411	}
	412
	413	long wxRegionIterator::GetH(void) const
	414	{
	415	wxNode *node = m_region.GetRectList()->Nth( m_current );
	416	if (!node) return 0;
	417	wxRect r = (wxRect)node->Data();
	418	return r->height;
	419	}
	420
	421