src/stringmap/rect.cpp
struct Rect RTreeCombineRect(struct Rect *R, struct Rect *Rr)
{
	register struct Rect *r = R, *rr = Rr;
	register int i, j;
	struct Rect new_rect;
	assert(r && rr);

	if (Undefined(r))
		return *rr;

	if (Undefined(rr))
		return *r;

	for (i = 0; i < NUMDIMS; i++)
	{
		new_rect.boundary[i] = MIN(r->boundary[i], rr->boundary[i]);
		j = i + NUMDIMS;
		new_rect.boundary[j] = MAX(r->boundary[j], rr->boundary[j]);
	}
	return new_rect;
}
/*-----------------------------------------------------------------------------
| Combine two rectangles, make one that includes both.
-----------------------------------------------------------------------------*/
| Combine two rectangles, make one that includes both.
| Combine two rectangles make one that includes both .
struct Rect RTreeCombineRect(struct Rect *R, struct Rect *Rr)
{
	register struct Rect *r = R, *rr = Rr;
	register int i, j;
	struct Rect new_rect;
	assert(r && rr);
	if (Undefined(r))
		return *rr;
	if (Undefined(rr))
		return *r;
	for (i = 0; i < NUMDIMS; i++)
	{
		new_rect.boundary[i] = MIN(r->boundary[i], rr->boundary[i]);
		j = i + NUMDIMS;
		new_rect.boundary[j] = MAX(r->boundary[j], rr->boundary[j]);
	}
	return new_rect;
}
struct Rect RTreeCombineRect ( struct Rect * R , struct Rect * Rr ) { register struct Rect * r = R , * rr = Rr ; register int i , j ; struct Rect new_rect ; assert ( r && rr ) ; if ( Undefined ( r ) ) return * rr ; if ( Undefined ( rr ) ) return * r ; for ( i = 0 ; i < NUMDIMS ; i ++ ) { new_rect . boundary [ i ] = MIN ( r -> boundary [ i ] , rr -> boundary [ i ] ) ; j = i + NUMDIMS ; new_rect . boundary [ j ] = MAX ( r -> boundary [ j ] , rr -> boundary [ j ] ) ; } return new_rect ; }
| Combine two rectangles, make one that includes both.
| Combine two rectangles make one that includes both .