2020-09-09 11:41:58 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2020, the SerenityOS developers.
|
|
|
|
*
|
2021-04-22 08:24:48 +00:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
2020-09-09 11:41:58 +00:00
|
|
|
*/
|
|
|
|
|
2021-04-25 05:53:23 +00:00
|
|
|
#include <LibTest/TestCase.h>
|
2020-09-09 11:41:58 +00:00
|
|
|
|
|
|
|
#include <AK/Array.h>
|
|
|
|
#include <AK/TypedTransfer.h>
|
|
|
|
|
|
|
|
struct NonPrimitiveIntWrapper {
|
|
|
|
NonPrimitiveIntWrapper(int value)
|
|
|
|
: m_value(value)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
int m_value;
|
|
|
|
};
|
|
|
|
|
|
|
|
TEST_CASE(overlapping_source_and_destination_1)
|
|
|
|
{
|
2022-04-01 17:58:27 +00:00
|
|
|
Array<NonPrimitiveIntWrapper, 6> const expected { 3, 4, 5, 6, 5, 6 };
|
2020-09-09 11:41:58 +00:00
|
|
|
|
|
|
|
Array<NonPrimitiveIntWrapper, 6> actual { 1, 2, 3, 4, 5, 6 };
|
|
|
|
AK::TypedTransfer<NonPrimitiveIntWrapper>::copy(actual.data(), actual.data() + 2, 4);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < 6; ++i)
|
|
|
|
EXPECT_EQ(actual[i].m_value, expected[i].m_value);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST_CASE(overlapping_source_and_destination_2)
|
|
|
|
{
|
2022-04-01 17:58:27 +00:00
|
|
|
Array<NonPrimitiveIntWrapper, 6> const expected { 1, 2, 1, 2, 3, 4 };
|
2020-09-09 11:41:58 +00:00
|
|
|
|
|
|
|
Array<NonPrimitiveIntWrapper, 6> actual { 1, 2, 3, 4, 5, 6 };
|
|
|
|
AK::TypedTransfer<NonPrimitiveIntWrapper>::copy(actual.data() + 2, actual.data(), 4);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < 6; ++i)
|
|
|
|
EXPECT_EQ(actual[i].m_value, expected[i].m_value);
|
|
|
|
}
|