blob: 17fbd65ddc943956b46eab0a69e0fa8f8d12abb4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
// Boost.Geometry (aka GGL, Generic Geometry Library)
// Copyright (c) 2014, Oracle and/or its affiliates.
// Licensed under the Boost Software License version 1.0.
// http://www.boost.org/users/license.html
// Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle
#ifndef BOOST_GEOMETRY_ALGORITHMS_DETAIL_TURNS_FILTER_CONTINUE_TURNS_HPP
#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_TURNS_FILTER_CONTINUE_TURNS_HPP
#include <algorithm>
#include <boost/geometry/algorithms/detail/overlay/turn_info.hpp>
namespace boost { namespace geometry
{
namespace detail { namespace turns
{
template <typename Turns, bool Enable>
struct filter_continue_turns
{
static inline void apply(Turns&) {}
};
template <typename Turns>
class filter_continue_turns<Turns, true>
{
private:
class IsContinueTurn
{
private:
template <typename Operation>
inline bool is_continue_or_opposite(Operation const& operation) const
{
return operation == detail::overlay::operation_continue
|| operation == detail::overlay::operation_opposite;
}
public:
template <typename Turn>
bool operator()(Turn const& turn) const
{
if ( turn.method != detail::overlay::method_collinear
&& turn.method != detail::overlay::method_equal )
{
return false;
}
return is_continue_or_opposite(turn.operations[0].operation)
&& is_continue_or_opposite(turn.operations[1].operation);
}
};
public:
static inline void apply(Turns& turns)
{
turns.erase( std::remove_if(turns.begin(), turns.end(),
IsContinueTurn()),
turns.end()
);
}
};
}} // namespace detail::turns
}} // namespect boost::geometry
#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_TURNS_FILTER_CONTINUE_TURNS_HPP
|
