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

	assert(n);
	assert(b);

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

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

	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 struct Node *n = N;
	register struct Branch *b = 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;
	BranchCount = NODECARD + 1;
	CoverSplit = BranchBuf[0].rect;
	for (i=1; i<NODECARD+1; i++)
	{
		CoverSplit = RTreeCombineRect(&CoverSplit, &BranchBuf[i].rect);
	}
	RTreeInitNode(n);
}
static void RTreeGetBranches ( struct Node * N , struct Branch * B ) { register struct Node * n = N ; register struct Branch * b = 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 ; BranchCount = NODECARD + 1 ; CoverSplit = BranchBuf [ 0 ] . rect ; for ( i = 1 ; i < NODECARD + 1 ; i ++ ) { CoverSplit = RTreeCombineRect ( & CoverSplit , & BranchBuf [ i ] . rect ) ; } 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 */ /* every entry should be full */ /* calculate rect containing all in the set */