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

12 files changed, 30 insertions, 30 deletions

diff --git a/library/cpp/containers/atomizer/atomizer.h b/library/cpp/containers/atomizer/atomizer.h
index b0ca6da0075..5e40f47ab93 100644
--- a/library/cpp/containers/atomizer/atomizer.h
+++ b/library/cpp/containers/atomizer/atomizer.h
@@ -41,7 +41,7 @@ public:
     {
         order.reserve(hash_size);
     }
-    ~atomizer() = default; 
+    ~atomizer() = default;
     ui32 string_to_atom(const char* key) {
         const char* old_begin = pool.Begin();
         const char* old_end = pool.End();
@@ -73,7 +73,7 @@ public:
     const char* get_atom_name(ui32 atom) const {
         if (atom && atom <= size())
             return order[atom - 1];
-        return nullptr; 
+        return nullptr;
     }
     void clear_atomizer() {
         clear_hash();
@@ -137,7 +137,7 @@ public:
     {
         order.reserve(hash_size);
     }
-    ~super_atomizer() = default; 
+    ~super_atomizer() = default;
     ui32 string_to_atom(const char* key, const T* atom_data = NULL) {
         const char* old_begin = pool.Begin();
         const char* old_end = pool.End();
@@ -169,7 +169,7 @@ public:
     const char* get_atom_name(ui32 atom) const {
         if (atom && atom <= size())
             return order[atom - 1].first;
-        return nullptr; 
+        return nullptr;
     }
     const T* get_atom_data(ui32 atom) const {
         if (atom && atom <= size())
diff --git a/library/cpp/containers/bitseq/bitvector.h b/library/cpp/containers/bitseq/bitvector.h
index d7d8db42684..3f8fd81ee57 100644
--- a/library/cpp/containers/bitseq/bitvector.h
+++ b/library/cpp/containers/bitseq/bitvector.h
@@ -34,7 +34,7 @@ public:
     {
     }
 
-    virtual ~TBitVector() = default; 
+    virtual ~TBitVector() = default;
 
     void Clear() {
         Size_ = 0;
diff --git a/library/cpp/containers/compact_vector/compact_vector.h b/library/cpp/containers/compact_vector/compact_vector.h
index 95f1255815b..dbe7473f0cc 100644
--- a/library/cpp/containers/compact_vector/compact_vector.h
+++ b/library/cpp/containers/compact_vector/compact_vector.h
@@ -39,12 +39,12 @@ public:
     typedef TConstIterator const_iterator;
 
     TCompactVector()
-        : Ptr(nullptr) 
+        : Ptr(nullptr)
     {
     }
 
     TCompactVector(const TThis& that)
-        : Ptr(nullptr) 
+        : Ptr(nullptr)
     {
         Reserve(that.Size());
         for (TConstIterator i = that.Begin(); i != that.End(); ++i) {
@@ -101,9 +101,9 @@ public:
 
     void Reserve(size_t newCapacity) {
         if (newCapacity <= Capacity()) {
-        } else if (Ptr == nullptr) { 
+        } else if (Ptr == nullptr) {
             void* mem = ::malloc(sizeof(THeader) + newCapacity * sizeof(T));
-            if (mem == nullptr) 
+            if (mem == nullptr)
                 ythrow yexception() << "out of memory";
             Ptr = (T*)(((THeader*)mem) + 1);
             Header()->Size = 0;
diff --git a/library/cpp/containers/comptrie/chunked_helpers_trie.h b/library/cpp/containers/comptrie/chunked_helpers_trie.h
index 4b925042a1f..cfa35f5ba2a 100644
--- a/library/cpp/containers/comptrie/chunked_helpers_trie.h
+++ b/library/cpp/containers/comptrie/chunked_helpers_trie.h
@@ -185,7 +185,7 @@ private:
     TValues Values;
 
 public:
-    TTrieSortedMapWriter() = default; 
+    TTrieSortedMapWriter() = default;
 
     void Add(const char* key, const T& value) {
         Values.push_back(TValue(key, value));
diff --git a/library/cpp/containers/comptrie/comptrie_builder.inl b/library/cpp/containers/comptrie/comptrie_builder.inl
index 35afea402bc..f273fa65710 100644
--- a/library/cpp/containers/comptrie/comptrie_builder.inl
+++ b/library/cpp/containers/comptrie/comptrie_builder.inl
@@ -115,7 +115,7 @@ public:
     typedef typename TBuilderImpl::TArc TArc;
 
     struct ISubtree {
-        virtual ~ISubtree() = default; 
+        virtual ~ISubtree() = default;
         virtual bool IsLast() const = 0;
         virtual ui64 Measure(const TBuilderImpl* builder) const = 0;
         virtual ui64 Save(const TBuilderImpl* builder, IOutputStream& os) const = 0;
@@ -146,8 +146,8 @@ public:
             return this->Empty();
         }
 
-        const TNode* Find(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override; 
-        const TNode* FindLongestPrefix(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override { 
+        const TNode* Find(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override;
+        const TNode* FindLongestPrefix(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override {
             return Find(key, value, result, packer);
         }
 
@@ -208,7 +208,7 @@ public:
             this->clear();
         }
 
-        ~TArcSet() override { 
+        ~TArcSet() override {
             Y_ASSERT(this->empty());
         }
 
@@ -225,7 +225,7 @@ public:
             return Buffer.Empty();
         }
 
-        const TNode* Find(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override { 
+        const TNode* Find(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override {
             if (Buffer.Empty()) {
                 result = false;
                 return nullptr;
@@ -237,7 +237,7 @@ public:
             return nullptr;
         }
 
-        const TNode* FindLongestPrefix(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override { 
+        const TNode* FindLongestPrefix(TStringBuf& key, TData* value, bool& result, const TPacker& packer) const override {
             if (Buffer.Empty()) {
                 result = false;
                 return nullptr;
@@ -291,7 +291,7 @@ public:
             return Data->Size == 0;
         }
 
-        const TNode* Find(TStringBuf& key, typename TCompactTrieBuilder::TData* value, bool& result, const TPacker& packer) const override { 
+        const TNode* Find(TStringBuf& key, typename TCompactTrieBuilder::TData* value, bool& result, const TPacker& packer) const override {
             if (!Data) {
                 result = false;
                 return nullptr;
@@ -302,7 +302,7 @@ public:
             return nullptr;
         }
 
-        const TNode* FindLongestPrefix(TStringBuf& key, typename TCompactTrieBuilder::TData* value, bool& result, const TPacker& packer) const override { 
+        const TNode* FindLongestPrefix(TStringBuf& key, typename TCompactTrieBuilder::TData* value, bool& result, const TPacker& packer) const override {
             if (!Data) {
                 result = false;
                 return nullptr;
@@ -622,7 +622,7 @@ typename TCompactTrieBuilder<T, D, S>::TCompactTrieBuilderImpl::TNode*
     char* ckey = ckeybuf.Data();
 
     TNode* next;
-    while ((ckeylen > 0) && (next = NodeForwardAdd(current, ckey, ckeylen, passed, &NodeCount)) != nullptr) { 
+    while ((ckeylen > 0) && (next = NodeForwardAdd(current, ckey, ckeylen, passed, &NodeCount)) != nullptr) {
         current = next;
         ckeylen -= passed;
         ckey += passed;
@@ -807,7 +807,7 @@ typename TCompactTrieBuilder<T, D, S>::TCompactTrieBuilderImpl::TNode*
         return it->Node;
     }
 
-    return nullptr; 
+    return nullptr;
 }
 
 template <class T, class D, class S>
diff --git a/library/cpp/containers/comptrie/comptrie_impl.h b/library/cpp/containers/comptrie/comptrie_impl.h
index b2fdba09310..f41c38311a4 100644
--- a/library/cpp/containers/comptrie/comptrie_impl.h
+++ b/library/cpp/containers/comptrie/comptrie_impl.h
@@ -172,7 +172,7 @@ namespace NCompactTrie {
         }
 
         // if we got here, we're past the dataend - bail out ASAP
-        datapos = nullptr; 
+        datapos = nullptr;
         return 0;
     }
 
diff --git a/library/cpp/containers/comptrie/comptrie_trie.h b/library/cpp/containers/comptrie/comptrie_trie.h
index 5a6811f8a18..40ec1e52b32 100644
--- a/library/cpp/containers/comptrie/comptrie_trie.h
+++ b/library/cpp/containers/comptrie/comptrie_trie.h
@@ -52,7 +52,7 @@ protected:
     NCompactTrie::TPackerLeafSkipper<TPacker> Skipper = &Packer; // This should be true for every constructor.
 
 public:
-    TCompactTrie() = default; 
+    TCompactTrie() = default;
 
     TCompactTrie(const char* d, size_t len, TPacker packer);
     TCompactTrie(const char* d, size_t len)
@@ -150,7 +150,7 @@ public:
         TConstIterator(const TOpaqueTrie& trie, const char* emptyValue, const TKeyBuf& key, TPacker packer); // only usable from UpperBound() method
 
     public:
-        TConstIterator() = default; 
+        TConstIterator() = default;
         bool IsEmpty() const {
             return !Impl;
         } // Almost no other method can be called.
diff --git a/library/cpp/containers/comptrie/leaf_skipper.h b/library/cpp/containers/comptrie/leaf_skipper.h
index 2136b8d59a8..39592589487 100644
--- a/library/cpp/containers/comptrie/leaf_skipper.h
+++ b/library/cpp/containers/comptrie/leaf_skipper.h
@@ -6,7 +6,7 @@ namespace NCompactTrie {
     class ILeafSkipper {
     public:
         virtual size_t SkipLeaf(const char* p) const = 0;
-        virtual ~ILeafSkipper() = default; 
+        virtual ~ILeafSkipper() = default;
     };
 
     template <class TPacker>
@@ -20,7 +20,7 @@ namespace NCompactTrie {
         {
         }
 
-        size_t SkipLeaf(const char* p) const override { 
+        size_t SkipLeaf(const char* p) const override {
             return Packer->SkipLeaf(p);
         }
 
diff --git a/library/cpp/containers/comptrie/protopacker.h b/library/cpp/containers/comptrie/protopacker.h
index b5f82c17b1e..3e15866dc54 100644
--- a/library/cpp/containers/comptrie/protopacker.h
+++ b/library/cpp/containers/comptrie/protopacker.h
@@ -6,7 +6,7 @@
 template <class Proto>
 class TProtoPacker {
 public:
-    TProtoPacker() = default; 
+    TProtoPacker() = default;
 
     void UnpackLeaf(const char* p, Proto& entry) const {
         TMemoryInput in(p + sizeof(ui32), SkipLeaf(p) - sizeof(ui32));
diff --git a/library/cpp/containers/comptrie/set.h b/library/cpp/containers/comptrie/set.h
index 92c378b7806..acd43338f0a 100644
--- a/library/cpp/containers/comptrie/set.h
+++ b/library/cpp/containers/comptrie/set.h
@@ -12,7 +12,7 @@ public:
     using typename TBase::TKeyBuf;
     using typename TBase::TSymbol;
 
-    TCompactTrieSet() = default; 
+    TCompactTrieSet() = default;
 
     explicit TCompactTrieSet(const TBlob& data)
         : TBase(data)
diff --git a/library/cpp/containers/comptrie/write_trie_backwards.h b/library/cpp/containers/comptrie/write_trie_backwards.h
index d50d45159e1..634e6b811a4 100644
--- a/library/cpp/containers/comptrie/write_trie_backwards.h
+++ b/library/cpp/containers/comptrie/write_trie_backwards.h
@@ -9,7 +9,7 @@
 namespace NCompactTrie {
     class TReverseNodeEnumerator {
     public:
-        virtual ~TReverseNodeEnumerator() = default; 
+        virtual ~TReverseNodeEnumerator() = default;
         virtual bool Move() = 0;
         virtual size_t GetLeafLength() const = 0;
         virtual size_t RecreateNode(char* buffer, size_t resultLength) = 0;
diff --git a/library/cpp/containers/intrusive_rb_tree/rb_tree.h b/library/cpp/containers/intrusive_rb_tree/rb_tree.h
index 1ac2c9d62db..0259452a145 100644
--- a/library/cpp/containers/intrusive_rb_tree/rb_tree.h
+++ b/library/cpp/containers/intrusive_rb_tree/rb_tree.h
@@ -95,7 +95,7 @@ struct TRbTreeIterator: public TRbTreeBaseIterator {
     using TSelf = TRbTreeIterator<TValue, TTraits>;
     using TBasePtr = TRbTreeNodeBase*;
 
-    inline TRbTreeIterator() noexcept = default; 
+    inline TRbTreeIterator() noexcept = default;
 
     template <class T1>
     inline TRbTreeIterator(const T1& x) noexcept
@@ -147,7 +147,7 @@ struct TRbTreeIterator: public TRbTreeBaseIterator {
 template <class TValue, class TCmp>
 class TRbTree {
     struct TCmpAdaptor: public TCmp {
-        inline TCmpAdaptor() noexcept = default; 
+        inline TCmpAdaptor() noexcept = default;
 
         inline TCmpAdaptor(const TCmp& cmp) noexcept
             : TCmp(cmp)