src/stringmap/split_q.cpp
static void RTreeGetBranches(struct Node *n, struct Branch *b)
{
	register int i;

	assert(n);
	assert(b);

	/* load the branch buffer */
	for (i=0; i<NODECARD; i++)
	{
		assert(n->branch[i].child); /* n should have every entry full */
		BranchBuf[i] = n->branch[i];
	}
	BranchBuf[NODECARD] = *b;

	/* calculate rect containing all in the set */
	CoverSplit = BranchBuf[0].rect;
	for (i=1; i<NODECARD+1; i++)
	{
		CoverSplit = RTreeCombineRect(&CoverSplit, &BranchBuf[i].rect);
	}
	CoverSplitArea = RTreeRectSphericalVolume(&CoverSplit);

	RTreeInitNode(n);
}
/*-----------------------------------------------------------------------------
| Load branch buffer with branches from full node plus the extra branch.
-----------------------------------------------------------------------------*/
| Load branch buffer with branches from full node plus the extra branch.
| Load branch buffer with branches from full node plus the extra branch .
static void RTreeGetBranches(struct Node *n, struct Branch *b)
{
	register int i;
	assert(n);
	assert(b);
	for (i=0; i<NODECARD; i++)
	{
		assert(n->branch[i].child); 
		BranchBuf[i] = n->branch[i];
	}
	BranchBuf[NODECARD] = *b;
	CoverSplit = BranchBuf[0].rect;
	for (i=1; i<NODECARD+1; i++)
	{
		CoverSplit = RTreeCombineRect(&CoverSplit, &BranchBuf[i].rect);
	}
	CoverSplitArea = RTreeRectSphericalVolume(&CoverSplit);
	RTreeInitNode(n);
}
static void RTreeGetBranches ( struct Node * n , struct Branch * b ) { register int i ; assert ( n ) ; assert ( b ) ; for ( i = 0 ; i < NODECARD ; i ++ ) { assert ( n -> branch [ i ] . child ) ; BranchBuf [ i ] = n -> branch [ i ] ; } BranchBuf [ NODECARD ] = * b ; CoverSplit = BranchBuf [ 0 ] . rect ; for ( i = 1 ; i < NODECARD + 1 ; i ++ ) { CoverSplit = RTreeCombineRect ( & CoverSplit , & BranchBuf [ i ] . rect ) ; } CoverSplitArea = RTreeRectSphericalVolume ( & CoverSplit ) ; RTreeInitNode ( n ) ; }
| Load branch buffer with branches from full node plus the extra branch.
| Load branch buffer with branches from full node plus the extra branch .
/* load the branch buffer */ /* n should have every entry full */ /* calculate rect containing all in the set */