@@ -27,7 +27,7 @@ TEST(IList, Empty) {
27
27
Node node;
28
28
29
29
EXPECT_TRUE (list.Empty ());
30
- EXPECT_EQ (list.Size (), 0 );
30
+ EXPECT_EQ (list.Size (), ( size_t ) 0 );
31
31
EXPECT_EQ (list.Back (), nullptr );
32
32
EXPECT_EQ (list.Front (), nullptr );
33
33
EXPECT_EQ (list.PopBack (), nullptr );
@@ -41,7 +41,7 @@ TEST(IList, OneNode) {
41
41
42
42
list.PushBack (&node);
43
43
EXPECT_FALSE (list.Empty ());
44
- EXPECT_EQ (list.Size (), 1 );
44
+ EXPECT_EQ (list.Size (), ( size_t ) 1 );
45
45
EXPECT_EQ (list.Back (), &node);
46
46
EXPECT_EQ (list.Front (), &node);
47
47
EXPECT_TRUE (list.Queued (&node));
@@ -50,7 +50,7 @@ TEST(IList, OneNode) {
50
50
51
51
EXPECT_EQ (list.PopFront (), &node);
52
52
EXPECT_TRUE (list.Empty ());
53
- EXPECT_EQ (list.Size (), 0 );
53
+ EXPECT_EQ (list.Size (), ( size_t ) 0 );
54
54
EXPECT_FALSE (list.Queued (&node));
55
55
}
56
56
@@ -62,7 +62,7 @@ TEST(IList, MultipleNodes) {
62
62
list.PushBack (&nodes[0 ]);
63
63
list.PushFront (&nodes[2 ]);
64
64
65
- EXPECT_EQ (list.Size (), 3 );
65
+ EXPECT_EQ (list.Size (), ( size_t ) 3 );
66
66
EXPECT_EQ (list.Back (), &nodes[0 ]);
67
67
EXPECT_EQ (list.Front (), &nodes[2 ]);
68
68
@@ -92,12 +92,12 @@ TEST(IList, TwoLists) {
92
92
93
93
list2.PushFront (&nodes[1 ]);
94
94
95
- EXPECT_EQ (list1.Size (), 3 );
95
+ EXPECT_EQ (list1.Size (), ( size_t ) 3 );
96
96
EXPECT_TRUE (list1.Queued (&nodes[0 ]));
97
97
EXPECT_TRUE (list1.Queued (&nodes[1 ]));
98
98
EXPECT_TRUE (list1.Queued (&nodes[2 ]));
99
99
100
- EXPECT_EQ (list2.Size (), 1 );
100
+ EXPECT_EQ (list2.Size (), ( size_t ) 1 );
101
101
EXPECT_FALSE (list2.Queued (&nodes[0 ]));
102
102
EXPECT_TRUE (list2.Queued (&nodes[1 ]));
103
103
EXPECT_FALSE (list2.Queued (&nodes[2 ]));
@@ -109,17 +109,17 @@ TEST(IList, TwoLists) {
109
109
EXPECT_EQ (list2.Prev (&nodes[1 ]), nullptr );
110
110
111
111
list1.Remove (&nodes[1 ]);
112
- EXPECT_EQ (list1.Size (), 2 );
112
+ EXPECT_EQ (list1.Size (), ( size_t ) 2 );
113
113
EXPECT_FALSE (list1.Queued (&nodes[1 ]));
114
- EXPECT_EQ (list2.Size (), 1 );
114
+ EXPECT_EQ (list2.Size (), ( size_t ) 1 );
115
115
EXPECT_TRUE (list2.Queued (&nodes[1 ]));
116
116
117
117
EXPECT_EQ (list1.PopBack (), &nodes[0 ]);
118
118
EXPECT_EQ (list1.PopBack (), &nodes[2 ]);
119
- EXPECT_EQ (list1.Size (), 0 );
119
+ EXPECT_EQ (list1.Size (), ( size_t ) 0 );
120
120
121
121
EXPECT_EQ (list2.PopBack (), &nodes[1 ]);
122
- EXPECT_EQ (list2.Size (), 0 );
122
+ EXPECT_EQ (list2.Size (), ( size_t ) 0 );
123
123
}
124
124
125
125
} // namespace __tsan
0 commit comments