2020-08-17 01:33:50 +03:00
|
|
|
|
/*
|
|
|
|
|
* Copyright (c) 2020, the SerenityOS developers.
|
|
|
|
|
*
|
2021-04-22 11:24:48 +03:00
|
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
2020-08-17 01:33:50 +03:00
|
|
|
|
*/
|
|
|
|
|
|
2021-04-25 08:53:23 +03:00
|
|
|
|
#include <LibTest/TestCase.h>
|
2020-08-17 01:33:50 +03:00
|
|
|
|
|
|
|
|
|
#include <AK/ByteBuffer.h>
|
2023-02-10 22:12:10 +03:00
|
|
|
|
#include <AK/Vector.h>
|
2020-08-17 01:33:50 +03:00
|
|
|
|
|
|
|
|
|
TEST_CASE(equality_operator)
|
|
|
|
|
{
|
2021-09-06 01:59:52 +03:00
|
|
|
|
ByteBuffer a = ByteBuffer::copy("Hello, world", 7).release_value();
|
|
|
|
|
ByteBuffer b = ByteBuffer::copy("Hello, friend", 7).release_value();
|
2020-08-17 01:33:50 +03:00
|
|
|
|
// `a` and `b` are both "Hello, ".
|
2021-09-06 01:59:52 +03:00
|
|
|
|
ByteBuffer c = ByteBuffer::copy("asdf", 4).release_value();
|
2020-08-17 01:33:50 +03:00
|
|
|
|
ByteBuffer d;
|
|
|
|
|
EXPECT_EQ(a == a, true);
|
|
|
|
|
EXPECT_EQ(a == b, true);
|
|
|
|
|
EXPECT_EQ(a == c, false);
|
|
|
|
|
EXPECT_EQ(a == d, false);
|
|
|
|
|
EXPECT_EQ(b == a, true);
|
|
|
|
|
EXPECT_EQ(b == b, true);
|
|
|
|
|
EXPECT_EQ(b == c, false);
|
|
|
|
|
EXPECT_EQ(b == d, false);
|
|
|
|
|
EXPECT_EQ(c == a, false);
|
|
|
|
|
EXPECT_EQ(c == b, false);
|
|
|
|
|
EXPECT_EQ(c == c, true);
|
|
|
|
|
EXPECT_EQ(c == d, false);
|
|
|
|
|
EXPECT_EQ(d == a, false);
|
|
|
|
|
EXPECT_EQ(d == b, false);
|
|
|
|
|
EXPECT_EQ(d == c, false);
|
|
|
|
|
EXPECT_EQ(d == d, true);
|
|
|
|
|
}
|
|
|
|
|
|
2023-02-10 22:12:10 +03:00
|
|
|
|
TEST_CASE(byte_buffer_vector_contains_slow_bytes)
|
|
|
|
|
{
|
|
|
|
|
Vector<ByteBuffer> vector;
|
|
|
|
|
ByteBuffer a = ByteBuffer::copy("Hello, friend", 13).release_value();
|
|
|
|
|
vector.append(a);
|
|
|
|
|
|
|
|
|
|
ReadonlyBytes b = "Hello, friend"sv.bytes();
|
|
|
|
|
Bytes c = a.bytes();
|
|
|
|
|
EXPECT_EQ(vector.contains_slow(b), true);
|
|
|
|
|
EXPECT_EQ(vector.contains_slow(c), true);
|
|
|
|
|
}
|
|
|
|
|
|
2023-12-27 18:11:20 +03:00
|
|
|
|
TEST_CASE(zero_fill_new_elements_on_growth)
|
|
|
|
|
{
|
|
|
|
|
auto buffer = MUST(ByteBuffer::create_uninitialized(5));
|
|
|
|
|
|
|
|
|
|
buffer.span().fill(1);
|
|
|
|
|
EXPECT_EQ(buffer.span(), (Array<u8, 5> { 1, 1, 1, 1, 1 }));
|
|
|
|
|
|
|
|
|
|
buffer.resize(8, ByteBuffer::ZeroFillNewElements::Yes);
|
|
|
|
|
EXPECT_EQ(buffer.span(), (Array<u8, 8> { 1, 1, 1, 1, 1, 0, 0, 0 }));
|
|
|
|
|
|
|
|
|
|
buffer.span().fill(2);
|
|
|
|
|
EXPECT_EQ(buffer.span(), (Array<u8, 8> { 2, 2, 2, 2, 2, 2, 2, 2 }));
|
|
|
|
|
|
|
|
|
|
buffer.resize(10, ByteBuffer::ZeroFillNewElements::Yes);
|
|
|
|
|
EXPECT_EQ(buffer.span(), (Array<u8, 10> { 2, 2, 2, 2, 2, 2, 2, 2, 0, 0 }));
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-09 17:31:27 +03:00
|
|
|
|
BENCHMARK_CASE(append)
|
|
|
|
|
{
|
|
|
|
|
ByteBuffer bb;
|
|
|
|
|
for (size_t i = 0; i < 1000000; ++i) {
|
|
|
|
|
bb.append(static_cast<u8>(i));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2020-08-22 17:10:19 +03:00
|
|
|
|
/*
|
|
|
|
|
* FIXME: These `negative_*` tests should cause precisely one compilation error
|
|
|
|
|
* each, and always for the specified reason. Currently we do not have a harness
|
|
|
|
|
* for that, so in order to run the test you need to set the #define to 1, compile
|
|
|
|
|
* it, and check the error messages manually.
|
|
|
|
|
*/
|
|
|
|
|
#define COMPILE_NEGATIVE_TESTS 0
|
|
|
|
|
#if COMPILE_NEGATIVE_TESTS
|
|
|
|
|
TEST_CASE(negative_operator_lt)
|
2020-08-17 01:33:50 +03:00
|
|
|
|
{
|
2022-01-20 20:47:39 +03:00
|
|
|
|
ByteBuffer a = ByteBuffer::copy("Hello, world", 10).release_value();
|
|
|
|
|
ByteBuffer b = ByteBuffer::copy("Hello, friend", 10).release_value();
|
2020-12-21 02:09:48 +03:00
|
|
|
|
[[maybe_unused]] auto res = a < b;
|
2020-08-22 17:10:19 +03:00
|
|
|
|
// error: error: use of deleted function ‘bool AK::ByteBuffer::operator<(const AK::ByteBuffer&) const’
|
2020-08-17 01:33:50 +03:00
|
|
|
|
}
|
2020-08-22 17:10:19 +03:00
|
|
|
|
#endif /* COMPILE_NEGATIVE_TESTS */
|