src/stringmap/split_q.cpp
static void RTreeClassify(int i, int group, struct PartitionVars *p)
{
	assert(p);
	assert(!p->taken[i]);

	p->partition[i] = group;
	p->taken[i] = TRUE;

	if (p->count[group] == 0)
		p->cover[group] = BranchBuf[i].rect;
	else
		p->cover[group] =
			RTreeCombineRect(&BranchBuf[i].rect, &p->cover[group]);
	p->area[group] = RTreeRectSphericalVolume(&p->cover[group]);
	p->count[group]++;
}
/*-----------------------------------------------------------------------------
| Put a branch in one of the groups.
-----------------------------------------------------------------------------*/
| Put a branch in one of the groups.
| Put a branch in one of the groups .
static void RTreeClassify(int i, int group, struct PartitionVars *p)
{
	assert(p);
	assert(!p->taken[i]);
	p->partition[i] = group;
	p->taken[i] = TRUE;
	if (p->count[group] == 0)
		p->cover[group] = BranchBuf[i].rect;
	else
		p->cover[group] =
			RTreeCombineRect(&BranchBuf[i].rect, &p->cover[group]);
	p->area[group] = RTreeRectSphericalVolume(&p->cover[group]);
	p->count[group]++;
}
static void RTreeClassify ( int i , int group , struct PartitionVars * p ) { assert ( p ) ; assert ( ! p -> taken [ i ] ) ; p -> partition [ i ] = group ; p -> taken [ i ] = TRUE ; if ( p -> count [ group ] == 0 ) p -> cover [ group ] = BranchBuf [ i ] . rect ; else p -> cover [ group ] = RTreeCombineRect ( & BranchBuf [ i ] . rect , & p -> cover [ group ] ) ; p -> area [ group ] = RTreeRectSphericalVolume ( & p -> cover [ group ] ) ; p -> count [ group ] ++ ; }
| Put a branch in one of the groups.
| Put a branch in one of the groups .