src/mattree/Rect.cpp
struct Rect RTreeNullRect()
{
	struct Rect r;
	//register int i;

	r.boundary[0] = (RectReal)1;
	r.boundary[NUMDIMS-1] = (RectReal)-1;
	
	/*for (i=1; i<NUMDIMS; i++)
		r.boundary[i] = r.boundary[i+NUMDIMS] = (RectReal)0;*/
	/*comment by liang*/
	//memset(r.trie, ' ', TRIELEN);
	//memset(r.minstr, ' ', MAXLEN);
	//memset(r.maxstr, ' ', MAXLEN);
	//r.trie = new char[MAXLEN];
	//r.trie = new string();
	
	return r;
}
/*-----------------------------------------------------------------------------
| Return a rect whose first low side is higher than its opposite side -
| interpreted as an uintptr_t rect.
-----------------------------------------------------------------------------*/
| Return a rect whose first low side is higher than its opposite side
| interpreted as an uintptr_t rect.
| Return a rect whose first low side is higher than its opposite side | interpreted as an uintptr_t rect .
struct Rect RTreeNullRect()
{
	struct Rect r;
	r.boundary[0] = (RectReal)1;
	r.boundary[NUMDIMS-1] = (RectReal)-1;
	return r;
}
struct Rect RTreeNullRect ( ) { struct Rect r ; r . boundary [ 0 ] = ( RectReal ) 1 ; r . boundary [ NUMDIMS - 1 ] = ( RectReal ) - 1 ; return r ; }
| Return a rect whose first low side is higher than its opposite side
| interpreted as an uintptr_t rect.
| Return a rect whose first low side is higher than its opposite side | interpreted as an uintptr_t rect .
//register int i; /*for (i=1; i<NUMDIMS; i++)
		r.boundary[i] = r.boundary[i+NUMDIMS] = (RectReal)0;*/ /*comment by liang*/ //memset(r.trie, ' ', TRIELEN); //memset(r.minstr, ' ', MAXLEN);
 //memset(r.maxstr, ' ', MAXLEN);
 //r.trie = new char[MAXLEN];
 //r.trie = new string();