PostGIS  2.4.9dev-r@@SVN_REVISION@@

◆ lwcollection_calculate_circ_tree()

static CIRC_NODE* lwcollection_calculate_circ_tree ( const LWCOLLECTION lwcol)
static

Definition at line 925 of file lwgeodetic_tree.c.

References circ_nodes_merge(), circ_nodes_sort(), circ_node::geom_type, LWCOLLECTION::geoms, lwalloc(), lwfree(), lwgeom_calculate_circ_tree(), lwgeom_get_type(), and LWCOLLECTION::ngeoms.

Referenced by lwgeom_calculate_circ_tree().

926 {
927  int i = 0, j = 0;
928  CIRC_NODE** nodes;
929  CIRC_NODE* node;
930 
931  /* One geometry? Done! */
932  if ( lwcol->ngeoms == 1 )
933  return lwgeom_calculate_circ_tree(lwcol->geoms[0]);
934 
935  /* Calculate a tree for each sub-geometry*/
936  nodes = lwalloc(lwcol->ngeoms * sizeof(CIRC_NODE*));
937  for ( i = 0; i < lwcol->ngeoms; i++ )
938  {
939  node = lwgeom_calculate_circ_tree(lwcol->geoms[i]);
940  if ( node )
941  nodes[j++] = node;
942  }
943  /* Put the trees into a spatially correlated order */
944  circ_nodes_sort(nodes, j);
945  /* Merge the trees pairwise up to a parent node and return */
946  node = circ_nodes_merge(nodes, j);
947  /* Don't need the working list any more */
948  lwfree(nodes);
949  node->geom_type = lwgeom_get_type((LWGEOM*)lwcol);
950  return node;
951 }
Note that p1 and p2 are pointers into an independent POINTARRAY, do not free them.
void lwfree(void *mem)
Definition: lwutil.c:244
uint32_t lwgeom_get_type(const LWGEOM *geom)
Return LWTYPE number.
Definition: lwgeom.c:878
CIRC_NODE * lwgeom_calculate_circ_tree(const LWGEOM *lwgeom)
LWGEOM ** geoms
Definition: liblwgeom.h:509
static CIRC_NODE * circ_nodes_merge(CIRC_NODE **nodes, int num_nodes)
static void circ_nodes_sort(CIRC_NODE **nodes, int num_nodes)
Given a list of nodes, sort them into a spatially consistent order, then pairwise merge them up into ...
void * lwalloc(size_t size)
Definition: lwutil.c:229
Here is the call graph for this function:
Here is the caller graph for this function: