ST_IntersectsIntervalTree()

Datum ST_IntersectsIntervalTree

(

PG_FUNCTION_ARGS

)

Definition at line 251 of file lwgeom_itree.c.

{
        GSERIALIZED *g1 = PG_GETARG_GSERIALIZED_P(0);
        GSERIALIZED *g2 = PG_GETARG_GSERIALIZED_P(1);
        LWGEOM *lwg1, *lwg2;
        LWPOINT *lwpt;
        IntervalTree *itree = NULL;
        bool isPoly1, isPoly2, isPt1, isPt2;
 
        /* Return false 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_BOOL(false);
        }
 
        lwg1 = lwgeom_from_gserialized(g1);
        lwg2 = lwgeom_from_gserialized(g2);
 
        isPoly1 = lwg1->type == POLYGONTYPE || lwg1->type == MULTIPOLYGONTYPE;
        isPoly2 = lwg2->type == POLYGONTYPE || lwg2->type == MULTIPOLYGONTYPE;
        isPt1 = lwg1->type == POINTTYPE;
        isPt2 = lwg2->type == POINTTYPE;
 
        /* Two points? Get outa here... */
        if (isPoly1 && isPt2)
        {
                itree = itree_from_lwgeom(lwg1);
                lwpt = lwgeom_as_lwpoint(lwg2);
        }
        else if (isPoly2 && isPt1)
        {
                itree = itree_from_lwgeom(lwg2);
                lwpt = lwgeom_as_lwpoint(lwg1);
        }
 
        if (!itree)
                elog(ERROR, "arguments to %s must a point and a polygon", __func__);
 
        PG_RETURN_BOOL(itree_point_in_multipolygon(itree, lwpt) != ITREE_OUTSIDE);
}

References gserialized_is_empty(), itree_from_lwgeom(), ITREE_OUTSIDE, itree_point_in_multipolygon(), lwgeom_as_lwpoint(), lwgeom_from_gserialized(), MULTIPOLYGONTYPE, POINTTYPE, POLYGONTYPE, and LWGEOM::type.

Here is the call graph for this function: