aboutsummaryrefslogtreecommitdiffstats
path: root/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
diff options
context:
space:
mode:
authorhindsight <hindsight@yandex-team.ru>2022-02-10 16:50:06 +0300
committerDaniil Cherednik <dcherednik@yandex-team.ru>2022-02-10 16:50:06 +0300
commita76f5e1efe665e1bb125f05ae275b2a6226517d9 (patch)
tree5d5cb817648f650d76cf1076100726fd9b8448e8 /library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
parentfe0f94e19a639b45108b1229c889c445edc7adef (diff)
downloadydb-a76f5e1efe665e1bb125f05ae275b2a6226517d9.tar.gz
Restoring authorship annotation for <hindsight@yandex-team.ru>. Commit 2 of 2.
Diffstat (limited to 'library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp')
-rw-r--r--library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp76
1 files changed, 38 insertions, 38 deletions
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 fca5501324..cab2365cce 100644
--- a/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
+++ b/library/cpp/containers/intrusive_avl_tree/ut/avltree_ut.cpp
@@ -5,12 +5,12 @@
class TAvlTreeTest: public TTestBase {
UNIT_TEST_SUITE(TAvlTreeTest);
UNIT_TEST(TestLowerBound);
- UNIT_TEST(TestIterator);
+ UNIT_TEST(TestIterator);
UNIT_TEST_SUITE_END();
private:
void TestLowerBound();
- void TestIterator();
+ void TestIterator();
class TIt;
struct TItCompare {
@@ -61,43 +61,43 @@ void TAvlTreeTest::TestLowerBound() {
UNIT_ASSERT_EQUAL(its.LowerBound(&it_zero), &it5);
UNIT_ASSERT_EQUAL(its.LowerBound(&it_large), nullptr);
}
-
-void TAvlTreeTest::TestIterator() {
- TIts its;
- TIt it1(1);
- TIt it2(2);
- TIt it3(3);
- TIt it4(4);
- TIt it5(5);
- TIt it6(6);
- TIt it7(7);
-
- its.Insert(&it3);
- its.Insert(&it1);
- its.Insert(&it7);
- its.Insert(&it5);
- its.Insert(&it4);
- its.Insert(&it6);
- its.Insert(&it2);
-
+
+void TAvlTreeTest::TestIterator() {
+ TIts its;
+ TIt it1(1);
+ TIt it2(2);
+ TIt it3(3);
+ TIt it4(4);
+ TIt it5(5);
+ TIt it6(6);
+ TIt it7(7);
+
+ its.Insert(&it3);
+ its.Insert(&it1);
+ its.Insert(&it7);
+ its.Insert(&it5);
+ its.Insert(&it4);
+ its.Insert(&it6);
+ its.Insert(&it2);
+
TVector<int> res;
for (const TIt& i : its) {
- res.push_back(i.Val);
- }
-
+ res.push_back(i.Val);
+ }
+
TVector<int> expected{1, 2, 3, 4, 5, 6, 7};
- UNIT_ASSERT_EQUAL(res, expected);
-
- res.clear();
+ UNIT_ASSERT_EQUAL(res, expected);
+
+ res.clear();
for (TIt& i : its) {
- res.push_back(i.Val);
- }
- UNIT_ASSERT_EQUAL(res, expected);
-
- res.clear();
- const TIts* constIts = &its;
- for (TIts::const_iterator i = constIts->begin(); i != constIts->end(); ++i) {
- res.push_back(i->Val);
- }
- UNIT_ASSERT_EQUAL(res, expected);
-}
+ res.push_back(i.Val);
+ }
+ UNIT_ASSERT_EQUAL(res, expected);
+
+ res.clear();
+ const TIts* constIts = &its;
+ for (TIts::const_iterator i = constIts->begin(); i != constIts->end(); ++i) {
+ res.push_back(i->Val);
+ }
+ UNIT_ASSERT_EQUAL(res, expected);
+}