@@ -40,7 +40,8 @@ TEST(DataQueue, InMemoryEntry) {
40
40
41
41
// We can slice the slice with a length.
42
42
// 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));
44
45
45
46
// That slice is idempotent.
46
47
CHECK (slice2->isIdempotent ());
@@ -50,7 +51,8 @@ TEST(DataQueue, InMemoryEntry) {
50
51
51
52
// The slice end can extend beyond the actual size and will be adjusted.
52
53
// 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));
54
56
CHECK_NOT_NULL (slice3);
55
57
56
58
// The slice size is known.
@@ -62,12 +64,14 @@ TEST(DataQueue, InMemoryEntry) {
62
64
CHECK_EQ (slice4->size ().ToChecked (), 0 );
63
65
64
66
// 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));
66
69
CHECK_NOT_NULL (slice5);
67
70
CHECK_EQ (slice5->size ().ToChecked (), 0 );
68
71
69
72
// 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));
71
75
CHECK_NOT_NULL (slice6);
72
76
CHECK_EQ (slice6->size ().ToChecked (), 0 );
73
77
@@ -289,7 +293,8 @@ TEST(DataQueue, IdempotentDataQueue) {
289
293
testSlice (reader3);
290
294
291
295
// 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));
293
298
294
299
// The size is known.
295
300
CHECK_EQ (slice2->size ().ToChecked (), 15 );
@@ -535,7 +540,8 @@ TEST(DataQueue, DataQueueEntry) {
535
540
CHECK_EQ (entry->size ().ToChecked (), data_queue->size ().ToChecked ());
536
541
537
542
// 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));
539
545
540
546
// The slice has the expected length.
541
547
CHECK_EQ (slice->size ().ToChecked (), 15 );
0 commit comments