blob: d84ae5fb3298edc0c225999d099721b9c61fd481 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
// Copyright 2021 The libgav1 Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "src/utils/queue.h"
#include <utility>
#include <vector>
#include "gtest/gtest.h"
namespace libgav1 {
namespace {
struct TestClass {
TestClass() = default;
explicit TestClass(int i) : i(i) {}
int i;
// The vector exists simply so that the class is not trivially copyable.
std::vector<int> dummy;
};
TEST(QueueTest, Basic) {
Queue<TestClass> queue;
ASSERT_TRUE(queue.Init(8));
EXPECT_TRUE(queue.Empty());
for (int i = 0; i < 8; ++i) {
EXPECT_FALSE(queue.Full());
TestClass test(i);
queue.Push(std::move(test));
EXPECT_EQ(queue.Back().i, i);
EXPECT_FALSE(queue.Empty());
}
EXPECT_TRUE(queue.Full());
for (int i = 0; i < 8; ++i) {
EXPECT_FALSE(queue.Empty());
EXPECT_EQ(queue.Front().i, i);
queue.Pop();
EXPECT_FALSE(queue.Full());
}
EXPECT_TRUE(queue.Empty());
for (int i = 0; i < 8; ++i) {
EXPECT_FALSE(queue.Full());
TestClass test(i);
queue.Push(std::move(test));
EXPECT_EQ(queue.Back().i, i);
EXPECT_FALSE(queue.Empty());
}
EXPECT_TRUE(queue.Full());
queue.Clear();
EXPECT_TRUE(queue.Empty());
EXPECT_FALSE(queue.Full());
}
TEST(QueueTest, WrapAround) {
Queue<TestClass> queue;
ASSERT_TRUE(queue.Init(8));
EXPECT_TRUE(queue.Empty());
for (int i = 0; i < 100; ++i) {
EXPECT_FALSE(queue.Full());
TestClass test(i);
queue.Push(std::move(test));
EXPECT_EQ(queue.Back().i, i);
EXPECT_FALSE(queue.Empty());
EXPECT_EQ(queue.Front().i, i);
queue.Pop();
EXPECT_TRUE(queue.Empty());
}
}
} // namespace
} // namespace libgav1
|
