Moved some utilities to TensorMeta.h to make it easier to reuse them accross several tensor operations.

Created the TensorDimensionList class to encode the list of all the dimensions of a tensor of rank n. This could be done using TensorIndexList, however TensorIndexList require cxx11 which isn't yet supported as widely as we'd like.
This commit is contained in:
Benoit Steiner 2015-06-29 10:49:55 -07:00
parent 392a30db82
commit 3625734bc8
7 changed files with 308 additions and 35 deletions

View File

@ -351,12 +351,33 @@ template<typename Scalar> void packetmath_real()
CHECK_CWISE1_IF(internal::packet_traits<Scalar>::HasLog, std::log, internal::plog);
{
data1[0] = std::numeric_limits<Scalar>::quiet_NaN();
data1[1] = std::numeric_limits<Scalar>::epsilon();
packet_helper<internal::packet_traits<Scalar>::HasLog,Packet> h;
h.store(data2, internal::plog(h.load(data1)));
VERIFY(numext::isnan(data2[0]));
VERIFY(std::isnan(data2[0]));
// VERIFY_IS_EQUAL(std::log(std::numeric_limits<Scalar>::epsilon()), data2[1]);
data1[0] = -std::numeric_limits<Scalar>::epsilon();
data1[1] = 0;
h.store(data2, internal::plog(h.load(data1)));
VERIFY(std::isnan(data2[0]));
// VERIFY_IS_EQUAL(std::log(0), data2[1]);
data1[0] = (std::numeric_limits<Scalar>::min)();
data1[1] = -(std::numeric_limits<Scalar>::min)();
h.store(data2, internal::plog(h.load(data1)));
VERIFY_IS_EQUAL(std::log((std::numeric_limits<Scalar>::min)()), data2[0]);
// VERIFY(std::isnan(data2[1]));
data1[0] = std::numeric_limits<Scalar>::denorm_min();
data1[1] = -std::numeric_limits<Scalar>::denorm_min();
h.store(data2, internal::plog(h.load(data1)));
// VERIFY_IS_EQUAL(std::log(std::numeric_limits<Scalar>::denorm_min()), data2[0]);
// VERIFY(std::isnan(data2[1]));
data1[0] = -1.0f;
h.store(data2, internal::plog(h.load(data1)));
VERIFY(numext::isnan(data2[0]));
VERIFY(std::isnan(data2[0]));
#if !EIGEN_FAST_MATH
h.store(data2, internal::psqrt(h.load(data1)));
VERIFY(numext::isnan(data2[0]));

View File

@ -59,8 +59,10 @@
#include "Eigen/Core"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorForwardDeclarations.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorMeta.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorDeviceType.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorIndexList.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorDimensionList.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorDimensions.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorInitializer.h"
#include "unsupported/Eigen/CXX11/src/Tensor/TensorTraits.h"

View File

@ -364,14 +364,6 @@ class TensorContractionInputMapper<Scalar, Index, side, Tensor, nocontract_t, co
};
template <size_t n> struct max_n_1 {
static const size_t size = n;
};
template <> struct max_n_1<0> {
static const size_t size = 1;
};
template<typename Dimensions, typename LhsXprType, typename RhsXprType>
struct traits<TensorContractionOp<Dimensions, LhsXprType, RhsXprType> >
{
@ -459,19 +451,6 @@ class TensorContractionOp : public TensorBase<TensorContractionOp<Indices, LhsXp
};
template<bool cond> struct Cond {};
template<typename T1, typename T2> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE
const T1& choose(Cond<true>, const T1& first, const T2&) {
return first;
}
template<typename T1, typename T2> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE
const T2& choose(Cond<false>, const T1&, const T2& second) {
return second;
}
template<typename Derived>
struct TensorContractionEvaluatorBase
{
@ -508,13 +487,13 @@ struct TensorContractionEvaluatorBase
static const int RDims =
internal::array_size<typename TensorEvaluator<EvalRightArgType, Device>::Dimensions>::value;
static const unsigned int ContractDims = internal::array_size<Indices>::value;
static const int NumDims = internal::max_n_1<LDims + RDims - 2 * ContractDims>::size;
static const int NumDims = max_n_1<LDims + RDims - 2 * ContractDims>::size;
typedef array<Index, LDims> left_dim_mapper_t;
typedef array<Index, RDims> right_dim_mapper_t;
typedef array<Index, ContractDims> contract_t;
typedef array<Index, internal::max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, internal::max_n_1<RDims - ContractDims>::size> right_nocontract_t;
typedef array<Index, max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, max_n_1<RDims - ContractDims>::size> right_nocontract_t;
typedef DSizes<Index, NumDims> Dimensions;
@ -869,10 +848,10 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
typedef array<Index, RDims> right_dim_mapper_t;
typedef array<Index, ContractDims> contract_t;
typedef array<Index, internal::max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, internal::max_n_1<RDims - ContractDims>::size> right_nocontract_t;
typedef array<Index, max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, max_n_1<RDims - ContractDims>::size> right_nocontract_t;
static const int NumDims = internal::max_n_1<LDims + RDims - 2 * ContractDims>::size;
static const int NumDims = max_n_1<LDims + RDims - 2 * ContractDims>::size;
// Could we use NumDimensions here?
typedef DSizes<Index, NumDims> Dimensions;

View File

@ -1241,10 +1241,10 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
typedef array<Index, RDims> right_dim_mapper_t;
typedef array<Index, ContractDims> contract_t;
typedef array<Index, internal::max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, internal::max_n_1<RDims - ContractDims>::size> right_nocontract_t;
typedef array<Index, max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, max_n_1<RDims - ContractDims>::size> right_nocontract_t;
static const int NumDims = internal::max_n_1<LDims + RDims - 2 * ContractDims>::size;
static const int NumDims = max_n_1<LDims + RDims - 2 * ContractDims>::size;
typedef DSizes<Index, NumDims> Dimensions;

View File

@ -93,10 +93,10 @@ struct TensorEvaluator<const TensorContractionOp<Indices, LeftArgType, RightArgT
typedef array<Index, RDims> right_dim_mapper_t;
typedef array<Index, ContractDims> contract_t;
typedef array<Index, internal::max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, internal::max_n_1<RDims - ContractDims>::size> right_nocontract_t;
typedef array<Index, max_n_1<LDims - ContractDims>::size> left_nocontract_t;
typedef array<Index, max_n_1<RDims - ContractDims>::size> right_nocontract_t;
static const int NumDims = internal::max_n_1<LDims + RDims - 2 * ContractDims>::size;
static const int NumDims = max_n_1<LDims + RDims - 2 * ContractDims>::size;
typedef DSizes<Index, NumDims> Dimensions;

View File

@ -0,0 +1,235 @@
// 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/.
#ifndef EIGEN_CXX11_TENSOR_TENSOR_DIMENSION_LIST_H
#define EIGEN_CXX11_TENSOR_TENSOR_DIMENSION_LIST_H
namespace Eigen {
/** \internal
*
* \class TensorDimensionList
* \ingroup CXX11_Tensor_Module
*
* \brief Special case of tensor index list used to list all the dimensions of a tensor of rank n.
*
* \sa Tensor
*/
template <typename Index, std::size_t Rank> struct DimensionList {
const Index operator[] (const Index i) const { return i; }
};
namespace internal {
template<typename Index, std::size_t Rank> struct array_size<DimensionList<Index, Rank> > {
static const size_t value = Rank;
};
template<typename Index, std::size_t Rank> struct array_size<const DimensionList<Index, Rank> > {
static const size_t value = Rank;
};
template<DenseIndex n, typename Index, std::size_t Rank> const Index array_get(DimensionList<Index, Rank>& a) {
return n;
}
template<DenseIndex n, typename Index, std::size_t Rank> const Index array_get(const DimensionList<Index, Rank>& a) {
return n;
}
#if defined(EIGEN_HAS_CONSTEXPR)
template <typename Index, std::size_t Rank>
struct index_known_statically<DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex) const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct index_known_statically<const DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex) const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct all_indices_known_statically<DimensionList<Index, Rank> > {
constexpr bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct all_indices_known_statically<const DimensionList<Index, Rank> > {
constexpr bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct indices_statically_known_to_increase<DimensionList<Index, Rank> > {
constexpr bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct indices_statically_known_to_increase<const DimensionList<Index, Rank> > {
constexpr bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_eq<DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i == value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_eq<const DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i == value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_ne<DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i != value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_ne<const DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i != value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_gt<DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i > value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_gt<const DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i > value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_lt<DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i < value;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_lt<const DimensionList<Index, Rank> > {
constexpr bool operator() (const DenseIndex i, const DenseIndex value) const {
return i < value;
}
};
#else
template <typename Index, std::size_t Rank>
struct index_known_statically<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex) const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct index_known_statically<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex) const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct all_indices_known_statically<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct all_indices_known_statically<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct indices_statically_known_to_increase<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct indices_statically_known_to_increase<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() () const {
return true;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_eq<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_eq<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_ne<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_ne<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_gt<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_gt<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_lt<DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
template <typename Index, std::size_t Rank>
struct index_statically_lt<const DimensionList<Index, Rank> > {
EIGEN_ALWAYS_INLINE bool operator() (const DenseIndex i, const DenseIndex value) const {
return false;
}
};
#endif
} // end namespace internal
} // end namespace Eigen
#endif // EIGEN_CXX11_TENSOR_TENSOR_DIMENSION_LIST_H

View File

@ -0,0 +1,36 @@
// 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/.
#ifndef EIGEN_CXX11_TENSOR_TENSOR_META_H
#define EIGEN_CXX11_TENSOR_TENSOR_META_H
namespace Eigen {
template<bool cond> struct Cond {};
template<typename T1, typename T2> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE
const T1& choose(Cond<true>, const T1& first, const T2&) {
return first;
}
template<typename T1, typename T2> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE
const T2& choose(Cond<false>, const T1&, const T2& second) {
return second;
}
template <size_t n> struct max_n_1 {
static const size_t size = n;
};
template <> struct max_n_1<0> {
static const size_t size = 1;
};
} // namespace Eigen
#endif // EIGEN_CXX11_TENSOR_TENSOR_META_H