GetIntervalTree()

IntervalTree* GetIntervalTree	(	FunctionCallInfo	fcinfo,
		SHARED_GSERIALIZED *	g1
	)

Checks for a cache hit against the provided geometry and returns a pre-built index structure (RTREE_POLY_CACHE) if one exists.

Otherwise builds a new one and returns that.

Definition at line 114 of file lwgeom_itree.c.

{
        const GSERIALIZED *poly1;
        LWGEOM *lwpoly1;
 
        IntervalTree *itree = NULL;
        IntervalTreeGeomCache *cache = (IntervalTreeGeomCache*)GetGeomCache(fcinfo, &IntervalTreeCacheMethods, g1, NULL);
 
        /* Found a cached tree */
        if (cache && cache->itree)
                return cache->itree;
 
        /* Build one on the fly */
        poly1 = shared_gserialized_get(g1);
        lwpoly1 = lwgeom_from_gserialized(poly1);
        itree = itree_from_lwgeom(lwpoly1);
        lwgeom_free(lwpoly1);
        return itree;
}

References IntervalTreeCacheMethods, IntervalTreeGeomCache::itree, itree_from_lwgeom(), lwgeom_free(), and lwgeom_from_gserialized().

Referenced by contains(), coveredby(), covers(), ST_Intersects(), and within().

Here is the call graph for this function:

Here is the caller graph for this function: