static int lwcollection_calculate_gbox_cartesian(LWCOLLECTION *coll, GBOX *gbox)
{
GBOX subbox;
int i;
int result = LW_FAILURE;
int first = LW_TRUE;
assert(coll);
if ( (coll->ngeoms == 0) || !gbox)
return LW_FAILURE;
subbox.flags = coll->flags;
for ( i = 0; i < coll->ngeoms; i++ )
{
if ( lwgeom_calculate_gbox_cartesian((LWGEOM*)(coll->geoms[i]), &subbox) == LW_SUCCESS )
{
/* Keep a copy of the sub-bounding box for later
if ( coll->geoms[i]->bbox )
lwfree(coll->geoms[i]->bbox);
coll->geoms[i]->bbox = gbox_copy(&subbox); */
if ( first )
{
gbox_duplicate(&subbox, gbox);
first = LW_FALSE;
}
else
{
gbox_merge(&subbox, gbox);
}
result = LW_SUCCESS;
}
}
return result;
}
static int lwcollection_calculate_gbox(LWCOLLECTION *coll, GBOX *gbox)
{
GBOX subbox;
int i;
int result = G_FAILURE;
int first = LW_TRUE;
assert(coll);
if ( coll->ngeoms == 0 )
return G_FAILURE;
subbox.flags = gbox->flags;
for ( i = 0; i < coll->ngeoms; i++ )
{
if ( lwgeom_calculate_gbox((LWGEOM*)(coll->geoms[i]), &subbox) == G_FAILURE )
{
continue;
}
else
{
if ( first )
{
gbox_duplicate(&subbox, gbox);
first = LW_FALSE;
}
else
{
gbox_merge(&subbox, gbox);
}
result = G_SUCCESS;
}
}
return result;
}
