Restoring authorship annotation for <sukhoi@yandex-team.ru>. Commit 2 of 2.

3 files changed, 25 insertions, 25 deletions

diff --git a/build/rules/contrib_python.policy b/build/rules/contrib_python.policy
index ff75009b606..60fd1497533 100644
--- a/build/rules/contrib_python.policy
+++ b/build/rules/contrib_python.policy
@@ -236,7 +236,7 @@ ALLOW trust/processing_holder -> contrib/python/pycrypto
 ALLOW trust/tests/tests_trust_bindings -> contrib/python/pycrypto
 ALLOW yabs/server/tools/banner_user_choice -> contrib/python/pycrypto
 ALLOW yabs/server/test -> contrib/python/pycrypto
-ALLOW ydo/database/active_record -> contrib/python/pycrypto 
+ALLOW ydo/database/active_record -> contrib/python/pycrypto
 ALLOW yweb/antispam/cid -> contrib/python/pycrypto
 ALLOW mail/payments/payments -> contrib/python/pycrypto
 DENY .* -> contrib/python/pycrypto
diff --git a/util/generic/algorithm.h b/util/generic/algorithm.h
index aa700a7c040..badfb889933 100644
--- a/util/generic/algorithm.h
+++ b/util/generic/algorithm.h
@@ -313,18 +313,18 @@ static inline T UniqueBy(T f, T l, const TGetKey& getKey) {
     return Unique(f, l, [&](auto&& left, auto&& right) { return getKey(left) == getKey(right); });
 }
 
-template <class C> 
-void SortUnique(C& c) { 
-    Sort(c.begin(), c.end()); 
+template <class C>
+void SortUnique(C& c) {
+    Sort(c.begin(), c.end());
     c.erase(Unique(c.begin(), c.end()), c.end());
-} 
- 
-template <class C, class Cmp> 
-void SortUnique(C& c, Cmp cmp) { 
-    Sort(c.begin(), c.end(), cmp); 
+}
+
+template <class C, class Cmp>
+void SortUnique(C& c, Cmp cmp) {
+    Sort(c.begin(), c.end(), cmp);
     c.erase(Unique(c.begin(), c.end()), c.end());
-} 
- 
+}
+
 template <class C, class TGetKey>
 void SortUniqueBy(C& c, const TGetKey& getKey) {
     SortBy(c, getKey);
diff --git a/util/generic/algorithm_ut.cpp b/util/generic/algorithm_ut.cpp
index 1b6f8595dc9..8d732fcc0cf 100644
--- a/util/generic/algorithm_ut.cpp
+++ b/util/generic/algorithm_ut.cpp
@@ -224,7 +224,7 @@ Y_UNIT_TEST_SUITE(TAlgorithm) {
         TVector<int> empty;
         UNIT_ASSERT_EQUAL(NPOS, FindIndex(empty, 0));
     }
- 
+
     Y_UNIT_TEST(FindIndexIfTest) {
         TVectorNoCopy v;
         v.push_back(1);
@@ -248,23 +248,23 @@ Y_UNIT_TEST_SUITE(TAlgorithm) {
     }
 
     Y_UNIT_TEST(SortUniqueTest) {
-        { 
+        {
             TVector<TString> v;
-            SortUnique(v); 
+            SortUnique(v);
             UNIT_ASSERT_EQUAL(v, TVector<TString>());
-        } 
- 
-        { 
-            const char* ar[] = {"345", "3", "123", "2", "23", "3", "2"}; 
+        }
+
+        {
+            const char* ar[] = {"345", "3", "123", "2", "23", "3", "2"};
             TVector<TString> v(ar, ar + Y_ARRAY_SIZE(ar));
-            SortUnique(v); 
- 
-            const char* suAr[] = {"123", "2", "23", "3", "345"}; 
+            SortUnique(v);
+
+            const char* suAr[] = {"123", "2", "23", "3", "345"};
             TVector<TString> suV(suAr, suAr + Y_ARRAY_SIZE(suAr));
- 
-            UNIT_ASSERT_EQUAL(v, suV); 
-        } 
-    } 
+
+            UNIT_ASSERT_EQUAL(v, suV);
+        }
+    }
 
     Y_UNIT_TEST(EraseTest) {
         TVector<int> data = {5, 4, 3, 2, 1, 0};