mirror of
https://codeberg.org/comaps/comaps
synced 2025-12-20 13:23:59 +00:00
Format all C++ and Java code via clang-format
Signed-off-by: Konstantin Pastbin <konstantin.pastbin@gmail.com>
This commit is contained in:
@@ -19,7 +19,6 @@ namespace turns
|
||||
/// \brief The TurnCandidate struct contains information about possible ways from a junction.
|
||||
struct TurnCandidate
|
||||
{
|
||||
|
||||
/// |m_angle| is the angle of the turn in degrees. It means the angle is 180 minus
|
||||
/// the angle between the current edge and the edge of the candidate. A counterclockwise rotation.
|
||||
/// The current edge is an edge which belongs to the route and is located before the junction.
|
||||
@@ -37,9 +36,11 @@ struct TurnCandidate
|
||||
bool m_isLink;
|
||||
|
||||
TurnCandidate(double angle, Segment const & segment, ftypes::HighwayClass c, bool isLink)
|
||||
: m_angle(angle), m_segment(segment), m_highwayClass(c), m_isLink(isLink)
|
||||
{
|
||||
}
|
||||
: m_angle(angle)
|
||||
, m_segment(segment)
|
||||
, m_highwayClass(c)
|
||||
, m_isLink(isLink)
|
||||
{}
|
||||
|
||||
bool IsAlmostEqual(TurnCandidate const & rhs) const
|
||||
{
|
||||
@@ -55,10 +56,8 @@ inline bool IsAlmostEqual(std::vector<TurnCandidate> const & lhs, std::vector<Tu
|
||||
return false;
|
||||
|
||||
for (size_t i = 0; i < lhs.size(); ++i)
|
||||
{
|
||||
if (!lhs[i].IsAlmostEqual(rhs[i]))
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
@@ -71,9 +70,8 @@ struct TurnCandidates
|
||||
|
||||
bool IsAlmostEqual(TurnCandidates const & rhs) const
|
||||
{
|
||||
return turns::IsAlmostEqual(candidates, rhs.candidates) &&
|
||||
isCandidatesAngleValid == rhs.isCandidatesAngleValid;
|
||||
return turns::IsAlmostEqual(candidates, rhs.candidates) && isCandidatesAngleValid == rhs.isCandidatesAngleValid;
|
||||
}
|
||||
};
|
||||
} // namespace routing
|
||||
} // namespace turns
|
||||
} // namespace routing
|
||||
|
||||
Reference in New Issue
Block a user