umappp 0.1.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/LICENSE.txt +25 -0
- data/README.md +110 -0
- data/ext/umappp/extconf.rb +25 -0
- data/ext/umappp/numo.hpp +867 -0
- data/ext/umappp/umappp.cpp +225 -0
- data/lib/umappp/version.rb +5 -0
- data/lib/umappp.rb +41 -0
- data/vendor/Eigen/Cholesky +45 -0
- data/vendor/Eigen/CholmodSupport +48 -0
- data/vendor/Eigen/Core +384 -0
- data/vendor/Eigen/Dense +7 -0
- data/vendor/Eigen/Eigen +2 -0
- data/vendor/Eigen/Eigenvalues +60 -0
- data/vendor/Eigen/Geometry +59 -0
- data/vendor/Eigen/Householder +29 -0
- data/vendor/Eigen/IterativeLinearSolvers +48 -0
- data/vendor/Eigen/Jacobi +32 -0
- data/vendor/Eigen/KLUSupport +41 -0
- data/vendor/Eigen/LU +47 -0
- data/vendor/Eigen/MetisSupport +35 -0
- data/vendor/Eigen/OrderingMethods +70 -0
- data/vendor/Eigen/PaStiXSupport +49 -0
- data/vendor/Eigen/PardisoSupport +35 -0
- data/vendor/Eigen/QR +50 -0
- data/vendor/Eigen/QtAlignedMalloc +39 -0
- data/vendor/Eigen/SPQRSupport +34 -0
- data/vendor/Eigen/SVD +50 -0
- data/vendor/Eigen/Sparse +34 -0
- data/vendor/Eigen/SparseCholesky +37 -0
- data/vendor/Eigen/SparseCore +69 -0
- data/vendor/Eigen/SparseLU +50 -0
- data/vendor/Eigen/SparseQR +36 -0
- data/vendor/Eigen/StdDeque +27 -0
- data/vendor/Eigen/StdList +26 -0
- data/vendor/Eigen/StdVector +27 -0
- data/vendor/Eigen/SuperLUSupport +64 -0
- data/vendor/Eigen/UmfPackSupport +40 -0
- data/vendor/Eigen/src/Cholesky/LDLT.h +688 -0
- data/vendor/Eigen/src/Cholesky/LLT.h +558 -0
- data/vendor/Eigen/src/Cholesky/LLT_LAPACKE.h +99 -0
- data/vendor/Eigen/src/CholmodSupport/CholmodSupport.h +682 -0
- data/vendor/Eigen/src/Core/ArithmeticSequence.h +413 -0
- data/vendor/Eigen/src/Core/Array.h +417 -0
- data/vendor/Eigen/src/Core/ArrayBase.h +226 -0
- data/vendor/Eigen/src/Core/ArrayWrapper.h +209 -0
- data/vendor/Eigen/src/Core/Assign.h +90 -0
- data/vendor/Eigen/src/Core/AssignEvaluator.h +1010 -0
- data/vendor/Eigen/src/Core/Assign_MKL.h +178 -0
- data/vendor/Eigen/src/Core/BandMatrix.h +353 -0
- data/vendor/Eigen/src/Core/Block.h +448 -0
- data/vendor/Eigen/src/Core/BooleanRedux.h +162 -0
- data/vendor/Eigen/src/Core/CommaInitializer.h +164 -0
- data/vendor/Eigen/src/Core/ConditionEstimator.h +175 -0
- data/vendor/Eigen/src/Core/CoreEvaluators.h +1741 -0
- data/vendor/Eigen/src/Core/CoreIterators.h +132 -0
- data/vendor/Eigen/src/Core/CwiseBinaryOp.h +183 -0
- data/vendor/Eigen/src/Core/CwiseNullaryOp.h +1001 -0
- data/vendor/Eigen/src/Core/CwiseTernaryOp.h +197 -0
- data/vendor/Eigen/src/Core/CwiseUnaryOp.h +103 -0
- data/vendor/Eigen/src/Core/CwiseUnaryView.h +132 -0
- data/vendor/Eigen/src/Core/DenseBase.h +701 -0
- data/vendor/Eigen/src/Core/DenseCoeffsBase.h +685 -0
- data/vendor/Eigen/src/Core/DenseStorage.h +652 -0
- data/vendor/Eigen/src/Core/Diagonal.h +258 -0
- data/vendor/Eigen/src/Core/DiagonalMatrix.h +391 -0
- data/vendor/Eigen/src/Core/DiagonalProduct.h +28 -0
- data/vendor/Eigen/src/Core/Dot.h +318 -0
- data/vendor/Eigen/src/Core/EigenBase.h +160 -0
- data/vendor/Eigen/src/Core/ForceAlignedAccess.h +150 -0
- data/vendor/Eigen/src/Core/Fuzzy.h +155 -0
- data/vendor/Eigen/src/Core/GeneralProduct.h +465 -0
- data/vendor/Eigen/src/Core/GenericPacketMath.h +1040 -0
- data/vendor/Eigen/src/Core/GlobalFunctions.h +194 -0
- data/vendor/Eigen/src/Core/IO.h +258 -0
- data/vendor/Eigen/src/Core/IndexedView.h +237 -0
- data/vendor/Eigen/src/Core/Inverse.h +117 -0
- data/vendor/Eigen/src/Core/Map.h +171 -0
- data/vendor/Eigen/src/Core/MapBase.h +310 -0
- data/vendor/Eigen/src/Core/MathFunctions.h +2057 -0
- data/vendor/Eigen/src/Core/MathFunctionsImpl.h +200 -0
- data/vendor/Eigen/src/Core/Matrix.h +565 -0
- data/vendor/Eigen/src/Core/MatrixBase.h +547 -0
- data/vendor/Eigen/src/Core/NestByValue.h +85 -0
- data/vendor/Eigen/src/Core/NoAlias.h +109 -0
- data/vendor/Eigen/src/Core/NumTraits.h +335 -0
- data/vendor/Eigen/src/Core/PartialReduxEvaluator.h +232 -0
- data/vendor/Eigen/src/Core/PermutationMatrix.h +605 -0
- data/vendor/Eigen/src/Core/PlainObjectBase.h +1128 -0
- data/vendor/Eigen/src/Core/Product.h +191 -0
- data/vendor/Eigen/src/Core/ProductEvaluators.h +1179 -0
- data/vendor/Eigen/src/Core/Random.h +218 -0
- data/vendor/Eigen/src/Core/Redux.h +515 -0
- data/vendor/Eigen/src/Core/Ref.h +381 -0
- data/vendor/Eigen/src/Core/Replicate.h +142 -0
- data/vendor/Eigen/src/Core/Reshaped.h +454 -0
- data/vendor/Eigen/src/Core/ReturnByValue.h +119 -0
- data/vendor/Eigen/src/Core/Reverse.h +217 -0
- data/vendor/Eigen/src/Core/Select.h +164 -0
- data/vendor/Eigen/src/Core/SelfAdjointView.h +365 -0
- data/vendor/Eigen/src/Core/SelfCwiseBinaryOp.h +47 -0
- data/vendor/Eigen/src/Core/Solve.h +188 -0
- data/vendor/Eigen/src/Core/SolveTriangular.h +235 -0
- data/vendor/Eigen/src/Core/SolverBase.h +168 -0
- data/vendor/Eigen/src/Core/StableNorm.h +251 -0
- data/vendor/Eigen/src/Core/StlIterators.h +463 -0
- data/vendor/Eigen/src/Core/Stride.h +116 -0
- data/vendor/Eigen/src/Core/Swap.h +68 -0
- data/vendor/Eigen/src/Core/Transpose.h +464 -0
- data/vendor/Eigen/src/Core/Transpositions.h +386 -0
- data/vendor/Eigen/src/Core/TriangularMatrix.h +1001 -0
- data/vendor/Eigen/src/Core/VectorBlock.h +96 -0
- data/vendor/Eigen/src/Core/VectorwiseOp.h +784 -0
- data/vendor/Eigen/src/Core/Visitor.h +381 -0
- data/vendor/Eigen/src/Core/arch/AVX/Complex.h +372 -0
- data/vendor/Eigen/src/Core/arch/AVX/MathFunctions.h +228 -0
- data/vendor/Eigen/src/Core/arch/AVX/PacketMath.h +1574 -0
- data/vendor/Eigen/src/Core/arch/AVX/TypeCasting.h +115 -0
- data/vendor/Eigen/src/Core/arch/AVX512/Complex.h +422 -0
- data/vendor/Eigen/src/Core/arch/AVX512/MathFunctions.h +362 -0
- data/vendor/Eigen/src/Core/arch/AVX512/PacketMath.h +2303 -0
- data/vendor/Eigen/src/Core/arch/AVX512/TypeCasting.h +89 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/Complex.h +417 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MathFunctions.h +90 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MatrixProduct.h +2937 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MatrixProductCommon.h +221 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/MatrixProductMMA.h +629 -0
- data/vendor/Eigen/src/Core/arch/AltiVec/PacketMath.h +2711 -0
- data/vendor/Eigen/src/Core/arch/CUDA/Complex.h +258 -0
- data/vendor/Eigen/src/Core/arch/Default/BFloat16.h +700 -0
- data/vendor/Eigen/src/Core/arch/Default/ConjHelper.h +117 -0
- data/vendor/Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h +1649 -0
- data/vendor/Eigen/src/Core/arch/Default/GenericPacketMathFunctionsFwd.h +110 -0
- data/vendor/Eigen/src/Core/arch/Default/Half.h +942 -0
- data/vendor/Eigen/src/Core/arch/Default/Settings.h +49 -0
- data/vendor/Eigen/src/Core/arch/Default/TypeCasting.h +120 -0
- data/vendor/Eigen/src/Core/arch/GPU/MathFunctions.h +103 -0
- data/vendor/Eigen/src/Core/arch/GPU/PacketMath.h +1685 -0
- data/vendor/Eigen/src/Core/arch/GPU/TypeCasting.h +80 -0
- data/vendor/Eigen/src/Core/arch/HIP/hcc/math_constants.h +23 -0
- data/vendor/Eigen/src/Core/arch/MSA/Complex.h +648 -0
- data/vendor/Eigen/src/Core/arch/MSA/MathFunctions.h +387 -0
- data/vendor/Eigen/src/Core/arch/MSA/PacketMath.h +1233 -0
- data/vendor/Eigen/src/Core/arch/NEON/Complex.h +584 -0
- data/vendor/Eigen/src/Core/arch/NEON/GeneralBlockPanelKernel.h +183 -0
- data/vendor/Eigen/src/Core/arch/NEON/MathFunctions.h +75 -0
- data/vendor/Eigen/src/Core/arch/NEON/PacketMath.h +4587 -0
- data/vendor/Eigen/src/Core/arch/NEON/TypeCasting.h +1419 -0
- data/vendor/Eigen/src/Core/arch/SSE/Complex.h +351 -0
- data/vendor/Eigen/src/Core/arch/SSE/MathFunctions.h +199 -0
- data/vendor/Eigen/src/Core/arch/SSE/PacketMath.h +1505 -0
- data/vendor/Eigen/src/Core/arch/SSE/TypeCasting.h +142 -0
- data/vendor/Eigen/src/Core/arch/SVE/MathFunctions.h +44 -0
- data/vendor/Eigen/src/Core/arch/SVE/PacketMath.h +752 -0
- data/vendor/Eigen/src/Core/arch/SVE/TypeCasting.h +49 -0
- data/vendor/Eigen/src/Core/arch/SYCL/InteropHeaders.h +232 -0
- data/vendor/Eigen/src/Core/arch/SYCL/MathFunctions.h +301 -0
- data/vendor/Eigen/src/Core/arch/SYCL/PacketMath.h +670 -0
- data/vendor/Eigen/src/Core/arch/SYCL/SyclMemoryModel.h +694 -0
- data/vendor/Eigen/src/Core/arch/SYCL/TypeCasting.h +85 -0
- data/vendor/Eigen/src/Core/arch/ZVector/Complex.h +426 -0
- data/vendor/Eigen/src/Core/arch/ZVector/MathFunctions.h +233 -0
- data/vendor/Eigen/src/Core/arch/ZVector/PacketMath.h +1060 -0
- data/vendor/Eigen/src/Core/functors/AssignmentFunctors.h +177 -0
- data/vendor/Eigen/src/Core/functors/BinaryFunctors.h +541 -0
- data/vendor/Eigen/src/Core/functors/NullaryFunctors.h +189 -0
- data/vendor/Eigen/src/Core/functors/StlFunctors.h +166 -0
- data/vendor/Eigen/src/Core/functors/TernaryFunctors.h +25 -0
- data/vendor/Eigen/src/Core/functors/UnaryFunctors.h +1131 -0
- data/vendor/Eigen/src/Core/products/GeneralBlockPanelKernel.h +2645 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrix.h +517 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h +317 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h +145 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixMatrix_BLAS.h +124 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixVector.h +518 -0
- data/vendor/Eigen/src/Core/products/GeneralMatrixVector_BLAS.h +136 -0
- data/vendor/Eigen/src/Core/products/Parallelizer.h +180 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixMatrix.h +544 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixMatrix_BLAS.h +295 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixVector.h +262 -0
- data/vendor/Eigen/src/Core/products/SelfadjointMatrixVector_BLAS.h +118 -0
- data/vendor/Eigen/src/Core/products/SelfadjointProduct.h +133 -0
- data/vendor/Eigen/src/Core/products/SelfadjointRank2Update.h +94 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixMatrix.h +472 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixMatrix_BLAS.h +317 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixVector.h +350 -0
- data/vendor/Eigen/src/Core/products/TriangularMatrixVector_BLAS.h +255 -0
- data/vendor/Eigen/src/Core/products/TriangularSolverMatrix.h +337 -0
- data/vendor/Eigen/src/Core/products/TriangularSolverMatrix_BLAS.h +167 -0
- data/vendor/Eigen/src/Core/products/TriangularSolverVector.h +148 -0
- data/vendor/Eigen/src/Core/util/BlasUtil.h +583 -0
- data/vendor/Eigen/src/Core/util/ConfigureVectorization.h +512 -0
- data/vendor/Eigen/src/Core/util/Constants.h +563 -0
- data/vendor/Eigen/src/Core/util/DisableStupidWarnings.h +106 -0
- data/vendor/Eigen/src/Core/util/ForwardDeclarations.h +322 -0
- data/vendor/Eigen/src/Core/util/IndexedViewHelper.h +186 -0
- data/vendor/Eigen/src/Core/util/IntegralConstant.h +272 -0
- data/vendor/Eigen/src/Core/util/MKL_support.h +137 -0
- data/vendor/Eigen/src/Core/util/Macros.h +1464 -0
- data/vendor/Eigen/src/Core/util/Memory.h +1163 -0
- data/vendor/Eigen/src/Core/util/Meta.h +812 -0
- data/vendor/Eigen/src/Core/util/NonMPL2.h +3 -0
- data/vendor/Eigen/src/Core/util/ReenableStupidWarnings.h +31 -0
- data/vendor/Eigen/src/Core/util/ReshapedHelper.h +51 -0
- data/vendor/Eigen/src/Core/util/StaticAssert.h +221 -0
- data/vendor/Eigen/src/Core/util/SymbolicIndex.h +293 -0
- data/vendor/Eigen/src/Core/util/XprHelper.h +856 -0
- data/vendor/Eigen/src/Eigenvalues/ComplexEigenSolver.h +346 -0
- data/vendor/Eigen/src/Eigenvalues/ComplexSchur.h +462 -0
- data/vendor/Eigen/src/Eigenvalues/ComplexSchur_LAPACKE.h +91 -0
- data/vendor/Eigen/src/Eigenvalues/EigenSolver.h +622 -0
- data/vendor/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h +418 -0
- data/vendor/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h +226 -0
- data/vendor/Eigen/src/Eigenvalues/HessenbergDecomposition.h +374 -0
- data/vendor/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h +158 -0
- data/vendor/Eigen/src/Eigenvalues/RealQZ.h +657 -0
- data/vendor/Eigen/src/Eigenvalues/RealSchur.h +558 -0
- data/vendor/Eigen/src/Eigenvalues/RealSchur_LAPACKE.h +77 -0
- data/vendor/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h +904 -0
- data/vendor/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h +87 -0
- data/vendor/Eigen/src/Eigenvalues/Tridiagonalization.h +561 -0
- data/vendor/Eigen/src/Geometry/AlignedBox.h +486 -0
- data/vendor/Eigen/src/Geometry/AngleAxis.h +247 -0
- data/vendor/Eigen/src/Geometry/EulerAngles.h +114 -0
- data/vendor/Eigen/src/Geometry/Homogeneous.h +501 -0
- data/vendor/Eigen/src/Geometry/Hyperplane.h +282 -0
- data/vendor/Eigen/src/Geometry/OrthoMethods.h +235 -0
- data/vendor/Eigen/src/Geometry/ParametrizedLine.h +232 -0
- data/vendor/Eigen/src/Geometry/Quaternion.h +870 -0
- data/vendor/Eigen/src/Geometry/Rotation2D.h +199 -0
- data/vendor/Eigen/src/Geometry/RotationBase.h +206 -0
- data/vendor/Eigen/src/Geometry/Scaling.h +188 -0
- data/vendor/Eigen/src/Geometry/Transform.h +1563 -0
- data/vendor/Eigen/src/Geometry/Translation.h +202 -0
- data/vendor/Eigen/src/Geometry/Umeyama.h +166 -0
- data/vendor/Eigen/src/Geometry/arch/Geometry_SIMD.h +168 -0
- data/vendor/Eigen/src/Householder/BlockHouseholder.h +110 -0
- data/vendor/Eigen/src/Householder/Householder.h +176 -0
- data/vendor/Eigen/src/Householder/HouseholderSequence.h +545 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h +226 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +212 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h +229 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h +394 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h +453 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h +444 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h +198 -0
- data/vendor/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h +117 -0
- data/vendor/Eigen/src/Jacobi/Jacobi.h +483 -0
- data/vendor/Eigen/src/KLUSupport/KLUSupport.h +358 -0
- data/vendor/Eigen/src/LU/Determinant.h +117 -0
- data/vendor/Eigen/src/LU/FullPivLU.h +877 -0
- data/vendor/Eigen/src/LU/InverseImpl.h +432 -0
- data/vendor/Eigen/src/LU/PartialPivLU.h +624 -0
- data/vendor/Eigen/src/LU/PartialPivLU_LAPACKE.h +83 -0
- data/vendor/Eigen/src/LU/arch/InverseSize4.h +351 -0
- data/vendor/Eigen/src/MetisSupport/MetisSupport.h +137 -0
- data/vendor/Eigen/src/OrderingMethods/Amd.h +435 -0
- data/vendor/Eigen/src/OrderingMethods/Eigen_Colamd.h +1863 -0
- data/vendor/Eigen/src/OrderingMethods/Ordering.h +153 -0
- data/vendor/Eigen/src/PaStiXSupport/PaStiXSupport.h +678 -0
- data/vendor/Eigen/src/PardisoSupport/PardisoSupport.h +545 -0
- data/vendor/Eigen/src/QR/ColPivHouseholderQR.h +674 -0
- data/vendor/Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h +97 -0
- data/vendor/Eigen/src/QR/CompleteOrthogonalDecomposition.h +635 -0
- data/vendor/Eigen/src/QR/FullPivHouseholderQR.h +713 -0
- data/vendor/Eigen/src/QR/HouseholderQR.h +434 -0
- data/vendor/Eigen/src/QR/HouseholderQR_LAPACKE.h +68 -0
- data/vendor/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h +335 -0
- data/vendor/Eigen/src/SVD/BDCSVD.h +1366 -0
- data/vendor/Eigen/src/SVD/JacobiSVD.h +812 -0
- data/vendor/Eigen/src/SVD/JacobiSVD_LAPACKE.h +91 -0
- data/vendor/Eigen/src/SVD/SVDBase.h +376 -0
- data/vendor/Eigen/src/SVD/UpperBidiagonalization.h +414 -0
- data/vendor/Eigen/src/SparseCholesky/SimplicialCholesky.h +697 -0
- data/vendor/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h +174 -0
- data/vendor/Eigen/src/SparseCore/AmbiVector.h +378 -0
- data/vendor/Eigen/src/SparseCore/CompressedStorage.h +274 -0
- data/vendor/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h +352 -0
- data/vendor/Eigen/src/SparseCore/MappedSparseMatrix.h +67 -0
- data/vendor/Eigen/src/SparseCore/SparseAssign.h +270 -0
- data/vendor/Eigen/src/SparseCore/SparseBlock.h +571 -0
- data/vendor/Eigen/src/SparseCore/SparseColEtree.h +206 -0
- data/vendor/Eigen/src/SparseCore/SparseCompressedBase.h +370 -0
- data/vendor/Eigen/src/SparseCore/SparseCwiseBinaryOp.h +722 -0
- data/vendor/Eigen/src/SparseCore/SparseCwiseUnaryOp.h +150 -0
- data/vendor/Eigen/src/SparseCore/SparseDenseProduct.h +342 -0
- data/vendor/Eigen/src/SparseCore/SparseDiagonalProduct.h +138 -0
- data/vendor/Eigen/src/SparseCore/SparseDot.h +98 -0
- data/vendor/Eigen/src/SparseCore/SparseFuzzy.h +29 -0
- data/vendor/Eigen/src/SparseCore/SparseMap.h +305 -0
- data/vendor/Eigen/src/SparseCore/SparseMatrix.h +1518 -0
- data/vendor/Eigen/src/SparseCore/SparseMatrixBase.h +398 -0
- data/vendor/Eigen/src/SparseCore/SparsePermutation.h +178 -0
- data/vendor/Eigen/src/SparseCore/SparseProduct.h +181 -0
- data/vendor/Eigen/src/SparseCore/SparseRedux.h +49 -0
- data/vendor/Eigen/src/SparseCore/SparseRef.h +397 -0
- data/vendor/Eigen/src/SparseCore/SparseSelfAdjointView.h +659 -0
- data/vendor/Eigen/src/SparseCore/SparseSolverBase.h +124 -0
- data/vendor/Eigen/src/SparseCore/SparseSparseProductWithPruning.h +198 -0
- data/vendor/Eigen/src/SparseCore/SparseTranspose.h +92 -0
- data/vendor/Eigen/src/SparseCore/SparseTriangularView.h +189 -0
- data/vendor/Eigen/src/SparseCore/SparseUtil.h +186 -0
- data/vendor/Eigen/src/SparseCore/SparseVector.h +478 -0
- data/vendor/Eigen/src/SparseCore/SparseView.h +254 -0
- data/vendor/Eigen/src/SparseCore/TriangularSolver.h +315 -0
- data/vendor/Eigen/src/SparseLU/SparseLU.h +923 -0
- data/vendor/Eigen/src/SparseLU/SparseLUImpl.h +66 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_Memory.h +226 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_Structs.h +110 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h +375 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_Utils.h +80 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_column_bmod.h +181 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_column_dfs.h +179 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h +107 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_gemm_kernel.h +280 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h +126 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_kernel_bmod.h +130 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_panel_bmod.h +223 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_panel_dfs.h +258 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_pivotL.h +137 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_pruneL.h +136 -0
- data/vendor/Eigen/src/SparseLU/SparseLU_relax_snode.h +83 -0
- data/vendor/Eigen/src/SparseQR/SparseQR.h +758 -0
- data/vendor/Eigen/src/StlSupport/StdDeque.h +116 -0
- data/vendor/Eigen/src/StlSupport/StdList.h +106 -0
- data/vendor/Eigen/src/StlSupport/StdVector.h +131 -0
- data/vendor/Eigen/src/StlSupport/details.h +84 -0
- data/vendor/Eigen/src/SuperLUSupport/SuperLUSupport.h +1025 -0
- data/vendor/Eigen/src/UmfPackSupport/UmfPackSupport.h +642 -0
- data/vendor/Eigen/src/misc/Image.h +82 -0
- data/vendor/Eigen/src/misc/Kernel.h +79 -0
- data/vendor/Eigen/src/misc/RealSvd2x2.h +55 -0
- data/vendor/Eigen/src/misc/blas.h +440 -0
- data/vendor/Eigen/src/misc/lapack.h +152 -0
- data/vendor/Eigen/src/misc/lapacke.h +16292 -0
- data/vendor/Eigen/src/misc/lapacke_mangling.h +17 -0
- data/vendor/Eigen/src/plugins/ArrayCwiseBinaryOps.h +358 -0
- data/vendor/Eigen/src/plugins/ArrayCwiseUnaryOps.h +696 -0
- data/vendor/Eigen/src/plugins/BlockMethods.h +1442 -0
- data/vendor/Eigen/src/plugins/CommonCwiseBinaryOps.h +115 -0
- data/vendor/Eigen/src/plugins/CommonCwiseUnaryOps.h +177 -0
- data/vendor/Eigen/src/plugins/IndexedViewMethods.h +262 -0
- data/vendor/Eigen/src/plugins/MatrixCwiseBinaryOps.h +152 -0
- data/vendor/Eigen/src/plugins/MatrixCwiseUnaryOps.h +95 -0
- data/vendor/Eigen/src/plugins/ReshapedMethods.h +149 -0
- data/vendor/aarand/aarand.hpp +114 -0
- data/vendor/annoy/annoylib.h +1495 -0
- data/vendor/annoy/kissrandom.h +120 -0
- data/vendor/annoy/mman.h +242 -0
- data/vendor/hnswlib/bruteforce.h +152 -0
- data/vendor/hnswlib/hnswalg.h +1192 -0
- data/vendor/hnswlib/hnswlib.h +108 -0
- data/vendor/hnswlib/space_ip.h +282 -0
- data/vendor/hnswlib/space_l2.h +281 -0
- data/vendor/hnswlib/visited_list_pool.h +79 -0
- data/vendor/irlba/irlba.hpp +575 -0
- data/vendor/irlba/lanczos.hpp +212 -0
- data/vendor/irlba/parallel.hpp +474 -0
- data/vendor/irlba/utils.hpp +224 -0
- data/vendor/irlba/wrappers.hpp +228 -0
- data/vendor/kmeans/Base.hpp +75 -0
- data/vendor/kmeans/Details.hpp +79 -0
- data/vendor/kmeans/HartiganWong.hpp +492 -0
- data/vendor/kmeans/InitializeKmeansPP.hpp +144 -0
- data/vendor/kmeans/InitializeNone.hpp +44 -0
- data/vendor/kmeans/InitializePCAPartition.hpp +309 -0
- data/vendor/kmeans/InitializeRandom.hpp +91 -0
- data/vendor/kmeans/Kmeans.hpp +161 -0
- data/vendor/kmeans/Lloyd.hpp +134 -0
- data/vendor/kmeans/MiniBatch.hpp +269 -0
- data/vendor/kmeans/QuickSearch.hpp +179 -0
- data/vendor/kmeans/compute_centroids.hpp +32 -0
- data/vendor/kmeans/compute_wcss.hpp +27 -0
- data/vendor/kmeans/is_edge_case.hpp +42 -0
- data/vendor/kmeans/random.hpp +55 -0
- data/vendor/knncolle/Annoy/Annoy.hpp +193 -0
- data/vendor/knncolle/BruteForce/BruteForce.hpp +120 -0
- data/vendor/knncolle/Hnsw/Hnsw.hpp +225 -0
- data/vendor/knncolle/Kmknn/Kmknn.hpp +286 -0
- data/vendor/knncolle/VpTree/VpTree.hpp +256 -0
- data/vendor/knncolle/knncolle.hpp +34 -0
- data/vendor/knncolle/utils/Base.hpp +100 -0
- data/vendor/knncolle/utils/NeighborQueue.hpp +94 -0
- data/vendor/knncolle/utils/distances.hpp +98 -0
- data/vendor/knncolle/utils/find_nearest_neighbors.hpp +112 -0
- data/vendor/powerit/PowerIterations.hpp +157 -0
- data/vendor/umappp/NeighborList.hpp +37 -0
- data/vendor/umappp/Umap.hpp +662 -0
- data/vendor/umappp/combine_neighbor_sets.hpp +95 -0
- data/vendor/umappp/find_ab.hpp +157 -0
- data/vendor/umappp/neighbor_similarities.hpp +136 -0
- data/vendor/umappp/optimize_layout.hpp +285 -0
- data/vendor/umappp/spectral_init.hpp +181 -0
- data/vendor/umappp/umappp.hpp +13 -0
- metadata +465 -0
@@ -0,0 +1,1131 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008-2016 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
//
|
6
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
7
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
8
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
9
|
+
|
10
|
+
#ifndef EIGEN_UNARY_FUNCTORS_H
|
11
|
+
#define EIGEN_UNARY_FUNCTORS_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
/** \internal
|
18
|
+
* \brief Template functor to compute the opposite of a scalar
|
19
|
+
*
|
20
|
+
* \sa class CwiseUnaryOp, MatrixBase::operator-
|
21
|
+
*/
|
22
|
+
template<typename Scalar> struct scalar_opposite_op {
|
23
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_opposite_op)
|
24
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return -a; }
|
25
|
+
template<typename Packet>
|
26
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const
|
27
|
+
{ return internal::pnegate(a); }
|
28
|
+
};
|
29
|
+
template<typename Scalar>
|
30
|
+
struct functor_traits<scalar_opposite_op<Scalar> >
|
31
|
+
{ enum {
|
32
|
+
Cost = NumTraits<Scalar>::AddCost,
|
33
|
+
PacketAccess = packet_traits<Scalar>::HasNegate };
|
34
|
+
};
|
35
|
+
|
36
|
+
/** \internal
|
37
|
+
* \brief Template functor to compute the absolute value of a scalar
|
38
|
+
*
|
39
|
+
* \sa class CwiseUnaryOp, Cwise::abs
|
40
|
+
*/
|
41
|
+
template<typename Scalar> struct scalar_abs_op {
|
42
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_abs_op)
|
43
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
44
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a) const { return numext::abs(a); }
|
45
|
+
template<typename Packet>
|
46
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const
|
47
|
+
{ return internal::pabs(a); }
|
48
|
+
};
|
49
|
+
template<typename Scalar>
|
50
|
+
struct functor_traits<scalar_abs_op<Scalar> >
|
51
|
+
{
|
52
|
+
enum {
|
53
|
+
Cost = NumTraits<Scalar>::AddCost,
|
54
|
+
PacketAccess = packet_traits<Scalar>::HasAbs
|
55
|
+
};
|
56
|
+
};
|
57
|
+
|
58
|
+
/** \internal
|
59
|
+
* \brief Template functor to compute the score of a scalar, to chose a pivot
|
60
|
+
*
|
61
|
+
* \sa class CwiseUnaryOp
|
62
|
+
*/
|
63
|
+
template<typename Scalar> struct scalar_score_coeff_op : scalar_abs_op<Scalar>
|
64
|
+
{
|
65
|
+
typedef void Score_is_abs;
|
66
|
+
};
|
67
|
+
template<typename Scalar>
|
68
|
+
struct functor_traits<scalar_score_coeff_op<Scalar> > : functor_traits<scalar_abs_op<Scalar> > {};
|
69
|
+
|
70
|
+
/* Avoid recomputing abs when we know the score and they are the same. Not a true Eigen functor. */
|
71
|
+
template<typename Scalar, typename=void> struct abs_knowing_score
|
72
|
+
{
|
73
|
+
EIGEN_EMPTY_STRUCT_CTOR(abs_knowing_score)
|
74
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
75
|
+
template<typename Score>
|
76
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a, const Score&) const { return numext::abs(a); }
|
77
|
+
};
|
78
|
+
template<typename Scalar> struct abs_knowing_score<Scalar, typename scalar_score_coeff_op<Scalar>::Score_is_abs>
|
79
|
+
{
|
80
|
+
EIGEN_EMPTY_STRUCT_CTOR(abs_knowing_score)
|
81
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
82
|
+
template<typename Scal>
|
83
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scal&, const result_type& a) const { return a; }
|
84
|
+
};
|
85
|
+
|
86
|
+
/** \internal
|
87
|
+
* \brief Template functor to compute the squared absolute value of a scalar
|
88
|
+
*
|
89
|
+
* \sa class CwiseUnaryOp, Cwise::abs2
|
90
|
+
*/
|
91
|
+
template<typename Scalar> struct scalar_abs2_op {
|
92
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_abs2_op)
|
93
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
94
|
+
EIGEN_DEVICE_FUNC
|
95
|
+
EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a) const { return numext::abs2(a); }
|
96
|
+
template<typename Packet>
|
97
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const
|
98
|
+
{ return internal::pmul(a,a); }
|
99
|
+
};
|
100
|
+
template<typename Scalar>
|
101
|
+
struct functor_traits<scalar_abs2_op<Scalar> >
|
102
|
+
{ enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasAbs2 }; };
|
103
|
+
|
104
|
+
/** \internal
|
105
|
+
* \brief Template functor to compute the conjugate of a complex value
|
106
|
+
*
|
107
|
+
* \sa class CwiseUnaryOp, MatrixBase::conjugate()
|
108
|
+
*/
|
109
|
+
template<typename Scalar> struct scalar_conjugate_op {
|
110
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_conjugate_op)
|
111
|
+
EIGEN_DEVICE_FUNC
|
112
|
+
EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::conj(a); }
|
113
|
+
template<typename Packet>
|
114
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const { return internal::pconj(a); }
|
115
|
+
};
|
116
|
+
template<typename Scalar>
|
117
|
+
struct functor_traits<scalar_conjugate_op<Scalar> >
|
118
|
+
{
|
119
|
+
enum {
|
120
|
+
Cost = 0,
|
121
|
+
// Yes the cost is zero even for complexes because in most cases for which
|
122
|
+
// the cost is used, conjugation turns to be a no-op. Some examples:
|
123
|
+
// cost(a*conj(b)) == cost(a*b)
|
124
|
+
// cost(a+conj(b)) == cost(a+b)
|
125
|
+
// <etc.
|
126
|
+
// If we don't set it to zero, then:
|
127
|
+
// A.conjugate().lazyProduct(B.conjugate())
|
128
|
+
// will bake its operands. We definitely don't want that!
|
129
|
+
PacketAccess = packet_traits<Scalar>::HasConj
|
130
|
+
};
|
131
|
+
};
|
132
|
+
|
133
|
+
/** \internal
|
134
|
+
* \brief Template functor to compute the phase angle of a complex
|
135
|
+
*
|
136
|
+
* \sa class CwiseUnaryOp, Cwise::arg
|
137
|
+
*/
|
138
|
+
template<typename Scalar> struct scalar_arg_op {
|
139
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_arg_op)
|
140
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
141
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a) const { return numext::arg(a); }
|
142
|
+
template<typename Packet>
|
143
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const
|
144
|
+
{ return internal::parg(a); }
|
145
|
+
};
|
146
|
+
template<typename Scalar>
|
147
|
+
struct functor_traits<scalar_arg_op<Scalar> >
|
148
|
+
{
|
149
|
+
enum {
|
150
|
+
Cost = NumTraits<Scalar>::IsComplex ? 5 * NumTraits<Scalar>::MulCost : NumTraits<Scalar>::AddCost,
|
151
|
+
PacketAccess = packet_traits<Scalar>::HasArg
|
152
|
+
};
|
153
|
+
};
|
154
|
+
/** \internal
|
155
|
+
* \brief Template functor to cast a scalar to another type
|
156
|
+
*
|
157
|
+
* \sa class CwiseUnaryOp, MatrixBase::cast()
|
158
|
+
*/
|
159
|
+
template<typename Scalar, typename NewType>
|
160
|
+
struct scalar_cast_op {
|
161
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_cast_op)
|
162
|
+
typedef NewType result_type;
|
163
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const NewType operator() (const Scalar& a) const { return cast<Scalar, NewType>(a); }
|
164
|
+
};
|
165
|
+
template<typename Scalar, typename NewType>
|
166
|
+
struct functor_traits<scalar_cast_op<Scalar,NewType> >
|
167
|
+
{ enum { Cost = is_same<Scalar, NewType>::value ? 0 : NumTraits<NewType>::AddCost, PacketAccess = false }; };
|
168
|
+
|
169
|
+
/** \internal
|
170
|
+
* \brief Template functor to arithmetically shift a scalar right by a number of bits
|
171
|
+
*
|
172
|
+
* \sa class CwiseUnaryOp, MatrixBase::shift_right()
|
173
|
+
*/
|
174
|
+
template<typename Scalar, int N>
|
175
|
+
struct scalar_shift_right_op {
|
176
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_shift_right_op)
|
177
|
+
|
178
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const
|
179
|
+
{ return a >> N; }
|
180
|
+
template<typename Packet>
|
181
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const
|
182
|
+
{ return internal::parithmetic_shift_right<N>(a); }
|
183
|
+
};
|
184
|
+
template<typename Scalar, int N>
|
185
|
+
struct functor_traits<scalar_shift_right_op<Scalar,N> >
|
186
|
+
{ enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasShift }; };
|
187
|
+
|
188
|
+
/** \internal
|
189
|
+
* \brief Template functor to logically shift a scalar left by a number of bits
|
190
|
+
*
|
191
|
+
* \sa class CwiseUnaryOp, MatrixBase::shift_left()
|
192
|
+
*/
|
193
|
+
template<typename Scalar, int N>
|
194
|
+
struct scalar_shift_left_op {
|
195
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_shift_left_op)
|
196
|
+
|
197
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const
|
198
|
+
{ return a << N; }
|
199
|
+
template<typename Packet>
|
200
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const
|
201
|
+
{ return internal::plogical_shift_left<N>(a); }
|
202
|
+
};
|
203
|
+
template<typename Scalar, int N>
|
204
|
+
struct functor_traits<scalar_shift_left_op<Scalar,N> >
|
205
|
+
{ enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasShift }; };
|
206
|
+
|
207
|
+
/** \internal
|
208
|
+
* \brief Template functor to extract the real part of a complex
|
209
|
+
*
|
210
|
+
* \sa class CwiseUnaryOp, MatrixBase::real()
|
211
|
+
*/
|
212
|
+
template<typename Scalar>
|
213
|
+
struct scalar_real_op {
|
214
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_real_op)
|
215
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
216
|
+
EIGEN_DEVICE_FUNC
|
217
|
+
EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { return numext::real(a); }
|
218
|
+
};
|
219
|
+
template<typename Scalar>
|
220
|
+
struct functor_traits<scalar_real_op<Scalar> >
|
221
|
+
{ enum { Cost = 0, PacketAccess = false }; };
|
222
|
+
|
223
|
+
/** \internal
|
224
|
+
* \brief Template functor to extract the imaginary part of a complex
|
225
|
+
*
|
226
|
+
* \sa class CwiseUnaryOp, MatrixBase::imag()
|
227
|
+
*/
|
228
|
+
template<typename Scalar>
|
229
|
+
struct scalar_imag_op {
|
230
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_imag_op)
|
231
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
232
|
+
EIGEN_DEVICE_FUNC
|
233
|
+
EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { return numext::imag(a); }
|
234
|
+
};
|
235
|
+
template<typename Scalar>
|
236
|
+
struct functor_traits<scalar_imag_op<Scalar> >
|
237
|
+
{ enum { Cost = 0, PacketAccess = false }; };
|
238
|
+
|
239
|
+
/** \internal
|
240
|
+
* \brief Template functor to extract the real part of a complex as a reference
|
241
|
+
*
|
242
|
+
* \sa class CwiseUnaryOp, MatrixBase::real()
|
243
|
+
*/
|
244
|
+
template<typename Scalar>
|
245
|
+
struct scalar_real_ref_op {
|
246
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_real_ref_op)
|
247
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
248
|
+
EIGEN_DEVICE_FUNC
|
249
|
+
EIGEN_STRONG_INLINE result_type& operator() (const Scalar& a) const { return numext::real_ref(*const_cast<Scalar*>(&a)); }
|
250
|
+
};
|
251
|
+
template<typename Scalar>
|
252
|
+
struct functor_traits<scalar_real_ref_op<Scalar> >
|
253
|
+
{ enum { Cost = 0, PacketAccess = false }; };
|
254
|
+
|
255
|
+
/** \internal
|
256
|
+
* \brief Template functor to extract the imaginary part of a complex as a reference
|
257
|
+
*
|
258
|
+
* \sa class CwiseUnaryOp, MatrixBase::imag()
|
259
|
+
*/
|
260
|
+
template<typename Scalar>
|
261
|
+
struct scalar_imag_ref_op {
|
262
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_imag_ref_op)
|
263
|
+
typedef typename NumTraits<Scalar>::Real result_type;
|
264
|
+
EIGEN_DEVICE_FUNC
|
265
|
+
EIGEN_STRONG_INLINE result_type& operator() (const Scalar& a) const { return numext::imag_ref(*const_cast<Scalar*>(&a)); }
|
266
|
+
};
|
267
|
+
template<typename Scalar>
|
268
|
+
struct functor_traits<scalar_imag_ref_op<Scalar> >
|
269
|
+
{ enum { Cost = 0, PacketAccess = false }; };
|
270
|
+
|
271
|
+
/** \internal
|
272
|
+
*
|
273
|
+
* \brief Template functor to compute the exponential of a scalar
|
274
|
+
*
|
275
|
+
* \sa class CwiseUnaryOp, Cwise::exp()
|
276
|
+
*/
|
277
|
+
template<typename Scalar> struct scalar_exp_op {
|
278
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_exp_op)
|
279
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::exp(a); }
|
280
|
+
template <typename Packet>
|
281
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pexp(a); }
|
282
|
+
};
|
283
|
+
template <typename Scalar>
|
284
|
+
struct functor_traits<scalar_exp_op<Scalar> > {
|
285
|
+
enum {
|
286
|
+
PacketAccess = packet_traits<Scalar>::HasExp,
|
287
|
+
// The following numbers are based on the AVX implementation.
|
288
|
+
#ifdef EIGEN_VECTORIZE_FMA
|
289
|
+
// Haswell can issue 2 add/mul/madd per cycle.
|
290
|
+
Cost =
|
291
|
+
(sizeof(Scalar) == 4
|
292
|
+
// float: 8 pmadd, 4 pmul, 2 padd/psub, 6 other
|
293
|
+
? (8 * NumTraits<Scalar>::AddCost + 6 * NumTraits<Scalar>::MulCost)
|
294
|
+
// double: 7 pmadd, 5 pmul, 3 padd/psub, 1 div, 13 other
|
295
|
+
: (14 * NumTraits<Scalar>::AddCost +
|
296
|
+
6 * NumTraits<Scalar>::MulCost +
|
297
|
+
scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value))
|
298
|
+
#else
|
299
|
+
Cost =
|
300
|
+
(sizeof(Scalar) == 4
|
301
|
+
// float: 7 pmadd, 6 pmul, 4 padd/psub, 10 other
|
302
|
+
? (21 * NumTraits<Scalar>::AddCost + 13 * NumTraits<Scalar>::MulCost)
|
303
|
+
// double: 7 pmadd, 5 pmul, 3 padd/psub, 1 div, 13 other
|
304
|
+
: (23 * NumTraits<Scalar>::AddCost +
|
305
|
+
12 * NumTraits<Scalar>::MulCost +
|
306
|
+
scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value))
|
307
|
+
#endif
|
308
|
+
};
|
309
|
+
};
|
310
|
+
|
311
|
+
/** \internal
|
312
|
+
*
|
313
|
+
* \brief Template functor to compute the exponential of a scalar - 1.
|
314
|
+
*
|
315
|
+
* \sa class CwiseUnaryOp, ArrayBase::expm1()
|
316
|
+
*/
|
317
|
+
template<typename Scalar> struct scalar_expm1_op {
|
318
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_expm1_op)
|
319
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::expm1(a); }
|
320
|
+
template <typename Packet>
|
321
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pexpm1(a); }
|
322
|
+
};
|
323
|
+
template <typename Scalar>
|
324
|
+
struct functor_traits<scalar_expm1_op<Scalar> > {
|
325
|
+
enum {
|
326
|
+
PacketAccess = packet_traits<Scalar>::HasExpm1,
|
327
|
+
Cost = functor_traits<scalar_exp_op<Scalar> >::Cost // TODO measure cost of expm1
|
328
|
+
};
|
329
|
+
};
|
330
|
+
|
331
|
+
/** \internal
|
332
|
+
*
|
333
|
+
* \brief Template functor to compute the logarithm of a scalar
|
334
|
+
*
|
335
|
+
* \sa class CwiseUnaryOp, ArrayBase::log()
|
336
|
+
*/
|
337
|
+
template<typename Scalar> struct scalar_log_op {
|
338
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_log_op)
|
339
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::log(a); }
|
340
|
+
template <typename Packet>
|
341
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog(a); }
|
342
|
+
};
|
343
|
+
template <typename Scalar>
|
344
|
+
struct functor_traits<scalar_log_op<Scalar> > {
|
345
|
+
enum {
|
346
|
+
PacketAccess = packet_traits<Scalar>::HasLog,
|
347
|
+
Cost =
|
348
|
+
(PacketAccess
|
349
|
+
// The following numbers are based on the AVX implementation.
|
350
|
+
#ifdef EIGEN_VECTORIZE_FMA
|
351
|
+
// 8 pmadd, 6 pmul, 8 padd/psub, 16 other, can issue 2 add/mul/madd per cycle.
|
352
|
+
? (20 * NumTraits<Scalar>::AddCost + 7 * NumTraits<Scalar>::MulCost)
|
353
|
+
#else
|
354
|
+
// 8 pmadd, 6 pmul, 8 padd/psub, 20 other
|
355
|
+
? (36 * NumTraits<Scalar>::AddCost + 14 * NumTraits<Scalar>::MulCost)
|
356
|
+
#endif
|
357
|
+
// Measured cost of std::log.
|
358
|
+
: sizeof(Scalar)==4 ? 40 : 85)
|
359
|
+
};
|
360
|
+
};
|
361
|
+
|
362
|
+
/** \internal
|
363
|
+
*
|
364
|
+
* \brief Template functor to compute the logarithm of 1 plus a scalar value
|
365
|
+
*
|
366
|
+
* \sa class CwiseUnaryOp, ArrayBase::log1p()
|
367
|
+
*/
|
368
|
+
template<typename Scalar> struct scalar_log1p_op {
|
369
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_log1p_op)
|
370
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::log1p(a); }
|
371
|
+
template <typename Packet>
|
372
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog1p(a); }
|
373
|
+
};
|
374
|
+
template <typename Scalar>
|
375
|
+
struct functor_traits<scalar_log1p_op<Scalar> > {
|
376
|
+
enum {
|
377
|
+
PacketAccess = packet_traits<Scalar>::HasLog1p,
|
378
|
+
Cost = functor_traits<scalar_log_op<Scalar> >::Cost // TODO measure cost of log1p
|
379
|
+
};
|
380
|
+
};
|
381
|
+
|
382
|
+
/** \internal
|
383
|
+
*
|
384
|
+
* \brief Template functor to compute the base-10 logarithm of a scalar
|
385
|
+
*
|
386
|
+
* \sa class CwiseUnaryOp, Cwise::log10()
|
387
|
+
*/
|
388
|
+
template<typename Scalar> struct scalar_log10_op {
|
389
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_log10_op)
|
390
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { EIGEN_USING_STD(log10) return log10(a); }
|
391
|
+
template <typename Packet>
|
392
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog10(a); }
|
393
|
+
};
|
394
|
+
template<typename Scalar>
|
395
|
+
struct functor_traits<scalar_log10_op<Scalar> >
|
396
|
+
{ enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasLog10 }; };
|
397
|
+
|
398
|
+
/** \internal
|
399
|
+
*
|
400
|
+
* \brief Template functor to compute the base-2 logarithm of a scalar
|
401
|
+
*
|
402
|
+
* \sa class CwiseUnaryOp, Cwise::log2()
|
403
|
+
*/
|
404
|
+
template<typename Scalar> struct scalar_log2_op {
|
405
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_log2_op)
|
406
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return Scalar(EIGEN_LOG2E) * numext::log(a); }
|
407
|
+
template <typename Packet>
|
408
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog2(a); }
|
409
|
+
};
|
410
|
+
template<typename Scalar>
|
411
|
+
struct functor_traits<scalar_log2_op<Scalar> >
|
412
|
+
{ enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasLog }; };
|
413
|
+
|
414
|
+
/** \internal
|
415
|
+
* \brief Template functor to compute the square root of a scalar
|
416
|
+
* \sa class CwiseUnaryOp, Cwise::sqrt()
|
417
|
+
*/
|
418
|
+
template<typename Scalar> struct scalar_sqrt_op {
|
419
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sqrt_op)
|
420
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::sqrt(a); }
|
421
|
+
template <typename Packet>
|
422
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psqrt(a); }
|
423
|
+
};
|
424
|
+
template <typename Scalar>
|
425
|
+
struct functor_traits<scalar_sqrt_op<Scalar> > {
|
426
|
+
enum {
|
427
|
+
#if EIGEN_FAST_MATH
|
428
|
+
// The following numbers are based on the AVX implementation.
|
429
|
+
Cost = (sizeof(Scalar) == 8 ? 28
|
430
|
+
// 4 pmul, 1 pmadd, 3 other
|
431
|
+
: (3 * NumTraits<Scalar>::AddCost +
|
432
|
+
5 * NumTraits<Scalar>::MulCost)),
|
433
|
+
#else
|
434
|
+
// The following numbers are based on min VSQRT throughput on Haswell.
|
435
|
+
Cost = (sizeof(Scalar) == 8 ? 28 : 14),
|
436
|
+
#endif
|
437
|
+
PacketAccess = packet_traits<Scalar>::HasSqrt
|
438
|
+
};
|
439
|
+
};
|
440
|
+
|
441
|
+
// Boolean specialization to eliminate -Wimplicit-conversion-floating-point-to-bool warnings.
|
442
|
+
template<> struct scalar_sqrt_op<bool> {
|
443
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sqrt_op)
|
444
|
+
EIGEN_DEPRECATED EIGEN_DEVICE_FUNC inline bool operator() (const bool& a) const { return a; }
|
445
|
+
template <typename Packet>
|
446
|
+
EIGEN_DEPRECATED EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return a; }
|
447
|
+
};
|
448
|
+
template <>
|
449
|
+
struct functor_traits<scalar_sqrt_op<bool> > {
|
450
|
+
enum { Cost = 1, PacketAccess = packet_traits<bool>::Vectorizable };
|
451
|
+
};
|
452
|
+
|
453
|
+
/** \internal
|
454
|
+
* \brief Template functor to compute the reciprocal square root of a scalar
|
455
|
+
* \sa class CwiseUnaryOp, Cwise::rsqrt()
|
456
|
+
*/
|
457
|
+
template<typename Scalar> struct scalar_rsqrt_op {
|
458
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_rsqrt_op)
|
459
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::rsqrt(a); }
|
460
|
+
template <typename Packet>
|
461
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::prsqrt(a); }
|
462
|
+
};
|
463
|
+
|
464
|
+
template<typename Scalar>
|
465
|
+
struct functor_traits<scalar_rsqrt_op<Scalar> >
|
466
|
+
{ enum {
|
467
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
468
|
+
PacketAccess = packet_traits<Scalar>::HasRsqrt
|
469
|
+
};
|
470
|
+
};
|
471
|
+
|
472
|
+
/** \internal
|
473
|
+
* \brief Template functor to compute the cosine of a scalar
|
474
|
+
* \sa class CwiseUnaryOp, ArrayBase::cos()
|
475
|
+
*/
|
476
|
+
template<typename Scalar> struct scalar_cos_op {
|
477
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_cos_op)
|
478
|
+
EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return numext::cos(a); }
|
479
|
+
template <typename Packet>
|
480
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pcos(a); }
|
481
|
+
};
|
482
|
+
template<typename Scalar>
|
483
|
+
struct functor_traits<scalar_cos_op<Scalar> >
|
484
|
+
{
|
485
|
+
enum {
|
486
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
487
|
+
PacketAccess = packet_traits<Scalar>::HasCos
|
488
|
+
};
|
489
|
+
};
|
490
|
+
|
491
|
+
/** \internal
|
492
|
+
* \brief Template functor to compute the sine of a scalar
|
493
|
+
* \sa class CwiseUnaryOp, ArrayBase::sin()
|
494
|
+
*/
|
495
|
+
template<typename Scalar> struct scalar_sin_op {
|
496
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sin_op)
|
497
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::sin(a); }
|
498
|
+
template <typename Packet>
|
499
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psin(a); }
|
500
|
+
};
|
501
|
+
template<typename Scalar>
|
502
|
+
struct functor_traits<scalar_sin_op<Scalar> >
|
503
|
+
{
|
504
|
+
enum {
|
505
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
506
|
+
PacketAccess = packet_traits<Scalar>::HasSin
|
507
|
+
};
|
508
|
+
};
|
509
|
+
|
510
|
+
|
511
|
+
/** \internal
|
512
|
+
* \brief Template functor to compute the tan of a scalar
|
513
|
+
* \sa class CwiseUnaryOp, ArrayBase::tan()
|
514
|
+
*/
|
515
|
+
template<typename Scalar> struct scalar_tan_op {
|
516
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_tan_op)
|
517
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::tan(a); }
|
518
|
+
template <typename Packet>
|
519
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::ptan(a); }
|
520
|
+
};
|
521
|
+
template<typename Scalar>
|
522
|
+
struct functor_traits<scalar_tan_op<Scalar> >
|
523
|
+
{
|
524
|
+
enum {
|
525
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
526
|
+
PacketAccess = packet_traits<Scalar>::HasTan
|
527
|
+
};
|
528
|
+
};
|
529
|
+
|
530
|
+
/** \internal
|
531
|
+
* \brief Template functor to compute the arc cosine of a scalar
|
532
|
+
* \sa class CwiseUnaryOp, ArrayBase::acos()
|
533
|
+
*/
|
534
|
+
template<typename Scalar> struct scalar_acos_op {
|
535
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_acos_op)
|
536
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::acos(a); }
|
537
|
+
template <typename Packet>
|
538
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pacos(a); }
|
539
|
+
};
|
540
|
+
template<typename Scalar>
|
541
|
+
struct functor_traits<scalar_acos_op<Scalar> >
|
542
|
+
{
|
543
|
+
enum {
|
544
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
545
|
+
PacketAccess = packet_traits<Scalar>::HasACos
|
546
|
+
};
|
547
|
+
};
|
548
|
+
|
549
|
+
/** \internal
|
550
|
+
* \brief Template functor to compute the arc sine of a scalar
|
551
|
+
* \sa class CwiseUnaryOp, ArrayBase::asin()
|
552
|
+
*/
|
553
|
+
template<typename Scalar> struct scalar_asin_op {
|
554
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_asin_op)
|
555
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::asin(a); }
|
556
|
+
template <typename Packet>
|
557
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pasin(a); }
|
558
|
+
};
|
559
|
+
template<typename Scalar>
|
560
|
+
struct functor_traits<scalar_asin_op<Scalar> >
|
561
|
+
{
|
562
|
+
enum {
|
563
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
564
|
+
PacketAccess = packet_traits<Scalar>::HasASin
|
565
|
+
};
|
566
|
+
};
|
567
|
+
|
568
|
+
|
569
|
+
/** \internal
|
570
|
+
* \brief Template functor to compute the atan of a scalar
|
571
|
+
* \sa class CwiseUnaryOp, ArrayBase::atan()
|
572
|
+
*/
|
573
|
+
template<typename Scalar> struct scalar_atan_op {
|
574
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_atan_op)
|
575
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::atan(a); }
|
576
|
+
template <typename Packet>
|
577
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::patan(a); }
|
578
|
+
};
|
579
|
+
template<typename Scalar>
|
580
|
+
struct functor_traits<scalar_atan_op<Scalar> >
|
581
|
+
{
|
582
|
+
enum {
|
583
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
584
|
+
PacketAccess = packet_traits<Scalar>::HasATan
|
585
|
+
};
|
586
|
+
};
|
587
|
+
|
588
|
+
/** \internal
|
589
|
+
* \brief Template functor to compute the tanh of a scalar
|
590
|
+
* \sa class CwiseUnaryOp, ArrayBase::tanh()
|
591
|
+
*/
|
592
|
+
template <typename Scalar>
|
593
|
+
struct scalar_tanh_op {
|
594
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_tanh_op)
|
595
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator()(const Scalar& a) const { return numext::tanh(a); }
|
596
|
+
template <typename Packet>
|
597
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& x) const { return ptanh(x); }
|
598
|
+
};
|
599
|
+
|
600
|
+
template <typename Scalar>
|
601
|
+
struct functor_traits<scalar_tanh_op<Scalar> > {
|
602
|
+
enum {
|
603
|
+
PacketAccess = packet_traits<Scalar>::HasTanh,
|
604
|
+
Cost = ( (EIGEN_FAST_MATH && is_same<Scalar,float>::value)
|
605
|
+
// The following numbers are based on the AVX implementation,
|
606
|
+
#ifdef EIGEN_VECTORIZE_FMA
|
607
|
+
// Haswell can issue 2 add/mul/madd per cycle.
|
608
|
+
// 9 pmadd, 2 pmul, 1 div, 2 other
|
609
|
+
? (2 * NumTraits<Scalar>::AddCost +
|
610
|
+
6 * NumTraits<Scalar>::MulCost +
|
611
|
+
scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value)
|
612
|
+
#else
|
613
|
+
? (11 * NumTraits<Scalar>::AddCost +
|
614
|
+
11 * NumTraits<Scalar>::MulCost +
|
615
|
+
scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value)
|
616
|
+
#endif
|
617
|
+
// This number assumes a naive implementation of tanh
|
618
|
+
: (6 * NumTraits<Scalar>::AddCost +
|
619
|
+
3 * NumTraits<Scalar>::MulCost +
|
620
|
+
2 * scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value +
|
621
|
+
functor_traits<scalar_exp_op<Scalar> >::Cost))
|
622
|
+
};
|
623
|
+
};
|
624
|
+
|
625
|
+
#if EIGEN_HAS_CXX11_MATH
|
626
|
+
/** \internal
|
627
|
+
* \brief Template functor to compute the atanh of a scalar
|
628
|
+
* \sa class CwiseUnaryOp, ArrayBase::atanh()
|
629
|
+
*/
|
630
|
+
template <typename Scalar>
|
631
|
+
struct scalar_atanh_op {
|
632
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_atanh_op)
|
633
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator()(const Scalar& a) const { return numext::atanh(a); }
|
634
|
+
};
|
635
|
+
|
636
|
+
template <typename Scalar>
|
637
|
+
struct functor_traits<scalar_atanh_op<Scalar> > {
|
638
|
+
enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false };
|
639
|
+
};
|
640
|
+
#endif
|
641
|
+
|
642
|
+
/** \internal
|
643
|
+
* \brief Template functor to compute the sinh of a scalar
|
644
|
+
* \sa class CwiseUnaryOp, ArrayBase::sinh()
|
645
|
+
*/
|
646
|
+
template<typename Scalar> struct scalar_sinh_op {
|
647
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sinh_op)
|
648
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::sinh(a); }
|
649
|
+
template <typename Packet>
|
650
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psinh(a); }
|
651
|
+
};
|
652
|
+
template<typename Scalar>
|
653
|
+
struct functor_traits<scalar_sinh_op<Scalar> >
|
654
|
+
{
|
655
|
+
enum {
|
656
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
657
|
+
PacketAccess = packet_traits<Scalar>::HasSinh
|
658
|
+
};
|
659
|
+
};
|
660
|
+
|
661
|
+
#if EIGEN_HAS_CXX11_MATH
|
662
|
+
/** \internal
|
663
|
+
* \brief Template functor to compute the asinh of a scalar
|
664
|
+
* \sa class CwiseUnaryOp, ArrayBase::asinh()
|
665
|
+
*/
|
666
|
+
template <typename Scalar>
|
667
|
+
struct scalar_asinh_op {
|
668
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_asinh_op)
|
669
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator()(const Scalar& a) const { return numext::asinh(a); }
|
670
|
+
};
|
671
|
+
|
672
|
+
template <typename Scalar>
|
673
|
+
struct functor_traits<scalar_asinh_op<Scalar> > {
|
674
|
+
enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false };
|
675
|
+
};
|
676
|
+
#endif
|
677
|
+
|
678
|
+
/** \internal
|
679
|
+
* \brief Template functor to compute the cosh of a scalar
|
680
|
+
* \sa class CwiseUnaryOp, ArrayBase::cosh()
|
681
|
+
*/
|
682
|
+
template<typename Scalar> struct scalar_cosh_op {
|
683
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_cosh_op)
|
684
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::cosh(a); }
|
685
|
+
template <typename Packet>
|
686
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pcosh(a); }
|
687
|
+
};
|
688
|
+
template<typename Scalar>
|
689
|
+
struct functor_traits<scalar_cosh_op<Scalar> >
|
690
|
+
{
|
691
|
+
enum {
|
692
|
+
Cost = 5 * NumTraits<Scalar>::MulCost,
|
693
|
+
PacketAccess = packet_traits<Scalar>::HasCosh
|
694
|
+
};
|
695
|
+
};
|
696
|
+
|
697
|
+
#if EIGEN_HAS_CXX11_MATH
|
698
|
+
/** \internal
|
699
|
+
* \brief Template functor to compute the acosh of a scalar
|
700
|
+
* \sa class CwiseUnaryOp, ArrayBase::acosh()
|
701
|
+
*/
|
702
|
+
template <typename Scalar>
|
703
|
+
struct scalar_acosh_op {
|
704
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_acosh_op)
|
705
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator()(const Scalar& a) const { return numext::acosh(a); }
|
706
|
+
};
|
707
|
+
|
708
|
+
template <typename Scalar>
|
709
|
+
struct functor_traits<scalar_acosh_op<Scalar> > {
|
710
|
+
enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false };
|
711
|
+
};
|
712
|
+
#endif
|
713
|
+
|
714
|
+
/** \internal
|
715
|
+
* \brief Template functor to compute the inverse of a scalar
|
716
|
+
* \sa class CwiseUnaryOp, Cwise::inverse()
|
717
|
+
*/
|
718
|
+
template<typename Scalar>
|
719
|
+
struct scalar_inverse_op {
|
720
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_inverse_op)
|
721
|
+
EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return Scalar(1)/a; }
|
722
|
+
template<typename Packet>
|
723
|
+
EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const
|
724
|
+
{ return internal::pdiv(pset1<Packet>(Scalar(1)),a); }
|
725
|
+
};
|
726
|
+
template <typename Scalar>
|
727
|
+
struct functor_traits<scalar_inverse_op<Scalar> > {
|
728
|
+
enum {
|
729
|
+
PacketAccess = packet_traits<Scalar>::HasDiv,
|
730
|
+
Cost = scalar_div_cost<Scalar, PacketAccess>::value
|
731
|
+
};
|
732
|
+
};
|
733
|
+
|
734
|
+
/** \internal
|
735
|
+
* \brief Template functor to compute the square of a scalar
|
736
|
+
* \sa class CwiseUnaryOp, Cwise::square()
|
737
|
+
*/
|
738
|
+
template<typename Scalar>
|
739
|
+
struct scalar_square_op {
|
740
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_square_op)
|
741
|
+
EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return a*a; }
|
742
|
+
template<typename Packet>
|
743
|
+
EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const
|
744
|
+
{ return internal::pmul(a,a); }
|
745
|
+
};
|
746
|
+
template<typename Scalar>
|
747
|
+
struct functor_traits<scalar_square_op<Scalar> >
|
748
|
+
{ enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; };
|
749
|
+
|
750
|
+
// Boolean specialization to avoid -Wint-in-bool-context warnings on GCC.
|
751
|
+
template<>
|
752
|
+
struct scalar_square_op<bool> {
|
753
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_square_op)
|
754
|
+
EIGEN_DEPRECATED EIGEN_DEVICE_FUNC inline bool operator() (const bool& a) const { return a; }
|
755
|
+
template<typename Packet>
|
756
|
+
EIGEN_DEPRECATED EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const
|
757
|
+
{ return a; }
|
758
|
+
};
|
759
|
+
template<>
|
760
|
+
struct functor_traits<scalar_square_op<bool> >
|
761
|
+
{ enum { Cost = 0, PacketAccess = packet_traits<bool>::Vectorizable }; };
|
762
|
+
|
763
|
+
/** \internal
|
764
|
+
* \brief Template functor to compute the cube of a scalar
|
765
|
+
* \sa class CwiseUnaryOp, Cwise::cube()
|
766
|
+
*/
|
767
|
+
template<typename Scalar>
|
768
|
+
struct scalar_cube_op {
|
769
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_cube_op)
|
770
|
+
EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return a*a*a; }
|
771
|
+
template<typename Packet>
|
772
|
+
EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const
|
773
|
+
{ return internal::pmul(a,pmul(a,a)); }
|
774
|
+
};
|
775
|
+
template<typename Scalar>
|
776
|
+
struct functor_traits<scalar_cube_op<Scalar> >
|
777
|
+
{ enum { Cost = 2*NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; };
|
778
|
+
|
779
|
+
// Boolean specialization to avoid -Wint-in-bool-context warnings on GCC.
|
780
|
+
template<>
|
781
|
+
struct scalar_cube_op<bool> {
|
782
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_cube_op)
|
783
|
+
EIGEN_DEPRECATED EIGEN_DEVICE_FUNC inline bool operator() (const bool& a) const { return a; }
|
784
|
+
template<typename Packet>
|
785
|
+
EIGEN_DEPRECATED EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const
|
786
|
+
{ return a; }
|
787
|
+
};
|
788
|
+
template<>
|
789
|
+
struct functor_traits<scalar_cube_op<bool> >
|
790
|
+
{ enum { Cost = 0, PacketAccess = packet_traits<bool>::Vectorizable }; };
|
791
|
+
|
792
|
+
/** \internal
|
793
|
+
* \brief Template functor to compute the rounded value of a scalar
|
794
|
+
* \sa class CwiseUnaryOp, ArrayBase::round()
|
795
|
+
*/
|
796
|
+
template<typename Scalar> struct scalar_round_op {
|
797
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_round_op)
|
798
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::round(a); }
|
799
|
+
template <typename Packet>
|
800
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pround(a); }
|
801
|
+
};
|
802
|
+
template<typename Scalar>
|
803
|
+
struct functor_traits<scalar_round_op<Scalar> >
|
804
|
+
{
|
805
|
+
enum {
|
806
|
+
Cost = NumTraits<Scalar>::MulCost,
|
807
|
+
PacketAccess = packet_traits<Scalar>::HasRound
|
808
|
+
};
|
809
|
+
};
|
810
|
+
|
811
|
+
/** \internal
|
812
|
+
* \brief Template functor to compute the floor of a scalar
|
813
|
+
* \sa class CwiseUnaryOp, ArrayBase::floor()
|
814
|
+
*/
|
815
|
+
template<typename Scalar> struct scalar_floor_op {
|
816
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_floor_op)
|
817
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::floor(a); }
|
818
|
+
template <typename Packet>
|
819
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pfloor(a); }
|
820
|
+
};
|
821
|
+
template<typename Scalar>
|
822
|
+
struct functor_traits<scalar_floor_op<Scalar> >
|
823
|
+
{
|
824
|
+
enum {
|
825
|
+
Cost = NumTraits<Scalar>::MulCost,
|
826
|
+
PacketAccess = packet_traits<Scalar>::HasFloor
|
827
|
+
};
|
828
|
+
};
|
829
|
+
|
830
|
+
/** \internal
|
831
|
+
* \brief Template functor to compute the rounded (with current rounding mode) value of a scalar
|
832
|
+
* \sa class CwiseUnaryOp, ArrayBase::rint()
|
833
|
+
*/
|
834
|
+
template<typename Scalar> struct scalar_rint_op {
|
835
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_rint_op)
|
836
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::rint(a); }
|
837
|
+
template <typename Packet>
|
838
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::print(a); }
|
839
|
+
};
|
840
|
+
template<typename Scalar>
|
841
|
+
struct functor_traits<scalar_rint_op<Scalar> >
|
842
|
+
{
|
843
|
+
enum {
|
844
|
+
Cost = NumTraits<Scalar>::MulCost,
|
845
|
+
PacketAccess = packet_traits<Scalar>::HasRint
|
846
|
+
};
|
847
|
+
};
|
848
|
+
|
849
|
+
/** \internal
|
850
|
+
* \brief Template functor to compute the ceil of a scalar
|
851
|
+
* \sa class CwiseUnaryOp, ArrayBase::ceil()
|
852
|
+
*/
|
853
|
+
template<typename Scalar> struct scalar_ceil_op {
|
854
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_ceil_op)
|
855
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::ceil(a); }
|
856
|
+
template <typename Packet>
|
857
|
+
EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pceil(a); }
|
858
|
+
};
|
859
|
+
template<typename Scalar>
|
860
|
+
struct functor_traits<scalar_ceil_op<Scalar> >
|
861
|
+
{
|
862
|
+
enum {
|
863
|
+
Cost = NumTraits<Scalar>::MulCost,
|
864
|
+
PacketAccess = packet_traits<Scalar>::HasCeil
|
865
|
+
};
|
866
|
+
};
|
867
|
+
|
868
|
+
/** \internal
|
869
|
+
* \brief Template functor to compute whether a scalar is NaN
|
870
|
+
* \sa class CwiseUnaryOp, ArrayBase::isnan()
|
871
|
+
*/
|
872
|
+
template<typename Scalar> struct scalar_isnan_op {
|
873
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_isnan_op)
|
874
|
+
typedef bool result_type;
|
875
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const {
|
876
|
+
#if defined(SYCL_DEVICE_ONLY)
|
877
|
+
return numext::isnan(a);
|
878
|
+
#else
|
879
|
+
return (numext::isnan)(a);
|
880
|
+
#endif
|
881
|
+
}
|
882
|
+
};
|
883
|
+
template<typename Scalar>
|
884
|
+
struct functor_traits<scalar_isnan_op<Scalar> >
|
885
|
+
{
|
886
|
+
enum {
|
887
|
+
Cost = NumTraits<Scalar>::MulCost,
|
888
|
+
PacketAccess = false
|
889
|
+
};
|
890
|
+
};
|
891
|
+
|
892
|
+
/** \internal
|
893
|
+
* \brief Template functor to check whether a scalar is +/-inf
|
894
|
+
* \sa class CwiseUnaryOp, ArrayBase::isinf()
|
895
|
+
*/
|
896
|
+
template<typename Scalar> struct scalar_isinf_op {
|
897
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_isinf_op)
|
898
|
+
typedef bool result_type;
|
899
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const {
|
900
|
+
#if defined(SYCL_DEVICE_ONLY)
|
901
|
+
return numext::isinf(a);
|
902
|
+
#else
|
903
|
+
return (numext::isinf)(a);
|
904
|
+
#endif
|
905
|
+
}
|
906
|
+
};
|
907
|
+
template<typename Scalar>
|
908
|
+
struct functor_traits<scalar_isinf_op<Scalar> >
|
909
|
+
{
|
910
|
+
enum {
|
911
|
+
Cost = NumTraits<Scalar>::MulCost,
|
912
|
+
PacketAccess = false
|
913
|
+
};
|
914
|
+
};
|
915
|
+
|
916
|
+
/** \internal
|
917
|
+
* \brief Template functor to check whether a scalar has a finite value
|
918
|
+
* \sa class CwiseUnaryOp, ArrayBase::isfinite()
|
919
|
+
*/
|
920
|
+
template<typename Scalar> struct scalar_isfinite_op {
|
921
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_isfinite_op)
|
922
|
+
typedef bool result_type;
|
923
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const {
|
924
|
+
#if defined(SYCL_DEVICE_ONLY)
|
925
|
+
return numext::isfinite(a);
|
926
|
+
#else
|
927
|
+
return (numext::isfinite)(a);
|
928
|
+
#endif
|
929
|
+
}
|
930
|
+
};
|
931
|
+
template<typename Scalar>
|
932
|
+
struct functor_traits<scalar_isfinite_op<Scalar> >
|
933
|
+
{
|
934
|
+
enum {
|
935
|
+
Cost = NumTraits<Scalar>::MulCost,
|
936
|
+
PacketAccess = false
|
937
|
+
};
|
938
|
+
};
|
939
|
+
|
940
|
+
/** \internal
|
941
|
+
* \brief Template functor to compute the logical not of a boolean
|
942
|
+
*
|
943
|
+
* \sa class CwiseUnaryOp, ArrayBase::operator!
|
944
|
+
*/
|
945
|
+
template<typename Scalar> struct scalar_boolean_not_op {
|
946
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_boolean_not_op)
|
947
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator() (const bool& a) const { return !a; }
|
948
|
+
};
|
949
|
+
template<typename Scalar>
|
950
|
+
struct functor_traits<scalar_boolean_not_op<Scalar> > {
|
951
|
+
enum {
|
952
|
+
Cost = NumTraits<bool>::AddCost,
|
953
|
+
PacketAccess = false
|
954
|
+
};
|
955
|
+
};
|
956
|
+
|
957
|
+
/** \internal
|
958
|
+
* \brief Template functor to compute the signum of a scalar
|
959
|
+
* \sa class CwiseUnaryOp, Cwise::sign()
|
960
|
+
*/
|
961
|
+
template<typename Scalar,bool is_complex=(NumTraits<Scalar>::IsComplex!=0), bool is_integer=(NumTraits<Scalar>::IsInteger!=0) > struct scalar_sign_op;
|
962
|
+
template<typename Scalar>
|
963
|
+
struct scalar_sign_op<Scalar, false, true> {
|
964
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sign_op)
|
965
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const
|
966
|
+
{
|
967
|
+
return Scalar( (a>Scalar(0)) - (a<Scalar(0)) );
|
968
|
+
}
|
969
|
+
//TODO
|
970
|
+
//template <typename Packet>
|
971
|
+
//EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psign(a); }
|
972
|
+
};
|
973
|
+
|
974
|
+
template<typename Scalar>
|
975
|
+
struct scalar_sign_op<Scalar, false, false> {
|
976
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sign_op)
|
977
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const
|
978
|
+
{
|
979
|
+
return (numext::isnan)(a) ? a : Scalar( (a>Scalar(0)) - (a<Scalar(0)) );
|
980
|
+
}
|
981
|
+
//TODO
|
982
|
+
//template <typename Packet>
|
983
|
+
//EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psign(a); }
|
984
|
+
};
|
985
|
+
|
986
|
+
template<typename Scalar, bool is_integer>
|
987
|
+
struct scalar_sign_op<Scalar,true, is_integer> {
|
988
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_sign_op)
|
989
|
+
EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const
|
990
|
+
{
|
991
|
+
typedef typename NumTraits<Scalar>::Real real_type;
|
992
|
+
real_type aa = numext::abs(a);
|
993
|
+
if (aa==real_type(0))
|
994
|
+
return Scalar(0);
|
995
|
+
aa = real_type(1)/aa;
|
996
|
+
return Scalar(a.real()*aa, a.imag()*aa );
|
997
|
+
}
|
998
|
+
//TODO
|
999
|
+
//template <typename Packet>
|
1000
|
+
//EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psign(a); }
|
1001
|
+
};
|
1002
|
+
template<typename Scalar>
|
1003
|
+
struct functor_traits<scalar_sign_op<Scalar> >
|
1004
|
+
{ enum {
|
1005
|
+
Cost =
|
1006
|
+
NumTraits<Scalar>::IsComplex
|
1007
|
+
? ( 8*NumTraits<Scalar>::MulCost ) // roughly
|
1008
|
+
: ( 3*NumTraits<Scalar>::AddCost),
|
1009
|
+
PacketAccess = packet_traits<Scalar>::HasSign
|
1010
|
+
};
|
1011
|
+
};
|
1012
|
+
|
1013
|
+
/** \internal
|
1014
|
+
* \brief Template functor to compute the logistic function of a scalar
|
1015
|
+
* \sa class CwiseUnaryOp, ArrayBase::logistic()
|
1016
|
+
*/
|
1017
|
+
template <typename T>
|
1018
|
+
struct scalar_logistic_op {
|
1019
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_logistic_op)
|
1020
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T operator()(const T& x) const {
|
1021
|
+
return packetOp(x);
|
1022
|
+
}
|
1023
|
+
|
1024
|
+
template <typename Packet> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
|
1025
|
+
Packet packetOp(const Packet& x) const {
|
1026
|
+
const Packet one = pset1<Packet>(T(1));
|
1027
|
+
return pdiv(one, padd(one, pexp(pnegate(x))));
|
1028
|
+
}
|
1029
|
+
};
|
1030
|
+
|
1031
|
+
#ifndef EIGEN_GPU_COMPILE_PHASE
|
1032
|
+
/** \internal
|
1033
|
+
* \brief Template specialization of the logistic function for float.
|
1034
|
+
*
|
1035
|
+
* Uses just a 9/10-degree rational interpolant which
|
1036
|
+
* interpolates 1/(1+exp(-x)) - 0.5 up to a couple of ulps in the range
|
1037
|
+
* [-9, 18]. Below -9 we use the more accurate approximation
|
1038
|
+
* 1/(1+exp(-x)) ~= exp(x), and above 18 the logistic function is 1 withing
|
1039
|
+
* one ulp. The shifted logistic is interpolated because it was easier to
|
1040
|
+
* make the fit converge.
|
1041
|
+
*
|
1042
|
+
*/
|
1043
|
+
template <>
|
1044
|
+
struct scalar_logistic_op<float> {
|
1045
|
+
EIGEN_EMPTY_STRUCT_CTOR(scalar_logistic_op)
|
1046
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float operator()(const float& x) const {
|
1047
|
+
return packetOp(x);
|
1048
|
+
}
|
1049
|
+
|
1050
|
+
template <typename Packet> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
|
1051
|
+
Packet packetOp(const Packet& _x) const {
|
1052
|
+
const Packet cutoff_lower = pset1<Packet>(-9.f);
|
1053
|
+
const Packet lt_mask = pcmp_lt<Packet>(_x, cutoff_lower);
|
1054
|
+
const bool any_small = predux_any(lt_mask);
|
1055
|
+
|
1056
|
+
// The upper cut-off is the smallest x for which the rational approximation evaluates to 1.
|
1057
|
+
// Choosing this value saves us a few instructions clamping the results at the end.
|
1058
|
+
#ifdef EIGEN_VECTORIZE_FMA
|
1059
|
+
const Packet cutoff_upper = pset1<Packet>(15.7243833541870117f);
|
1060
|
+
#else
|
1061
|
+
const Packet cutoff_upper = pset1<Packet>(15.6437711715698242f);
|
1062
|
+
#endif
|
1063
|
+
const Packet x = pmin(_x, cutoff_upper);
|
1064
|
+
|
1065
|
+
// The monomial coefficients of the numerator polynomial (odd).
|
1066
|
+
const Packet alpha_1 = pset1<Packet>(2.48287947061529e-01f);
|
1067
|
+
const Packet alpha_3 = pset1<Packet>(8.51377133304701e-03f);
|
1068
|
+
const Packet alpha_5 = pset1<Packet>(6.08574864600143e-05f);
|
1069
|
+
const Packet alpha_7 = pset1<Packet>(1.15627324459942e-07f);
|
1070
|
+
const Packet alpha_9 = pset1<Packet>(4.37031012579801e-11f);
|
1071
|
+
|
1072
|
+
// The monomial coefficients of the denominator polynomial (even).
|
1073
|
+
const Packet beta_0 = pset1<Packet>(9.93151921023180e-01f);
|
1074
|
+
const Packet beta_2 = pset1<Packet>(1.16817656904453e-01f);
|
1075
|
+
const Packet beta_4 = pset1<Packet>(1.70198817374094e-03f);
|
1076
|
+
const Packet beta_6 = pset1<Packet>(6.29106785017040e-06f);
|
1077
|
+
const Packet beta_8 = pset1<Packet>(5.76102136993427e-09f);
|
1078
|
+
const Packet beta_10 = pset1<Packet>(6.10247389755681e-13f);
|
1079
|
+
|
1080
|
+
// Since the polynomials are odd/even, we need x^2.
|
1081
|
+
const Packet x2 = pmul(x, x);
|
1082
|
+
|
1083
|
+
// Evaluate the numerator polynomial p.
|
1084
|
+
Packet p = pmadd(x2, alpha_9, alpha_7);
|
1085
|
+
p = pmadd(x2, p, alpha_5);
|
1086
|
+
p = pmadd(x2, p, alpha_3);
|
1087
|
+
p = pmadd(x2, p, alpha_1);
|
1088
|
+
p = pmul(x, p);
|
1089
|
+
|
1090
|
+
// Evaluate the denominator polynomial q.
|
1091
|
+
Packet q = pmadd(x2, beta_10, beta_8);
|
1092
|
+
q = pmadd(x2, q, beta_6);
|
1093
|
+
q = pmadd(x2, q, beta_4);
|
1094
|
+
q = pmadd(x2, q, beta_2);
|
1095
|
+
q = pmadd(x2, q, beta_0);
|
1096
|
+
// Divide the numerator by the denominator and shift it up.
|
1097
|
+
const Packet logistic = padd(pdiv(p, q), pset1<Packet>(0.5f));
|
1098
|
+
if (EIGEN_PREDICT_FALSE(any_small)) {
|
1099
|
+
const Packet exponential = pexp(_x);
|
1100
|
+
return pselect(lt_mask, exponential, logistic);
|
1101
|
+
} else {
|
1102
|
+
return logistic;
|
1103
|
+
}
|
1104
|
+
}
|
1105
|
+
};
|
1106
|
+
#endif // #ifndef EIGEN_GPU_COMPILE_PHASE
|
1107
|
+
|
1108
|
+
template <typename T>
|
1109
|
+
struct functor_traits<scalar_logistic_op<T> > {
|
1110
|
+
enum {
|
1111
|
+
// The cost estimate for float here here is for the common(?) case where
|
1112
|
+
// all arguments are greater than -9.
|
1113
|
+
Cost = scalar_div_cost<T, packet_traits<T>::HasDiv>::value +
|
1114
|
+
(internal::is_same<T, float>::value
|
1115
|
+
? NumTraits<T>::AddCost * 15 + NumTraits<T>::MulCost * 11
|
1116
|
+
: NumTraits<T>::AddCost * 2 +
|
1117
|
+
functor_traits<scalar_exp_op<T> >::Cost),
|
1118
|
+
PacketAccess =
|
1119
|
+
packet_traits<T>::HasAdd && packet_traits<T>::HasDiv &&
|
1120
|
+
(internal::is_same<T, float>::value
|
1121
|
+
? packet_traits<T>::HasMul && packet_traits<T>::HasMax &&
|
1122
|
+
packet_traits<T>::HasMin
|
1123
|
+
: packet_traits<T>::HasNegate && packet_traits<T>::HasExp)
|
1124
|
+
};
|
1125
|
+
};
|
1126
|
+
|
1127
|
+
} // end namespace internal
|
1128
|
+
|
1129
|
+
} // end namespace Eigen
|
1130
|
+
|
1131
|
+
#endif // EIGEN_FUNCTORS_H
|