Definition at line 269 of file intervaltree.c.
270{
272 if (mpoly->
ngeoms == 0)
return itree;
273
277
281
282 for (uint32_t i = 0; i < mpoly->
ngeoms; i++)
283 {
285
286
288 continue;
289
290 for (uint32_t j = 0; j < poly->
nrings; j++)
291 {
293
294
296 continue;
297
299
301 }
302
304 }
305 return itree;
306}
static void itree_add_pointarray(IntervalTree *itree, const POINTARRAY *pa)
static uint32_t itree_num_rings(const LWMPOLY *mpoly)
static uint32_t itree_num_nodes_multipolygon(const LWMPOLY *mpoly)
void * lwalloc0(size_t sz)
int lwpoly_is_empty(const LWPOLY *poly)
struct IntervalTreeNode * nodes
struct IntervalTreeNode ** indexes
POINTARRAY ** indexArrays
References LWMPOLY::geoms, IntervalTree::indexArrays, IntervalTree::indexes, itree_add_pointarray(), itree_num_nodes_multipolygon(), itree_num_rings(), lwalloc0(), lwpoly_is_empty(), IntervalTree::maxNodes, LWMPOLY::ngeoms, IntervalTree::nodes, POINTARRAY::npoints, LWPOLY::nrings, IntervalTree::numNodes, IntervalTree::numPolys, IntervalTree::ringCounts, and LWPOLY::rings.
Referenced by itree_from_lwgeom().