mirror of
https://gitlab.com/libeigen/eigen.git
synced 2024-12-27 07:29:52 +08:00
82f0ce2726
This provide several advantages: - more flexibility in designing unit tests - unit tests can be glued to speed up compilation - unit tests are compiled with same predefined macros, which is a requirement for zapcc
47 lines
993 B
C++
47 lines
993 B
C++
// This file is part of Eigen, a lightweight C++ template library
|
|
// for linear algebra.
|
|
//
|
|
// Copyright (C) 2015 Benoit Steiner <benoit.steiner.goog@gmail.com>
|
|
//
|
|
// This Source Code Form is subject to the terms of the Mozilla
|
|
// Public License v. 2.0. If a copy of the MPL was not distributed
|
|
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
|
|
#include "main.h"
|
|
|
|
#include <Eigen/CXX11/Tensor>
|
|
|
|
using Eigen::Tensor;
|
|
using Eigen::RowMajor;
|
|
|
|
static void test_tanh()
|
|
{
|
|
Tensor<float, 1> vec1(6);
|
|
vec1.setRandom();
|
|
|
|
Tensor<float, 1> vec2 = vec1.tanh();
|
|
|
|
for (int i = 0; i < 6; ++i) {
|
|
VERIFY_IS_APPROX(vec2(i), tanhf(vec1(i)));
|
|
}
|
|
}
|
|
|
|
static void test_sigmoid()
|
|
{
|
|
Tensor<float, 1> vec1(6);
|
|
vec1.setRandom();
|
|
|
|
Tensor<float, 1> vec2 = vec1.sigmoid();
|
|
|
|
for (int i = 0; i < 6; ++i) {
|
|
VERIFY_IS_APPROX(vec2(i), 1.0f / (1.0f + std::exp(-vec1(i))));
|
|
}
|
|
}
|
|
|
|
|
|
EIGEN_DECLARE_TEST(cxx11_tensor_math)
|
|
{
|
|
CALL_SUBTEST(test_tanh());
|
|
CALL_SUBTEST(test_sigmoid());
|
|
}
|