lwtriangle_from_wkb_state()

static LWTRIANGLE* lwtriangle_from_wkb_state ( wkb_parse_state *  s )

static

TRIANGLE Read a WKB triangle, starting just after the endian byte, type number and optional srid number.

Advance the parse state forward appropriately. Triangles are encoded like polygons in WKB, but more like linestrings as lwgeometries.

Definition at line 555 of file lwin_wkb.c.

References wkb_parse_state::check, wkb_parse_state::has_m, wkb_parse_state::has_z, integer_from_wkb_state(), LW_PARSER_CHECK_MINPOINTS, LW_PARSER_CHECK_ZCLOSURE, LWDEBUGF, lwerror(), lwtriangle_construct_empty(), wkb_parse_state::lwtype, lwtype_name(), POINTARRAY::npoints, LWTRIANGLE::points, ptarray_free(), ptarray_from_wkb_state(), ptarray_is_closed_z(), and wkb_parse_state::srid.

Referenced by lwgeom_from_wkb_state().

{
        uint32_t nrings = integer_from_wkb_state(s);
        LWTRIANGLE *tri = lwtriangle_construct_empty(s->srid, s->has_z, s->has_m);
        POINTARRAY *pa = NULL;

        /* Empty triangle? */
        if( nrings == 0 )
                return tri;

        /* Should be only one ring. */
        if ( nrings != 1 )
                lwerror("Triangle has wrong number of rings: %d", nrings);

        /* There's only one ring, we hope? */
        pa = ptarray_from_wkb_state(s);

        /* If there's no points, return an empty triangle. */
        if( pa == NULL )
                return tri;

        /* Check for at least four points. */
        if( s->check & LW_PARSER_CHECK_MINPOINTS && pa->npoints < 4 )
        {
                LWDEBUGF(2, "%s must have at least four points", lwtype_name(s->lwtype));
                lwerror("%s must have at least four points", lwtype_name(s->lwtype));
                return NULL;
        }

        if( s->check & LW_PARSER_CHECK_ZCLOSURE && ! ptarray_is_closed_z(pa) )
        {
                lwerror("%s must have closed rings", lwtype_name(s->lwtype));
                return NULL;
        }

        /* Empty TRIANGLE starts w/ empty POINTARRAY, free it first */
        if (tri->points)
                ptarray_free(tri->points);

        tri->points = pa;
        return tri;
}

Here is the call graph for this function:

Here is the caller graph for this function: