Restoring authorship annotation for <a-bocharov@yandex-team.ru>. Commit 1 of 2.

2 files changed, 31 insertions, 31 deletions

diff --git a/util/generic/algorithm.h b/util/generic/algorithm.h
index badfb889933..05a6c093ec0 100644
--- a/util/generic/algorithm.h
+++ b/util/generic/algorithm.h
@@ -192,21 +192,21 @@ static inline auto FindIfPtr(C&& c, P pred) {
 }
 
 template <class C, class T>
-static inline size_t FindIndex(C&& c, const T& x) {
+static inline size_t FindIndex(C&& c, const T& x) { 
     using std::begin;
     using std::end;
     auto it = Find(begin(c), end(c), x);
     return it == end(c) ? NPOS : (it - begin(c));
 }
 
-template <class C, class P>
-static inline size_t FindIndexIf(C&& c, P p) {
-    using std::begin;
-    using std::end;
-    auto it = FindIf(begin(c), end(c), p);
-    return it == end(c) ? NPOS : (it - begin(c));
-}
-
+template <class C, class P> 
+static inline size_t FindIndexIf(C&& c, P p) { 
+    using std::begin; 
+    using std::end; 
+    auto it = FindIf(begin(c), end(c), p); 
+    return it == end(c) ? NPOS : (it - begin(c)); 
+} 
+ 
 //EqualToOneOf(x, "apple", "orange") means (x == "apple" || x == "orange")
 template <typename T>
 inline bool EqualToOneOf(const T&) {
diff --git a/util/generic/algorithm_ut.cpp b/util/generic/algorithm_ut.cpp
index 8d732fcc0cf..87a41c89bb8 100644
--- a/util/generic/algorithm_ut.cpp
+++ b/util/generic/algorithm_ut.cpp
@@ -225,28 +225,28 @@ Y_UNIT_TEST_SUITE(TAlgorithm) {
         UNIT_ASSERT_EQUAL(NPOS, FindIndex(empty, 0));
     }
 
-    Y_UNIT_TEST(FindIndexIfTest) {
-        TVectorNoCopy v;
-        v.push_back(1);
-        v.push_back(2);
-        v.push_back(3);
-
-        UNIT_ASSERT_EQUAL(0, FindIndexIf(v, [](int x) { return x == 1; }));
-        UNIT_ASSERT_EQUAL(1, FindIndexIf(v, [](int x) { return x == 2; }));
-        UNIT_ASSERT_EQUAL(2, FindIndexIf(v, [](int x) { return x == 3; }));
-        UNIT_ASSERT_EQUAL(NPOS, FindIndexIf(v, [](int x) { return x == 42; }));
-
-        int array[3] = {1, 2, 3};
-
-        UNIT_ASSERT_EQUAL(0, FindIndexIf(array, [](int x) { return x == 1; }));
-        UNIT_ASSERT_EQUAL(1, FindIndexIf(array, [](int x) { return x == 2; }));
-        UNIT_ASSERT_EQUAL(2, FindIndexIf(array, [](int x) { return x == 3; }));
-        UNIT_ASSERT_EQUAL(NPOS, FindIndexIf(array, [](int x) { return x == 42; }));
-
-        TVector<int> empty;
-        UNIT_ASSERT_EQUAL(NPOS, FindIndexIf(empty, [](int x) { return x == 3; }));
-    }
-
+    Y_UNIT_TEST(FindIndexIfTest) { 
+        TVectorNoCopy v; 
+        v.push_back(1); 
+        v.push_back(2); 
+        v.push_back(3); 
+ 
+        UNIT_ASSERT_EQUAL(0, FindIndexIf(v, [](int x) { return x == 1; })); 
+        UNIT_ASSERT_EQUAL(1, FindIndexIf(v, [](int x) { return x == 2; })); 
+        UNIT_ASSERT_EQUAL(2, FindIndexIf(v, [](int x) { return x == 3; })); 
+        UNIT_ASSERT_EQUAL(NPOS, FindIndexIf(v, [](int x) { return x == 42; })); 
+ 
+        int array[3] = {1, 2, 3}; 
+ 
+        UNIT_ASSERT_EQUAL(0, FindIndexIf(array, [](int x) { return x == 1; })); 
+        UNIT_ASSERT_EQUAL(1, FindIndexIf(array, [](int x) { return x == 2; })); 
+        UNIT_ASSERT_EQUAL(2, FindIndexIf(array, [](int x) { return x == 3; })); 
+        UNIT_ASSERT_EQUAL(NPOS, FindIndexIf(array, [](int x) { return x == 42; })); 
+ 
+        TVector<int> empty; 
+        UNIT_ASSERT_EQUAL(NPOS, FindIndexIf(empty, [](int x) { return x == 3; })); 
+    } 
+ 
     Y_UNIT_TEST(SortUniqueTest) {
         {
             TVector<TString> v;