geometry/test/algorithms/convert.cpp
Barend Gehrels b7be230f14 Added ttmath_big for:
append,assign,buffer,comparable_distance,convert,correct,disjoint,distance,envelope,for_each,make,reverse,simplify,transform,unique
  plus all vcproj files


[SVN r69336]
2011-02-27 16:27:57 +00:00

100 lines
2.8 KiB
C++

// Boost.Geometry (aka GGL, Generic Geometry Library) test file
//
// Copyright Barend Gehrels 2007-2009, Geodan, Amsterdam, the Netherlands
// Copyright Bruno Lalande 2008, 2009
// 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>
#include <boost/geometry/algorithms/assign.hpp>
#include <boost/geometry/algorithms/convert.hpp>
#include <boost/geometry/algorithms/make.hpp>
#include <boost/geometry/algorithms/num_points.hpp>
#include <boost/geometry/geometries/geometries.hpp>
#include <boost/geometry/geometries/adapted/c_array_cartesian.hpp>
#include <boost/geometry/geometries/adapted/tuple_cartesian.hpp>
#include <test_common/test_point.hpp>
template <typename P>
void test_all()
{
typedef bg::model::box<P> box_type;
P p;
bg::assign(p, 1, 2);
box_type b;
bg::convert(p, b);
BOOST_CHECK_CLOSE((bg::get<0, 0>(b)), 1.0, 0.001);
BOOST_CHECK_CLOSE((bg::get<0, 1>(b)), 2.0, 0.001);
BOOST_CHECK_CLOSE((bg::get<1, 0>(b)), 1.0, 0.001);
BOOST_CHECK_CLOSE((bg::get<1, 1>(b)), 2.0, 0.001);
}
template <typename P>
void test_std()
{
test_all<P>();
typedef bg::model::box<P> box_type;
typedef bg::model::ring<P> ring_type;
typedef bg::model::polygon<P> polygon_type;
box_type b;
bg::set<bg::min_corner, 0>(b, 1);
bg::set<bg::min_corner, 1>(b, 2);
bg::set<bg::max_corner, 0>(b, 3);
bg::set<bg::max_corner, 1>(b, 4);
ring_type ring;
bg::convert(b, ring);
//std::cout << bg::wkt(b) << std::endl;
//std::cout << bg::wkt(ring) << std::endl;
typename boost::range_const_iterator<ring_type>::type it = ring.begin();
BOOST_CHECK_CLOSE(bg::get<0>(*it), 1.0, 0.001);
BOOST_CHECK_CLOSE(bg::get<1>(*it), 2.0, 0.001);
it++;
BOOST_CHECK_CLOSE(bg::get<0>(*it), 1.0, 0.001);
BOOST_CHECK_CLOSE(bg::get<1>(*it), 4.0, 0.001);
it++;
BOOST_CHECK_CLOSE(bg::get<0>(*it), 3.0, 0.001);
BOOST_CHECK_CLOSE(bg::get<1>(*it), 4.0, 0.001);
it++;
BOOST_CHECK_CLOSE(bg::get<0>(*it), 3.0, 0.001);
BOOST_CHECK_CLOSE(bg::get<1>(*it), 2.0, 0.001);
it++;
BOOST_CHECK_CLOSE(bg::get<0>(*it), 1.0, 0.001);
BOOST_CHECK_CLOSE(bg::get<1>(*it), 2.0, 0.001);
BOOST_CHECK_EQUAL(ring.size(), 5u);
polygon_type polygon;
bg::convert(ring, polygon);
BOOST_CHECK_EQUAL(bg::num_points(polygon), 5u);
bg::convert(polygon, ring);
BOOST_CHECK_EQUAL(bg::num_points(ring), 5u);
}
int test_main(int, char* [])
{
test_std<bg::model::point<int, 2, bg::cs::cartesian> >();
test_std<bg::model::point<float, 2, bg::cs::cartesian> >();
test_std<bg::model::point<double, 2, bg::cs::cartesian> >();
#ifdef HAVE_TTMATH
test_std<bg::model::point<ttmath_big, 2, bg::cs::cartesian> >();
#endif
return 0;
}