src/stringmap/node.cpp
struct Node * RTreeNewNode()
{
	register struct Node *n;

	//n = new Node;
	n = (struct Node*)malloc(sizeof(struct Node));
	assert(n);
	RTreeInitNode(n);
	return n;
}
// Make a new node and initialize to have all branch cells empty.
//
Make a new node and initialize to have all branch cells empty.
Make a new node and initialize to have all branch cells empty .
struct Node * RTreeNewNode()
{
	register struct Node *n;
	n = (struct Node*)malloc(sizeof(struct Node));
	assert(n);
	RTreeInitNode(n);
	return n;
}
struct Node * RTreeNewNode ( ) { register struct Node * n ; n = ( struct Node * ) malloc ( sizeof ( struct Node ) ) ; assert ( n ) ; RTreeInitNode ( n ) ; return n ; }
Make a new node and initialize to have all branch cells empty.
Make a new node and initialize to have all branch cells empty .
//n = new Node;