noury/mirror-chatterino2
1
0
Fork 0
mirror of https://github.com/Chatterino/chatterino2.git synced 2024-11-13 19:49:51 +01:00
Code Issues Packages Projects Releases Wiki Activity

fix: we need C++ 23 for a size_t suffix

Browse source
This commit is contained in:
Nerixyz 2024-10-28 22:40:55 +01:00
parent 1d5c8725ae
commit 6430682902
No known key found for this signature in database
GPG key ID: 946BA188C5609CCC
1 changed files with 11 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
tests/src/LimitedQueue.cpp
View file

@ -135,14 +135,14 @@ TEST(LimitedQueue, ReplaceItem)
EXPECT_FALSE(res); EXPECT_FALSE(res);
// correct hint // correct hint
EXPECT_EQ(queue.replaceItem(3ULL, 4, 11), 3); EXPECT_EQ(queue.replaceItem(3, 4, 11), 3);
// incorrect hints // incorrect hints
EXPECT_EQ(queue.replaceItem(5ULL, 11, 12), 3); EXPECT_EQ(queue.replaceItem(5, 11, 12), 3);
EXPECT_EQ(queue.replaceItem(0ULL, 12, 13), 3); EXPECT_EQ(queue.replaceItem(0, 12, 13), 3);
// oob hint // oob hint
EXPECT_EQ(queue.replaceItem(42ULL, 13, 14), 3); EXPECT_EQ(queue.replaceItem(42, 13, 14), 3);
// bad needle // bad needle
EXPECT_EQ(queue.replaceItem(0ULL, 15, 16), -1); EXPECT_EQ(queue.replaceItem(0, 15, 16), -1);
SNAPSHOT_EQUALS(queue.getSnapshot(), {9, 10, 3, 14, 5, 6}, SNAPSHOT_EQUALS(queue.getSnapshot(), {9, 10, 3, 14, 5, 6},
"first snapshot"); "first snapshot");
@ -198,6 +198,7 @@ TEST(LimitedQueue, Find)
}) })
.has_value()); .has_value());
using Pair = std::pair<size_t, int>;
// with hint // with hint
EXPECT_FALSE(queue EXPECT_FALSE(queue
.find(0, .find(0,
@ -212,14 +213,14 @@ TEST(LimitedQueue, Find)
return i == 1; return i == 1;
}) })
.value(), .value(),
(std::pair{0ULL, 1})); (Pair{0, 1}));
EXPECT_EQ(queue EXPECT_EQ(queue
.find(1, .find(1,
[](int i) { [](int i) {
return i == 2; return i == 2;
}) })
.value(), .value(),
(std::pair{1ULL, 2})); (Pair{1, 2}));
// incorrect hint // incorrect hint
EXPECT_EQ(queue EXPECT_EQ(queue
.find(1, .find(1,
@ -227,14 +228,14 @@ TEST(LimitedQueue, Find)
return i == 1; return i == 1;
}) })
.value(), .value(),
(std::pair{0ULL, 1})); (Pair{0, 1}));
EXPECT_EQ(queue EXPECT_EQ(queue
.find(5, .find(5,
[](int i) { [](int i) {
return i == 6; return i == 6;
}) })
.value(), .value(),
(std::pair{5ULL, 6})); (Pair{5, 6}));
// oob hint // oob hint
EXPECT_EQ(queue EXPECT_EQ(queue
.find(6, .find(6,
@ -242,7 +243,7 @@ TEST(LimitedQueue, Find)
return i == 3; return i == 3;
}) })
.value(), .value(),
(std::pair{2ULL, 3})); (Pair{2, 3}));
// non-existent items // non-existent items
EXPECT_FALSE(queue EXPECT_FALSE(queue
.find(42, .find(42,