// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2014 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2008-2014 Bruno Lalande, Paris, France. // Copyright (c) 2009-2014 Mateusz Loskot, London, UK. // This file was modified by Oracle on 2014. // Modifications copyright (c) 2014, Oracle and/or its affiliates. // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library // (geolib/GGL), copyright (c) 1995-2010 Geodan, 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_LENGTH_HPP #define BOOST_GEOMETRY_ALGORITHMS_LENGTH_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace length { template struct segment_length { template static inline typename default_length_result::type apply( Segment const& segment, Strategy const& strategy) { typedef typename point_type::type point_type; point_type p1, p2; geometry::detail::assign_point_from_index<0>(segment, p1); geometry::detail::assign_point_from_index<1>(segment, p2); return strategy.apply(p1, p2); } }; /*! \brief Internal, calculates length of a linestring using iterator pairs and specified strategy \note for_each could be used here, now that point_type is changed by boost range iterator */ template struct range_length { typedef typename default_length_result::type return_type; template static inline return_type apply( Range const& range, Strategy const& strategy) { boost::ignore_unused_variable_warning(strategy); typedef typename closeable_view::type view_type; typedef typename boost::range_iterator < view_type const >::type iterator_type; return_type sum = return_type(); view_type view(range); iterator_type it = boost::begin(view), end = boost::end(view); if(it != end) { for(iterator_type previous = it++; it != end; ++previous, ++it) { // Add point-point distance using the return type belonging // to strategy sum += strategy.apply(*previous, *it); } } return sum; } }; }} // namespace detail::length #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template ::type> struct length : detail::calculate_null { typedef typename default_length_result::type return_type; template static inline return_type apply(Geometry const& geometry, Strategy const& strategy) { return calculate_null::apply(geometry, strategy); } }; template struct length : detail::length::range_length {}; // RING: length is currently 0; it might be argued that it is the "perimeter" template struct length : detail::length::segment_length {}; template struct length : detail::multi_sum { template static inline typename default_length_result::type apply(MultiLinestring const& multi, Strategy const& strategy) { return multi_sum::apply < typename default_length_result::type, detail::length::range_length < typename boost::range_value::type, closed // no need to close it explicitly > >(multi, strategy); } }; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH namespace resolve_variant { template struct length { template static inline typename default_length_result::type apply(Geometry const& geometry, Strategy const& strategy) { return dispatch::length::apply(geometry, strategy); } }; template struct length > { typedef typename default_length_result < boost::variant >::type result_type; template struct visitor : static_visitor { Strategy const& m_strategy; visitor(Strategy const& strategy) : m_strategy(strategy) {} template inline typename default_length_result::type operator()(Geometry const& geometry) const { return length::apply(geometry, m_strategy); } }; template static inline result_type apply( variant const& geometry, Strategy const& strategy ) { return apply_visitor(visitor(strategy), geometry); } }; } // namespace resolve_variant /*! \brief \brief_calc{length} \ingroup length \details \details_calc{length, length (the sum of distances between consecutive points)}. \details_default_strategy \tparam Geometry \tparam_geometry \param geometry \param_geometry \return \return_calc{length} \qbk{[include reference/algorithms/length.qbk]} \qbk{[length] [length_output]} */ template inline typename default_length_result::type length(Geometry const& geometry) { concept::check(); // detail::throw_on_empty_input(geometry); // TODO put this into a resolve_strategy stage typedef typename strategy::distance::services::default_strategy < point_tag, point_tag, typename point_type::type >::type strategy_type; return resolve_variant::length::apply(geometry, strategy_type()); } /*! \brief \brief_calc{length} \brief_strategy \ingroup length \details \details_calc{length, length (the sum of distances between consecutive points)} \brief_strategy. \details_strategy_reasons \tparam Geometry \tparam_geometry \tparam Strategy \tparam_strategy{distance} \param geometry \param_geometry \param strategy \param_strategy{distance} \return \return_calc{length} \qbk{distinguish,with strategy} \qbk{[include reference/algorithms/length.qbk]} \qbk{[length_with_strategy] [length_with_strategy_output]} */ template inline typename default_length_result::type length(Geometry const& geometry, Strategy const& strategy) { concept::check(); // detail::throw_on_empty_input(geometry); return resolve_variant::length::apply(geometry, strategy); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_LENGTH_HPP