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

45 files changed, 122 insertions, 122 deletions

diff --git a/library/cpp/containers/atomizer/atomizer.h b/library/cpp/containers/atomizer/atomizer.h
index 5e40f47ab9..df25899dbb 100644
--- a/library/cpp/containers/atomizer/atomizer.h
+++ b/library/cpp/containers/atomizer/atomizer.h
@@ -1,6 +1,6 @@
 #pragma once
 
-#include <library/cpp/containers/str_map/str_map.h>
+#include <library/cpp/containers/str_map/str_map.h> 
 
 #include <util/generic/vector.h>
 #include <util/generic/utility.h>
diff --git a/library/cpp/containers/atomizer/ya.make b/library/cpp/containers/atomizer/ya.make
index 55165a3b67..7076e9d915 100644
--- a/library/cpp/containers/atomizer/ya.make
+++ b/library/cpp/containers/atomizer/ya.make
@@ -3,7 +3,7 @@ LIBRARY()
 OWNER(g:util)
 
 PEERDIR(
-    library/cpp/containers/str_map
+    library/cpp/containers/str_map 
 )
 
 SRCS(
diff --git a/library/cpp/containers/bitseq/ut/ya.make b/library/cpp/containers/bitseq/ut/ya.make
index 7155e82c06..acaa044db2 100644
--- a/library/cpp/containers/bitseq/ut/ya.make
+++ b/library/cpp/containers/bitseq/ut/ya.make
@@ -1,4 +1,4 @@
-UNITTEST_FOR(library/cpp/containers/bitseq)
+UNITTEST_FOR(library/cpp/containers/bitseq) 
 
 OWNER(g:util)
 
diff --git a/library/cpp/containers/compact_vector/ut/ya.make b/library/cpp/containers/compact_vector/ut/ya.make
index 5e655bc619..f3e72ed41c 100644
--- a/library/cpp/containers/compact_vector/ut/ya.make
+++ b/library/cpp/containers/compact_vector/ut/ya.make
@@ -2,7 +2,7 @@ UNITTEST()
 
 OWNER(nga)
 
-SRCDIR(library/cpp/containers/compact_vector)
+SRCDIR(library/cpp/containers/compact_vector) 
 
 SRCS(
     compact_vector_ut.cpp
diff --git a/library/cpp/containers/comptrie/README.md b/library/cpp/containers/comptrie/README.md
index 43c298e2c8..c5efc26cb3 100644
--- a/library/cpp/containers/comptrie/README.md
+++ b/library/cpp/containers/comptrie/README.md
@@ -37,7 +37,7 @@ integer type, which means that arithmetical operations must be defined for it.
 serialize the value type to a continuous memory buffer, deserialize it
 back, and quickly determine its size using the pointer to the beginning of this
 memory buffer. Good packers have already been written for most types, and they are available in
-library/cpp/packers. For more information, please refer to the documentation for these packers.
+library/cpp/packers. For more information, please refer to the documentation for these packers. 
 
 The set.h file defines a modification for cases when keys must be stored
 without values.
diff --git a/library/cpp/containers/comptrie/benchmark/main.cpp b/library/cpp/containers/comptrie/benchmark/main.cpp
index 6e42dad18a..431034137b 100644
--- a/library/cpp/containers/comptrie/benchmark/main.cpp
+++ b/library/cpp/containers/comptrie/benchmark/main.cpp
@@ -5,11 +5,11 @@
 #include <library/cpp/containers/comptrie/search_iterator.h>
 #include <library/cpp/containers/comptrie/pattern_searcher.h>
 
-#include <library/cpp/on_disk/aho_corasick/writer.h>
-#include <library/cpp/on_disk/aho_corasick/reader.h>
-#include <library/cpp/on_disk/aho_corasick/helpers.h>
+#include <library/cpp/on_disk/aho_corasick/writer.h> 
+#include <library/cpp/on_disk/aho_corasick/reader.h> 
+#include <library/cpp/on_disk/aho_corasick/helpers.h> 
 
-#include <library/cpp/containers/dense_hash/dense_hash.h>
+#include <library/cpp/containers/dense_hash/dense_hash.h> 
 
 #include <util/stream/file.h>
 #include <util/generic/algorithm.h>
diff --git a/library/cpp/containers/comptrie/chunked_helpers_trie.h b/library/cpp/containers/comptrie/chunked_helpers_trie.h
index cfa35f5ba2..c139afd316 100644
--- a/library/cpp/containers/comptrie/chunked_helpers_trie.h
+++ b/library/cpp/containers/comptrie/chunked_helpers_trie.h
@@ -1,6 +1,6 @@
 #pragma once
 
-#include <library/cpp/on_disk/chunks/chunked_helpers.h>
+#include <library/cpp/on_disk/chunks/chunked_helpers.h> 
 
 #include "comptrie.h"
 
diff --git a/library/cpp/containers/comptrie/comptrie_builder.inl b/library/cpp/containers/comptrie/comptrie_builder.inl
index f273fa6571..5e6bb0f0ad 100644
--- a/library/cpp/containers/comptrie/comptrie_builder.inl
+++ b/library/cpp/containers/comptrie/comptrie_builder.inl
@@ -5,7 +5,7 @@
 #include "make_fast_layout.h"
 #include "array_with_size.h"
 
-#include <library/cpp/containers/compact_vector/compact_vector.h>
+#include <library/cpp/containers/compact_vector/compact_vector.h> 
 
 #include <util/memory/alloc.h>
 #include <util/memory/blob.h>
diff --git a/library/cpp/containers/comptrie/comptrie_packer.h b/library/cpp/containers/comptrie/comptrie_packer.h
index 0341eeeae3..f997d89dd1 100644
--- a/library/cpp/containers/comptrie/comptrie_packer.h
+++ b/library/cpp/containers/comptrie/comptrie_packer.h
@@ -1,6 +1,6 @@
 #pragma once
 
-#include <library/cpp/packers/packers.h>
+#include <library/cpp/packers/packers.h> 
 
 template <class T>
 class TCompactTriePacker {
diff --git a/library/cpp/containers/comptrie/loader/loader.h b/library/cpp/containers/comptrie/loader/loader.h
index ee10e9b451..d4f3c0503f 100644
--- a/library/cpp/containers/comptrie/loader/loader.h
+++ b/library/cpp/containers/comptrie/loader/loader.h
@@ -1,6 +1,6 @@
 #pragma once
 
-#include <library/cpp/archive/yarchive.h>
+#include <library/cpp/archive/yarchive.h> 
 #include <util/generic/string.h>
 #include <util/generic/ptr.h>
 #include <util/generic/yexception.h>
diff --git a/library/cpp/containers/comptrie/loader/ya.make b/library/cpp/containers/comptrie/loader/ya.make
index 1e23e442a0..2054a8d777 100644
--- a/library/cpp/containers/comptrie/loader/ya.make
+++ b/library/cpp/containers/comptrie/loader/ya.make
@@ -8,7 +8,7 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/archive
+    library/cpp/archive 
     library/cpp/containers/comptrie
 )
 
diff --git a/library/cpp/containers/comptrie/pattern_searcher.h b/library/cpp/containers/comptrie/pattern_searcher.h
index caab51dc1c..d3cfe82ebf 100644
--- a/library/cpp/containers/comptrie/pattern_searcher.h
+++ b/library/cpp/containers/comptrie/pattern_searcher.h
@@ -3,7 +3,7 @@
 #include "comptrie_builder.h"
 #include "comptrie_trie.h"
 #include "comptrie_impl.h"
-#include <library/cpp/packers/packers.h>
+#include <library/cpp/packers/packers.h> 
 
 #include <util/system/yassert.h>
 #include <util/generic/vector.h>
diff --git a/library/cpp/containers/comptrie/ya.make b/library/cpp/containers/comptrie/ya.make
index 81352da4b2..e063792717 100644
--- a/library/cpp/containers/comptrie/ya.make
+++ b/library/cpp/containers/comptrie/ya.make
@@ -26,9 +26,9 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/packers
-    library/cpp/containers/compact_vector
-    library/cpp/on_disk/chunks
+    library/cpp/packers 
+    library/cpp/containers/compact_vector 
+    library/cpp/on_disk/chunks 
     util/draft
 )
 
diff --git a/library/cpp/containers/flat_hash/benchmark/flat_hash_benchmark.cpp b/library/cpp/containers/flat_hash/benchmark/flat_hash_benchmark.cpp
index 040cff3fff..e2fb2ec3a1 100644
--- a/library/cpp/containers/flat_hash/benchmark/flat_hash_benchmark.cpp
+++ b/library/cpp/containers/flat_hash/benchmark/flat_hash_benchmark.cpp
@@ -1,6 +1,6 @@
-#include <library/cpp/containers/flat_hash/flat_hash.h>
+#include <library/cpp/containers/flat_hash/flat_hash.h> 
 
-#include <library/cpp/containers/dense_hash/dense_hash.h>
+#include <library/cpp/containers/dense_hash/dense_hash.h> 
 #include <library/cpp/testing/benchmark/bench.h>
 
 #include <util/random/random.h>
diff --git a/library/cpp/containers/flat_hash/benchmark/ya.make b/library/cpp/containers/flat_hash/benchmark/ya.make
index 6f9aedf50d..a6f733431b 100644
--- a/library/cpp/containers/flat_hash/benchmark/ya.make
+++ b/library/cpp/containers/flat_hash/benchmark/ya.make
@@ -7,7 +7,7 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/containers/flat_hash
+    library/cpp/containers/flat_hash 
 )
 
 END()
