Definition at line 337 of file cu_measures.c.
345 poly =
lwgeom_from_wkt(
"CURVEPOLYGON(COMPOUNDCURVE(CIRCULARSTRING(0 0,1 5,0 10),(0 10,10 10,10 0, 0 0)),COMPOUNDCURVE(CIRCULARSTRING(3 7,5 8,7 7),(7 7,7 3,3 3, 3 7)))",
LW_PARSER_CHECK_NONE);
353 CU_ASSERT_EQUAL(
tree_pt(tree, 5, 7.5), 0);
355 CU_ASSERT_EQUAL(
tree_pt(tree, 8, 9), 1);
357 CU_ASSERT_EQUAL(
tree_pt(tree, -1, 5), 0);
359 CU_ASSERT_EQUAL(
tree_pt(tree, -1, 7.5), 0);
361 CU_ASSERT_EQUAL(
tree_pt(tree, 0.2, 7.5), 0);
363 CU_ASSERT_EQUAL(
tree_pt(tree, 0.5, 0.5), 1);
365 CU_ASSERT_EQUAL(
tree_pt(tree, 2, 7.5), 1);
367 CU_ASSERT_EQUAL(
tree_pt(tree, 7, 7), 1);
376 poly =
lwgeom_from_wkt(
"POLYGON((0 0,0 10,10 10,10 0,9 0,9 9,8 6,8 0,2 0,2 9,1 6,1 0,0 0),(4 4,4 6,6 6,6 4,4 4))",
LW_PARSER_CHECK_NONE);
380 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 6), 1);
382 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 5.5), 1);
384 CU_ASSERT_EQUAL(
tree_pt(tree, -3, 5.5), 0);
386 CU_ASSERT_EQUAL(
tree_pt(tree, 4, 4), 1);
387 CU_ASSERT_EQUAL(
tree_pt(tree, 6, 6), 1);
389 CU_ASSERT_EQUAL(
tree_pt(tree, 4.5, 4), 1);
391 CU_ASSERT_EQUAL(
tree_pt(tree, 8, 0), 1);
392 CU_ASSERT_EQUAL(
tree_pt(tree, 9, 0), 1);
393 CU_ASSERT_EQUAL(
tree_pt(tree, 10, 1), 1);
394 CU_ASSERT_EQUAL(
tree_pt(tree, 9.5, 1), 1);
395 CU_ASSERT_EQUAL(
tree_pt(tree, 0, 10), 1);
397 CU_ASSERT_EQUAL(
tree_pt(tree, 1, 6), 1);
399 CU_ASSERT_EQUAL(
tree_pt(tree, -1, 6), 0);
401 CU_ASSERT_EQUAL(
tree_pt(tree, 5, 5), 0);
403 CU_ASSERT_EQUAL(
tree_pt(tree, 0.5, 4), 1);
404 CU_ASSERT_EQUAL(
tree_pt(tree, 0.5, 6), 1);
405 CU_ASSERT_EQUAL(
tree_pt(tree, 0.5, 9), 1);
417 CU_ASSERT_EQUAL(
tree_pt(tree, 0.5, 0.5), 1);
419 CU_ASSERT_EQUAL(
tree_pt(tree, 1.5, 0.5), 0);
421 CU_ASSERT_EQUAL(
tree_pt(tree, -1, 1), 0);
423 CU_ASSERT_EQUAL(
tree_pt(tree, 1, 1), 1);
425 CU_ASSERT_EQUAL(
tree_pt(tree, 0.5, 1), 1);
427 CU_ASSERT_EQUAL(
tree_pt(tree, 1, 0.5), 1);
437 CU_ASSERT_EQUAL(
tree_pt(tree, -0.5, 0.5), 0);
439 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 1), 0);
441 CU_ASSERT_EQUAL(
tree_pt(tree, 2, 1), 1);
443 CU_ASSERT_EQUAL(
tree_pt(tree, 0, 1), 1);
445 CU_ASSERT_EQUAL(
tree_pt(tree, 0, 3), 1);
447 CU_ASSERT_EQUAL(
tree_pt(tree, 4, 0), 1);
449 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 3), 1);
451 CU_ASSERT_EQUAL(
tree_pt(tree, 2, 0), 1);
459 poly =
lwgeom_from_wkt(
"POLYGON((0 0, 3 1, 0 2, 3 3, 0 4, 3 5, 0 6, 5 6, 5 0, 0 0))",
LW_PARSER_CHECK_NONE);
463 CU_ASSERT_EQUAL(
tree_pt(tree, -0.5, 3.5), 0);
465 CU_ASSERT_EQUAL(
tree_pt(tree, 6.0, 2.2), 0);
467 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 2), 1);
469 CU_ASSERT_EQUAL(
tree_pt(tree, 1, 0), 1);
471 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 6), 1);
473 CU_ASSERT_EQUAL(
tree_pt(tree, 3, 1), 1);
475 CU_ASSERT_EQUAL(
tree_pt(tree, 0, 2), 1);
477 CU_ASSERT_EQUAL(
tree_pt(tree, 0, 6), 1);
static int tree_pt(RECT_NODE *tree, double x, double y)
void lwgeom_free(LWGEOM *geom)
#define LW_PARSER_CHECK_NONE
LWGEOM * lwgeom_from_wkt(const char *wkt, const char check)
RECT_NODE * rect_tree_from_lwgeom(const LWGEOM *lwgeom)
Create a tree index on top an LWGEOM.
void rect_tree_free(RECT_NODE *node)
Recurse from top of node tree and free all children.
References LW_PARSER_CHECK_NONE, lwgeom_free(), lwgeom_from_wkt(), rect_tree_free(), rect_tree_from_lwgeom(), and tree_pt().
Referenced by measures_suite_setup().