[bicycle routing] Simplifying IRoadGraph::ForEachEdge().

1 files changed, 3 insertions, 3 deletions

diff --git a/base/base_tests/stl_helpers_test.cpp b/base/base_tests/stl_helpers_test.cpp
index f42e8ac4df..af47c7e5fb 100644
--- a/base/base_tests/stl_helpers_test.cpp
+++ b/base/base_tests/stl_helpers_test.cpp
@@ -78,10 +78,10 @@ UNIT_TEST(EqualsBy)
 UNIT_TEST(SortUnique)
 {
   {
-    vector<int> v = {1, 2, 1, 4, 3, 5, 2, 7, 1};
-    my::SortUnique(v);
+    vector<int> actual = {1, 2, 1, 4, 3, 5, 2, 7, 1};
+    my::SortUnique(actual);
     vector<int> const expected = {1, 2, 3, 4, 5, 7};
-    TEST_EQUAL(v, expected, ());
+    TEST_EQUAL(actual, expected, ());
   }
   {
     using TValue = int;