diff --git a/library/cpp/containers/flat_hash/flat_hash.h b/library/cpp/containers/flat_hash/flat_hash.h
index 582b8ae8f5..e9555b27bc 100644
--- a/library/cpp/containers/flat_hash/flat_hash.h
+++ b/library/cpp/containers/flat_hash/flat_hash.h
@@ -1,11 +1,11 @@
 #pragma once
 
-#include <library/cpp/containers/flat_hash/lib/map.h>
-#include <library/cpp/containers/flat_hash/lib/containers.h>
-#include <library/cpp/containers/flat_hash/lib/probings.h>
-#include <library/cpp/containers/flat_hash/lib/set.h>
-#include <library/cpp/containers/flat_hash/lib/size_fitters.h>
-#include <library/cpp/containers/flat_hash/lib/expanders.h>
+#include <library/cpp/containers/flat_hash/lib/map.h> 
+#include <library/cpp/containers/flat_hash/lib/containers.h> 
+#include <library/cpp/containers/flat_hash/lib/probings.h> 
+#include <library/cpp/containers/flat_hash/lib/set.h> 
+#include <library/cpp/containers/flat_hash/lib/size_fitters.h> 
+#include <library/cpp/containers/flat_hash/lib/expanders.h> 
 
 #include <util/str_stl.h>
 
