/usr/include/boost/geometry/index/detail/algorithms
NameSizeModeActions
bounds.hpp64570644editdlrm
comparable_distance_centroid.hpp27950644editdlrm
comparable_distance_far.hpp23950644editdlrm
comparable_distance_near.hpp26550644editdlrm
content.hpp23800644editdlrm
diff_abs.hpp11460644editdlrm
intersection_content.hpp29120644editdlrm
is_valid.hpp21760644editdlrm
margin.hpp52610644editdlrm
minmaxdist.hpp41030644editdlrm
nth_element.hpp17490644editdlrm
path_intersection.hpp46090644editdlrm
segment_intersection.hpp53040644editdlrm
smallest_for_indexable.hpp24420644editdlrm
sum_for_indexable.hpp22370644editdlrm
union_content.hpp11030644editdlrm
Edit: /usr/include/boost/geometry/index/detail/algorithms/union_content.hpp (1103B)
// Boost.Geometry Index // // boxes union/sum area/volume // // Copyright (c) 2008 Federico J. Fernandez. // Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland. // // 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_INDEX_DETAIL_ALGORITHMS_UNION_CONTENT_HPP #define BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_UNION_CONTENT_HPP #include #include namespace boost { namespace geometry { namespace index { namespace detail { /** * \brief Compute the area of the union of b1 and b2 */ template inline typename default_content_result::type union_content(Box const& b, Geometry const& g) { Box expanded_box(b); geometry::expand(expanded_box, g); return detail::content(expanded_box); } }}}} // namespace boost::geometry::index::detail #endif // BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_UNION_CONTENT_HPP