Definition at line 976 of file lwgeodetic_tree.c.
977{
978 uint32_t i = 0, j = 0;
981
982
985
986
988 for ( i = 0; i < lwcol->
ngeoms; i++ )
989 {
991 if ( node )
992 nodes[j++] = node;
993 }
994
996
998
1001 return node;
1002}
void * lwalloc(size_t size)
CIRC_NODE * lwgeom_calculate_circ_tree(const LWGEOM *lwgeom)
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 ...
static uint32_t lwgeom_get_type(const LWGEOM *geom)
Return LWTYPE number.
Note that p1 and p2 are pointers into an independent POINTARRAY, do not free them.
References circ_nodes_merge(), circ_nodes_sort(), sort_node::d, circ_node::geom_type, lwalloc(), lwfree(), lwgeom_calculate_circ_tree(), lwgeom_get_type(), and sort_node::node.
Referenced by lwgeom_calculate_circ_tree().