diff --git a/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/fuzz.cpp b/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/fuzz.cpp
index 9b4cb4c983..0147288df2 100644
--- a/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/fuzz.cpp
+++ b/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/fuzz.cpp
@@ -1,10 +1,10 @@
-#include <library/cpp/containers/flat_hash/lib/map.h>
-#include <library/cpp/containers/flat_hash/lib/containers.h>
-#include <library/cpp/containers/flat_hash/lib/probings.h>
-#include <library/cpp/containers/flat_hash/lib/size_fitters.h>
-#include <library/cpp/containers/flat_hash/lib/expanders.h>
+#include <library/cpp/containers/flat_hash/lib/map.h> 
+#include <library/cpp/containers/flat_hash/lib/containers.h> 
+#include <library/cpp/containers/flat_hash/lib/probings.h> 
+#include <library/cpp/containers/flat_hash/lib/size_fitters.h> 
+#include <library/cpp/containers/flat_hash/lib/expanders.h> 
 
-#include <library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/fuzz_common.h>
+#include <library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/fuzz_common.h> 
 
 #include <util/generic/hash.h>
 #include <util/generic/xrange.h>
diff --git a/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/ya.make b/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/ya.make
index 3a5d3d6d8c..65478c69b6 100644
--- a/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/ya.make
+++ b/library/cpp/containers/flat_hash/lib/fuzz/dense_map_fuzz/ya.make
@@ -9,7 +9,7 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/containers/flat_hash/lib/fuzz/fuzz_common
+    library/cpp/containers/flat_hash/lib/fuzz/fuzz_common 
 )
 
 SIZE(LARGE)
