示例#1
0
 int getTreeSegmentLimits(void *dbid, int nid, int idx, void **startPtr, void **endPtr)
{
	struct descriptor_xd *startXd, *endXd;
	EMPTYXD(emptyXd);

	startXd = (struct descriptor_xd *)malloc(sizeof(struct descriptor_xd));
	*startXd = emptyXd;
	endXd = (struct descriptor_xd *)malloc(sizeof(struct descriptor_xd));
	*endXd = emptyXd;

	*startPtr = startXd;
	*endPtr = endXd;
	return _TreeGetSegmentLimits(dbid, nid, idx, startXd, endXd);
}
示例#2
0
 int getTreeSegmentLimits(void *dbid, int nid, void **startPtr, void **endPtr, int isCached)
{
	struct descriptor_xd *startXd, *endXd;
	EMPTYXD(emptyXd);

	startXd = (struct descriptor_xd *)malloc(sizeof(struct descriptor_xd));
	*startXd = emptyXd;
	endXd = (struct descriptor_xd *)malloc(sizeof(struct descriptor_xd));
	*endXd = emptyXd;

	*startPtr = startXd;
	*endPtr = endXd;
	if(isCached)
		return _RTreeGetSegmentLimits(dbid, nid, -1, startXd, endXd);
	else
		return _TreeGetSegmentLimits(dbid, nid, -1, startXd, endXd);
}