Просмотр исходного кода

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

divankov 3 лет назад
Родитель
Сommit
5b8d95df2f

+ 3 - 3
contrib/libs/jemalloc/spinlock.h

@@ -1,9 +1,9 @@
 #pragma once
 
-#include <util/system/defaults.h> 
+#include <util/system/defaults.h>
+
+typedef volatile intptr_t spinlock_t;
 
-typedef volatile intptr_t spinlock_t; 
- 
 #define SPIN_L AllocAcquireAdaptiveLock
 #define SPIN_U AllocReleaseAdaptiveLock
 

+ 2 - 2
library/cpp/cgiparam/cgiparam_ut.cpp

@@ -51,7 +51,7 @@ Y_UNIT_TEST_SUITE(TCgiParametersTest) {
         TCgiParameters c;
         c.Scan(parsee);
 
-        c.InsertUnescaped("d", "xxx"); 
+        c.InsertUnescaped("d", "xxx");
 
         UNIT_ASSERT_VALUES_EQUAL(c.Print(), parsee + "&d=xxx");
     }
@@ -197,7 +197,7 @@ Y_UNIT_TEST_SUITE(TCgiParametersTest) {
     Y_UNIT_TEST(TestJoinUnescaped) {
         TCgiParameters c;
 
-        c.Scan("foo=1&foo=2"); 
+        c.Scan("foo=1&foo=2");
         c.JoinUnescaped("foo", ';', "0");
 
         UNIT_ASSERT_VALUES_EQUAL(c.Print(), "foo=1;2;0");

+ 1 - 1
library/cpp/regex/pcre/regexp.h

@@ -18,7 +18,7 @@ class TRegExBaseImpl;
 
 class TRegExBase {
 protected:
-    TSimpleIntrusivePtr<TRegExBaseImpl> Impl; 
+    TSimpleIntrusivePtr<TRegExBaseImpl> Impl;
 
 public:
     TRegExBase(const char* regExpr = nullptr, int cflags = REG_EXTENDED);

+ 1 - 1
library/cpp/string_utils/quote/quote.h

@@ -32,7 +32,7 @@ char* CGIUnescape(char* to, const char* from);
 char* CGIUnescape(char* to, const char* from, size_t len);
 void CGIUnescape(TString& url);
 TString CGIUnescapeRet(const TStringBuf from);
- 
+
 inline TStringBuf CgiUnescapeBuf(char* to, const TStringBuf from) {
     return TStringBuf(to, CGIUnescape(to, from.data(), from.size()));
 }

+ 4 - 4
library/cpp/testing/unittest/utmain.cpp

@@ -244,7 +244,7 @@ public:
     inline void SetShowFails(bool show) {
         ShowFails = show;
     }
- 
+
     void SetContinueOnFail(bool val) {
         NUnitTest::ContinueOnFail = val;
     }
@@ -421,7 +421,7 @@ private:
         if (ShowFails) {
             for (size_t i = 0; i < Fails.size(); ++i) {
                 printf("%s", Fails[i].data());
-            } 
+            }
         }
     }
 
@@ -693,8 +693,8 @@ int NUnitTest::RunMain(int argc, char** argv) {
                     processor.SetPrintBeforeSuite(true);
                 } else if (strcmp(name, "--print-before-test") == 0) {
                     processor.SetPrintBeforeTest(true);
-                } else if (strcmp(name, "--show-fails") == 0) { 
-                    processor.SetShowFails(true); 
+                } else if (strcmp(name, "--show-fails") == 0) {
+                    processor.SetShowFails(true);
                 } else if (strcmp(name, "--dont-show-fails") == 0) {
                     processor.SetShowFails(false);
                 } else if (strcmp(name, "--continue-on-fail") == 0) {

+ 2 - 2
library/cpp/uri/uri_ut.cpp

@@ -552,7 +552,7 @@ namespace NUri {
                 URL_TEST(url, test);
             }
         }
- 
+
         Y_UNIT_TEST(test11) {
             {
                 TTest test = {
@@ -568,7 +568,7 @@ namespace NUri {
                 URL_TEST(url, test);
             }
         }
- 
+
         Y_UNIT_TEST(test12) {
             // test characters which are not always safe
             {

+ 1 - 1
util/datetime/base.h

@@ -53,7 +53,7 @@ void sprint_gm_date(char* buf, time_t when, long* sec = nullptr);
 bool sscan_date(const char* date, struct tm& theTm);
 
 const int DATE_8601_LEN = 21; // strlen("YYYY-MM-DDThh:mm:ssZ") = 20 + '\0'
- 
+
 size_t FormatDate8601(char* buf, size_t len, time_t when);
 
 inline void sprint_date8601(char* buf, time_t when) {

+ 2 - 2
util/generic/algorithm.h

@@ -63,7 +63,7 @@ static inline void SortBy(TContainer& container, const TGetKey& getKey) {
     SortBy(container.begin(), container.end(), getKey);
 }
 
-template <class T> 
+template <class T>
 static inline void StableSort(T f, T l) {
     std::stable_sort(f, l);
 }
@@ -93,7 +93,7 @@ static inline void StableSortBy(TContainer& container, const TGetKey& getKey) {
     StableSortBy(container.begin(), container.end(), getKey);
 }
 
-template <class T> 
+template <class T>
 static inline void PartialSort(T f, T m, T l) {
     std::partial_sort(f, m, l);
 }

+ 2 - 2
util/generic/hash.h

@@ -743,7 +743,7 @@ public:
     template <class ForwardIterator>
     void insert_unique(ForwardIterator f, ForwardIterator l, std::forward_iterator_tag) {
         difference_type n = std::distance(f, l);
- 
+
         reserve(num_elements + n);
         for (; n > 0; --n, ++f)
             insert_unique_noresize(*f);
@@ -752,7 +752,7 @@ public:
     template <class ForwardIterator>
     void insert_equal(ForwardIterator f, ForwardIterator l, std::forward_iterator_tag) {
         difference_type n = std::distance(f, l);
- 
+
         reserve(num_elements + n);
         for (; n > 0; --n, ++f)
             emplace_equal_noresize(*f);

+ 2 - 2
util/generic/intrlist_ut.cpp

@@ -246,7 +246,7 @@ static void TestCutFront(int N, int M) {
     }
 
     TMyList::Cut(l.Begin(), it, l2.End());
-    CheckIterationAfterCut(l2, l, N, M); 
+    CheckIterationAfterCut(l2, l, N, M);
 }
 
 static void TestCutBack(int N, int M) {
@@ -259,7 +259,7 @@ static void TestCutBack(int N, int M) {
     }
 
     TMyList::Cut(it, l.End(), l2.End());
-    CheckIterationAfterCut(l, l2, N, M); 
+    CheckIterationAfterCut(l, l2, N, M);
 }
 
 void TListTest::TestCut() {

Некоторые файлы не были показаны из-за большого количества измененных файлов