diff --git a/routing/osrm_router.cpp b/routing/osrm_router.cpp
index 9a0a2ef363..e04151e107 100644
--- a/routing/osrm_router.cpp
+++ b/routing/osrm_router.cpp
@@ -694,8 +694,7 @@ m2::PointD OsrmRouter::GetPointForTurnAngle(OsrmFtSegMapping::FtSeg const &seg,
   m2::PointD pnt = turnPnt, nextPnt;
 
   const size_t segDist = abs(seg.m_pointEnd - seg.m_pointStart);
-  ASSERT_LESS(segDist, ft.GetPointsCount(),
-              ("GetPntForTurnAngle(). The start and the end pnt of a segment are too far from each other"));
+  ASSERT_LESS(segDist, ft.GetPointsCount(), ());
   const size_t usedFtPntNum = min(maxPntsNum, segDist);
 
   for (size_t i = 1; i <= usedFtPntNum; ++i)
@@ -792,9 +791,21 @@ void OsrmRouter::GetPossibleTurns(NodeID node,
     candidates.emplace_back(a, trg);
   }
 
-  sort(candidates.begin(), candidates.end(), [](TurnCandidate const & t1, TurnCandidate const & t2) { return t1.m_angle < t2.m_angle; });
-  auto last = unique(candidates.begin(), candidates.end());
+  sort(candidates.begin(), candidates.end(), [](TurnCandidate const & t1, TurnCandidate const & t2)
+  {
+    return t1.m_node < t2.m_node;
+  });
+
+  auto last = unique(candidates.begin(), candidates.end(), [](TurnCandidate const & t1, TurnCandidate const & t2)
+  {
+    return t1.m_node == t2.m_node;
+  });
   candidates.erase(last, candidates.end());
+
+  sort(candidates.begin(), candidates.end(), [](TurnCandidate const & t1, TurnCandidate const & t2)
+  {
+    return t1.m_angle < t2.m_angle;
+  });
 }
 
 
diff --git a/routing/osrm_router.hpp b/routing/osrm_router.hpp
index 95c56aba0f..d9c50f830e 100644
--- a/routing/osrm_router.hpp
+++ b/routing/osrm_router.hpp
@@ -46,11 +46,6 @@ public:
       : m_angle(a), m_node(n)
     {
     }
-
-    bool operator == (TurnCandidate const & other) const
-    {
-      return m_node == other.m_node;
-    }
   };
   typedef vector<TurnCandidate> TurnCandidatesT;