diff options
author | dpaveldev <dpaveldev@yandex-team.ru> | 2022-02-10 16:49:26 +0300 |
---|---|---|
committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:49:26 +0300 |
commit | 602d919ca49cb8e97dc5cae74f82be068f31afd3 (patch) | |
tree | 5d5cb817648f650d76cf1076100726fd9b8448e8 /library/cpp | |
parent | 673dba906d2cf09717ad91dd039ff76f310162a0 (diff) | |
download | ydb-602d919ca49cb8e97dc5cae74f82be068f31afd3.tar.gz |
Restoring authorship annotation for <dpaveldev@yandex-team.ru>. Commit 2 of 2.
Diffstat (limited to 'library/cpp')
5 files changed, 65 insertions, 65 deletions
diff --git a/library/cpp/containers/top_keeper/top_keeper.h b/library/cpp/containers/top_keeper/top_keeper.h index df891568c3..2f282b5a9e 100644 --- a/library/cpp/containers/top_keeper/top_keeper.h +++ b/library/cpp/containers/top_keeper/top_keeper.h @@ -108,15 +108,15 @@ private: return Internal; } - auto Extract() { - using std::swap; - - decltype(Internal) values; - swap(Internal, values); - Reset(); - return values; - } - + auto Extract() { + using std::swap; + + decltype(Internal) values; + swap(Internal, values); + Reset(); + return values; + } + const T& Back() const { return Internal.back(); } @@ -204,11 +204,11 @@ public: return value; } - auto Extract() { - Finalize(); - return Internal.Extract(); - } - + auto Extract() { + Finalize(); + return Internal.Extract(); + } + bool Insert(const T& value) { CheckNotFinalized(); return Internal.Push(value); diff --git a/library/cpp/containers/top_keeper/top_keeper/top_keeper.h b/library/cpp/containers/top_keeper/top_keeper/top_keeper.h index df891568c3..2f282b5a9e 100644 --- a/library/cpp/containers/top_keeper/top_keeper/top_keeper.h +++ b/library/cpp/containers/top_keeper/top_keeper/top_keeper.h @@ -108,15 +108,15 @@ private: return Internal; } - auto Extract() { - using std::swap; - - decltype(Internal) values; - swap(Internal, values); - Reset(); - return values; - } - + auto Extract() { + using std::swap; + + decltype(Internal) values; + swap(Internal, values); + Reset(); + return values; + } + const T& Back() const { return Internal.back(); } @@ -204,11 +204,11 @@ public: return value; } - auto Extract() { - Finalize(); - return Internal.Extract(); - } - + auto Extract() { + Finalize(); + return Internal.Extract(); + } + bool Insert(const T& value) { CheckNotFinalized(); return Internal.Push(value); 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 c5306afe15..a938279025 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 @@ -202,21 +202,21 @@ Y_UNIT_TEST_SUITE(TTopKeeperTest) { } k.Finalize(); } - - Y_UNIT_TEST(ExtractTest) { - TTopKeeper<size_t> keeper(100); - for (size_t i = 0; i < 100; ++i) { - keeper.Insert(i); - } - - auto values = keeper.Extract(); - UNIT_ASSERT_EQUAL(values.size(), 100); - Sort(values); - - for (size_t i = 0; i < 100; ++i) { - UNIT_ASSERT_EQUAL(values[i], i); - } - - UNIT_ASSERT(keeper.IsEmpty()); - } + + Y_UNIT_TEST(ExtractTest) { + TTopKeeper<size_t> keeper(100); + for (size_t i = 0; i < 100; ++i) { + keeper.Insert(i); + } + + auto values = keeper.Extract(); + UNIT_ASSERT_EQUAL(values.size(), 100); + Sort(values); + + for (size_t i = 0; i < 100; ++i) { + UNIT_ASSERT_EQUAL(values[i], i); + } + + UNIT_ASSERT(keeper.IsEmpty()); + } } 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 c5306afe15..a938279025 100644 --- a/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp +++ b/library/cpp/containers/top_keeper/ut/top_keeper_ut.cpp @@ -202,21 +202,21 @@ Y_UNIT_TEST_SUITE(TTopKeeperTest) { } k.Finalize(); } - - Y_UNIT_TEST(ExtractTest) { - TTopKeeper<size_t> keeper(100); - for (size_t i = 0; i < 100; ++i) { - keeper.Insert(i); - } - - auto values = keeper.Extract(); - UNIT_ASSERT_EQUAL(values.size(), 100); - Sort(values); - - for (size_t i = 0; i < 100; ++i) { - UNIT_ASSERT_EQUAL(values[i], i); - } - - UNIT_ASSERT(keeper.IsEmpty()); - } + + Y_UNIT_TEST(ExtractTest) { + TTopKeeper<size_t> keeper(100); + for (size_t i = 0; i < 100; ++i) { + keeper.Insert(i); + } + + auto values = keeper.Extract(); + UNIT_ASSERT_EQUAL(values.size(), 100); + Sort(values); + + for (size_t i = 0; i < 100; ++i) { + UNIT_ASSERT_EQUAL(values[i], i); + } + + UNIT_ASSERT(keeper.IsEmpty()); + } } diff --git a/library/cpp/enumbitset/enumbitset.h b/library/cpp/enumbitset/enumbitset.h index 68ed89d0cc..41864c3a04 100644 --- a/library/cpp/enumbitset/enumbitset.h +++ b/library/cpp/enumbitset/enumbitset.h @@ -371,7 +371,7 @@ public: return Value != other.Value; } - TIterator& operator++() noexcept { + TIterator& operator++() noexcept { Y_ASSERT(Value < EndIndex); TEnum res; if (BitMap->FindNext(static_cast<TEnum>(Value), res)) { @@ -379,8 +379,8 @@ public: } else { Value = EndIndex; } - - return *this; + + return *this; } private: |