| /third_party/boost/libs/geometry/test/algorithms/within/ |
| D | within_areal_areal.cpp | 29 typedef bg::model::polygon<P2> poly2; in test_a_a() typedef
31 typedef bg::model::multi_polygon<poly2> mpoly2; in test_a_a()
34 …test_geometry<ring1, poly2>("POLYGON((0 0,0 5,5 5,5 0,0 0))", "POLYGON((0 0,0 5,5 5,5 0,0 0))", tr… in test_a_a()
37 test_geometry<poly1, poly2>("POLYGON((0 0,0 9,9 9,9 0,0 0),(3 3,6 3,6 6,3 6,3 3))", in test_a_a()
39 test_geometry<poly1, poly2>("POLYGON((0 0,0 9,9 9,9 0,0 0),(3 3,6 3,6 6,3 6,3 3))", in test_a_a()
41 test_geometry<poly1, poly2>("POLYGON((1 1,1 8,8 8,8 1,1 1),(3 3,6 3,6 6,3 6,3 3))", in test_a_a()
43 test_geometry<poly1, poly2>("POLYGON((1 1,1 8,8 8,8 1,1 1),(3 3,6 3,6 6,3 6,3 3))", in test_a_a()
53 …test_geometry<mpoly1, poly2>("MULTIPOLYGON(((0 0,0 5,5 5,5 0,0 0)),((15 15,15 110,110 110,110 15,1… in test_a_a()
56 test_geometry<mpoly1, poly2>("MULTIPOLYGON(((0 0,0 1,1 0,0 0)),((3 3,3 4,4 3,3 3)))", in test_a_a()
67 test_geometry<poly1, poly2>("POLYGON((0 0,0 5,5 5,5 0,0 0))", in test_a_a()
[all …]
|
| D | within.cpp | 83 typedef boost::geometry::model::polygon<P2> poly2; in test_point_poly() typedef
85 test_geometry<P1, poly2>("POINT(3 3)", "POLYGON((0 0,0 5,5 5,5 0,0 0))", true); in test_point_poly()
|
| /third_party/boost/libs/geometry/doc/src/examples/algorithms/ |
| D | equals.cpp | 29 boost::geometry::model::polygon<point> poly1, poly2; in BOOST_GEOMETRY_REGISTER_BOOST_TUPLE_CS() local
31 boost::geometry::exterior_ring(poly2) = tuple_list_of(5, 0)(0, 0)(0, 5)(5, 5)(5, 0); in BOOST_GEOMETRY_REGISTER_BOOST_TUPLE_CS()
35 << (boost::geometry::equals(poly1, poly2) ? "equal" : "not equal") in BOOST_GEOMETRY_REGISTER_BOOST_TUPLE_CS()
43 << (boost::geometry::equals(box, poly2) ? "equal" : "not equal") in BOOST_GEOMETRY_REGISTER_BOOST_TUPLE_CS()
|
| D | touches_one_geometry.cpp | 33 bg::model::polygon<bg::model::d2::point_xy<double> > poly2; in main() local
34 bg::read_wkt("POLYGON((0 0,0 4,4 4,4 0,2 3,0 0))", poly2); in main()
35 check_touches = bg::touches(poly2); in main()
|
| D | disjoint.cpp | 26 bg::model::polygon<bg::model::d2::point_xy<double> > poly2; in main() local
27 bg::read_wkt("POLYGON((2 2,4 4,6 2,4 0,2 2))", poly2); in main()
28 bool check_disjoint = bg::disjoint(poly1, poly2); in main()
|
| D | touches_two_geometries.cpp | 26 bg::model::polygon<bg::model::d2::point_xy<double> > poly2; in main() local
27 bg::read_wkt("POLYGON((0 0,0 -4,-4 -4,-4 0,0 0))", poly2); in main()
28 bool check_touches = bg::touches(poly1, poly2); in main()
|
| D | overlaps.cpp | 26 bg::model::polygon<bg::model::d2::point_xy<double> > poly2; in main() local
27 bg::read_wkt("POLYGON((2 2,2 6,6 7,6 1,2 2))", poly2); in main()
28 bool check_overlap = bg::overlaps(poly1, poly2); in main()
|
| D | covered_by.cpp | 26 bg::model::polygon<bg::model::d2::point_xy<double> > poly2; in main() local
27 bg::read_wkt("POLYGON((0 4,3 4,2 2,0 1,0 4))", poly2); in main()
28 bool check_covered = bg::covered_by(poly1, poly2); in main()
|
| /third_party/boost/libs/geometry/test/algorithms/area/ |
| D | area_sph_geo.cpp | 207 std::string poly2 = "POLYGON((0 0,0 10,10 10,10 0,0 0))"; in test_spherical_geo() local
211 bg::read_wkt(poly2, geometry); in test_spherical_geo()
221 bg::read_wkt(poly2, geometry_geo); in test_spherical_geo()
231 std::string poly2 = "POLYGON((0 -5,0 5,10 5,10 -5,0 -5))"; in test_spherical_geo() local
235 bg::read_wkt(poly2, geometry); in test_spherical_geo()
245 bg::read_wkt(poly2, geometry_geo); in test_spherical_geo()
256 std::string poly2 = "POLYGON((175 0,175 10,-175 10,-175 0,175 0))"; in test_spherical_geo() local
262 bg::read_wkt(poly2, geometry); in test_spherical_geo()
278 bg::read_wkt(poly2, geometry_geo); in test_spherical_geo()
294 std::string poly2 = "POLYGON((175 -5,175 5,-175 5,-175 -5,175 -5))"; in test_spherical_geo() local
[all …]
|
| D | area.cpp | 92 std::string poly2 = "POLYGON((1 1,2 0,3 1,2 2,1 1))"; in test_ccw() local
98 bg::read_wkt(poly2, ccw_polygon); in test_ccw()
131 std::string poly2 = "POLYGON((45 45,95 45,45 95,45 45))"; in test_poles_ccw() local
137 bg::read_wkt(poly2, polygon); in test_poles_ccw()
|
| /third_party/boost/libs/geometry/example/ |
| D | 06_a_transformation_example.cpp | 38 model::polygon<point_2d> poly, poly2; in BOOST_GEOMETRY_REGISTER_C_ARRAY_CS() local
44 transform(poly, poly2, translate); in BOOST_GEOMETRY_REGISTER_C_ARRAY_CS()
47 std::cout << "transformed polygon " << boost::geometry::dsv(poly2) << std::endl; in BOOST_GEOMETRY_REGISTER_C_ARRAY_CS()
|
| D | 03_polygon_example.cpp | 131 deque_polygon poly2; in main() local
132 ring_type<deque_polygon>::type& ring = exterior_ring(poly2); in main()
138 std::cout << dsv(poly2) << std::endl; in main()
|
| /third_party/boost/libs/geometry/test/robustness/overlay/areal_areal/ |
| D | general_intersection_precision.cpp | 120 MultiPolygon const& poly1, MultiPolygon const& poly2, in test_case() argument
126 MultiPolygon poly2_adapted = poly2; in test_case()
173 multi_polygon poly2; in test_all() local
174 bg::read_wkt(second, poly2); in test_all()
192 poly1, poly2, do_output); in test_all()
|
| /third_party/boost/libs/geometry/test/srs/ |
| D | transformation_interface.cpp | 56 polygon poly2; in test_geometries() local
71 tr.forward(poly, poly2); in test_geometries()
80 test::check_geometry(poly2, "POLYGON((0.322952937968 0.9459567165))", 0.001); in test_geometries()
89 tr.inverse(poly2, poly); in test_geometries()
|
| /third_party/boost/boost/geometry/algorithms/ |
| D | transform.hpp | 157 static inline bool apply(Polygon1 const& poly1, Polygon2& poly2, in apply()
162 geometry::clear(poly2); in apply()
165 range::back_inserter(geometry::exterior_ring(poly2)), strategy)) in apply()
177 >::apply(geometry::interior_rings(poly2), in apply()
183 rings2 = geometry::interior_rings(poly2); in apply()
|
| /third_party/boost/libs/geometry/test/algorithms/covered_by/ |
| D | covered_by.cpp | 140 polygon_type2 poly2; in test_mixed_of() local
142 boost::geometry::read_wkt("POLYGON((0 0,0 5,5 5,5 0,0 0))", poly2); in test_mixed_of()
149 BOOST_CHECK_EQUAL(bg::covered_by(p1, poly2), true); in test_mixed_of()
|
| /third_party/boost/libs/geometry/test/algorithms/intersects/ |
| D | intersects.cpp | 159 typedef bg::model::polygon<P2> poly2; in test_multi_polygon_polygon() typedef
161 …test_geometry<mpoly, poly2>("MULTIPOLYGON(((11 11,11 20,20 20,20 11,11 11)),((5 5,5 6,6 6,6 5,5 5)… in test_multi_polygon_polygon()
|
| /third_party/boost/boost/polygon/detail/ |
| D | scan_arbitrary.hpp | 2208 polygon_data<Unit> poly2; in test_merge() local
2209 poly2.set(pts.begin(), pts.end()); in test_merge()
2210 stdcout << poly2 << "\n"; in test_merge()
2211 si.insert(poly2, 444); in test_merge()
2229 si.insert(poly2, 333); in test_merge()
2400 polygon_data<Unit> poly2; in test_intersection() local
2401 poly2.set(pts.begin(), pts.end()); in test_intersection()
2402 stdcout << poly2 << "\n"; in test_intersection()
2403 si.insert(poly2, 444); in test_intersection()
2404 si2.insert(poly2, 444); in test_intersection()
|
| /third_party/python/Doc/library/ |
| D | turtle.rst | 1558 >>> poly2 = ((0,0),(10,-5),(-10,-5))
1559 >>> s.addcomponent(poly2, "blue", "red")
|