2022-03-16 02:47:17 +00:00
|
|
|
#include "Testing/MiscellaneousTesting.h"
|
2022-03-19 05:35:27 +00:00
|
|
|
|
2022-03-16 02:47:17 +00:00
|
|
|
#include "Miscellaneous/AssertionMacros.h"
|
2022-03-16 03:25:48 +00:00
|
|
|
#include "Miscellaneous/TypeInfo.h"
|
2022-03-16 02:47:17 +00:00
|
|
|
#include "Miscellaneous/Compare.h"
|
|
|
|
|
|
|
|
NAMESPACE_REDCRAFT_BEGIN
|
|
|
|
NAMESPACE_MODULE_BEGIN(Redcraft)
|
|
|
|
NAMESPACE_MODULE_BEGIN(Utility)
|
|
|
|
|
2022-03-19 05:35:27 +00:00
|
|
|
NAMESPACE_BEGIN(Testing)
|
|
|
|
|
2022-03-16 02:47:17 +00:00
|
|
|
void TestMiscellaneous()
|
|
|
|
{
|
|
|
|
TestAssertionMacros();
|
|
|
|
TestCompare();
|
2022-03-16 03:25:48 +00:00
|
|
|
TestTypeInfo();
|
2022-03-16 02:47:17 +00:00
|
|
|
}
|
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
NAMESPACE_UNNAMED_BEGIN
|
2022-03-16 02:47:17 +00:00
|
|
|
|
|
|
|
void TestNoEntry()
|
|
|
|
{
|
|
|
|
check_no_entry();
|
|
|
|
always_check_no_entry();
|
|
|
|
}
|
|
|
|
|
|
|
|
void TestNoReentry()
|
|
|
|
{
|
|
|
|
check_no_reentry();
|
|
|
|
always_check_no_reentry();
|
|
|
|
}
|
|
|
|
|
|
|
|
void TestNoRecursion(int32 Depth)
|
|
|
|
{
|
|
|
|
if (Depth < 0) return;
|
|
|
|
|
|
|
|
check_no_recursion();
|
|
|
|
always_check_no_recursion();
|
|
|
|
|
|
|
|
TestNoRecursion(--Depth);
|
|
|
|
}
|
|
|
|
|
|
|
|
void TestUnimplemented()
|
|
|
|
{
|
|
|
|
unimplemented();
|
|
|
|
always_unimplemented();
|
|
|
|
}
|
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
NAMESPACE_UNNAMED_END
|
2022-03-16 02:47:17 +00:00
|
|
|
|
|
|
|
void TestAssertionMacros()
|
|
|
|
{
|
|
|
|
check(true);
|
|
|
|
//check(false);
|
|
|
|
checkf(true, "True!");
|
|
|
|
//checkf(false, "False!");
|
|
|
|
|
|
|
|
always_check(true);
|
|
|
|
//always_check(false);
|
|
|
|
always_checkf(true, "True!");
|
|
|
|
//always_checkf(false, "False!");
|
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
//TestNoEntry();
|
2022-03-16 02:47:17 +00:00
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
TestNoReentry();
|
|
|
|
//TestNoReentry();
|
2022-03-16 02:47:17 +00:00
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
TestNoRecursion(0);
|
|
|
|
TestNoRecursion(0);
|
|
|
|
//TestNoRecursion(1);
|
2022-03-16 02:47:17 +00:00
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
//TestUnimplemented();
|
2022-03-16 02:47:17 +00:00
|
|
|
|
|
|
|
verify(true);
|
|
|
|
//verify(false);
|
|
|
|
|
|
|
|
int32 A = 1;
|
|
|
|
int32 B = 0;
|
|
|
|
verify(B = A);
|
|
|
|
always_check(B == A);
|
|
|
|
}
|
|
|
|
|
|
|
|
NAMESPACE_UNNAMED_BEGIN
|
|
|
|
|
|
|
|
struct FTestPartialOrdering
|
|
|
|
{
|
|
|
|
int32 Num;
|
|
|
|
bool bIsValid;
|
|
|
|
FTestPartialOrdering(int32 InNum, bool bInIsValid = true) : Num(InNum), bIsValid(bInIsValid) { }
|
|
|
|
friend bool operator==(FTestPartialOrdering LHS, FTestPartialOrdering RHS) { return LHS.bIsValid && RHS.bIsValid ? LHS.Num == RHS.Num : false; }
|
|
|
|
friend partial_ordering operator<=>(FTestPartialOrdering LHS, FTestPartialOrdering RHS) { return LHS.bIsValid && RHS.bIsValid ? LHS.Num <=> RHS.Num : partial_ordering::unordered; }
|
|
|
|
};
|
|
|
|
|
|
|
|
struct FTestWeakOrdering
|
|
|
|
{
|
|
|
|
int32 Num;
|
|
|
|
FTestWeakOrdering(int32 InNum) : Num(InNum) { }
|
|
|
|
friend bool operator==(FTestWeakOrdering LHS, FTestWeakOrdering RHS) { return LHS.Num == RHS.Num; }
|
|
|
|
friend weak_ordering operator<=>(FTestWeakOrdering LHS, FTestWeakOrdering RHS) { return LHS.Num <=> RHS.Num; }
|
|
|
|
};
|
|
|
|
|
|
|
|
struct FTestStrongOrdering
|
|
|
|
{
|
|
|
|
int32 Num;
|
|
|
|
FTestStrongOrdering(int32 InNum) : Num(InNum) { }
|
|
|
|
friend bool operator==(FTestStrongOrdering LHS, FTestStrongOrdering RHS) { return LHS.Num == RHS.Num; }
|
|
|
|
friend strong_ordering operator<=>(FTestStrongOrdering LHS, FTestStrongOrdering RHS) { return LHS.Num <=> RHS.Num; }
|
|
|
|
};
|
|
|
|
|
2022-03-30 04:07:48 +00:00
|
|
|
struct FTestSynth
|
|
|
|
{
|
|
|
|
int32 A;
|
|
|
|
FTestSynth(int32 InA) : A(InA) { }
|
|
|
|
friend bool operator==(FTestSynth LHS, FTestSynth RHS) { return LHS.A == RHS.A; }
|
|
|
|
friend bool operator< (FTestSynth LHS, FTestSynth RHS) { return LHS.A < RHS.A; }
|
|
|
|
};
|
|
|
|
|
2022-03-16 02:47:17 +00:00
|
|
|
NAMESPACE_UNNAMED_END
|
|
|
|
|
|
|
|
void TestCompare()
|
|
|
|
{
|
|
|
|
always_check((-1 <=> 0) == strong_ordering::less);
|
|
|
|
always_check(( 0 <=> 0) == strong_ordering::equivalent);
|
|
|
|
always_check(( 0 <=> 0) == strong_ordering::equal);
|
|
|
|
always_check(( 0 <=> -1) == strong_ordering::greater);
|
|
|
|
|
|
|
|
always_check((-1 <=> 0) < 0);
|
|
|
|
always_check((-1 <=> 0) <= 0);
|
|
|
|
always_check(( 0 <=> 0) <= 0);
|
|
|
|
always_check(( 0 <=> 0) == 0);
|
|
|
|
always_check(( 0 <=> 0) >= 0);
|
|
|
|
always_check(( 0 <=> -1) >= 0);
|
|
|
|
always_check(( 0 <=> -1) > 0);
|
|
|
|
always_check((-1 <=> 1) != 0);
|
|
|
|
|
|
|
|
int64 NaNBit = 0xFFF8000000000000;
|
|
|
|
double NaN = *reinterpret_cast<double*>(&NaNBit);
|
|
|
|
|
|
|
|
always_check((-1.0 <=> 0.0) == partial_ordering::less);
|
|
|
|
always_check(( 0.0 <=> 0.0) == partial_ordering::equivalent);
|
|
|
|
always_check(( 0.0 <=> -1.0) == partial_ordering::greater);
|
|
|
|
always_check(( 0.0 <=> NaN) == partial_ordering::unordered);
|
|
|
|
|
|
|
|
always_check((-1.0 <=> 0.0) == weak_ordering::less);
|
|
|
|
always_check(( 0.0 <=> 0.0) == weak_ordering::equivalent);
|
|
|
|
always_check(( 0.0 <=> -1.0) == weak_ordering::greater);
|
|
|
|
|
|
|
|
always_check((-1.0 <=> 0.0) == strong_ordering::less);
|
|
|
|
always_check(( 0.0 <=> 0.0) == strong_ordering::equivalent);
|
|
|
|
always_check(( 0.0 <=> 0.0) == strong_ordering::equal);
|
|
|
|
always_check(( 0.0 <=> -1.0) == strong_ordering::greater);
|
|
|
|
|
|
|
|
always_check((-1.0 <=> 0.0) < 0);
|
|
|
|
always_check((-1.0 <=> 0.0) <= 0);
|
|
|
|
always_check(( 0.0 <=> 0.0) <= 0);
|
|
|
|
always_check(( 0.0 <=> 0.0) == 0);
|
|
|
|
always_check(( 0.0 <=> 0.0) >= 0);
|
|
|
|
always_check(( 0.0 <=> -1.0) >= 0);
|
|
|
|
always_check(( 0.0 <=> -1.0) > 0);
|
|
|
|
always_check((-1.0 <=> 1.0) != 0);
|
|
|
|
|
|
|
|
always_check((FTestPartialOrdering(-1) <=> FTestPartialOrdering( 0)) == partial_ordering::less);
|
|
|
|
always_check((FTestPartialOrdering( 0) <=> FTestPartialOrdering( 0)) == partial_ordering::equivalent);
|
|
|
|
always_check((FTestPartialOrdering( 0) <=> FTestPartialOrdering(-1)) == partial_ordering::greater);
|
|
|
|
|
|
|
|
always_check((FTestPartialOrdering( 0, true) <=> FTestPartialOrdering( 0, false)) == partial_ordering::unordered);
|
|
|
|
|
|
|
|
always_check((FTestWeakOrdering(-1) <=> FTestWeakOrdering( 0)) == weak_ordering::less);
|
|
|
|
always_check((FTestWeakOrdering( 0) <=> FTestWeakOrdering( 0)) == weak_ordering::equivalent);
|
|
|
|
always_check((FTestWeakOrdering( 0) <=> FTestWeakOrdering(-1)) == weak_ordering::greater);
|
|
|
|
|
|
|
|
always_check((FTestStrongOrdering(-1) <=> FTestStrongOrdering( 0)) == strong_ordering::less);
|
|
|
|
always_check((FTestStrongOrdering( 0) <=> FTestStrongOrdering( 0)) == strong_ordering::equivalent);
|
|
|
|
always_check((FTestStrongOrdering( 0) <=> FTestStrongOrdering( 0)) == strong_ordering::equal);
|
|
|
|
always_check((FTestStrongOrdering( 0) <=> FTestStrongOrdering(-1)) == strong_ordering::greater);
|
|
|
|
|
|
|
|
always_check((FTestPartialOrdering(-1) < FTestPartialOrdering( 0)));
|
|
|
|
always_check((FTestPartialOrdering( 0) == FTestPartialOrdering( 0)));
|
|
|
|
always_check((FTestPartialOrdering( 0) > FTestPartialOrdering(-1)));
|
|
|
|
|
|
|
|
always_check((FTestWeakOrdering(-1) < FTestWeakOrdering( 0)));
|
|
|
|
always_check((FTestWeakOrdering( 0) == FTestWeakOrdering( 0)));
|
|
|
|
always_check((FTestWeakOrdering( 0) > FTestWeakOrdering(-1)));
|
|
|
|
|
|
|
|
always_check((FTestStrongOrdering(-1) < FTestStrongOrdering( 0)));
|
|
|
|
always_check((FTestStrongOrdering( 0) == FTestStrongOrdering( 0)));
|
|
|
|
always_check((FTestStrongOrdering( 0) > FTestStrongOrdering(-1)));
|
|
|
|
|
|
|
|
always_check((TIsSame<TCommonComparisonCategory<strong_ordering >::Type, strong_ordering >::Value));
|
|
|
|
always_check((TIsSame<TCommonComparisonCategory<strong_ordering, weak_ordering >::Type, weak_ordering >::Value));
|
|
|
|
always_check((TIsSame<TCommonComparisonCategory<strong_ordering, weak_ordering, partial_ordering>::Type, partial_ordering>::Value));
|
|
|
|
|
|
|
|
always_check(CThreeWayComparable<int32>);
|
|
|
|
always_check(CThreeWayComparable<FTestPartialOrdering>);
|
|
|
|
always_check(CThreeWayComparable<FTestWeakOrdering>);
|
|
|
|
always_check(CThreeWayComparable<FTestStrongOrdering>);
|
|
|
|
|
|
|
|
always_check((CThreeWayComparableWith<bool, bool>));
|
|
|
|
always_check((CThreeWayComparableWith<int16, int32>));
|
|
|
|
|
|
|
|
always_check((TIsSame<TCompareThreeWayResult<int32 >::Type, strong_ordering >::Value));
|
|
|
|
always_check((TIsSame<TCompareThreeWayResult<float >::Type, partial_ordering>::Value));
|
|
|
|
always_check((TIsSame<TCompareThreeWayResult<FTestPartialOrdering>::Type, partial_ordering>::Value));
|
|
|
|
always_check((TIsSame<TCompareThreeWayResult<FTestWeakOrdering >::Type, weak_ordering >::Value));
|
|
|
|
always_check((TIsSame<TCompareThreeWayResult<FTestStrongOrdering >::Type, strong_ordering >::Value));
|
|
|
|
|
|
|
|
always_check((TCompareThreeWay<int32>()(0, 0) == strong_ordering::equal));
|
|
|
|
always_check((TCompareThreeWay<void>() (0, 0.0) == strong_ordering::equal));
|
|
|
|
|
2022-03-30 04:07:48 +00:00
|
|
|
|
|
|
|
always_check(TSynthThreeWay{}(FTestPartialOrdering(-1), FTestPartialOrdering( 0)) == partial_ordering::less);
|
|
|
|
always_check(TSynthThreeWay{}(FTestPartialOrdering( 0), FTestPartialOrdering( 0)) == partial_ordering::equivalent);
|
|
|
|
always_check(TSynthThreeWay{}(FTestPartialOrdering( 0), FTestPartialOrdering(-1)) == partial_ordering::greater);
|
|
|
|
|
|
|
|
always_check(TSynthThreeWay{}(FTestPartialOrdering( 0, true), FTestPartialOrdering( 0, false)) == partial_ordering::unordered);
|
|
|
|
|
|
|
|
always_check(TSynthThreeWay{}(FTestSynth(-1), FTestSynth( 0)) == weak_ordering::less);
|
|
|
|
always_check(TSynthThreeWay{}(FTestSynth( 0), FTestSynth( 0)) == weak_ordering::equivalent);
|
|
|
|
always_check(TSynthThreeWay{}(FTestSynth( 0), FTestSynth(-1)) == weak_ordering::greater);
|
|
|
|
|
2022-03-16 02:47:17 +00:00
|
|
|
always_check((StrongOrder(0, 0) == strong_ordering::equal));
|
|
|
|
always_check((WeakOrder(0, 0) == strong_ordering::equal));
|
|
|
|
always_check((PartialOrder(0, 0) == strong_ordering::equal));
|
|
|
|
always_check((CompareStrongOrderFallback(0, 0) == strong_ordering::equal));
|
|
|
|
always_check((CompareWeakOrderFallback(0, 0) == strong_ordering::equal));
|
|
|
|
always_check((ComparePartialOrderFallback(0, 0) == strong_ordering::equal));
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
NAMESPACE_UNNAMED_BEGIN
|
2022-03-16 03:25:48 +00:00
|
|
|
|
|
|
|
template <typename...>
|
|
|
|
struct TTestTemplateType { };
|
|
|
|
|
2022-03-19 08:05:47 +00:00
|
|
|
NAMESPACE_UNNAMED_END
|
2022-03-16 03:25:48 +00:00
|
|
|
|
|
|
|
void TestTypeInfo()
|
|
|
|
{
|
2022-04-05 09:00:33 +00:00
|
|
|
const FTypeInfo& TempA = Typeid(void);
|
|
|
|
const FTypeInfo& TempB = Typeid(void);
|
2022-03-16 03:25:48 +00:00
|
|
|
|
|
|
|
always_check(TempA == TempB);
|
|
|
|
always_check(TempA == Typeid(void));
|
|
|
|
|
2022-04-05 09:00:33 +00:00
|
|
|
const FTypeInfo& TempC(Typeid(TTestTemplateType<int8, int16>));
|
|
|
|
const FTypeInfo& TempD = Typeid(TTestTemplateType<int8, int32>);
|
2022-03-16 03:25:48 +00:00
|
|
|
|
2022-04-05 09:00:33 +00:00
|
|
|
const FTypeInfo& TempE = TempC;
|
|
|
|
const FTypeInfo& TempF = TempD;
|
2022-03-16 03:25:48 +00:00
|
|
|
|
|
|
|
always_check(TempE != TempF);
|
|
|
|
always_check((TempE < TempF) == (TempF > TempE));
|
|
|
|
always_check((TempE > TempF) == (TempF < TempE));
|
2022-04-05 09:00:33 +00:00
|
|
|
always_check((TempE <= TempF) == (TempF >= TempE));
|
|
|
|
always_check((TempE >= TempF) == (TempF <= TempE));
|
2022-03-16 03:25:48 +00:00
|
|
|
always_check((TempE <=> TempF) != 0);
|
|
|
|
}
|
|
|
|
|
2022-03-19 05:35:27 +00:00
|
|
|
NAMESPACE_END(Testing)
|
|
|
|
|
2022-03-16 02:47:17 +00:00
|
|
|
NAMESPACE_MODULE_END(Utility)
|
|
|
|
NAMESPACE_MODULE_END(Redcraft)
|
|
|
|
NAMESPACE_REDCRAFT_END
|