You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.
libcxx_old/test/std/numerics/complex.number/complex.ops/complex_equals_scalar.pass.cpp

85 lines
1.6 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>
// bool
// operator==(const complex<T>& lhs, const T& rhs);
#include <complex>
#include <cassert>
#include "test_macros.h"
template <class T>
void
test_constexpr()
{
#if TEST_STD_VER > 11
{
constexpr std::complex<T> lhs(1.5, 2.5);
constexpr T rhs(-2.5);
static_assert(!(lhs == rhs), "");
}
{
constexpr std::complex<T> lhs(1.5, 0);
constexpr T rhs(-2.5);
static_assert(!(lhs == rhs), "");
}
{
constexpr std::complex<T> lhs(1.5, 2.5);
constexpr T rhs(1.5);
static_assert(!(lhs == rhs), "");
}
{
constexpr std::complex<T> lhs(1.5, 0);
constexpr T rhs(1.5);
static_assert( (lhs == rhs), "");
}
#endif
}
template <class T>
void
test()
{
{
std::complex<T> lhs(1.5, 2.5);
T rhs(-2.5);
assert(!(lhs == rhs));
}
{
std::complex<T> lhs(1.5, 0);
T rhs(-2.5);
assert(!(lhs == rhs));
}
{
std::complex<T> lhs(1.5, 2.5);
T rhs(1.5);
assert(!(lhs == rhs));
}
{
std::complex<T> lhs(1.5, 0);
T rhs(1.5);
assert( (lhs == rhs));
}
test_constexpr<T> ();
}
int main(int, char**)
{
test<float>();
test<double>();
test<long double>();
// test_constexpr<int> ();
return 0;
}