diff --git a/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/fuzz.cpp b/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/fuzz.cpp
index 7fb73af0e9..f15f0877e4 100644
--- a/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/fuzz.cpp
+++ b/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/fuzz.cpp
@@ -1,10 +1,10 @@
-#include <library/cpp/containers/flat_hash/lib/map.h>
-#include <library/cpp/containers/flat_hash/lib/containers.h>
-#include <library/cpp/containers/flat_hash/lib/probings.h>
-#include <library/cpp/containers/flat_hash/lib/size_fitters.h>
-#include <library/cpp/containers/flat_hash/lib/expanders.h>
+#include <library/cpp/containers/flat_hash/lib/map.h> 
+#include <library/cpp/containers/flat_hash/lib/containers.h> 
+#include <library/cpp/containers/flat_hash/lib/probings.h> 
+#include <library/cpp/containers/flat_hash/lib/size_fitters.h> 
+#include <library/cpp/containers/flat_hash/lib/expanders.h> 
 
-#include <library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/fuzz_common.h>
+#include <library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/fuzz_common.h> 
 
 #include <util/generic/hash.h>
 #include <util/generic/xrange.h>
diff --git a/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/ya.make b/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/ya.make
index 3a5d3d6d8c..65478c69b6 100644
--- a/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/ya.make
+++ b/library/cpp/containers/flat_hash/lib/fuzz/flat_map_fuzz/ya.make
@@ -9,7 +9,7 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/containers/flat_hash/lib/fuzz/fuzz_common
+    library/cpp/containers/flat_hash/lib/fuzz/fuzz_common 
 )
 
 SIZE(LARGE)
diff --git a/library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/ya.make b/library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/ya.make
index ecb590e116..a4a01e75f0 100644
--- a/library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/ya.make
+++ b/library/cpp/containers/flat_hash/lib/fuzz/fuzz_common/ya.make
@@ -5,7 +5,7 @@ OWNER(tender-bum)
 SRCS(fuzz_common.cpp)
 
 PEERDIR(
-    library/cpp/containers/flat_hash/lib
+    library/cpp/containers/flat_hash/lib 
 )
 
 END()
diff --git a/library/cpp/containers/flat_hash/lib/ut/containers_ut.cpp b/library/cpp/containers/flat_hash/lib/ut/containers_ut.cpp
index b17b30fa80..ac0b2e49cb 100644
--- a/library/cpp/containers/flat_hash/lib/ut/containers_ut.cpp
+++ b/library/cpp/containers/flat_hash/lib/ut/containers_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/flat_hash/lib/containers.h>
+#include <library/cpp/containers/flat_hash/lib/containers.h> 
 
 #include <library/cpp/testing/unittest/registar.h>
 
diff --git a/library/cpp/containers/flat_hash/lib/ut/iterator_ut.cpp b/library/cpp/containers/flat_hash/lib/ut/iterator_ut.cpp
index 0b77bf043f..f8ef0a4292 100644
--- a/library/cpp/containers/flat_hash/lib/ut/iterator_ut.cpp
+++ b/library/cpp/containers/flat_hash/lib/ut/iterator_ut.cpp
@@ -1,5 +1,5 @@
-#include <library/cpp/containers/flat_hash/lib/iterator.h>
-#include <library/cpp/containers/flat_hash/lib/containers.h>
+#include <library/cpp/containers/flat_hash/lib/iterator.h> 
+#include <library/cpp/containers/flat_hash/lib/containers.h> 
 
 #include <library/cpp/testing/unittest/registar.h>
 
diff --git a/library/cpp/containers/flat_hash/lib/ut/probings_ut.cpp b/library/cpp/containers/flat_hash/lib/ut/probings_ut.cpp
index 593f8cbb1b..0a9339cae7 100644
--- a/library/cpp/containers/flat_hash/lib/ut/probings_ut.cpp
+++ b/library/cpp/containers/flat_hash/lib/ut/probings_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/flat_hash/lib/probings.h>
+#include <library/cpp/containers/flat_hash/lib/probings.h> 
 
 #include <library/cpp/testing/unittest/registar.h>
 
diff --git a/library/cpp/containers/flat_hash/lib/ut/size_fitters_ut.cpp b/library/cpp/containers/flat_hash/lib/ut/size_fitters_ut.cpp
index 4167947ece..6d3e9cb8bd 100644
--- a/library/cpp/containers/flat_hash/lib/ut/size_fitters_ut.cpp
+++ b/library/cpp/containers/flat_hash/lib/ut/size_fitters_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/flat_hash/lib/size_fitters.h>
+#include <library/cpp/containers/flat_hash/lib/size_fitters.h> 
 
 #include <library/cpp/testing/unittest/registar.h>
 
