{

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);

std::size_t expected_main_count,

std::size_t expected_interior_ring_count,

std::size_t expected_first_interior_count)

{

using the_polygon = bg::model::polygon<P>;

using the_ring = bg::ring_type_t<the_polygon>;

using the_interior = bg::interior_return_type_t<the_polygon const>;

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);

}

{

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);

{

test_all<bg::model::point<double, 2, bg::cs::cartesian> >();

return 0;