918fe04351
PR-URL: https://github.com/nodejs/node/pull/58070 Reviewed-By: Antoine du Hamel <duhamelantoine1995@gmail.com> Reviewed-By: Darshan Sen <raisinten@gmail.com> Reviewed-By: Joyee Cheung <joyeec9h3@gmail.com> Reviewed-By: Rafael Gonzaga <rafael.nunu@hotmail.com>
117 lines
3.0 KiB
C++
117 lines
3.0 KiB
C++
// Copyright 2018 the V8 project authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include "src/heap/list.h"
|
|
#include "testing/gtest-support.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
namespace heap {
|
|
|
|
class TestChunk {
|
|
public:
|
|
heap::ListNode<TestChunk>& list_node() { return list_node_; }
|
|
const heap::ListNode<TestChunk>& list_node() const { return list_node_; }
|
|
heap::ListNode<TestChunk> list_node_;
|
|
};
|
|
|
|
TEST(List, InsertAtTailAndRemove) {
|
|
List<TestChunk> list;
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
TestChunk t1;
|
|
list.PushBack(&t1);
|
|
EXPECT_FALSE(list.Empty());
|
|
EXPECT_EQ(1u, list.size());
|
|
EXPECT_TRUE(list.Contains(&t1));
|
|
list.Remove(&t1);
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
}
|
|
|
|
TEST(List, InsertAtHeadAndRemove) {
|
|
List<TestChunk> list;
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
TestChunk t1;
|
|
list.PushFront(&t1);
|
|
EXPECT_FALSE(list.Empty());
|
|
EXPECT_EQ(1u, list.size());
|
|
list.Remove(&t1);
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
}
|
|
|
|
TEST(List, InsertMultipleAtTailAndRemoveFromTail) {
|
|
List<TestChunk> list;
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
const size_t kSize = 10;
|
|
TestChunk chunks[kSize];
|
|
for (size_t i = 0; i < kSize; i++) {
|
|
list.PushBack(&chunks[i]);
|
|
EXPECT_EQ(list.back(), &chunks[i]);
|
|
EXPECT_EQ(i + 1, list.size());
|
|
}
|
|
EXPECT_EQ(kSize, list.size());
|
|
for (size_t i = kSize - 1; i > 0; i--) {
|
|
list.Remove(&chunks[i]);
|
|
EXPECT_EQ(list.back(), &chunks[i - 1]);
|
|
EXPECT_EQ(i, list.size());
|
|
}
|
|
|
|
list.Remove(&chunks[0]);
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
}
|
|
|
|
TEST(List, InsertMultipleAtHeadAndRemoveFromHead) {
|
|
List<TestChunk> list;
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
const size_t kSize = 10;
|
|
TestChunk chunks[kSize];
|
|
for (size_t i = 0; i < kSize; i++) {
|
|
list.PushFront(&chunks[i]);
|
|
EXPECT_EQ(list.front(), &chunks[i]);
|
|
EXPECT_EQ(i + 1, list.size());
|
|
}
|
|
EXPECT_EQ(kSize, list.size());
|
|
for (size_t i = kSize - 1; i > 0; i--) {
|
|
list.Remove(&chunks[i]);
|
|
EXPECT_EQ(list.front(), &chunks[i - 1]);
|
|
EXPECT_EQ(i, list.size());
|
|
}
|
|
list.Remove(&chunks[0]);
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
}
|
|
|
|
TEST(List, InsertMultipleAtTailAndRemoveFromMiddle) {
|
|
List<TestChunk> list;
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
const size_t kSize = 10;
|
|
TestChunk chunks[kSize];
|
|
for (size_t i = 0; i < kSize; i++) {
|
|
list.PushBack(&chunks[i]);
|
|
EXPECT_EQ(list.back(), &chunks[i]);
|
|
EXPECT_EQ(i + 1, list.size());
|
|
}
|
|
EXPECT_EQ(kSize, list.size());
|
|
size_t i, j;
|
|
for (i = kSize / 2 - 1, j = kSize / 2; j < kSize; i--, j++) {
|
|
list.Remove(&chunks[i]);
|
|
EXPECT_EQ(i * 2 + 1, list.size());
|
|
list.Remove(&chunks[j]);
|
|
EXPECT_EQ(i * 2, list.size());
|
|
}
|
|
EXPECT_TRUE(list.Empty());
|
|
EXPECT_EQ(0u, list.size());
|
|
}
|
|
|
|
} // namespace heap
|
|
} // namespace internal
|
|
} // namespace v8
|