Redstone1024/Redcraft
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: Redstone1024:c543abebfbea3c94be69df3cfcdbad562b58367e
Branches Tags
Redstone1024:master
..
compare: Redstone1024:66baa51e30ee137c9d03d2f43de3cdb332fc643b
Branches Tags
Redstone1024:master

6 Commits
c543abebfb ... 66baa51e30

Author SHA1 Message Date
_Redstone_c_
66baa51e30 feat(templates): overloads the GetTypeHash algorithm for array 2023-01-03 10:15:38 +08:00
_Redstone_c_
1deb09480f refactor(templates): restrict the return value types of GetData and GetNum 2023-01-03 10:15:38 +08:00
_Redstone_c_
95b492851a fix(templates): fix the implementation of the Swap algorithm for arrays 2023-01-03 10:15:38 +08:00
_Redstone_c_
96ecd33c16 feat(templates): add TScopeCallback TGuardValue and TScopeCounter 2023-01-03 10:15:38 +08:00
_Redstone_c_
0709f209c8 feat(templates): add initializer_list overloads to the in place constructor and emplace 2023-01-03 10:15:38 +08:00
_Redstone_c_
5338cd286a feat(templates): overloads the Swap algorithm for array 2023-01-03 10:14:53 +08:00
2 changed files with 23 additions and 8 deletions
Show Stats Expand all files Collapse all files

29
Redcraft.Utility/Source/Public/Templates/Container.h
View File

@ -1,14 +1,15 @@
#pragma once
#include "CoreTypes.h"
#include "Templates/TypeHash.h"
#include "TypeTraits/Swappable.h"
NAMESPACE_REDCRAFT_BEGIN
NAMESPACE_MODULE_BEGIN(Redcraft)
NAMESPACE_MODULE_BEGIN(Utility)
/** @return The pointer or iterator to the container element storage. */
template <typename T> requires (requires(T&& Container) { Container.GetData(); })
/** @return The pointer to the container element storage. */
template <typename T> requires (requires(T&& Container) { { Container.GetData() } -> CPointer; })
FORCEINLINE constexpr decltype(auto) GetData(T&& Container)
{
return Container.GetData();
@ -21,7 +22,7 @@ template <typename T, size_t N> FORCEINLINE constexpr const T* GetData(const T(&
template <typename T, size_t N> FORCEINLINE constexpr const T* GetData(const T(&& Container)[N]) { return Container; }
/** Overloads the GetData algorithm for T::data(). */
template <typename T> requires (requires(T&& Container) { Container.data(); })
template <typename T> requires (requires(T&& Container) { { Container.data() } -> CPointer; })
FORCEINLINE constexpr decltype(auto) GetData(T&& Container)
{
return Container.data();
@ -29,13 +30,13 @@ FORCEINLINE constexpr decltype(auto) GetData(T&& Container)
/** Overloads the GetData algorithm for initializer_list. */
template <typename T>
FORCEINLINE constexpr decltype(auto) GetData(initializer_list<T> Container)
FORCEINLINE constexpr const T* GetData(initializer_list<T> Container)
{
return Container.begin();
}
/** @return The number of elements in the container. */
template <typename T> requires (requires(T&& Container) { Container.Num(); })
template <typename T> requires (requires(T&& Container) { { Container.Num() } -> CConvertibleTo<size_t>; })
FORCEINLINE constexpr decltype(auto) GetNum(T&& Container)
{
return Container.Num();
@ -48,7 +49,7 @@ template <typename T, size_t N> FORCEINLINE constexpr size_t GetNum(const T(& C
template <typename T, size_t N> FORCEINLINE constexpr size_t GetNum(const T(&& Container)[N]) { return N; }
/** Overloads the GetNum algorithm for T::size(). */
template <typename T> requires (requires(T&& Container) { Container.size(); })
template <typename T> requires (requires(T&& Container) { { Container.size() } -> CConvertibleTo<size_t>; })
FORCEINLINE constexpr decltype(auto) GetNum(T&& Container)
{
return Container.size();
@ -56,7 +57,7 @@ FORCEINLINE constexpr decltype(auto) GetNum(T&& Container)
/** Overloads the GetNum algorithm for initializer_list. */
template <typename T>
FORCEINLINE constexpr decltype(auto) GetNum(initializer_list<T> Container)
FORCEINLINE constexpr size_t GetNum(initializer_list<T> Container)
{
return Container.size();
}
@ -71,6 +72,20 @@ FORCEINLINE constexpr void Swap(T(&A)[N], T(&B)[N])
}
}
/** Overloads the GetTypeHash algorithm for arrays. */
template <typename T, size_t N> requires (CHashable<TRemoveAllExtents<T>>)
FORCEINLINE constexpr size_t GetTypeHash(T(&A)[N])
{
size_t Result = 3516520171;
for (size_t Index = 0; Index < N; ++Index)
{
Result = HashCombine(Result, GetTypeHash(A[Index]));
}
return Result;
}
NAMESPACE_MODULE_END(Utility)
NAMESPACE_MODULE_END(Redcraft)
NAMESPACE_REDCRAFT_END

2
Redcraft.Utility/Source/Public/Templates/TypeHash.h
View File

@ -74,7 +74,7 @@ FORCEINLINE constexpr size_t GetTypeHash(T A)
if constexpr (sizeof(T) == 2) return GetTypeHash(*reinterpret_cast<uint16*>(&A));
if constexpr (sizeof(T) == 4) return GetTypeHash(*reinterpret_cast<uint32*>(&A));
if constexpr (sizeof(T) == 8) return GetTypeHash(*reinterpret_cast<uint64*>(&A));
if constexpr (sizeof(T) == 16) return GetTypeHash(*reinterpret_cast<uint64*>(&A) + *(reinterpret_cast<uint64*>(&A) + 1));
if constexpr (sizeof(T) == 16) return GetTypeHash(*reinterpret_cast<uint64*>(&A) ^ *(reinterpret_cast<uint64*>(&A) + 1));
else check_no_entry();
return INDEX_NONE;