src/stringmap/split_q.cpp
static void RTreePrintPVars(struct PartitionVars *p)
{
	register int i;
	assert(p);

	printf("\npartition:\n");
	for (i=0; i<NODECARD+1; i++)
	{
		printf("%3d\t", i);
	}
	printf("\n");
	for (i=0; i<NODECARD+1; i++)
	{
		if (p->taken[i])
			printf("  t\t");
		else
			printf("\t");
	}
	printf("\n");
	for (i=0; i<NODECARD+1; i++)
	{
		printf("%3d\t", p->partition[i]);
	}
	printf("\n");

	printf("count[0] = %d  area = %f\n", p->count[0], p->area[0]);
	printf("count[1] = %d  area = %f\n", p->count[1], p->area[1]);
	if (p->area[0] + p->area[1] > 0)
	{
		printf("total area = %f  effectiveness = %3.2f\n",
			p->area[0] + p->area[1],
			(float)CoverSplitArea / (p->area[0] + p->area[1]));
	}
	printf("cover[0]:\n");
	RTreePrintRect(&p->cover[0], 0);

	printf("cover[1]:\n");
	RTreePrintRect(&p->cover[1], 0);
}
/*-----------------------------------------------------------------------------
| Print out data for a partition from PartitionVars struct.
-----------------------------------------------------------------------------*/
| Print out data for a partition from PartitionVars struct.
| Print out data for a partition from PartitionVars struct .
static void RTreePrintPVars(struct PartitionVars *p)
{
	register int i;
	assert(p);
	printf("\npartition:\n");
	for (i=0; i<NODECARD+1; i++)
	{
		printf("%3d\t", i);
	}
	printf("\n");
	for (i=0; i<NODECARD+1; i++)
	{
		if (p->taken[i])
			printf("  t\t");
		else
			printf("\t");
	}
	printf("\n");
	for (i=0; i<NODECARD+1; i++)
	{
		printf("%3d\t", p->partition[i]);
	}
	printf("\n");
	printf("count[0] = %d  area = %f\n", p->count[0], p->area[0]);
	printf("count[1] = %d  area = %f\n", p->count[1], p->area[1]);
	if (p->area[0] + p->area[1] > 0)
	{
		printf("total area = %f  effectiveness = %3.2f\n",
			p->area[0] + p->area[1],
			(float)CoverSplitArea / (p->area[0] + p->area[1]));
	}
	printf("cover[0]:\n");
	RTreePrintRect(&p->cover[0], 0);
	printf("cover[1]:\n");
	RTreePrintRect(&p->cover[1], 0);
}
static void RTreePrintPVars ( struct PartitionVars * p ) { register int i ; assert ( p ) ; printf ( " \n \n " ) ; for ( i = 0 ; i < NODECARD + 1 ; i ++ ) { printf ( " \t " , i ) ; } printf ( " \n " ) ; for ( i = 0 ; i < NODECARD + 1 ; i ++ ) { if ( p -> taken [ i ] ) printf ( " \t " ) ; else printf ( " \t " ) ; } printf ( " \n " ) ; for ( i = 0 ; i < NODECARD + 1 ; i ++ ) { printf ( " \t " , p -> partition [ i ] ) ; } printf ( " \n " ) ; printf ( " \n " , p -> count [ 0 ] , p -> area [ 0 ] ) ; printf ( " \n " , p -> count [ 1 ] , p -> area [ 1 ] ) ; if ( p -> area [ 0 ] + p -> area [ 1 ] > 0 ) { printf ( " \n " , p -> area [ 0 ] + p -> area [ 1 ] , ( float ) CoverSplitArea / ( p -> area [ 0 ] + p -> area [ 1 ] ) ) ; } printf ( " \n " ) ; RTreePrintRect ( & p -> cover [ 0 ] , 0 ) ; printf ( " \n " ) ; RTreePrintRect ( & p -> cover [ 1 ] , 0 ) ; }
| Print out data for a partition from PartitionVars struct.
| Print out data for a partition from PartitionVars struct .