mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-22 15:40:19 +00:00
667b417d9f
The return value is always be 'count', even in the case of 0. Note that the return value of TypedTransfer::copy() is likewise uninteresting, but apparently it is beig used. Hence this patch does not touch it.
93 lines
2.9 KiB
C++
93 lines
2.9 KiB
C++
/*
|
|
* Copyright (c) 2020, the SerenityOS developers.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#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)
|
|
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(AK::move(source[i]));
|
|
else
|
|
new (&destination[count - i - 1]) T(AK::move(source[count - i - 1]));
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
static size_t copy(T* destination, const T* source, size_t count)
|
|
{
|
|
if (!count)
|
|
return 0;
|
|
|
|
if constexpr (Traits<T>::is_trivial()) {
|
|
__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)
|
|
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;
|
|
}
|
|
};
|
|
|
|
}
|