src/stringmap/node.cpp
void RTreePrintNode(struct Node *n, int depth) {
	int i;
	assert(n);

	RTreeTabIn(depth);
	printf("node");
	if (n->level == 0)
		printf(" LEAF");
	else if (n->level > 0)
		printf(" NONLEAF");
	else
		printf(" TYPE=?");
	printf("  level=%d  count=%d  address=%o\n", 
               n->level,
               n->count,
               static_cast<int>(reinterpret_cast<uintptr_t>(n)));

	for (i=0; i<n->count; i++) {
		if(n->level == 0) {
			// RTreeTabIn(depth);
			// printf("\t%d: data = %d\n", i, n->branch[i].child);
		} else {
			RTreeTabIn(depth);
			printf("branch %d\n", i);
			RTreePrintBranch(&n->branch[i], depth+1);
		}
	}
}
// Print out the data in a node.
//
Print out the data in a node.
Print out the data in a node .
void RTreePrintNode(struct Node *n, int depth) {
	int i;
	assert(n);
	RTreeTabIn(depth);
	printf("node");
	if (n->level == 0)
		printf(" LEAF");
	else if (n->level > 0)
		printf(" NONLEAF");
	else
		printf(" TYPE=?");
	printf("  level=%d  count=%d  address=%o\n", 
               n->level,
               n->count,
               static_cast<int>(reinterpret_cast<uintptr_t>(n)));
	for (i=0; i<n->count; i++) {
		if(n->level == 0) {
		} else {
			RTreeTabIn(depth);
			printf("branch %d\n", i);
			RTreePrintBranch(&n->branch[i], depth+1);
		}
	}
}
void RTreePrintNode ( struct Node * n , int depth ) { int i ; assert ( n ) ; RTreeTabIn ( depth ) ; printf ( " " ) ; if ( n -> level == 0 ) printf ( " " ) ; else if ( n -> level > 0 ) printf ( " " ) ; else printf ( " " ) ; printf ( " \n " , n -> level , n -> count , static_cast < int > ( reinterpret_cast < uintptr_t > ( n ) ) ) ; for ( i = 0 ; i < n -> count ; i ++ ) { if ( n -> level == 0 ) { } else { RTreeTabIn ( depth ) ; printf ( " \n " , i ) ; RTreePrintBranch ( & n -> branch [ i ] , depth + 1 ) ; } } }
Print out the data in a node.
Print out the data in a node .
// RTreeTabIn(depth); // printf("\t%d: data = %d\n", i, n->branch[i].child);