forked from OSchip/llvm-project
164 lines
4.5 KiB
C++
164 lines
4.5 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <complex>
|
|
|
|
// template<class T>
|
|
// complex<T>
|
|
// operator*(const complex<T>& lhs, const complex<T>& rhs);
|
|
|
|
#include <complex>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "../cases.h"
|
|
|
|
template <class T>
|
|
void
|
|
test(const std::complex<T>& lhs, const std::complex<T>& rhs, std::complex<T> x)
|
|
{
|
|
assert(lhs * rhs == x);
|
|
}
|
|
|
|
template <class T>
|
|
void
|
|
test()
|
|
{
|
|
std::complex<T> lhs(1.5, 2.5);
|
|
std::complex<T> rhs(1.5, 2.5);
|
|
std::complex<T> x(-4.0, 7.5);
|
|
test(lhs, rhs, x);
|
|
}
|
|
|
|
// test edges
|
|
|
|
void test_edges()
|
|
{
|
|
const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
|
|
for (unsigned i = 0; i < N; ++i)
|
|
{
|
|
for (unsigned j = 0; j < N; ++j)
|
|
{
|
|
std::complex<double> r = testcases[i] * testcases[j];
|
|
switch (classify(testcases[i]))
|
|
{
|
|
case zero:
|
|
switch (classify(testcases[j]))
|
|
{
|
|
case zero:
|
|
assert(classify(r) == zero);
|
|
break;
|
|
case non_zero:
|
|
assert(classify(r) == zero);
|
|
break;
|
|
case inf:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case NaN:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero_nan:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
}
|
|
break;
|
|
case non_zero:
|
|
switch (classify(testcases[j]))
|
|
{
|
|
case zero:
|
|
assert(classify(r) == zero);
|
|
break;
|
|
case non_zero:
|
|
assert(classify(r) == non_zero);
|
|
break;
|
|
case inf:
|
|
assert(classify(r) == inf);
|
|
break;
|
|
case NaN:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero_nan:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
}
|
|
break;
|
|
case inf:
|
|
switch (classify(testcases[j]))
|
|
{
|
|
case zero:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero:
|
|
assert(classify(r) == inf);
|
|
break;
|
|
case inf:
|
|
assert(classify(r) == inf);
|
|
break;
|
|
case NaN:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero_nan:
|
|
assert(classify(r) == inf);
|
|
break;
|
|
}
|
|
break;
|
|
case NaN:
|
|
switch (classify(testcases[j]))
|
|
{
|
|
case zero:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case inf:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case NaN:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero_nan:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
}
|
|
break;
|
|
case non_zero_nan:
|
|
switch (classify(testcases[j]))
|
|
{
|
|
case zero:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case inf:
|
|
assert(classify(r) == inf);
|
|
break;
|
|
case NaN:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
case non_zero_nan:
|
|
assert(classify(r) == NaN);
|
|
break;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
int main(int, char**)
|
|
{
|
|
test<float>();
|
|
test<double>();
|
|
test<long double>();
|
|
test_edges();
|
|
|
|
return 0;
|
|
}
|