Skip to content

Commit c36be6e

Browse files
committed
fixup! fixup! fixup! [SQUASH] src: fixup lint issues
1 parent 19b52aa commit c36be6e

File tree

1 file changed

+12
-6
lines changed

1 file changed

+12
-6
lines changed

test/cctest/test_dataqueue.cc

Lines changed: 12 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -40,7 +40,8 @@ TEST(DataQueue, InMemoryEntry) {
4040

4141
// We can slice the slice with a length.
4242
// slice: "o w"
43-
std::unique_ptr<DataQueue::Entry> slice2 = slice1->slice(2, Just(5UL));
43+
uint64_t end = 5;
44+
std::unique_ptr<DataQueue::Entry> slice2 = slice1->slice(2, Just(end));
4445

4546
// That slice is idempotent.
4647
CHECK(slice2->isIdempotent());
@@ -50,7 +51,8 @@ TEST(DataQueue, InMemoryEntry) {
5051

5152
// The slice end can extend beyond the actual size and will be adjusted.
5253
// slice: "orld"
53-
std::unique_ptr<DataQueue::Entry> slice3 = slice1->slice(5, Just(100UL));
54+
end = 100;
55+
std::unique_ptr<DataQueue::Entry> slice3 = slice1->slice(5, Just(end));
5456
CHECK_NOT_NULL(slice3);
5557

5658
// The slice size is known.
@@ -62,12 +64,14 @@ TEST(DataQueue, InMemoryEntry) {
6264
CHECK_EQ(slice4->size().ToChecked(), 0);
6365

6466
// If the slice end is less than the start, we get a zero length slice.
65-
std::unique_ptr<DataQueue::Entry> slice5 = entry->slice(2, Just(1UL));
67+
end = 1;
68+
std::unique_ptr<DataQueue::Entry> slice5 = entry->slice(2, Just(end));
6669
CHECK_NOT_NULL(slice5);
6770
CHECK_EQ(slice5->size().ToChecked(), 0);
6871

6972
// If the slice end equal to the start, we get a zero length slice.
70-
std::unique_ptr<DataQueue::Entry> slice6 = entry->slice(2, Just(2UL));
73+
end = 2;
74+
std::unique_ptr<DataQueue::Entry> slice6 = entry->slice(2, Just(end));
7175
CHECK_NOT_NULL(slice6);
7276
CHECK_EQ(slice6->size().ToChecked(), 0);
7377

@@ -289,7 +293,8 @@ TEST(DataQueue, IdempotentDataQueue) {
289293
testSlice(reader3);
290294

291295
// We can slice correctly across boundaries.
292-
std::shared_ptr<DataQueue> slice2 = data_queue->slice(5, Just(20UL));
296+
uint64_t end = 20;
297+
std::shared_ptr<DataQueue> slice2 = data_queue->slice(5, Just(end));
293298

294299
// The size is known.
295300
CHECK_EQ(slice2->size().ToChecked(), 15);
@@ -535,7 +540,8 @@ TEST(DataQueue, DataQueueEntry) {
535540
CHECK_EQ(entry->size().ToChecked(), data_queue->size().ToChecked());
536541

537542
// We can slice it since it is idempotent.
538-
std::unique_ptr<DataQueue::Entry> slice = entry->slice(5, Just(20UL));
543+
uint64_t end = 20;
544+
std::unique_ptr<DataQueue::Entry> slice = entry->slice(5, Just(end));
539545

540546
// The slice has the expected length.
541547
CHECK_EQ(slice->size().ToChecked(), 15);

0 commit comments

Comments
 (0)