diff options
author | Ilnur Khuziev <ilnur.khuziev@yandex.ru> | 2022-02-10 16:46:13 +0300 |
---|---|---|
committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:46:13 +0300 |
commit | 736dcd8ca259457a136f2f9f9168c44643914323 (patch) | |
tree | ddd46a036d68bfa83aa11b892f31243ea6b068a1 /library/cpp/containers | |
parent | 9bf2fa2b060c9881d3135c2208c624a1dd546ecc (diff) | |
download | ydb-736dcd8ca259457a136f2f9f9168c44643914323.tar.gz |
Restoring authorship annotation for Ilnur Khuziev <ilnur.khuziev@yandex.ru>. Commit 1 of 2.
Diffstat (limited to 'library/cpp/containers')
33 files changed, 82 insertions, 82 deletions
diff --git a/library/cpp/containers/bitseq/bititerator_ut.cpp b/library/cpp/containers/bitseq/bititerator_ut.cpp index ed0925866f..9857e31fc1 100644 --- a/library/cpp/containers/bitseq/bititerator_ut.cpp +++ b/library/cpp/containers/bitseq/bititerator_ut.cpp @@ -1,6 +1,6 @@ #include "bititerator.h" -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/generic/vector.h> Y_UNIT_TEST_SUITE(TBitIteratorTest) { diff --git a/library/cpp/containers/bitseq/bitvector_ut.cpp b/library/cpp/containers/bitseq/bitvector_ut.cpp index 6137adab1e..78fd155f87 100644 --- a/library/cpp/containers/bitseq/bitvector_ut.cpp +++ b/library/cpp/containers/bitseq/bitvector_ut.cpp @@ -1,7 +1,7 @@ #include "bitvector.h" #include "readonly_bitvector.h" -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/memory/blob.h> #include <util/stream/buffer.h> diff --git a/library/cpp/containers/compact_vector/compact_vector_ut.cpp b/library/cpp/containers/compact_vector/compact_vector_ut.cpp index 7d413d6575..cef0f81726 100644 --- a/library/cpp/containers/compact_vector/compact_vector_ut.cpp +++ b/library/cpp/containers/compact_vector/compact_vector_ut.cpp @@ -1,4 +1,4 @@ -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include "compact_vector.h" diff --git a/library/cpp/containers/comptrie/benchmark/main.cpp b/library/cpp/containers/comptrie/benchmark/main.cpp index 6e42dad18a..8a353b6b5d 100644 --- a/library/cpp/containers/comptrie/benchmark/main.cpp +++ b/library/cpp/containers/comptrie/benchmark/main.cpp @@ -1,9 +1,9 @@ -#include <library/cpp/testing/benchmark/bench.h> +#include <library/cpp/testing/benchmark/bench.h> -#include <library/cpp/containers/comptrie/comptrie_trie.h> -#include <library/cpp/containers/comptrie/comptrie_builder.h> -#include <library/cpp/containers/comptrie/search_iterator.h> -#include <library/cpp/containers/comptrie/pattern_searcher.h> +#include <library/cpp/containers/comptrie/comptrie_trie.h> +#include <library/cpp/containers/comptrie/comptrie_builder.h> +#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> diff --git a/library/cpp/containers/comptrie/benchmark/ya.make b/library/cpp/containers/comptrie/benchmark/ya.make index 16fa19530d..fcd3d2851c 100644 --- a/library/cpp/containers/comptrie/benchmark/ya.make +++ b/library/cpp/containers/comptrie/benchmark/ya.make @@ -7,7 +7,7 @@ SRCS( ) PEERDIR( - library/cpp/containers/comptrie + library/cpp/containers/comptrie util ) diff --git a/library/cpp/containers/comptrie/comptrie_builder.inl b/library/cpp/containers/comptrie/comptrie_builder.inl index f273fa6571..fd8d30b13c 100644 --- a/library/cpp/containers/comptrie/comptrie_builder.inl +++ b/library/cpp/containers/comptrie/comptrie_builder.inl @@ -745,8 +745,8 @@ void TCompactTrieBuilder<T, D, S>::TCompactTrieBuilderImpl::Clear() { Pool.Clear(); NodeAllocator.Reset(new TFixedSizeAllocator(sizeof(TNode) + PayloadSize, TDefaultAllocator::Instance())); Root = new (*NodeAllocator) TNode; - EntryCount = 0; - NodeCount = 1; + EntryCount = 0; + NodeCount = 1; } template <class T, class D, class S> diff --git a/library/cpp/containers/comptrie/comptrie_ut.cpp b/library/cpp/containers/comptrie/comptrie_ut.cpp index 74bee09b5d..f71b285e6a 100644 --- a/library/cpp/containers/comptrie/comptrie_ut.cpp +++ b/library/cpp/containers/comptrie/comptrie_ut.cpp @@ -1,5 +1,5 @@ #include <util/random/shuffle.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/stream/output.h> #include <utility> @@ -206,7 +206,7 @@ public: void TestMergeFromBuffer(); void TestUnique(); void TestAddRetValue(); - void TestClear(); + void TestClear(); void TestIterateEmptyKey(); @@ -983,27 +983,27 @@ void TCompactTrieTest::TestAddRetValue() { } void TCompactTrieTest::TestClear() { - TCompactTrieBuilder<char, ui32> builder; - const char* data[] = { - "Kazan", - "Moscow", - "Monino", - "Murmansk", - "Fryanovo", - "Fryazino", - "Fryazevo", - "Fry", - "Tumen", - }; + TCompactTrieBuilder<char, ui32> builder; + const char* data[] = { + "Kazan", + "Moscow", + "Monino", + "Murmansk", + "Fryanovo", + "Fryazino", + "Fryazevo", + "Fry", + "Tumen", + }; for (size_t i = 0; i < Y_ARRAY_SIZE(data); ++i) { - builder.Add(data[i], strlen(data[i]), i + 1); - } + builder.Add(data[i], strlen(data[i]), i + 1); + } UNIT_ASSERT(builder.GetEntryCount() == Y_ARRAY_SIZE(data)); - builder.Clear(); - UNIT_ASSERT(builder.GetEntryCount() == 0); - UNIT_ASSERT(builder.GetNodeCount() == 1); -} - + builder.Clear(); + UNIT_ASSERT(builder.GetEntryCount() == 0); + UNIT_ASSERT(builder.GetNodeCount() == 1); +} + void TCompactTrieTest::TestFindTails() { TestFindTailsImpl("aa"); TestFindTailsImpl("bb"); diff --git a/library/cpp/containers/comptrie/loader/loader_ut.cpp b/library/cpp/containers/comptrie/loader/loader_ut.cpp index 345063a31e..1654f8d4d0 100644 --- a/library/cpp/containers/comptrie/loader/loader_ut.cpp +++ b/library/cpp/containers/comptrie/loader/loader_ut.cpp @@ -1,6 +1,6 @@ -#include <library/cpp/testing/unittest/registar.h> -#include <library/cpp/containers/comptrie/comptrie.h> -#include <library/cpp/containers/comptrie/loader/loader.h> +#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/containers/comptrie/comptrie.h> +#include <library/cpp/containers/comptrie/loader/loader.h> using TDummyTrie = TCompactTrie<char, i32>; diff --git a/library/cpp/containers/comptrie/loader/ut/ya.make b/library/cpp/containers/comptrie/loader/ut/ya.make index 6c0334d3ea..6f20e6d699 100644 --- a/library/cpp/containers/comptrie/loader/ut/ya.make +++ b/library/cpp/containers/comptrie/loader/ut/ya.make @@ -1,4 +1,4 @@ -UNITTEST_FOR(library/cpp/containers/comptrie/loader) +UNITTEST_FOR(library/cpp/containers/comptrie/loader) OWNER(my34) @@ -12,7 +12,7 @@ SRCS( ) PEERDIR( - library/cpp/containers/comptrie/loader + library/cpp/containers/comptrie/loader ) END() diff --git a/library/cpp/containers/comptrie/loader/ya.make b/library/cpp/containers/comptrie/loader/ya.make index 1e23e442a0..8279dd86e5 100644 --- a/library/cpp/containers/comptrie/loader/ya.make +++ b/library/cpp/containers/comptrie/loader/ya.make @@ -9,7 +9,7 @@ SRCS( PEERDIR( library/cpp/archive - library/cpp/containers/comptrie + library/cpp/containers/comptrie ) END() diff --git a/library/cpp/containers/comptrie/pattern_searcher.h b/library/cpp/containers/comptrie/pattern_searcher.h index caab51dc1c..bce5f8615b 100644 --- a/library/cpp/containers/comptrie/pattern_searcher.h +++ b/library/cpp/containers/comptrie/pattern_searcher.h @@ -1,8 +1,8 @@ #pragma once -#include "comptrie_builder.h" -#include "comptrie_trie.h" -#include "comptrie_impl.h" +#include "comptrie_builder.h" +#include "comptrie_trie.h" +#include "comptrie_impl.h" #include <library/cpp/packers/packers.h> #include <util/system/yassert.h> diff --git a/library/cpp/containers/comptrie/ut/ya.make b/library/cpp/containers/comptrie/ut/ya.make index c4f4666009..4ad483c0dc 100644 --- a/library/cpp/containers/comptrie/ut/ya.make +++ b/library/cpp/containers/comptrie/ut/ya.make @@ -1,4 +1,4 @@ -UNITTEST_FOR(library/cpp/containers/comptrie) +UNITTEST_FOR(library/cpp/containers/comptrie) OWNER(alzobnin) 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..c9f90a5bf1 100644 --- a/library/cpp/containers/flat_hash/benchmark/flat_hash_benchmark.cpp +++ b/library/cpp/containers/flat_hash/benchmark/flat_hash_benchmark.cpp @@ -1,7 +1,7 @@ #include <library/cpp/containers/flat_hash/flat_hash.h> #include <library/cpp/containers/dense_hash/dense_hash.h> -#include <library/cpp/testing/benchmark/bench.h> +#include <library/cpp/testing/benchmark/bench.h> #include <util/random/random.h> #include <util/generic/xrange.h> 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..8da76a0512 100644 --- a/library/cpp/containers/flat_hash/lib/ut/containers_ut.cpp +++ b/library/cpp/containers/flat_hash/lib/ut/containers_ut.cpp @@ -1,6 +1,6 @@ #include <library/cpp/containers/flat_hash/lib/containers.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/generic/algorithm.h> #include <util/random/random.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..f0282c11b6 100644 --- a/library/cpp/containers/flat_hash/lib/ut/iterator_ut.cpp +++ b/library/cpp/containers/flat_hash/lib/ut/iterator_ut.cpp @@ -1,7 +1,7 @@ #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> +#include <library/cpp/testing/unittest/registar.h> #include <util/random/random.h> #include <util/generic/algorithm.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..33484a1459 100644 --- a/library/cpp/containers/flat_hash/lib/ut/probings_ut.cpp +++ b/library/cpp/containers/flat_hash/lib/ut/probings_ut.cpp @@ -1,6 +1,6 @@ #include <library/cpp/containers/flat_hash/lib/probings.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> using namespace NFlatHash; 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..299249c5e7 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,6 +1,6 @@ #include <library/cpp/containers/flat_hash/lib/size_fitters.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> using namespace NFlatHash; 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..1c34598ee0 100644 --- a/library/cpp/containers/flat_hash/lib/ut/table_ut.cpp +++ b/library/cpp/containers/flat_hash/lib/ut/table_ut.cpp @@ -4,7 +4,7 @@ #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> +#include <library/cpp/testing/unittest/registar.h> #include <util/generic/algorithm.h> #include <util/random/random.h> 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..77c6d5ff95 100644 --- a/library/cpp/containers/flat_hash/ut/flat_hash_ut.cpp +++ b/library/cpp/containers/flat_hash/ut/flat_hash_ut.cpp @@ -1,6 +1,6 @@ #include <library/cpp/containers/flat_hash/flat_hash.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> using namespace NFH; 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..07ca1176fd 100644 --- a/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp +++ b/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp @@ -1,4 +1,4 @@ -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <library/cpp/containers/intrusive_avl_tree/avltree.h> diff --git a/library/cpp/containers/intrusive_rb_tree/rb_tree_ut.cpp b/library/cpp/containers/intrusive_rb_tree/rb_tree_ut.cpp index c34ed1fd9b..5a75bdd8f5 100644 --- a/library/cpp/containers/intrusive_rb_tree/rb_tree_ut.cpp +++ b/library/cpp/containers/intrusive_rb_tree/rb_tree_ut.cpp @@ -1,6 +1,6 @@ #include "rb_tree.h" -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/random/fast.h> #include <util/random/easy.h> 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..7d3e544aa7 100644 --- a/library/cpp/containers/paged_vector/ut/paged_vector_ut.cpp +++ b/library/cpp/containers/paged_vector/ut/paged_vector_ut.cpp @@ -1,5 +1,5 @@ #include <library/cpp/containers/paged_vector/paged_vector.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <stdexcept> diff --git a/library/cpp/containers/sorted_vector/sorted_vector_ut.cpp b/library/cpp/containers/sorted_vector/sorted_vector_ut.cpp index 893862f098..47a718e729 100644 --- a/library/cpp/containers/sorted_vector/sorted_vector_ut.cpp +++ b/library/cpp/containers/sorted_vector/sorted_vector_ut.cpp @@ -1,6 +1,6 @@ #include "sorted_vector.h" -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/generic/string.h> #include <util/generic/strbuf.h> diff --git a/library/cpp/containers/stack_array/ut/tests_ut.cpp b/library/cpp/containers/stack_array/ut/tests_ut.cpp index 3e96384f0e..b99334ba1e 100644 --- a/library/cpp/containers/stack_array/ut/tests_ut.cpp +++ b/library/cpp/containers/stack_array/ut/tests_ut.cpp @@ -1,5 +1,5 @@ #include <library/cpp/containers/stack_array/stack_array.h> -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> Y_UNIT_TEST_SUITE(TestStackArray) { using namespace NStackArray; diff --git a/library/cpp/containers/stack_vector/stack_vec_ut.cpp b/library/cpp/containers/stack_vector/stack_vec_ut.cpp index 19f9677781..003ec955e6 100644 --- a/library/cpp/containers/stack_vector/stack_vec_ut.cpp +++ b/library/cpp/containers/stack_vector/stack_vec_ut.cpp @@ -1,6 +1,6 @@ #include "stack_vec.h" -#include <library/cpp/testing/unittest/registar.h> +#include <library/cpp/testing/unittest/registar.h> namespace { struct TNotCopyAssignable { diff --git a/library/cpp/containers/stack_vector/ut/ya.make b/library/cpp/containers/stack_vector/ut/ya.make index 1d70496954..86327485b0 100644 --- a/library/cpp/containers/stack_vector/ut/ya.make +++ b/library/cpp/containers/stack_vector/ut/ya.make @@ -1,8 +1,8 @@ UNITTEST() -OWNER(ilnurkh) +OWNER(ilnurkh) -SRCDIR(library/cpp/containers/stack_vector) +SRCDIR(library/cpp/containers/stack_vector) SRCS( stack_vec_ut.cpp diff --git a/library/cpp/containers/stack_vector/ya.make b/library/cpp/containers/stack_vector/ya.make index cfb63295ec..938bf2945b 100644 --- a/library/cpp/containers/stack_vector/ya.make +++ b/library/cpp/containers/stack_vector/ya.make @@ -1,11 +1,11 @@ LIBRARY() -OWNER(ilnurkh) +OWNER(ilnurkh) SRCS( stack_vec.cpp ) END() - -RECURSE_FOR_TESTS(ut) + +RECURSE_FOR_TESTS(ut) diff --git a/library/cpp/containers/top_keeper/README.md b/library/cpp/containers/top_keeper/README.md index f160fb1c01..e7a1adb9af 100644 --- a/library/cpp/containers/top_keeper/README.md +++ b/library/cpp/containers/top_keeper/README.md @@ -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..761478481d 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,6 +1,6 @@ #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 <library/cpp/testing/unittest/registar.h> #include <util/random/random.h> static ui32 seed = 3; 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..ecb624143d 100644 --- a/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp +++ b/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp @@ -1,6 +1,6 @@ #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 <library/cpp/containers/top_keeper/top_keeper.h> +#include <library/cpp/testing/unittest/registar.h> #include <util/random/random.h> static ui32 seed = 3; diff --git a/library/cpp/containers/top_keeper/ut/ya.make b/library/cpp/containers/top_keeper/ut/ya.make index 42cfdd6f13..49093c470c 100644 --- a/library/cpp/containers/top_keeper/ut/ya.make +++ b/library/cpp/containers/top_keeper/ut/ya.make @@ -1,7 +1,7 @@ -UNITTEST_FOR(library/cpp/containers/top_keeper) +UNITTEST_FOR(library/cpp/containers/top_keeper) OWNER( - ilnurkh + ilnurkh rmplstiltskin ) diff --git a/library/cpp/containers/top_keeper/ya.make b/library/cpp/containers/top_keeper/ya.make index ed206a1df9..7f0779e051 100644 --- a/library/cpp/containers/top_keeper/ya.make +++ b/library/cpp/containers/top_keeper/ya.make @@ -1,13 +1,13 @@ LIBRARY() -OWNER(ilnurkh) +OWNER(ilnurkh) SRCS( top_keeper.cpp ) END() - -RECURSE_FOR_TESTS(ut) - - + +RECURSE_FOR_TESTS(ut) + + diff --git a/library/cpp/containers/ya.make b/library/cpp/containers/ya.make index 4b1b315e6a..a65dee29b3 100644 --- a/library/cpp/containers/ya.make +++ b/library/cpp/containers/ya.make @@ -1,5 +1,5 @@ RECURSE( - 2d_array + 2d_array absl_flat_hash absl_tstring_flat_hash atomizer @@ -7,11 +7,11 @@ RECURSE( bitseq/ut compact_vector compact_vector/ut - comptrie - comptrie/loader - comptrie/loader/ut - comptrie/ut - comptrie/benchmark + comptrie + comptrie/loader + comptrie/loader/ut + comptrie/ut + comptrie/benchmark concurrent_hash concurrent_hash_set concurrent_hash_set/ut @@ -22,8 +22,8 @@ RECURSE( dictionary/ut disjoint_interval_tree disjoint_interval_tree/ut - ext_priority_queue - ext_priority_queue/ut + ext_priority_queue + ext_priority_queue/ut fast_trie fast_trie/ut flat_hash @@ -59,11 +59,11 @@ RECURSE( spars_ar stack_array stack_array/ut - stack_vector + stack_vector str_hash str_map - top_keeper - top_keeper/ut + top_keeper + top_keeper/ut two_level_hash two_level_hash/ut vp_tree |