FM / buffer

/usr/include/boost/geometry/algorithms/detail/buffer/

/usr/include/boost/geometry/algorithms/detail/buffer

Name	Size	Mode	Actions
buffered_piece_collection.hpp	43881	0644	edit dl rm
buffered_ring.hpp	6574	0644	edit dl rm
buffer_box.hpp	2005	0644	edit dl rm
buffer_inserter.hpp	35775	0644	edit dl rm
buffer_policies.hpp	8286	0644	edit dl rm
get_piece_turns.hpp	12156	0644	edit dl rm
line_line_intersection.hpp	1769	0644	edit dl rm
piece_border.hpp	18348	0644	edit dl rm
turn_in_original_visitor.hpp	8510	0644	edit dl rm
turn_in_piece_visitor.hpp	6963	0644	edit dl rm

Edit: /usr/include/boost/geometry/algorithms/detail/buffer/line_line_intersection.hpp (1769B)

// Boost.Geometry (aka GGL, Generic Geometry Library)

// 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_DETAIL_BUFFER_LINE_LINE_INTERSECTION_HPP
#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_BUFFER_LINE_LINE_INTERSECTION_HPP

#include <boost/geometry/core/assert.hpp>
#include <boost/geometry/arithmetic/infinite_line_functions.hpp>
#include <boost/geometry/algorithms/detail/make/make.hpp>

#include <boost/core/ignore_unused.hpp>

namespace boost { namespace geometry
{

#ifndef DOXYGEN_NO_DETAIL
namespace detail { namespace buffer
{

// TODO: it might once be changed this to proper strategy
struct line_line_intersection
{
    template <typename Point>
    static inline Point
    apply(Point const& pi, Point const& pj, Point const& qi, Point const& qj)
    {
        typedef typename coordinate_type<Point>::type ct;
        typedef model::infinite_line<ct> line_type;

line_type const p = detail::make::make_infinite_line<ct>(pi, pj);
        line_type const q = detail::make::make_infinite_line<ct>(qi, qj);

// The input lines are not parallel, they intersect, because
        // their join type is checked before.
        Point ip;
        bool const intersecting = arithmetic::intersection_point(p, q, ip);
        BOOST_GEOMETRY_ASSERT(intersecting);
        boost::ignore_unused(intersecting);

return ip;
    }
};

}} // namespace detail::buffer
#endif // DOXYGEN_NO_DETAIL

}} // namespace boost::geometry

#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_BUFFER_LINE_LINE_INTERSECTION_HPP

// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2012-2020 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_DETAIL_BUFFER_LINE_LINE_INTERSECTION_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_BUFFER_LINE_LINE_INTERSECTION_HPP #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace buffer { // TODO: it might once be changed this to proper strategy struct line_line_intersection { template static inline Point apply(Point const& pi, Point const& pj, Point const& qi, Point const& qj) { typedef typename coordinate_type::type ct; typedef model::infinite_line line_type; line_type const p = detail::make::make_infinite_line(pi, pj); line_type const q = detail::make::make_infinite_line(qi, qj); // The input lines are not parallel, they intersect, because // their join type is checked before. Point ip; bool const intersecting = arithmetic::intersection_point(p, q, ip); BOOST_GEOMETRY_ASSERT(intersecting); boost::ignore_unused(intersecting); return ip; } }; }} // namespace detail::buffer #endif // DOXYGEN_NO_DETAIL }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_BUFFER_LINE_LINE_INTERSECTION_HPP