src/stringmap/split_l.cpp
static void RTreeMethodZero(struct PartitionVars *p, int minfill)
{
	RTreeInitPVars(p, BranchCount, minfill);
	RTreePickSeeds(p);
	RTreePigeonhole(p);
}
/*-----------------------------------------------------------------------------
| Method 0 for finding a partition:
| First find two seeds, one for each group, well separated.
| Then put other rects in whichever group will be smallest after addition.
-----------------------------------------------------------------------------*/
| Method 0 for finding a partition:
| First find two seeds, one for each group, well separated.
| Then put other rects in whichever group will be smallest after addition.
| Method 0 for finding a partition : | First find two seeds one for each group well separated . | Then put other rects in whichever group will be smallest after addition .
static void RTreeMethodZero(struct PartitionVars *p, int minfill)
{
	RTreeInitPVars(p, BranchCount, minfill);
	RTreePickSeeds(p);
	RTreePigeonhole(p);
}
static void RTreeMethodZero ( struct PartitionVars * p , int minfill ) { RTreeInitPVars ( p , BranchCount , minfill ) ; RTreePickSeeds ( p ) ; RTreePigeonhole ( p ) ; }
| Method 0 for finding a partition:
| First find two seeds, one for each group, well separated.
| Method 0 for finding a partition : | First find two seeds one for each group well separated .