diff --git a/library/cpp/containers/flat_hash/lib/ut/table_ut.cpp b/library/cpp/containers/flat_hash/lib/ut/table_ut.cpp
index ea511e2c6a..19606c7948 100644
--- a/library/cpp/containers/flat_hash/lib/ut/table_ut.cpp
+++ b/library/cpp/containers/flat_hash/lib/ut/table_ut.cpp
@@ -1,8 +1,8 @@
-#include <library/cpp/containers/flat_hash/lib/containers.h>
-#include <library/cpp/containers/flat_hash/lib/expanders.h>
-#include <library/cpp/containers/flat_hash/lib/probings.h>
-#include <library/cpp/containers/flat_hash/lib/size_fitters.h>
-#include <library/cpp/containers/flat_hash/lib/table.h>
+#include <library/cpp/containers/flat_hash/lib/containers.h> 
+#include <library/cpp/containers/flat_hash/lib/expanders.h> 
+#include <library/cpp/containers/flat_hash/lib/probings.h> 
+#include <library/cpp/containers/flat_hash/lib/size_fitters.h> 
+#include <library/cpp/containers/flat_hash/lib/table.h> 
 
 #include <library/cpp/testing/unittest/registar.h>
 
diff --git a/library/cpp/containers/flat_hash/lib/ut/ya.make b/library/cpp/containers/flat_hash/lib/ut/ya.make
index 04d65a8c6e..4233dfb56c 100644
--- a/library/cpp/containers/flat_hash/lib/ut/ya.make
+++ b/library/cpp/containers/flat_hash/lib/ut/ya.make
@@ -11,7 +11,7 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/containers/flat_hash/lib
+    library/cpp/containers/flat_hash/lib 
 )
 
 END()
diff --git a/library/cpp/containers/flat_hash/ut/flat_hash_ut.cpp b/library/cpp/containers/flat_hash/ut/flat_hash_ut.cpp
index 2b9d6a1dc2..d1b9072c0b 100644
--- a/library/cpp/containers/flat_hash/ut/flat_hash_ut.cpp
+++ b/library/cpp/containers/flat_hash/ut/flat_hash_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/flat_hash/flat_hash.h>
+#include <library/cpp/containers/flat_hash/flat_hash.h> 
 
 #include <library/cpp/testing/unittest/registar.h>
 
diff --git a/library/cpp/containers/flat_hash/ut/ya.make b/library/cpp/containers/flat_hash/ut/ya.make
index 1d33d36120..5f3a733c00 100644
--- a/library/cpp/containers/flat_hash/ut/ya.make
+++ b/library/cpp/containers/flat_hash/ut/ya.make
@@ -7,7 +7,7 @@ SRCS(
 )
 
 PEERDIR(
-    library/cpp/containers/flat_hash
+    library/cpp/containers/flat_hash 
 )
 
 END()
