/usr/include/boost/geometry/algorithms
NameSizeModeActions
detail/-0755rm
dispatch/-0755rm
append.hpp114930644editdlrm
area.hpp106570644editdlrm
assign.hpp107090644editdlrm
buffer.hpp86560644editdlrm
centroid.hpp196200644editdlrm
clear.hpp51560644editdlrm
comparable_distance.hpp11070644editdlrm
convert.hpp173270644editdlrm
convex_hull.hpp115890644editdlrm
correct.hpp99560644editdlrm
correct_closure.hpp58620644editdlrm
covered_by.hpp10770644editdlrm
crosses.hpp84780644editdlrm
densify.hpp124720644editdlrm
difference.hpp165910644editdlrm
discrete_frechet_distance.hpp78440644editdlrm
discrete_hausdorff_distance.hpp112810644editdlrm
disjoint.hpp11910644editdlrm
distance.hpp11100644editdlrm
envelope.hpp10210644editdlrm
equals.hpp11960644editdlrm
expand.hpp10730644editdlrm
for_each.hpp98310644editdlrm
intersection.hpp8060644editdlrm
intersects.hpp11450644editdlrm
is_convex.hpp65080644editdlrm
is_empty.hpp48530644editdlrm
is_simple.hpp5750644editdlrm
is_valid.hpp5700644editdlrm
length.hpp93410644editdlrm
line_interpolate.hpp130540644editdlrm
make.hpp51700644editdlrm
not_implemented.hpp38390644editdlrm
num_geometries.hpp35860644editdlrm
num_interior_rings.hpp37560644editdlrm
num_points.hpp55650644editdlrm
num_segments.hpp47750644editdlrm
overlaps.hpp10670644editdlrm
perimeter.hpp72120644editdlrm
point_on_surface.hpp132810644editdlrm
relate.hpp6420644editdlrm
relation.hpp6520644editdlrm
remove_spikes.hpp97530644editdlrm
reverse.hpp43860644editdlrm
simplify.hpp226960644editdlrm
sym_difference.hpp231690644editdlrm
touches.hpp11270644editdlrm
transform.hpp141050644editdlrm
union.hpp213830644editdlrm
unique.hpp46820644editdlrm
validity_failure_type.hpp36840644editdlrm
within.hpp10570644editdlrm
Edit: /usr/include/boost/geometry/algorithms/is_empty.hpp (4853B)
// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2015, Oracle and/or its affiliates. // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle // Licensed under the Boost Software License version 1.0. // http://www.boost.org/users/license.html #ifndef BOOST_GEOMETRY_ALGORITHMS_IS_EMPTY_HPP #define BOOST_GEOMETRY_ALGORITHMS_IS_EMPTY_HPP #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace is_empty { struct always_not_empty { template static inline bool apply(Geometry const&) { return false; } }; struct range_is_empty { template static inline bool apply(Range const& range) { return boost::empty(range); } }; class polygon_is_empty { template static inline bool check_interior_rings(InteriorRings const& interior_rings) { return check_iterator_range < range_is_empty, true // allow empty range >::apply(boost::begin(interior_rings), boost::end(interior_rings)); } public: template static inline bool apply(Polygon const& polygon) { return boost::empty(exterior_ring(polygon)) && check_interior_rings(interior_rings(polygon)); } }; template struct multi_is_empty { template static inline bool apply(MultiGeometry const& multigeometry) { return check_iterator_range < Policy, true // allow empty range >::apply(boost::begin(multigeometry), boost::end(multigeometry)); } }; }} // namespace detail::is_empty #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template ::type> struct is_empty : not_implemented {}; template struct is_empty : detail::is_empty::always_not_empty {}; template struct is_empty : detail::is_empty::always_not_empty {}; template struct is_empty : detail::is_empty::always_not_empty {}; template struct is_empty : detail::is_empty::range_is_empty {}; template struct is_empty : detail::is_empty::range_is_empty {}; template struct is_empty : detail::is_empty::polygon_is_empty {}; template struct is_empty : detail::is_empty::range_is_empty {}; template struct is_empty : detail::is_empty::multi_is_empty<> {}; template struct is_empty : detail::is_empty::multi_is_empty {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH namespace resolve_variant { template struct is_empty { static inline bool apply(Geometry const& geometry) { concepts::check(); return dispatch::is_empty::apply(geometry); } }; template struct is_empty > { struct visitor : boost::static_visitor { template inline bool operator()(Geometry const& geometry) const { return is_empty::apply(geometry); } }; static bool apply(boost::variant const& geometry) { return boost::apply_visitor(visitor(), geometry); } }; } // namespace resolve_variant /*! \brief \brief_check{is the empty set} \ingroup is_empty \tparam Geometry \tparam_geometry \param geometry \param_geometry \return \return_check{is the empty set} \qbk{[include reference/algorithms/is_empty.qbk]} */ template inline bool is_empty(Geometry const& geometry) { return resolve_variant::is_empty::apply(geometry); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_IS_EMPTY_HPP