mirror of
https://github.com/SerenityOS/serenity
synced 2024-09-06 17:06:31 +00:00
75 lines
1.7 KiB
C++
75 lines
1.7 KiB
C++
/*
|
|
* Copyright (c) 2020, the SerenityOS developers.
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Traits.h>
|
|
|
|
namespace AK {
|
|
|
|
template<typename T>
|
|
class TypedTransfer {
|
|
public:
|
|
static void move(T* destination, T* source, size_t count)
|
|
{
|
|
if (count == 0)
|
|
return;
|
|
|
|
if constexpr (Traits<T>::is_trivial()) {
|
|
__builtin_memmove(destination, source, count * sizeof(T));
|
|
return;
|
|
}
|
|
|
|
for (size_t i = 0; i < count; ++i) {
|
|
if (destination <= source)
|
|
new (&destination[i]) T(std::move(source[i]));
|
|
else
|
|
new (&destination[count - i - 1]) T(std::move(source[count - i - 1]));
|
|
}
|
|
}
|
|
|
|
static size_t copy(T* destination, const T* source, size_t count)
|
|
{
|
|
if (count == 0)
|
|
return 0;
|
|
|
|
if constexpr (Traits<T>::is_trivial()) {
|
|
if (count == 1)
|
|
*destination = *source;
|
|
else
|
|
__builtin_memmove(destination, source, count * sizeof(T));
|
|
return count;
|
|
}
|
|
|
|
for (size_t i = 0; i < count; ++i) {
|
|
if (destination <= source)
|
|
new (&destination[i]) T(source[i]);
|
|
else
|
|
new (&destination[count - i - 1]) T(source[count - i - 1]);
|
|
}
|
|
|
|
return count;
|
|
}
|
|
|
|
static bool compare(const T* a, const T* b, size_t count)
|
|
{
|
|
if (count == 0)
|
|
return true;
|
|
|
|
if constexpr (Traits<T>::is_trivial())
|
|
return !__builtin_memcmp(a, b, count * sizeof(T));
|
|
|
|
for (size_t i = 0; i < count; ++i) {
|
|
if (a[i] != b[i])
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
};
|
|
|
|
}
|