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,317 @@
|
|
1
|
+
/*
|
2
|
+
Copyright (c) 2011, Intel Corporation. All rights reserved.
|
3
|
+
|
4
|
+
Redistribution and use in source and binary forms, with or without modification,
|
5
|
+
are permitted provided that the following conditions are met:
|
6
|
+
|
7
|
+
* Redistributions of source code must retain the above copyright notice, this
|
8
|
+
list of conditions and the following disclaimer.
|
9
|
+
* Redistributions in binary form must reproduce the above copyright notice,
|
10
|
+
this list of conditions and the following disclaimer in the documentation
|
11
|
+
and/or other materials provided with the distribution.
|
12
|
+
* Neither the name of Intel Corporation nor the names of its contributors may
|
13
|
+
be used to endorse or promote products derived from this software without
|
14
|
+
specific prior written permission.
|
15
|
+
|
16
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
17
|
+
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
18
|
+
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
19
|
+
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
20
|
+
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
21
|
+
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
22
|
+
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
23
|
+
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
24
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
25
|
+
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
26
|
+
|
27
|
+
********************************************************************************
|
28
|
+
* Content : Eigen bindings to BLAS F77
|
29
|
+
* Triangular matrix * matrix product functionality based on ?TRMM.
|
30
|
+
********************************************************************************
|
31
|
+
*/
|
32
|
+
|
33
|
+
#ifndef EIGEN_TRIANGULAR_MATRIX_MATRIX_BLAS_H
|
34
|
+
#define EIGEN_TRIANGULAR_MATRIX_MATRIX_BLAS_H
|
35
|
+
|
36
|
+
namespace Eigen {
|
37
|
+
|
38
|
+
namespace internal {
|
39
|
+
|
40
|
+
|
41
|
+
template <typename Scalar, typename Index,
|
42
|
+
int Mode, bool LhsIsTriangular,
|
43
|
+
int LhsStorageOrder, bool ConjugateLhs,
|
44
|
+
int RhsStorageOrder, bool ConjugateRhs,
|
45
|
+
int ResStorageOrder>
|
46
|
+
struct product_triangular_matrix_matrix_trmm :
|
47
|
+
product_triangular_matrix_matrix<Scalar,Index,Mode,
|
48
|
+
LhsIsTriangular,LhsStorageOrder,ConjugateLhs,
|
49
|
+
RhsStorageOrder, ConjugateRhs, ResStorageOrder, 1, BuiltIn> {};
|
50
|
+
|
51
|
+
|
52
|
+
// try to go to BLAS specialization
|
53
|
+
#define EIGEN_BLAS_TRMM_SPECIALIZE(Scalar, LhsIsTriangular) \
|
54
|
+
template <typename Index, int Mode, \
|
55
|
+
int LhsStorageOrder, bool ConjugateLhs, \
|
56
|
+
int RhsStorageOrder, bool ConjugateRhs> \
|
57
|
+
struct product_triangular_matrix_matrix<Scalar,Index, Mode, LhsIsTriangular, \
|
58
|
+
LhsStorageOrder,ConjugateLhs, RhsStorageOrder,ConjugateRhs,ColMajor,1,Specialized> { \
|
59
|
+
static inline void run(Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride,\
|
60
|
+
const Scalar* _rhs, Index rhsStride, Scalar* res, Index resIncr, Index resStride, Scalar alpha, level3_blocking<Scalar,Scalar>& blocking) { \
|
61
|
+
EIGEN_ONLY_USED_FOR_DEBUG(resIncr); \
|
62
|
+
eigen_assert(resIncr == 1); \
|
63
|
+
product_triangular_matrix_matrix_trmm<Scalar,Index,Mode, \
|
64
|
+
LhsIsTriangular,LhsStorageOrder,ConjugateLhs, \
|
65
|
+
RhsStorageOrder, ConjugateRhs, ColMajor>::run( \
|
66
|
+
_rows, _cols, _depth, _lhs, lhsStride, _rhs, rhsStride, res, resStride, alpha, blocking); \
|
67
|
+
} \
|
68
|
+
};
|
69
|
+
|
70
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(double, true)
|
71
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(double, false)
|
72
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(dcomplex, true)
|
73
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(dcomplex, false)
|
74
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(float, true)
|
75
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(float, false)
|
76
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(scomplex, true)
|
77
|
+
EIGEN_BLAS_TRMM_SPECIALIZE(scomplex, false)
|
78
|
+
|
79
|
+
// implements col-major += alpha * op(triangular) * op(general)
|
80
|
+
#define EIGEN_BLAS_TRMM_L(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \
|
81
|
+
template <typename Index, int Mode, \
|
82
|
+
int LhsStorageOrder, bool ConjugateLhs, \
|
83
|
+
int RhsStorageOrder, bool ConjugateRhs> \
|
84
|
+
struct product_triangular_matrix_matrix_trmm<EIGTYPE,Index,Mode,true, \
|
85
|
+
LhsStorageOrder,ConjugateLhs,RhsStorageOrder,ConjugateRhs,ColMajor> \
|
86
|
+
{ \
|
87
|
+
enum { \
|
88
|
+
IsLower = (Mode&Lower) == Lower, \
|
89
|
+
SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1, \
|
90
|
+
IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \
|
91
|
+
IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \
|
92
|
+
LowUp = IsLower ? Lower : Upper, \
|
93
|
+
conjA = ((LhsStorageOrder==ColMajor) && ConjugateLhs) ? 1 : 0 \
|
94
|
+
}; \
|
95
|
+
\
|
96
|
+
static void run( \
|
97
|
+
Index _rows, Index _cols, Index _depth, \
|
98
|
+
const EIGTYPE* _lhs, Index lhsStride, \
|
99
|
+
const EIGTYPE* _rhs, Index rhsStride, \
|
100
|
+
EIGTYPE* res, Index resStride, \
|
101
|
+
EIGTYPE alpha, level3_blocking<EIGTYPE,EIGTYPE>& blocking) \
|
102
|
+
{ \
|
103
|
+
Index diagSize = (std::min)(_rows,_depth); \
|
104
|
+
Index rows = IsLower ? _rows : diagSize; \
|
105
|
+
Index depth = IsLower ? diagSize : _depth; \
|
106
|
+
Index cols = _cols; \
|
107
|
+
\
|
108
|
+
typedef Matrix<EIGTYPE, Dynamic, Dynamic, LhsStorageOrder> MatrixLhs; \
|
109
|
+
typedef Matrix<EIGTYPE, Dynamic, Dynamic, RhsStorageOrder> MatrixRhs; \
|
110
|
+
\
|
111
|
+
/* Non-square case - doesn't fit to BLAS ?TRMM. Fall to default triangular product or call BLAS ?GEMM*/ \
|
112
|
+
if (rows != depth) { \
|
113
|
+
\
|
114
|
+
/* FIXME handle mkl_domain_get_max_threads */ \
|
115
|
+
/*int nthr = mkl_domain_get_max_threads(EIGEN_BLAS_DOMAIN_BLAS);*/ int nthr = 1;\
|
116
|
+
\
|
117
|
+
if (((nthr==1) && (((std::max)(rows,depth)-diagSize)/(double)diagSize < 0.5))) { \
|
118
|
+
/* Most likely no benefit to call TRMM or GEMM from BLAS */ \
|
119
|
+
product_triangular_matrix_matrix<EIGTYPE,Index,Mode,true, \
|
120
|
+
LhsStorageOrder,ConjugateLhs, RhsStorageOrder, ConjugateRhs, ColMajor, 1, BuiltIn>::run( \
|
121
|
+
_rows, _cols, _depth, _lhs, lhsStride, _rhs, rhsStride, res, 1, resStride, alpha, blocking); \
|
122
|
+
/*std::cout << "TRMM_L: A is not square! Go to Eigen TRMM implementation!\n";*/ \
|
123
|
+
} else { \
|
124
|
+
/* Make sense to call GEMM */ \
|
125
|
+
Map<const MatrixLhs, 0, OuterStride<> > lhsMap(_lhs,rows,depth,OuterStride<>(lhsStride)); \
|
126
|
+
MatrixLhs aa_tmp=lhsMap.template triangularView<Mode>(); \
|
127
|
+
BlasIndex aStride = convert_index<BlasIndex>(aa_tmp.outerStride()); \
|
128
|
+
gemm_blocking_space<ColMajor,EIGTYPE,EIGTYPE,Dynamic,Dynamic,Dynamic> gemm_blocking(_rows,_cols,_depth, 1, true); \
|
129
|
+
general_matrix_matrix_product<Index,EIGTYPE,LhsStorageOrder,ConjugateLhs,EIGTYPE,RhsStorageOrder,ConjugateRhs,ColMajor,1>::run( \
|
130
|
+
rows, cols, depth, aa_tmp.data(), aStride, _rhs, rhsStride, res, 1, resStride, alpha, gemm_blocking, 0); \
|
131
|
+
\
|
132
|
+
/*std::cout << "TRMM_L: A is not square! Go to BLAS GEMM implementation! " << nthr<<" \n";*/ \
|
133
|
+
} \
|
134
|
+
return; \
|
135
|
+
} \
|
136
|
+
char side = 'L', transa, uplo, diag = 'N'; \
|
137
|
+
EIGTYPE *b; \
|
138
|
+
const EIGTYPE *a; \
|
139
|
+
BlasIndex m, n, lda, ldb; \
|
140
|
+
\
|
141
|
+
/* Set m, n */ \
|
142
|
+
m = convert_index<BlasIndex>(diagSize); \
|
143
|
+
n = convert_index<BlasIndex>(cols); \
|
144
|
+
\
|
145
|
+
/* Set trans */ \
|
146
|
+
transa = (LhsStorageOrder==RowMajor) ? ((ConjugateLhs) ? 'C' : 'T') : 'N'; \
|
147
|
+
\
|
148
|
+
/* Set b, ldb */ \
|
149
|
+
Map<const MatrixRhs, 0, OuterStride<> > rhs(_rhs,depth,cols,OuterStride<>(rhsStride)); \
|
150
|
+
MatrixX##EIGPREFIX b_tmp; \
|
151
|
+
\
|
152
|
+
if (ConjugateRhs) b_tmp = rhs.conjugate(); else b_tmp = rhs; \
|
153
|
+
b = b_tmp.data(); \
|
154
|
+
ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
|
155
|
+
\
|
156
|
+
/* Set uplo */ \
|
157
|
+
uplo = IsLower ? 'L' : 'U'; \
|
158
|
+
if (LhsStorageOrder==RowMajor) uplo = (uplo == 'L') ? 'U' : 'L'; \
|
159
|
+
/* Set a, lda */ \
|
160
|
+
Map<const MatrixLhs, 0, OuterStride<> > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \
|
161
|
+
MatrixLhs a_tmp; \
|
162
|
+
\
|
163
|
+
if ((conjA!=0) || (SetDiag==0)) { \
|
164
|
+
if (conjA) a_tmp = lhs.conjugate(); else a_tmp = lhs; \
|
165
|
+
if (IsZeroDiag) \
|
166
|
+
a_tmp.diagonal().setZero(); \
|
167
|
+
else if (IsUnitDiag) \
|
168
|
+
a_tmp.diagonal().setOnes();\
|
169
|
+
a = a_tmp.data(); \
|
170
|
+
lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
|
171
|
+
} else { \
|
172
|
+
a = _lhs; \
|
173
|
+
lda = convert_index<BlasIndex>(lhsStride); \
|
174
|
+
} \
|
175
|
+
/*std::cout << "TRMM_L: A is square! Go to BLAS TRMM implementation! \n";*/ \
|
176
|
+
/* call ?trmm*/ \
|
177
|
+
BLASFUNC(&side, &uplo, &transa, &diag, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (BLASTYPE*)b, &ldb); \
|
178
|
+
\
|
179
|
+
/* Add op(a_triangular)*b into res*/ \
|
180
|
+
Map<MatrixX##EIGPREFIX, 0, OuterStride<> > res_tmp(res,rows,cols,OuterStride<>(resStride)); \
|
181
|
+
res_tmp=res_tmp+b_tmp; \
|
182
|
+
} \
|
183
|
+
};
|
184
|
+
|
185
|
+
#ifdef EIGEN_USE_MKL
|
186
|
+
EIGEN_BLAS_TRMM_L(double, double, d, dtrmm)
|
187
|
+
EIGEN_BLAS_TRMM_L(dcomplex, MKL_Complex16, cd, ztrmm)
|
188
|
+
EIGEN_BLAS_TRMM_L(float, float, f, strmm)
|
189
|
+
EIGEN_BLAS_TRMM_L(scomplex, MKL_Complex8, cf, ctrmm)
|
190
|
+
#else
|
191
|
+
EIGEN_BLAS_TRMM_L(double, double, d, dtrmm_)
|
192
|
+
EIGEN_BLAS_TRMM_L(dcomplex, double, cd, ztrmm_)
|
193
|
+
EIGEN_BLAS_TRMM_L(float, float, f, strmm_)
|
194
|
+
EIGEN_BLAS_TRMM_L(scomplex, float, cf, ctrmm_)
|
195
|
+
#endif
|
196
|
+
|
197
|
+
// implements col-major += alpha * op(general) * op(triangular)
|
198
|
+
#define EIGEN_BLAS_TRMM_R(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \
|
199
|
+
template <typename Index, int Mode, \
|
200
|
+
int LhsStorageOrder, bool ConjugateLhs, \
|
201
|
+
int RhsStorageOrder, bool ConjugateRhs> \
|
202
|
+
struct product_triangular_matrix_matrix_trmm<EIGTYPE,Index,Mode,false, \
|
203
|
+
LhsStorageOrder,ConjugateLhs,RhsStorageOrder,ConjugateRhs,ColMajor> \
|
204
|
+
{ \
|
205
|
+
enum { \
|
206
|
+
IsLower = (Mode&Lower) == Lower, \
|
207
|
+
SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1, \
|
208
|
+
IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \
|
209
|
+
IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \
|
210
|
+
LowUp = IsLower ? Lower : Upper, \
|
211
|
+
conjA = ((RhsStorageOrder==ColMajor) && ConjugateRhs) ? 1 : 0 \
|
212
|
+
}; \
|
213
|
+
\
|
214
|
+
static void run( \
|
215
|
+
Index _rows, Index _cols, Index _depth, \
|
216
|
+
const EIGTYPE* _lhs, Index lhsStride, \
|
217
|
+
const EIGTYPE* _rhs, Index rhsStride, \
|
218
|
+
EIGTYPE* res, Index resStride, \
|
219
|
+
EIGTYPE alpha, level3_blocking<EIGTYPE,EIGTYPE>& blocking) \
|
220
|
+
{ \
|
221
|
+
Index diagSize = (std::min)(_cols,_depth); \
|
222
|
+
Index rows = _rows; \
|
223
|
+
Index depth = IsLower ? _depth : diagSize; \
|
224
|
+
Index cols = IsLower ? diagSize : _cols; \
|
225
|
+
\
|
226
|
+
typedef Matrix<EIGTYPE, Dynamic, Dynamic, LhsStorageOrder> MatrixLhs; \
|
227
|
+
typedef Matrix<EIGTYPE, Dynamic, Dynamic, RhsStorageOrder> MatrixRhs; \
|
228
|
+
\
|
229
|
+
/* Non-square case - doesn't fit to BLAS ?TRMM. Fall to default triangular product or call BLAS ?GEMM*/ \
|
230
|
+
if (cols != depth) { \
|
231
|
+
\
|
232
|
+
int nthr = 1 /*mkl_domain_get_max_threads(EIGEN_BLAS_DOMAIN_BLAS)*/; \
|
233
|
+
\
|
234
|
+
if ((nthr==1) && (((std::max)(cols,depth)-diagSize)/(double)diagSize < 0.5)) { \
|
235
|
+
/* Most likely no benefit to call TRMM or GEMM from BLAS*/ \
|
236
|
+
product_triangular_matrix_matrix<EIGTYPE,Index,Mode,false, \
|
237
|
+
LhsStorageOrder,ConjugateLhs, RhsStorageOrder, ConjugateRhs, ColMajor, 1, BuiltIn>::run( \
|
238
|
+
_rows, _cols, _depth, _lhs, lhsStride, _rhs, rhsStride, res, 1, resStride, alpha, blocking); \
|
239
|
+
/*std::cout << "TRMM_R: A is not square! Go to Eigen TRMM implementation!\n";*/ \
|
240
|
+
} else { \
|
241
|
+
/* Make sense to call GEMM */ \
|
242
|
+
Map<const MatrixRhs, 0, OuterStride<> > rhsMap(_rhs,depth,cols, OuterStride<>(rhsStride)); \
|
243
|
+
MatrixRhs aa_tmp=rhsMap.template triangularView<Mode>(); \
|
244
|
+
BlasIndex aStride = convert_index<BlasIndex>(aa_tmp.outerStride()); \
|
245
|
+
gemm_blocking_space<ColMajor,EIGTYPE,EIGTYPE,Dynamic,Dynamic,Dynamic> gemm_blocking(_rows,_cols,_depth, 1, true); \
|
246
|
+
general_matrix_matrix_product<Index,EIGTYPE,LhsStorageOrder,ConjugateLhs,EIGTYPE,RhsStorageOrder,ConjugateRhs,ColMajor,1>::run( \
|
247
|
+
rows, cols, depth, _lhs, lhsStride, aa_tmp.data(), aStride, res, 1, resStride, alpha, gemm_blocking, 0); \
|
248
|
+
\
|
249
|
+
/*std::cout << "TRMM_R: A is not square! Go to BLAS GEMM implementation! " << nthr<<" \n";*/ \
|
250
|
+
} \
|
251
|
+
return; \
|
252
|
+
} \
|
253
|
+
char side = 'R', transa, uplo, diag = 'N'; \
|
254
|
+
EIGTYPE *b; \
|
255
|
+
const EIGTYPE *a; \
|
256
|
+
BlasIndex m, n, lda, ldb; \
|
257
|
+
\
|
258
|
+
/* Set m, n */ \
|
259
|
+
m = convert_index<BlasIndex>(rows); \
|
260
|
+
n = convert_index<BlasIndex>(diagSize); \
|
261
|
+
\
|
262
|
+
/* Set trans */ \
|
263
|
+
transa = (RhsStorageOrder==RowMajor) ? ((ConjugateRhs) ? 'C' : 'T') : 'N'; \
|
264
|
+
\
|
265
|
+
/* Set b, ldb */ \
|
266
|
+
Map<const MatrixLhs, 0, OuterStride<> > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \
|
267
|
+
MatrixX##EIGPREFIX b_tmp; \
|
268
|
+
\
|
269
|
+
if (ConjugateLhs) b_tmp = lhs.conjugate(); else b_tmp = lhs; \
|
270
|
+
b = b_tmp.data(); \
|
271
|
+
ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
|
272
|
+
\
|
273
|
+
/* Set uplo */ \
|
274
|
+
uplo = IsLower ? 'L' : 'U'; \
|
275
|
+
if (RhsStorageOrder==RowMajor) uplo = (uplo == 'L') ? 'U' : 'L'; \
|
276
|
+
/* Set a, lda */ \
|
277
|
+
Map<const MatrixRhs, 0, OuterStride<> > rhs(_rhs,depth,cols, OuterStride<>(rhsStride)); \
|
278
|
+
MatrixRhs a_tmp; \
|
279
|
+
\
|
280
|
+
if ((conjA!=0) || (SetDiag==0)) { \
|
281
|
+
if (conjA) a_tmp = rhs.conjugate(); else a_tmp = rhs; \
|
282
|
+
if (IsZeroDiag) \
|
283
|
+
a_tmp.diagonal().setZero(); \
|
284
|
+
else if (IsUnitDiag) \
|
285
|
+
a_tmp.diagonal().setOnes();\
|
286
|
+
a = a_tmp.data(); \
|
287
|
+
lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
|
288
|
+
} else { \
|
289
|
+
a = _rhs; \
|
290
|
+
lda = convert_index<BlasIndex>(rhsStride); \
|
291
|
+
} \
|
292
|
+
/*std::cout << "TRMM_R: A is square! Go to BLAS TRMM implementation! \n";*/ \
|
293
|
+
/* call ?trmm*/ \
|
294
|
+
BLASFUNC(&side, &uplo, &transa, &diag, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (BLASTYPE*)b, &ldb); \
|
295
|
+
\
|
296
|
+
/* Add op(a_triangular)*b into res*/ \
|
297
|
+
Map<MatrixX##EIGPREFIX, 0, OuterStride<> > res_tmp(res,rows,cols,OuterStride<>(resStride)); \
|
298
|
+
res_tmp=res_tmp+b_tmp; \
|
299
|
+
} \
|
300
|
+
};
|
301
|
+
|
302
|
+
#ifdef EIGEN_USE_MKL
|
303
|
+
EIGEN_BLAS_TRMM_R(double, double, d, dtrmm)
|
304
|
+
EIGEN_BLAS_TRMM_R(dcomplex, MKL_Complex16, cd, ztrmm)
|
305
|
+
EIGEN_BLAS_TRMM_R(float, float, f, strmm)
|
306
|
+
EIGEN_BLAS_TRMM_R(scomplex, MKL_Complex8, cf, ctrmm)
|
307
|
+
#else
|
308
|
+
EIGEN_BLAS_TRMM_R(double, double, d, dtrmm_)
|
309
|
+
EIGEN_BLAS_TRMM_R(dcomplex, double, cd, ztrmm_)
|
310
|
+
EIGEN_BLAS_TRMM_R(float, float, f, strmm_)
|
311
|
+
EIGEN_BLAS_TRMM_R(scomplex, float, cf, ctrmm_)
|
312
|
+
#endif
|
313
|
+
} // end namespace internal
|
314
|
+
|
315
|
+
} // end namespace Eigen
|
316
|
+
|
317
|
+
#endif // EIGEN_TRIANGULAR_MATRIX_MATRIX_BLAS_H
|
@@ -0,0 +1,350 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009 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_TRIANGULARMATRIXVECTOR_H
|
11
|
+
#define EIGEN_TRIANGULARMATRIXVECTOR_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder, int Version=Specialized>
|
18
|
+
struct triangular_matrix_vector_product;
|
19
|
+
|
20
|
+
template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int Version>
|
21
|
+
struct triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor,Version>
|
22
|
+
{
|
23
|
+
typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar;
|
24
|
+
enum {
|
25
|
+
IsLower = ((Mode&Lower)==Lower),
|
26
|
+
HasUnitDiag = (Mode & UnitDiag)==UnitDiag,
|
27
|
+
HasZeroDiag = (Mode & ZeroDiag)==ZeroDiag
|
28
|
+
};
|
29
|
+
static EIGEN_DONT_INLINE void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride,
|
30
|
+
const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const RhsScalar& alpha);
|
31
|
+
};
|
32
|
+
|
33
|
+
template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int Version>
|
34
|
+
EIGEN_DONT_INLINE void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor,Version>
|
35
|
+
::run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride,
|
36
|
+
const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const RhsScalar& alpha)
|
37
|
+
{
|
38
|
+
static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH;
|
39
|
+
Index size = (std::min)(_rows,_cols);
|
40
|
+
Index rows = IsLower ? _rows : (std::min)(_rows,_cols);
|
41
|
+
Index cols = IsLower ? (std::min)(_rows,_cols) : _cols;
|
42
|
+
|
43
|
+
typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
|
44
|
+
const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
|
45
|
+
typename conj_expr_if<ConjLhs,LhsMap>::type cjLhs(lhs);
|
46
|
+
|
47
|
+
typedef Map<const Matrix<RhsScalar,Dynamic,1>, 0, InnerStride<> > RhsMap;
|
48
|
+
const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr));
|
49
|
+
typename conj_expr_if<ConjRhs,RhsMap>::type cjRhs(rhs);
|
50
|
+
|
51
|
+
typedef Map<Matrix<ResScalar,Dynamic,1> > ResMap;
|
52
|
+
ResMap res(_res,rows);
|
53
|
+
|
54
|
+
typedef const_blas_data_mapper<LhsScalar,Index,ColMajor> LhsMapper;
|
55
|
+
typedef const_blas_data_mapper<RhsScalar,Index,RowMajor> RhsMapper;
|
56
|
+
|
57
|
+
for (Index pi=0; pi<size; pi+=PanelWidth)
|
58
|
+
{
|
59
|
+
Index actualPanelWidth = (std::min)(PanelWidth, size-pi);
|
60
|
+
for (Index k=0; k<actualPanelWidth; ++k)
|
61
|
+
{
|
62
|
+
Index i = pi + k;
|
63
|
+
Index s = IsLower ? ((HasUnitDiag||HasZeroDiag) ? i+1 : i ) : pi;
|
64
|
+
Index r = IsLower ? actualPanelWidth-k : k+1;
|
65
|
+
if ((!(HasUnitDiag||HasZeroDiag)) || (--r)>0)
|
66
|
+
res.segment(s,r) += (alpha * cjRhs.coeff(i)) * cjLhs.col(i).segment(s,r);
|
67
|
+
if (HasUnitDiag)
|
68
|
+
res.coeffRef(i) += alpha * cjRhs.coeff(i);
|
69
|
+
}
|
70
|
+
Index r = IsLower ? rows - pi - actualPanelWidth : pi;
|
71
|
+
if (r>0)
|
72
|
+
{
|
73
|
+
Index s = IsLower ? pi+actualPanelWidth : 0;
|
74
|
+
general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run(
|
75
|
+
r, actualPanelWidth,
|
76
|
+
LhsMapper(&lhs.coeffRef(s,pi), lhsStride),
|
77
|
+
RhsMapper(&rhs.coeffRef(pi), rhsIncr),
|
78
|
+
&res.coeffRef(s), resIncr, alpha);
|
79
|
+
}
|
80
|
+
}
|
81
|
+
if((!IsLower) && cols>size)
|
82
|
+
{
|
83
|
+
general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs>::run(
|
84
|
+
rows, cols-size,
|
85
|
+
LhsMapper(&lhs.coeffRef(0,size), lhsStride),
|
86
|
+
RhsMapper(&rhs.coeffRef(size), rhsIncr),
|
87
|
+
_res, resIncr, alpha);
|
88
|
+
}
|
89
|
+
}
|
90
|
+
|
91
|
+
template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs,int Version>
|
92
|
+
struct triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version>
|
93
|
+
{
|
94
|
+
typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar;
|
95
|
+
enum {
|
96
|
+
IsLower = ((Mode&Lower)==Lower),
|
97
|
+
HasUnitDiag = (Mode & UnitDiag)==UnitDiag,
|
98
|
+
HasZeroDiag = (Mode & ZeroDiag)==ZeroDiag
|
99
|
+
};
|
100
|
+
static EIGEN_DONT_INLINE void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride,
|
101
|
+
const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const ResScalar& alpha);
|
102
|
+
};
|
103
|
+
|
104
|
+
template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs,int Version>
|
105
|
+
EIGEN_DONT_INLINE void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version>
|
106
|
+
::run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride,
|
107
|
+
const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const ResScalar& alpha)
|
108
|
+
{
|
109
|
+
static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH;
|
110
|
+
Index diagSize = (std::min)(_rows,_cols);
|
111
|
+
Index rows = IsLower ? _rows : diagSize;
|
112
|
+
Index cols = IsLower ? diagSize : _cols;
|
113
|
+
|
114
|
+
typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap;
|
115
|
+
const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
|
116
|
+
typename conj_expr_if<ConjLhs,LhsMap>::type cjLhs(lhs);
|
117
|
+
|
118
|
+
typedef Map<const Matrix<RhsScalar,Dynamic,1> > RhsMap;
|
119
|
+
const RhsMap rhs(_rhs,cols);
|
120
|
+
typename conj_expr_if<ConjRhs,RhsMap>::type cjRhs(rhs);
|
121
|
+
|
122
|
+
typedef Map<Matrix<ResScalar,Dynamic,1>, 0, InnerStride<> > ResMap;
|
123
|
+
ResMap res(_res,rows,InnerStride<>(resIncr));
|
124
|
+
|
125
|
+
typedef const_blas_data_mapper<LhsScalar,Index,RowMajor> LhsMapper;
|
126
|
+
typedef const_blas_data_mapper<RhsScalar,Index,RowMajor> RhsMapper;
|
127
|
+
|
128
|
+
for (Index pi=0; pi<diagSize; pi+=PanelWidth)
|
129
|
+
{
|
130
|
+
Index actualPanelWidth = (std::min)(PanelWidth, diagSize-pi);
|
131
|
+
for (Index k=0; k<actualPanelWidth; ++k)
|
132
|
+
{
|
133
|
+
Index i = pi + k;
|
134
|
+
Index s = IsLower ? pi : ((HasUnitDiag||HasZeroDiag) ? i+1 : i);
|
135
|
+
Index r = IsLower ? k+1 : actualPanelWidth-k;
|
136
|
+
if ((!(HasUnitDiag||HasZeroDiag)) || (--r)>0)
|
137
|
+
res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum();
|
138
|
+
if (HasUnitDiag)
|
139
|
+
res.coeffRef(i) += alpha * cjRhs.coeff(i);
|
140
|
+
}
|
141
|
+
Index r = IsLower ? pi : cols - pi - actualPanelWidth;
|
142
|
+
if (r>0)
|
143
|
+
{
|
144
|
+
Index s = IsLower ? 0 : pi + actualPanelWidth;
|
145
|
+
general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run(
|
146
|
+
actualPanelWidth, r,
|
147
|
+
LhsMapper(&lhs.coeffRef(pi,s), lhsStride),
|
148
|
+
RhsMapper(&rhs.coeffRef(s), rhsIncr),
|
149
|
+
&res.coeffRef(pi), resIncr, alpha);
|
150
|
+
}
|
151
|
+
}
|
152
|
+
if(IsLower && rows>diagSize)
|
153
|
+
{
|
154
|
+
general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs>::run(
|
155
|
+
rows-diagSize, cols,
|
156
|
+
LhsMapper(&lhs.coeffRef(diagSize,0), lhsStride),
|
157
|
+
RhsMapper(&rhs.coeffRef(0), rhsIncr),
|
158
|
+
&res.coeffRef(diagSize), resIncr, alpha);
|
159
|
+
}
|
160
|
+
}
|
161
|
+
|
162
|
+
/***************************************************************************
|
163
|
+
* Wrapper to product_triangular_vector
|
164
|
+
***************************************************************************/
|
165
|
+
|
166
|
+
template<int Mode,int StorageOrder>
|
167
|
+
struct trmv_selector;
|
168
|
+
|
169
|
+
} // end namespace internal
|
170
|
+
|
171
|
+
namespace internal {
|
172
|
+
|
173
|
+
template<int Mode, typename Lhs, typename Rhs>
|
174
|
+
struct triangular_product_impl<Mode,true,Lhs,false,Rhs,true>
|
175
|
+
{
|
176
|
+
template<typename Dest> static void run(Dest& dst, const Lhs &lhs, const Rhs &rhs, const typename Dest::Scalar& alpha)
|
177
|
+
{
|
178
|
+
eigen_assert(dst.rows()==lhs.rows() && dst.cols()==rhs.cols());
|
179
|
+
|
180
|
+
internal::trmv_selector<Mode,(int(internal::traits<Lhs>::Flags)&RowMajorBit) ? RowMajor : ColMajor>::run(lhs, rhs, dst, alpha);
|
181
|
+
}
|
182
|
+
};
|
183
|
+
|
184
|
+
template<int Mode, typename Lhs, typename Rhs>
|
185
|
+
struct triangular_product_impl<Mode,false,Lhs,true,Rhs,false>
|
186
|
+
{
|
187
|
+
template<typename Dest> static void run(Dest& dst, const Lhs &lhs, const Rhs &rhs, const typename Dest::Scalar& alpha)
|
188
|
+
{
|
189
|
+
eigen_assert(dst.rows()==lhs.rows() && dst.cols()==rhs.cols());
|
190
|
+
|
191
|
+
Transpose<Dest> dstT(dst);
|
192
|
+
internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower),
|
193
|
+
(int(internal::traits<Rhs>::Flags)&RowMajorBit) ? ColMajor : RowMajor>
|
194
|
+
::run(rhs.transpose(),lhs.transpose(), dstT, alpha);
|
195
|
+
}
|
196
|
+
};
|
197
|
+
|
198
|
+
} // end namespace internal
|
199
|
+
|
200
|
+
namespace internal {
|
201
|
+
|
202
|
+
// TODO: find a way to factorize this piece of code with gemv_selector since the logic is exactly the same.
|
203
|
+
|
204
|
+
template<int Mode> struct trmv_selector<Mode,ColMajor>
|
205
|
+
{
|
206
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
207
|
+
static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
208
|
+
{
|
209
|
+
typedef typename Lhs::Scalar LhsScalar;
|
210
|
+
typedef typename Rhs::Scalar RhsScalar;
|
211
|
+
typedef typename Dest::Scalar ResScalar;
|
212
|
+
typedef typename Dest::RealScalar RealScalar;
|
213
|
+
|
214
|
+
typedef internal::blas_traits<Lhs> LhsBlasTraits;
|
215
|
+
typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType;
|
216
|
+
typedef internal::blas_traits<Rhs> RhsBlasTraits;
|
217
|
+
typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType;
|
218
|
+
|
219
|
+
typedef Map<Matrix<ResScalar,Dynamic,1>, EIGEN_PLAIN_ENUM_MIN(AlignedMax,internal::packet_traits<ResScalar>::size)> MappedDest;
|
220
|
+
|
221
|
+
typename internal::add_const_on_value_type<ActualLhsType>::type actualLhs = LhsBlasTraits::extract(lhs);
|
222
|
+
typename internal::add_const_on_value_type<ActualRhsType>::type actualRhs = RhsBlasTraits::extract(rhs);
|
223
|
+
|
224
|
+
LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(lhs);
|
225
|
+
RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(rhs);
|
226
|
+
ResScalar actualAlpha = alpha * lhs_alpha * rhs_alpha;
|
227
|
+
|
228
|
+
enum {
|
229
|
+
// FIXME find a way to allow an inner stride on the result if packet_traits<Scalar>::size==1
|
230
|
+
// on, the other hand it is good for the cache to pack the vector anyways...
|
231
|
+
EvalToDestAtCompileTime = Dest::InnerStrideAtCompileTime==1,
|
232
|
+
ComplexByReal = (NumTraits<LhsScalar>::IsComplex) && (!NumTraits<RhsScalar>::IsComplex),
|
233
|
+
MightCannotUseDest = (Dest::InnerStrideAtCompileTime!=1) || ComplexByReal
|
234
|
+
};
|
235
|
+
|
236
|
+
gemv_static_vector_if<ResScalar,Dest::SizeAtCompileTime,Dest::MaxSizeAtCompileTime,MightCannotUseDest> static_dest;
|
237
|
+
|
238
|
+
bool alphaIsCompatible = (!ComplexByReal) || (numext::imag(actualAlpha)==RealScalar(0));
|
239
|
+
bool evalToDest = EvalToDestAtCompileTime && alphaIsCompatible;
|
240
|
+
|
241
|
+
RhsScalar compatibleAlpha = get_factor<ResScalar,RhsScalar>::run(actualAlpha);
|
242
|
+
|
243
|
+
ei_declare_aligned_stack_constructed_variable(ResScalar,actualDestPtr,dest.size(),
|
244
|
+
evalToDest ? dest.data() : static_dest.data());
|
245
|
+
|
246
|
+
if(!evalToDest)
|
247
|
+
{
|
248
|
+
#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
249
|
+
Index size = dest.size();
|
250
|
+
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
251
|
+
#endif
|
252
|
+
if(!alphaIsCompatible)
|
253
|
+
{
|
254
|
+
MappedDest(actualDestPtr, dest.size()).setZero();
|
255
|
+
compatibleAlpha = RhsScalar(1);
|
256
|
+
}
|
257
|
+
else
|
258
|
+
MappedDest(actualDestPtr, dest.size()) = dest;
|
259
|
+
}
|
260
|
+
|
261
|
+
internal::triangular_matrix_vector_product
|
262
|
+
<Index,Mode,
|
263
|
+
LhsScalar, LhsBlasTraits::NeedToConjugate,
|
264
|
+
RhsScalar, RhsBlasTraits::NeedToConjugate,
|
265
|
+
ColMajor>
|
266
|
+
::run(actualLhs.rows(),actualLhs.cols(),
|
267
|
+
actualLhs.data(),actualLhs.outerStride(),
|
268
|
+
actualRhs.data(),actualRhs.innerStride(),
|
269
|
+
actualDestPtr,1,compatibleAlpha);
|
270
|
+
|
271
|
+
if (!evalToDest)
|
272
|
+
{
|
273
|
+
if(!alphaIsCompatible)
|
274
|
+
dest += actualAlpha * MappedDest(actualDestPtr, dest.size());
|
275
|
+
else
|
276
|
+
dest = MappedDest(actualDestPtr, dest.size());
|
277
|
+
}
|
278
|
+
|
279
|
+
if ( ((Mode&UnitDiag)==UnitDiag) && (lhs_alpha!=LhsScalar(1)) )
|
280
|
+
{
|
281
|
+
Index diagSize = (std::min)(lhs.rows(),lhs.cols());
|
282
|
+
dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
|
283
|
+
}
|
284
|
+
}
|
285
|
+
};
|
286
|
+
|
287
|
+
template<int Mode> struct trmv_selector<Mode,RowMajor>
|
288
|
+
{
|
289
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
290
|
+
static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
291
|
+
{
|
292
|
+
typedef typename Lhs::Scalar LhsScalar;
|
293
|
+
typedef typename Rhs::Scalar RhsScalar;
|
294
|
+
typedef typename Dest::Scalar ResScalar;
|
295
|
+
|
296
|
+
typedef internal::blas_traits<Lhs> LhsBlasTraits;
|
297
|
+
typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType;
|
298
|
+
typedef internal::blas_traits<Rhs> RhsBlasTraits;
|
299
|
+
typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType;
|
300
|
+
typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned;
|
301
|
+
|
302
|
+
typename add_const<ActualLhsType>::type actualLhs = LhsBlasTraits::extract(lhs);
|
303
|
+
typename add_const<ActualRhsType>::type actualRhs = RhsBlasTraits::extract(rhs);
|
304
|
+
|
305
|
+
LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(lhs);
|
306
|
+
RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(rhs);
|
307
|
+
ResScalar actualAlpha = alpha * lhs_alpha * rhs_alpha;
|
308
|
+
|
309
|
+
enum {
|
310
|
+
DirectlyUseRhs = ActualRhsTypeCleaned::InnerStrideAtCompileTime==1
|
311
|
+
};
|
312
|
+
|
313
|
+
gemv_static_vector_if<RhsScalar,ActualRhsTypeCleaned::SizeAtCompileTime,ActualRhsTypeCleaned::MaxSizeAtCompileTime,!DirectlyUseRhs> static_rhs;
|
314
|
+
|
315
|
+
ei_declare_aligned_stack_constructed_variable(RhsScalar,actualRhsPtr,actualRhs.size(),
|
316
|
+
DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data());
|
317
|
+
|
318
|
+
if(!DirectlyUseRhs)
|
319
|
+
{
|
320
|
+
#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
321
|
+
Index size = actualRhs.size();
|
322
|
+
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
323
|
+
#endif
|
324
|
+
Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, actualRhs.size()) = actualRhs;
|
325
|
+
}
|
326
|
+
|
327
|
+
internal::triangular_matrix_vector_product
|
328
|
+
<Index,Mode,
|
329
|
+
LhsScalar, LhsBlasTraits::NeedToConjugate,
|
330
|
+
RhsScalar, RhsBlasTraits::NeedToConjugate,
|
331
|
+
RowMajor>
|
332
|
+
::run(actualLhs.rows(),actualLhs.cols(),
|
333
|
+
actualLhs.data(),actualLhs.outerStride(),
|
334
|
+
actualRhsPtr,1,
|
335
|
+
dest.data(),dest.innerStride(),
|
336
|
+
actualAlpha);
|
337
|
+
|
338
|
+
if ( ((Mode&UnitDiag)==UnitDiag) && (lhs_alpha!=LhsScalar(1)) )
|
339
|
+
{
|
340
|
+
Index diagSize = (std::min)(lhs.rows(),lhs.cols());
|
341
|
+
dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize);
|
342
|
+
}
|
343
|
+
}
|
344
|
+
};
|
345
|
+
|
346
|
+
} // end namespace internal
|
347
|
+
|
348
|
+
} // end namespace Eigen
|
349
|
+
|
350
|
+
#endif // EIGEN_TRIANGULARMATRIXVECTOR_H
|