ST_DistanceRectTreeCached()

Datum ST_DistanceRectTreeCached

(

PG_FUNCTION_ARGS

)

Definition at line 149 of file lwgeom_rectree.c.

{
        RectTreeGeomCache *tree_cache = NULL;
        GSERIALIZED *g1 = PG_GETARG_GSERIALIZED_P(0);
        GSERIALIZED *g2 = PG_GETARG_GSERIALIZED_P(1);
        LWGEOM *lwg1, *lwg2;
 
        /* Return NULL on empty arguments. */
        if (gserialized_is_empty(g1) || gserialized_is_empty(g2))
        {
                PG_FREE_IF_COPY(g1, 0);
                PG_FREE_IF_COPY(g2, 1);
                PG_RETURN_NULL();
        }
 
        lwg1 = lwgeom_from_gserialized(g1);
        lwg2 = lwgeom_from_gserialized(g2);
 
        /* Two points? Get outa here... */
        if (lwg1->type == POINTTYPE && lwg2->type == POINTTYPE)
                PG_RETURN_FLOAT8(lwgeom_mindistance2d(lwg1, lwg2));
 
        /* Fetch/build our cache, if appropriate, etc... */
        tree_cache = GetRectTreeGeomCache(fcinfo, g1, g2);
 
        if (tree_cache && tree_cache->gcache.argnum)
        {
                RECT_NODE *n;
                RECT_NODE *n_cached = tree_cache->index;;
                if (tree_cache->gcache.argnum == 1)
                {
                        n = rect_tree_from_lwgeom(lwg2);
                }
                else if (tree_cache->gcache.argnum == 2)
                {
                        n = rect_tree_from_lwgeom(lwg1);
                }
                else
                {
                        elog(ERROR, "reached unreachable block in %s", __func__);
                }
                PG_RETURN_FLOAT8(rect_tree_distance_tree(n, n_cached, 0.0));
        }
        else
        {
                PG_RETURN_FLOAT8(lwgeom_mindistance2d(lwg1, lwg2));
        }
 
        PG_RETURN_NULL();
}

References RectTreeGeomCache::gcache, GetRectTreeGeomCache(), gserialized_is_empty(), RectTreeGeomCache::index, lwgeom_from_gserialized(), lwgeom_mindistance2d(), POINTTYPE, rect_tree_distance_tree(), rect_tree_from_lwgeom(), and LWGEOM::type.

Here is the call graph for this function: