1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Unit Test
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// This file was modified by Oracle on 2014.
// Modifications copyright (c) 2014 Oracle and/or its affiliates.
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <geometry_test_common.hpp>
// To be tested:
#include <boost/geometry/core/ring_type.hpp>
#include <boost/geometry/core/exterior_ring.hpp>
#include <boost/geometry/core/interior_rings.hpp>
// For geometries:
#include <boost/geometry/core/cs.hpp>
#include <boost/geometry/geometries/point.hpp>
#include <boost/geometry/geometries/polygon.hpp>
#include <boost/geometry/io/wkt/read.hpp>
template <typename Poly>
void test_order_closure(bg::order_selector expected_order, bg::closure_selector exptected_closure)
{
bg::order_selector order = bg::point_order<Poly>::value;
bg::closure_selector closure = bg::closure<Poly>::value;
BOOST_CHECK_EQUAL(order, expected_order);
BOOST_CHECK_EQUAL(closure, exptected_closure);
}
template <typename P>
void test_ring(std::string const& wkt,
std::size_t expected_main_count,
std::size_t expected_interior_ring_count,
std::size_t expected_first_interior_count)
{
typedef bg::model::polygon<P> the_polygon;
typedef typename bg::ring_type<the_polygon>::type the_ring;
typedef typename bg::interior_return_type<the_polygon const>::type the_interior;
the_polygon poly;
bg::read_wkt(wkt, poly);
the_ring ext = bg::exterior_ring(poly);
the_interior rings = bg::interior_rings(poly);
BOOST_CHECK_EQUAL(bg::num_interior_rings(poly), expected_interior_ring_count);
BOOST_CHECK_EQUAL(boost::size(rings), expected_interior_ring_count);
BOOST_CHECK_EQUAL(boost::size(ext), expected_main_count);
if (boost::size(rings))
{
BOOST_CHECK_EQUAL(boost::size(rings.front()), expected_first_interior_count);
}
}
template <typename P>
void test_all()
{
test_ring<P>("POLYGON((0 0,0 3,3 3,3 0,0 0),(1 1,1 2,2 2,2 1,1 1))", 5, 1, 5);
test_ring<P>("POLYGON((0 0,0 3,3 3,3 0,0 0),(1 1,2 2,2 1,1 1),(1 1,1 2,2 2,1 1))", 5, 2, 4);
test_ring<P>("POLYGON((0 0,0 3,3 3,3 0,0 0))", 5, 0, 0);
test_order_closure< bg::model::polygon<P, true, true> >(bg::clockwise, bg::closed);
test_order_closure< bg::model::polygon<P, true, false> >(bg::clockwise, bg::open);
test_order_closure< bg::model::polygon<P, false, true> >(bg::counterclockwise, bg::closed);
test_order_closure< bg::model::polygon<P, false, false> >(bg::counterclockwise, bg::open);
test_order_closure< bg::model::polygon<P> *>(bg::clockwise, bg::closed);
test_order_closure< bg::model::polygon<P> &>(bg::clockwise, bg::closed);
test_order_closure< bg::model::polygon<P> const>(bg::clockwise, bg::closed);
test_order_closure< bg::model::polygon<P> *&>(bg::clockwise, bg::closed);
test_order_closure< const bg::model::polygon<P> *>(bg::clockwise, bg::closed);
}
int test_main(int, char* [])
{
test_all<bg::model::point<double, 2, bg::cs::cartesian> >();
return 0;
}
|