diff --git a/library/cpp/containers/flat_hash/ya.make b/library/cpp/containers/flat_hash/ya.make
index 612e2c1cde..3d0f17f8db 100644
--- a/library/cpp/containers/flat_hash/ya.make
+++ b/library/cpp/containers/flat_hash/ya.make
@@ -3,7 +3,7 @@ LIBRARY()
 OWNER(tender-bum)
 
 PEERDIR(
-    library/cpp/containers/flat_hash/lib
+    library/cpp/containers/flat_hash/lib 
 )
 
 SRCS(
diff --git a/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp b/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
index cab2365cce..94a9dfe120 100644
--- a/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
+++ b/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
@@ -1,6 +1,6 @@
 #include <library/cpp/testing/unittest/registar.h>
 
-#include <library/cpp/containers/intrusive_avl_tree/avltree.h>
+#include <library/cpp/containers/intrusive_avl_tree/avltree.h> 
 
 class TAvlTreeTest: public TTestBase {
     UNIT_TEST_SUITE(TAvlTreeTest);
diff --git a/library/cpp/containers/intrusive_avl_tree/ut/ya.make b/library/cpp/containers/intrusive_avl_tree/ut/ya.make
index 87920306d7..5ac59fa542 100644
--- a/library/cpp/containers/intrusive_avl_tree/ut/ya.make
+++ b/library/cpp/containers/intrusive_avl_tree/ut/ya.make
@@ -1,4 +1,4 @@
-UNITTEST_FOR(library/cpp/containers/intrusive_avl_tree)
+UNITTEST_FOR(library/cpp/containers/intrusive_avl_tree) 
 
 OWNER(
     pg
diff --git a/library/cpp/containers/intrusive_rb_tree/fuzz/rb_tree_fuzzing.cpp b/library/cpp/containers/intrusive_rb_tree/fuzz/rb_tree_fuzzing.cpp
index 92370760b5..5e85623c73 100644
--- a/library/cpp/containers/intrusive_rb_tree/fuzz/rb_tree_fuzzing.cpp
+++ b/library/cpp/containers/intrusive_rb_tree/fuzz/rb_tree_fuzzing.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/intrusive_rb_tree/rb_tree.h>
+#include <library/cpp/containers/intrusive_rb_tree/rb_tree.h> 
 
 #include <util/generic/deque.h>
 #include <stdint.h>
diff --git a/library/cpp/containers/intrusive_rb_tree/fuzz/ya.make b/library/cpp/containers/intrusive_rb_tree/fuzz/ya.make
index 61be9919e6..4e3d967f22 100644
--- a/library/cpp/containers/intrusive_rb_tree/fuzz/ya.make
+++ b/library/cpp/containers/intrusive_rb_tree/fuzz/ya.make
@@ -10,7 +10,7 @@ SIZE(LARGE)
 TAG(ya:fat)
 
 PEERDIR(
-    library/cpp/containers/intrusive_rb_tree
+    library/cpp/containers/intrusive_rb_tree 
 )
 
 SRCS(
diff --git a/library/cpp/containers/intrusive_rb_tree/ut/ya.make b/library/cpp/containers/intrusive_rb_tree/ut/ya.make
index 6f1e3b38ee..d243014bf5 100644
--- a/library/cpp/containers/intrusive_rb_tree/ut/ya.make
+++ b/library/cpp/containers/intrusive_rb_tree/ut/ya.make
@@ -1,4 +1,4 @@
-UNITTEST_FOR(library/cpp/containers/intrusive_rb_tree)
+UNITTEST_FOR(library/cpp/containers/intrusive_rb_tree) 
 
 OWNER(
     pg
diff --git a/library/cpp/containers/paged_vector/ut/paged_vector_ut.cpp b/library/cpp/containers/paged_vector/ut/paged_vector_ut.cpp
index e867808ee4..04a95e6d25 100644
--- a/library/cpp/containers/paged_vector/ut/paged_vector_ut.cpp
+++ b/library/cpp/containers/paged_vector/ut/paged_vector_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/paged_vector/paged_vector.h>
+#include <library/cpp/containers/paged_vector/paged_vector.h> 
 #include <library/cpp/testing/unittest/registar.h>
 
 #include <stdexcept>
diff --git a/library/cpp/containers/paged_vector/ut/ya.make b/library/cpp/containers/paged_vector/ut/ya.make
index 74cfe5fb4a..0431261100 100644
--- a/library/cpp/containers/paged_vector/ut/ya.make
+++ b/library/cpp/containers/paged_vector/ut/ya.make
@@ -3,7 +3,7 @@ UNITTEST()
 OWNER(velavokr)
 
 PEERDIR(
-    library/cpp/containers/paged_vector
+    library/cpp/containers/paged_vector 
 )
 
 SRCS(
diff --git a/library/cpp/containers/stack_array/ut/tests_ut.cpp b/library/cpp/containers/stack_array/ut/tests_ut.cpp
index 3e96384f0e..7495b2b661 100644
--- a/library/cpp/containers/stack_array/ut/tests_ut.cpp
+++ b/library/cpp/containers/stack_array/ut/tests_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/stack_array/stack_array.h>
+#include <library/cpp/containers/stack_array/stack_array.h> 
 #include <library/cpp/testing/unittest/registar.h>
 
 Y_UNIT_TEST_SUITE(TestStackArray) {
diff --git a/library/cpp/containers/stack_array/ut/ya.make b/library/cpp/containers/stack_array/ut/ya.make
index 7db7340073..2d6551b7f6 100644
--- a/library/cpp/containers/stack_array/ut/ya.make
+++ b/library/cpp/containers/stack_array/ut/ya.make
@@ -1,4 +1,4 @@
-UNITTEST_FOR(library/cpp/containers/stack_array)
+UNITTEST_FOR(library/cpp/containers/stack_array) 
 
 OWNER(pg)
 
diff --git a/library/cpp/containers/top_keeper/README.md b/library/cpp/containers/top_keeper/README.md
index f160fb1c01..b5d3add816 100644
--- a/library/cpp/containers/top_keeper/README.md
+++ b/library/cpp/containers/top_keeper/README.md
@@ -11,7 +11,7 @@ TopKeeper - структура данных для поддержания "top M
 5) Удаляем элементы из правой половины
 
 Трудоёмкость:
-На M добавлений происходит 1 PartitionSort (усреднённая оценка трудоёмкости - О(M)) и удаление M элементов. Таким образом достигается О(1) операций в среднем на 1 добавление. Для алгоритма TLimitedHeap (library/cpp/containers/limited_heap) - эта оценка О(log (M))
+На M добавлений происходит 1 PartitionSort (усреднённая оценка трудоёмкости - О(M)) и удаление M элементов. Таким образом достигается О(1) операций в среднем на 1 добавление. Для алгоритма TLimitedHeap (library/cpp/containers/limited_heap) - эта оценка О(log (M)) 
 
 Тесты:
 На случайных потоках данных количество сравнений у TopKeeper и LimitedHeap одинаково (происходит потому что минимум у первого обновляется раз в M добавлений, а у второго - при каждом добавлении). Худший случай LimitedHeap - сортированная последовательность (добавляем каждый элемент), на таком потоке для 2 000 000 000 int TopKeeper выигрывает во много раз.
diff --git a/library/cpp/containers/top_keeper/top_keeper/README.md b/library/cpp/containers/top_keeper/top_keeper/README.md
index f160fb1c01..2b0f67b214 100644
--- a/library/cpp/containers/top_keeper/top_keeper/README.md
+++ b/library/cpp/containers/top_keeper/top_keeper/README.md
@@ -11,7 +11,7 @@ TopKeeper - структура данных для поддержания "top M
 5) Удаляем элементы из правой половины
 
 Трудоёмкость:
-На M добавлений происходит 1 PartitionSort (усреднённая оценка трудоёмкости - О(M)) и удаление M элементов. Таким образом достигается О(1) операций в среднем на 1 добавление. Для алгоритма TLimitedHeap (library/cpp/containers/limited_heap) - эта оценка О(log (M))
+На M добавлений происходит 1 PartitionSort (усреднённая оценка трудоёмкости - О(M)) и удаление M элементов. Таким образом достигается О(1) операций в среднем на 1 добавление. Для алгоритма TLimitedHeap (library/cpp/containers/limited_heap) - эта оценка О(log (M)) 
 
 Тесты:
 На случайных потоках данных количество сравнений у TopKeeper и LimitedHeap одинаково (происходит потому что минимум у первого обновляется раз в M добавлений, а у второго - при каждом добавлении). Худший случай LimitedHeap - сортированная последовательность (добавляем каждый элемент), на таком потоке для 2 000 000 000 int TopKeeper выигрывает во много раз.
@@ -23,4 +23,4 @@ TopKeeper - структура данных для поддержания "top M
 В ситуации когда нужны чередующиеся добавления / извлечения - используйте LimitedHeap
 
 Примеры использования:
-library/cpp/containers/top_keeper/ut
+library/cpp/containers/top_keeper/ut 
diff --git a/library/cpp/containers/top_keeper/top_keeper/ut/top_keeper_ut.cpp b/library/cpp/containers/top_keeper/top_keeper/ut/top_keeper_ut.cpp
index a938279025..61bc58ccb5 100644
--- a/library/cpp/containers/top_keeper/top_keeper/ut/top_keeper_ut.cpp
+++ b/library/cpp/containers/top_keeper/top_keeper/ut/top_keeper_ut.cpp
@@ -1,5 +1,5 @@
-#include <library/cpp/containers/limited_heap/limited_heap.h>
-#include <library/cpp/containers/top_keeper/top_keeper.h>
+#include <library/cpp/containers/limited_heap/limited_heap.h> 
+#include <library/cpp/containers/top_keeper/top_keeper.h> 
 #include <library/cpp/testing/unittest/registar.h>
 #include <util/random/random.h>
 
diff --git a/library/cpp/containers/top_keeper/top_keeper/ut/ya.make b/library/cpp/containers/top_keeper/top_keeper/ut/ya.make
index 8553389e17..58bc33c3a9 100644
--- a/library/cpp/containers/top_keeper/top_keeper/ut/ya.make
+++ b/library/cpp/containers/top_keeper/top_keeper/ut/ya.make
@@ -1,4 +1,4 @@
-UNITTEST_FOR(library/cpp/containers/top_keeper)
+UNITTEST_FOR(library/cpp/containers/top_keeper) 
 
 OWNER(
     mbusel
diff --git a/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp b/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp
index a938279025..9609b71ea8 100644
--- a/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp
+++ b/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp
@@ -1,4 +1,4 @@
-#include <library/cpp/containers/limited_heap/limited_heap.h>
+#include <library/cpp/containers/limited_heap/limited_heap.h> 
 #include <library/cpp/containers/top_keeper/top_keeper.h>
 #include <library/cpp/testing/unittest/registar.h>
 #include <util/random/random.h>
diff --git a/library/cpp/containers/ya.make b/library/cpp/containers/ya.make
index 4b1b315e6a..06daa1be53 100644
--- a/library/cpp/containers/ya.make
+++ b/library/cpp/containers/ya.make
@@ -1,71 +1,71 @@
 RECURSE(
     2d_array
-    absl_flat_hash
+    absl_flat_hash 
     absl_tstring_flat_hash
-    atomizer
-    bitseq
-    bitseq/ut
-    compact_vector
-    compact_vector/ut
+    atomizer 
+    bitseq 
+    bitseq/ut 
+    compact_vector 
+    compact_vector/ut 
     comptrie
     comptrie/loader
     comptrie/loader/ut
     comptrie/ut
     comptrie/benchmark
     concurrent_hash
-    concurrent_hash_set
-    concurrent_hash_set/ut
-    dense_hash
-    dense_hash/dense_hash_benchmark
-    dense_hash/ut
-    dictionary
-    dictionary/ut
+    concurrent_hash_set 
+    concurrent_hash_set/ut 
+    dense_hash 
+    dense_hash/dense_hash_benchmark 
+    dense_hash/ut 
+    dictionary 
+    dictionary/ut 
     disjoint_interval_tree
     disjoint_interval_tree/ut
     ext_priority_queue
     ext_priority_queue/ut
-    fast_trie
-    fast_trie/ut
-    flat_hash
-    flat_hash/benchmark
-    flat_hash/lib
-    flat_hash/lib/concepts
-    flat_hash/lib/fuzz
-    flat_hash/lib/ut
-    flat_hash/ut
-    hash_trie
-    heap_dict
-    heap_dict/benchmark
-    heap_dict/ut
-    intrusive_avl_tree
-    intrusive_avl_tree/ut
-    intrusive_hash
-    intrusive_hash/ut
-    intrusive_rb_tree
-    intrusive_rb_tree/fuzz
-    intrusive_rb_tree/ut
-    limited_heap
-    mh_heap
-    mh_heap/ut
-    paged_vector
-    paged_vector/ut
-    rarefied_array
-    ring_buffer
-    safe_vector
-    safe_vector/ut
-    segmented_pool_container
+    fast_trie 
+    fast_trie/ut 
+    flat_hash 
+    flat_hash/benchmark 
+    flat_hash/lib 
+    flat_hash/lib/concepts 
+    flat_hash/lib/fuzz 
+    flat_hash/lib/ut 
+    flat_hash/ut 
+    hash_trie 
+    heap_dict 
+    heap_dict/benchmark 
+    heap_dict/ut 
+    intrusive_avl_tree 
+    intrusive_avl_tree/ut 
+    intrusive_hash 
+    intrusive_hash/ut 
+    intrusive_rb_tree 
+    intrusive_rb_tree/fuzz 
+    intrusive_rb_tree/ut 
+    limited_heap 
+    mh_heap 
+    mh_heap/ut 
+    paged_vector 
+    paged_vector/ut 
+    rarefied_array 
+    ring_buffer 
+    safe_vector 
+    safe_vector/ut 
+    segmented_pool_container 
     sorted_vector
     sorted_vector/ut
-    spars_ar
-    stack_array
-    stack_array/ut
+    spars_ar 
+    stack_array 
+    stack_array/ut 
     stack_vector
-    str_hash
-    str_map
+    str_hash 
+    str_map 
     top_keeper
     top_keeper/ut
-    two_level_hash
-    two_level_hash/ut
+    two_level_hash 
+    two_level_hash/ut 
     vp_tree
     vp_tree/ut
 )