123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256 |
- // Boost.Geometry (aka GGL, Generic Geometry Library)
- // Unit Test
- // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
- // This file was modified by Oracle 2017.
- // Modifications copyright (c) 2017, Oracle and/or its affiliates.
- // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
- // 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 <algorithm>
- #include <boost/geometry/algorithms/make.hpp>
- #include <boost/geometry/io/dsv/write.hpp>
- #include <boost/geometry/policies/compare.hpp>
- #include <boost/geometry/strategies/strategies.hpp>
- #include <boost/geometry/geometries/point.hpp>
- #include <boost/geometry/geometries/adapted/c_array.hpp>
- #include <boost/geometry/geometries/adapted/boost_tuple.hpp>
- #include <test_common/test_point.hpp>
- BOOST_GEOMETRY_REGISTER_C_ARRAY_CS(cs::cartesian)
- BOOST_GEOMETRY_REGISTER_BOOST_TUPLE_CS(cs::cartesian)
- template <typename Container>
- inline std::string coordinates(Container const& points)
- {
- std::ostringstream out;
- for (typename boost::range_const_iterator<Container>::type it = boost::begin(points);
- it != boost::end(points);
- ++it)
- {
- out << bg::dsv(*it);
- }
- return out.str();
- }
- template <typename P>
- void test_2d_compare()
- {
- P p1 = bg::make<P>(3, 1);
- P p2 = bg::make<P>(3, 1);
- P p3 = bg::make<P>(1, 3);
- P p4 = bg::make<P>(5, 2);
- P p5 = bg::make<P>(3, 2);
- // Test in all dimensions
- {
- bg::equal_to<P> et;
- bg::less<P> lt;
- bg::greater<P> gt;
- BOOST_CHECK_EQUAL(et(p1, p2), true);
- BOOST_CHECK_EQUAL(et(p1, p3), false);
- BOOST_CHECK_EQUAL(et(p1, p4), false);
- BOOST_CHECK_EQUAL(et(p1, p5), false);
- BOOST_CHECK_EQUAL(et(p3, p4), false);
- BOOST_CHECK_EQUAL(lt(p1, p2), false);
- BOOST_CHECK_EQUAL(lt(p1, p3), false);
- BOOST_CHECK_EQUAL(lt(p1, p4), true);
- BOOST_CHECK_EQUAL(lt(p1, p5), true);
- BOOST_CHECK_EQUAL(lt(p3, p4), true);
- BOOST_CHECK_EQUAL(gt(p1, p2), false);
- BOOST_CHECK_EQUAL(gt(p1, p3), true);
- BOOST_CHECK_EQUAL(gt(p1, p4), false);
- BOOST_CHECK_EQUAL(gt(p1, p5), false);
- BOOST_CHECK_EQUAL(gt(p3, p4), false);
- }
- // Test in dimension 0, X
- {
- bg::equal_to<P, 0> et;
- bg::less<P, 0> lt;
- bg::greater<P, 0> gt;
- BOOST_CHECK_EQUAL(et(p1, p2), true);
- BOOST_CHECK_EQUAL(et(p1, p3), false);
- BOOST_CHECK_EQUAL(et(p1, p4), false);
- BOOST_CHECK_EQUAL(et(p1, p5), true);
- BOOST_CHECK_EQUAL(et(p3, p4), false);
- BOOST_CHECK_EQUAL(lt(p1, p2), false);
- BOOST_CHECK_EQUAL(lt(p1, p3), false);
- BOOST_CHECK_EQUAL(lt(p1, p4), true);
- BOOST_CHECK_EQUAL(lt(p1, p5), false);
- BOOST_CHECK_EQUAL(lt(p3, p4), true);
- BOOST_CHECK_EQUAL(gt(p1, p2), false);
- BOOST_CHECK_EQUAL(gt(p1, p3), true);
- BOOST_CHECK_EQUAL(gt(p1, p4), false);
- BOOST_CHECK_EQUAL(gt(p1, p5), false);
- BOOST_CHECK_EQUAL(gt(p3, p4), false);
- }
- // Test in dimension 1, Y
- {
- bg::equal_to<P, 1> et;
- bg::less<P, 1> lt;
- bg::greater<P, 1> gt;
- BOOST_CHECK_EQUAL(et(p1, p2), true);
- BOOST_CHECK_EQUAL(et(p1, p3), false);
- BOOST_CHECK_EQUAL(et(p1, p4), false);
- BOOST_CHECK_EQUAL(et(p1, p5), false);
- BOOST_CHECK_EQUAL(et(p3, p4), false);
- BOOST_CHECK_EQUAL(lt(p1, p2), false);
- BOOST_CHECK_EQUAL(lt(p1, p3), true);
- BOOST_CHECK_EQUAL(lt(p1, p4), true);
- BOOST_CHECK_EQUAL(lt(p1, p5), true);
- BOOST_CHECK_EQUAL(lt(p3, p4), false);
- BOOST_CHECK_EQUAL(gt(p1, p2), false);
- BOOST_CHECK_EQUAL(gt(p1, p3), false);
- BOOST_CHECK_EQUAL(gt(p1, p4), false);
- BOOST_CHECK_EQUAL(gt(p1, p5), false);
- BOOST_CHECK_EQUAL(gt(p3, p4), true);
- }
- }
- template <typename P>
- void test_2d_sort()
- {
- std::vector<P> v;
- v.push_back(bg::make<P>(3, 1));
- v.push_back(bg::make<P>(2, 3));
- v.push_back(bg::make<P>(2, 2));
- v.push_back(bg::make<P>(1, 3));
- // Sort on coordinates in order x,y,z
- std::sort(v.begin(), v.end(), bg::less<P>());
- std::string s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(1, 3)(2, 2)(2, 3)(3, 1)");
- // Reverse sort
- std::sort(v.begin(), v.end(), bg::greater<P>());
- s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(3, 1)(2, 3)(2, 2)(1, 3)");
- // Sort backwards on coordinates in order x,y,z
- //std::sort(v.begin(), v.end(), bg::greater<P>());
- //std::string s = coordinates(v);
- //BOOST_CHECK_EQUAL(s, "(1, 3)(2, 2)(2, 3)(3, 1)");
- // Refill to remove duplicate coordinates
- v.clear();
- v.push_back(bg::make<P>(4, 1));
- v.push_back(bg::make<P>(3, 2));
- v.push_back(bg::make<P>(2, 3));
- v.push_back(bg::make<P>(1, 4));
- // Sort ascending on only x-coordinate
- std::sort(v.begin(), v.end(), bg::less<P, 0>());
- s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(1, 4)(2, 3)(3, 2)(4, 1)");
- // Sort ascending on only y-coordinate
- std::sort(v.begin(), v.end(), bg::less<P, 1>());
- s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(4, 1)(3, 2)(2, 3)(1, 4)");
- // Sort descending on only x-coordinate
- std::sort(v.begin(), v.end(), bg::greater<P, 0>());
- s = coordinates(v);
- //BOOST_CHECK_EQUAL(s, "(4, 1)(3, 2)(2, 3)(1, 4)");
- // Sort descending on only y-coordinate
- std::sort(v.begin(), v.end(), bg::greater<P, 1>());
- s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(1, 4)(2, 3)(3, 2)(4, 1)");
- // Make non-unique vector
- v.push_back(bg::make<P>(4, 1));
- v.push_back(bg::make<P>(3, 2));
- v.push_back(bg::make<P>(2, 3));
- v.push_back(bg::make<P>(1, 4));
- v.push_back(bg::make<P>(1, 5));
- std::sort(v.begin(), v.end(), bg::less<P>());
- s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(1, 4)(1, 4)(1, 5)(2, 3)(2, 3)(3, 2)(3, 2)(4, 1)(4, 1)");
- std::vector<P> v2;
- std::unique_copy(v.begin(), v.end(), std::back_inserter(v2), bg::equal_to<P>());
- s = coordinates(v2);
- BOOST_CHECK_EQUAL(s, "(1, 4)(1, 5)(2, 3)(3, 2)(4, 1)");
- }
- template <typename P>
- void test_spherical()
- {
- //typedef typename bg::coordinate_type<P>::type ct;
- std::vector<P> v;
- v.push_back(bg::make<P>( 180.00, 70.56));
- v.push_back(bg::make<P>( 179.73, 71.56)); // east
- v.push_back(bg::make<P>( 177.47, 71.23)); // less east
- v.push_back(bg::make<P>(-178.78, 72.78)); // further east, = west, this is the most left point
- v.push_back(bg::make<P>(-180.00, 73.12));
- // Sort on coordinates in order x,y,z
- std::sort(v.begin(), v.end(), bg::less<P>());
- std::string s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(-178.78, 72.78)(177.47, 71.23)(179.73, 71.56)(180, 70.56)(-180, 73.12)");
- // Sort ascending on only y-coordinate
- std::sort(v.begin(), v.end(), bg::less<P, 1>());
- s = coordinates(v);
- BOOST_CHECK_EQUAL(s, "(180, 70.56)(177.47, 71.23)(179.73, 71.56)(-178.78, 72.78)(-180, 73.12)");
- // Sort ascending on only x-coordinate
- std::sort(v.begin(), v.end(), bg::less<P, 0>());
- s = coordinates(v);
- BOOST_CHECK((s == "(-178.78, 72.78)(177.47, 71.23)(179.73, 71.56)(180, 70.56)(-180, 73.12)"
- || s == "(-178.78, 72.78)(177.47, 71.23)(179.73, 71.56)(-180, 73.12)(180, 70.56)"));
- // Sort ascending on only x-coordinate, but override with std-comparison,
- // (so this is the normal sorting behaviour that would have been used
- // if it would not have been spherical)
- //std::sort(v.begin(), v.end(), bg::less<P, 0, std::less<ct> >());
- //s = coordinates(v);
- //BOOST_CHECK_EQUAL(s, "(-178.78, 70.78)(177.47, 71.23)(179.73, 71.56)");
- }
- int test_main(int, char* [])
- {
- test_2d_compare<bg::model::point<int, 2, bg::cs::cartesian> >();
- test_2d_compare<bg::model::point<double, 2, bg::cs::cartesian> >();
- test_2d_sort<bg::model::point<int, 2, bg::cs::cartesian> >();
- test_2d_sort<bg::model::point<float, 2, bg::cs::cartesian> >();
- test_2d_sort<boost::tuple<double, double> >();
- test_2d_sort<bg::model::point<double, 2, bg::cs::cartesian> >();
- test_spherical<bg::model::point<double, 2, bg::cs::spherical<bg::degree> > >();
- test_spherical<bg::model::point<double, 2, bg::cs::spherical_equatorial<bg::degree> > >();
- test_spherical<bg::model::point<double, 2, bg::cs::geographic<bg::degree> > >();
- return 0;
- }
|