src/stringmap/rect.cpp
int RTreeOverlap(struct Rect *R, struct Rect *S)
{
	register struct Rect *r = R, *s = S;
	register int i, j;
	assert(r && s);

	for (i=0; i<NUMDIMS; i++)
	{
		j = i + NUMDIMS;  /* index for high sides */
		if (r->boundary[i] > s->boundary[j] ||
		    s->boundary[i] > r->boundary[j])
		{
			return FALSE;
		}
	}
	return TRUE;
}
/*-----------------------------------------------------------------------------
| Decide whether two rectangles overlap.
-----------------------------------------------------------------------------*/
| Decide whether two rectangles overlap.
| Decide whether two rectangles overlap .
int RTreeOverlap(struct Rect *R, struct Rect *S)
{
	register struct Rect *r = R, *s = S;
	register int i, j;
	assert(r && s);
	for (i=0; i<NUMDIMS; i++)
	{
		j = i + NUMDIMS;  
		if (r->boundary[i] > s->boundary[j] ||
		    s->boundary[i] > r->boundary[j])
		{
			return FALSE;
		}
	}
	return TRUE;
}
int RTreeOverlap ( struct Rect * R , struct Rect * S ) { register struct Rect * r = R , * s = S ; register int i , j ; assert ( r && s ) ; for ( i = 0 ; i < NUMDIMS ; i ++ ) { j = i + NUMDIMS ; if ( r -> boundary [ i ] > s -> boundary [ j ] || s -> boundary [ i ] > r -> boundary [ j ] ) { return FALSE ; } } return TRUE ; }
| Decide whether two rectangles overlap.
| Decide whether two rectangles overlap .
/* index for high sides */