Name	Size	Mode	Actions
detail/	-	0755	rm
dispatch/	-	0755	rm
append.hpp	11493	0644	editdlrm
area.hpp	10657	0644	editdlrm
assign.hpp	10709	0644	editdlrm
buffer.hpp	8656	0644	editdlrm
centroid.hpp	19620	0644	editdlrm
clear.hpp	5156	0644	editdlrm
comparable_distance.hpp	1107	0644	editdlrm
convert.hpp	17327	0644	editdlrm
convex_hull.hpp	11589	0644	editdlrm
correct.hpp	9956	0644	editdlrm
correct_closure.hpp	5862	0644	editdlrm
covered_by.hpp	1077	0644	editdlrm
crosses.hpp	8478	0644	editdlrm
densify.hpp	12472	0644	editdlrm
difference.hpp	16591	0644	editdlrm
discrete_frechet_distance.hpp	7844	0644	editdlrm
discrete_hausdorff_distance.hpp	11281	0644	editdlrm
disjoint.hpp	1191	0644	editdlrm
distance.hpp	1110	0644	editdlrm
envelope.hpp	1021	0644	editdlrm
equals.hpp	1196	0644	editdlrm
expand.hpp	1073	0644	editdlrm
for_each.hpp	9831	0644	editdlrm
intersection.hpp	806	0644	editdlrm
intersects.hpp	1145	0644	editdlrm
is_convex.hpp	6508	0644	editdlrm
is_empty.hpp	4853	0644	editdlrm
is_simple.hpp	575	0644	editdlrm
is_valid.hpp	570	0644	editdlrm
length.hpp	9341	0644	editdlrm
line_interpolate.hpp	13054	0644	editdlrm
make.hpp	5170	0644	editdlrm
not_implemented.hpp	3839	0644	editdlrm
num_geometries.hpp	3586	0644	editdlrm
num_interior_rings.hpp	3756	0644	editdlrm
num_points.hpp	5565	0644	editdlrm
num_segments.hpp	4775	0644	editdlrm
overlaps.hpp	1067	0644	editdlrm
perimeter.hpp	7212	0644	editdlrm
point_on_surface.hpp	13281	0644	editdlrm
relate.hpp	642	0644	editdlrm
relation.hpp	652	0644	editdlrm
remove_spikes.hpp	9753	0644	editdlrm
reverse.hpp	4386	0644	editdlrm
simplify.hpp	22696	0644	editdlrm
sym_difference.hpp	23169	0644	editdlrm
touches.hpp	1127	0644	editdlrm
transform.hpp	14105	0644	editdlrm
union.hpp	21383	0644	editdlrm
unique.hpp	4682	0644	editdlrm
validity_failure_type.hpp	3684	0644	editdlrm
within.hpp	1057	0644	editdlrm

// Boost.Geometry // Copyright (c) 2017 Barend Gehrels, 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) #ifndef BOOST_GEOMETRY_ALGORITHMS_CORRECT_CLOSURE_HPP #define BOOST_GEOMETRY_ALGORITHMS_CORRECT_CLOSURE_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { // Silence warning C4127: conditional expression is constant #if defined(_MSC_VER) #pragma warning(push) #pragma warning(disable : 4127) #endif #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace correct_closure { template struct nop { static inline void apply(Geometry& ) {} }; // Close a ring, if not closed, or open it template struct close_or_open_ring { static inline void apply(Ring& r) { if (boost::size(r) <= 2) { return; } bool const disjoint = geometry::disjoint(*boost::begin(r), *(boost::end(r) - 1)); closure_selector const s = geometry::closure::value; if (disjoint && s == closed) { // Close it by adding first point geometry::append(r, *boost::begin(r)); } else if (! disjoint && s != closed) { // Open it by removing last point geometry::traits::resize::apply(r, boost::size(r) - 1); } } }; // Close/open exterior ring and all its interior rings template struct close_or_open_polygon { typedef typename ring_type::type ring_type; static inline void apply(Polygon& poly) { close_or_open_ring::apply(exterior_ring(poly)); typename interior_return_type::type rings = interior_rings(poly); for (typename detail::interior_iterator::type it = boost::begin(rings); it != boost::end(rings); ++it) { close_or_open_ring::apply(*it); } } }; }} // namespace detail::correct_closure #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template ::type> struct correct_closure: not_implemented {}; template struct correct_closure : detail::correct_closure::nop {}; template struct correct_closure : detail::correct_closure::nop {}; template struct correct_closure : detail::correct_closure::nop {}; template struct correct_closure : detail::correct_closure::nop {}; template struct correct_closure : detail::correct_closure::close_or_open_ring {}; template struct correct_closure : detail::correct_closure::close_or_open_polygon {}; template struct correct_closure : detail::correct_closure::nop {}; template struct correct_closure : detail::correct_closure::nop {}; template struct correct_closure : detail::multi_modify < Geometry, detail::correct_closure::close_or_open_polygon < typename boost::range_value::type > > {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH namespace resolve_variant { template struct correct_closure { static inline void apply(Geometry& geometry) { concepts::check(); dispatch::correct_closure::apply(geometry); } }; template struct correct_closure > { struct visitor: boost::static_visitor { template void operator()(Geometry& geometry) const { correct_closure::apply(geometry); } }; static inline void apply(boost::variant& geometry) { visitor vis; boost::apply_visitor(vis, geometry); } }; } // namespace resolve_variant /*! \brief Closes or opens a geometry, according to its type \details Corrects a geometry w.r.t. closure points to all rings which do not have a closing point and are typed as they should have one, the first point is appended. \ingroup correct_closure \tparam Geometry \tparam_geometry \param geometry \param_geometry which will be corrected if necessary */ template inline void correct_closure(Geometry& geometry) { resolve_variant::correct_closure::apply(geometry); } #if defined(_MSC_VER) #pragma warning(pop) #endif }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_CORRECT_CLOSURE_HPP