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,544 @@
|
|
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_SELFADJOINT_MATRIX_MATRIX_H
|
11
|
+
#define EIGEN_SELFADJOINT_MATRIX_MATRIX_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
// pack a selfadjoint block diagonal for use with the gebp_kernel
|
18
|
+
template<typename Scalar, typename Index, int Pack1, int Pack2_dummy, int StorageOrder>
|
19
|
+
struct symm_pack_lhs
|
20
|
+
{
|
21
|
+
template<int BlockRows> inline
|
22
|
+
void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count)
|
23
|
+
{
|
24
|
+
// normal copy
|
25
|
+
for(Index k=0; k<i; k++)
|
26
|
+
for(Index w=0; w<BlockRows; w++)
|
27
|
+
blockA[count++] = lhs(i+w,k); // normal
|
28
|
+
// symmetric copy
|
29
|
+
Index h = 0;
|
30
|
+
for(Index k=i; k<i+BlockRows; k++)
|
31
|
+
{
|
32
|
+
for(Index w=0; w<h; w++)
|
33
|
+
blockA[count++] = numext::conj(lhs(k, i+w)); // transposed
|
34
|
+
|
35
|
+
blockA[count++] = numext::real(lhs(k,k)); // real (diagonal)
|
36
|
+
|
37
|
+
for(Index w=h+1; w<BlockRows; w++)
|
38
|
+
blockA[count++] = lhs(i+w, k); // normal
|
39
|
+
++h;
|
40
|
+
}
|
41
|
+
// transposed copy
|
42
|
+
for(Index k=i+BlockRows; k<cols; k++)
|
43
|
+
for(Index w=0; w<BlockRows; w++)
|
44
|
+
blockA[count++] = numext::conj(lhs(k, i+w)); // transposed
|
45
|
+
}
|
46
|
+
void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows)
|
47
|
+
{
|
48
|
+
typedef typename unpacket_traits<typename packet_traits<Scalar>::type>::half HalfPacket;
|
49
|
+
typedef typename unpacket_traits<typename unpacket_traits<typename packet_traits<Scalar>::type>::half>::half QuarterPacket;
|
50
|
+
enum { PacketSize = packet_traits<Scalar>::size,
|
51
|
+
HalfPacketSize = unpacket_traits<HalfPacket>::size,
|
52
|
+
QuarterPacketSize = unpacket_traits<QuarterPacket>::size,
|
53
|
+
HasHalf = (int)HalfPacketSize < (int)PacketSize,
|
54
|
+
HasQuarter = (int)QuarterPacketSize < (int)HalfPacketSize};
|
55
|
+
|
56
|
+
const_blas_data_mapper<Scalar,Index,StorageOrder> lhs(_lhs,lhsStride);
|
57
|
+
Index count = 0;
|
58
|
+
//Index peeled_mc3 = (rows/Pack1)*Pack1;
|
59
|
+
|
60
|
+
const Index peeled_mc3 = Pack1>=3*PacketSize ? (rows/(3*PacketSize))*(3*PacketSize) : 0;
|
61
|
+
const Index peeled_mc2 = Pack1>=2*PacketSize ? peeled_mc3+((rows-peeled_mc3)/(2*PacketSize))*(2*PacketSize) : 0;
|
62
|
+
const Index peeled_mc1 = Pack1>=1*PacketSize ? peeled_mc2+((rows-peeled_mc2)/(1*PacketSize))*(1*PacketSize) : 0;
|
63
|
+
const Index peeled_mc_half = Pack1>=HalfPacketSize ? peeled_mc1+((rows-peeled_mc1)/(HalfPacketSize))*(HalfPacketSize) : 0;
|
64
|
+
const Index peeled_mc_quarter = Pack1>=QuarterPacketSize ? peeled_mc_half+((rows-peeled_mc_half)/(QuarterPacketSize))*(QuarterPacketSize) : 0;
|
65
|
+
|
66
|
+
if(Pack1>=3*PacketSize)
|
67
|
+
for(Index i=0; i<peeled_mc3; i+=3*PacketSize)
|
68
|
+
pack<3*PacketSize>(blockA, lhs, cols, i, count);
|
69
|
+
|
70
|
+
if(Pack1>=2*PacketSize)
|
71
|
+
for(Index i=peeled_mc3; i<peeled_mc2; i+=2*PacketSize)
|
72
|
+
pack<2*PacketSize>(blockA, lhs, cols, i, count);
|
73
|
+
|
74
|
+
if(Pack1>=1*PacketSize)
|
75
|
+
for(Index i=peeled_mc2; i<peeled_mc1; i+=1*PacketSize)
|
76
|
+
pack<1*PacketSize>(blockA, lhs, cols, i, count);
|
77
|
+
|
78
|
+
if(HasHalf && Pack1>=HalfPacketSize)
|
79
|
+
for(Index i=peeled_mc1; i<peeled_mc_half; i+=HalfPacketSize)
|
80
|
+
pack<HalfPacketSize>(blockA, lhs, cols, i, count);
|
81
|
+
|
82
|
+
if(HasQuarter && Pack1>=QuarterPacketSize)
|
83
|
+
for(Index i=peeled_mc_half; i<peeled_mc_quarter; i+=QuarterPacketSize)
|
84
|
+
pack<QuarterPacketSize>(blockA, lhs, cols, i, count);
|
85
|
+
|
86
|
+
// do the same with mr==1
|
87
|
+
for(Index i=peeled_mc_quarter; i<rows; i++)
|
88
|
+
{
|
89
|
+
for(Index k=0; k<i; k++)
|
90
|
+
blockA[count++] = lhs(i, k); // normal
|
91
|
+
|
92
|
+
blockA[count++] = numext::real(lhs(i, i)); // real (diagonal)
|
93
|
+
|
94
|
+
for(Index k=i+1; k<cols; k++)
|
95
|
+
blockA[count++] = numext::conj(lhs(k, i)); // transposed
|
96
|
+
}
|
97
|
+
}
|
98
|
+
};
|
99
|
+
|
100
|
+
template<typename Scalar, typename Index, int nr, int StorageOrder>
|
101
|
+
struct symm_pack_rhs
|
102
|
+
{
|
103
|
+
enum { PacketSize = packet_traits<Scalar>::size };
|
104
|
+
void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2)
|
105
|
+
{
|
106
|
+
Index end_k = k2 + rows;
|
107
|
+
Index count = 0;
|
108
|
+
const_blas_data_mapper<Scalar,Index,StorageOrder> rhs(_rhs,rhsStride);
|
109
|
+
Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0;
|
110
|
+
Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0;
|
111
|
+
|
112
|
+
// first part: normal case
|
113
|
+
for(Index j2=0; j2<k2; j2+=nr)
|
114
|
+
{
|
115
|
+
for(Index k=k2; k<end_k; k++)
|
116
|
+
{
|
117
|
+
blockB[count+0] = rhs(k,j2+0);
|
118
|
+
blockB[count+1] = rhs(k,j2+1);
|
119
|
+
if (nr>=4)
|
120
|
+
{
|
121
|
+
blockB[count+2] = rhs(k,j2+2);
|
122
|
+
blockB[count+3] = rhs(k,j2+3);
|
123
|
+
}
|
124
|
+
if (nr>=8)
|
125
|
+
{
|
126
|
+
blockB[count+4] = rhs(k,j2+4);
|
127
|
+
blockB[count+5] = rhs(k,j2+5);
|
128
|
+
blockB[count+6] = rhs(k,j2+6);
|
129
|
+
blockB[count+7] = rhs(k,j2+7);
|
130
|
+
}
|
131
|
+
count += nr;
|
132
|
+
}
|
133
|
+
}
|
134
|
+
|
135
|
+
// second part: diagonal block
|
136
|
+
Index end8 = nr>=8 ? (std::min)(k2+rows,packet_cols8) : k2;
|
137
|
+
if(nr>=8)
|
138
|
+
{
|
139
|
+
for(Index j2=k2; j2<end8; j2+=8)
|
140
|
+
{
|
141
|
+
// again we can split vertically in three different parts (transpose, symmetric, normal)
|
142
|
+
// transpose
|
143
|
+
for(Index k=k2; k<j2; k++)
|
144
|
+
{
|
145
|
+
blockB[count+0] = numext::conj(rhs(j2+0,k));
|
146
|
+
blockB[count+1] = numext::conj(rhs(j2+1,k));
|
147
|
+
blockB[count+2] = numext::conj(rhs(j2+2,k));
|
148
|
+
blockB[count+3] = numext::conj(rhs(j2+3,k));
|
149
|
+
blockB[count+4] = numext::conj(rhs(j2+4,k));
|
150
|
+
blockB[count+5] = numext::conj(rhs(j2+5,k));
|
151
|
+
blockB[count+6] = numext::conj(rhs(j2+6,k));
|
152
|
+
blockB[count+7] = numext::conj(rhs(j2+7,k));
|
153
|
+
count += 8;
|
154
|
+
}
|
155
|
+
// symmetric
|
156
|
+
Index h = 0;
|
157
|
+
for(Index k=j2; k<j2+8; k++)
|
158
|
+
{
|
159
|
+
// normal
|
160
|
+
for (Index w=0 ; w<h; ++w)
|
161
|
+
blockB[count+w] = rhs(k,j2+w);
|
162
|
+
|
163
|
+
blockB[count+h] = numext::real(rhs(k,k));
|
164
|
+
|
165
|
+
// transpose
|
166
|
+
for (Index w=h+1 ; w<8; ++w)
|
167
|
+
blockB[count+w] = numext::conj(rhs(j2+w,k));
|
168
|
+
count += 8;
|
169
|
+
++h;
|
170
|
+
}
|
171
|
+
// normal
|
172
|
+
for(Index k=j2+8; k<end_k; k++)
|
173
|
+
{
|
174
|
+
blockB[count+0] = rhs(k,j2+0);
|
175
|
+
blockB[count+1] = rhs(k,j2+1);
|
176
|
+
blockB[count+2] = rhs(k,j2+2);
|
177
|
+
blockB[count+3] = rhs(k,j2+3);
|
178
|
+
blockB[count+4] = rhs(k,j2+4);
|
179
|
+
blockB[count+5] = rhs(k,j2+5);
|
180
|
+
blockB[count+6] = rhs(k,j2+6);
|
181
|
+
blockB[count+7] = rhs(k,j2+7);
|
182
|
+
count += 8;
|
183
|
+
}
|
184
|
+
}
|
185
|
+
}
|
186
|
+
if(nr>=4)
|
187
|
+
{
|
188
|
+
for(Index j2=end8; j2<(std::min)(k2+rows,packet_cols4); j2+=4)
|
189
|
+
{
|
190
|
+
// again we can split vertically in three different parts (transpose, symmetric, normal)
|
191
|
+
// transpose
|
192
|
+
for(Index k=k2; k<j2; k++)
|
193
|
+
{
|
194
|
+
blockB[count+0] = numext::conj(rhs(j2+0,k));
|
195
|
+
blockB[count+1] = numext::conj(rhs(j2+1,k));
|
196
|
+
blockB[count+2] = numext::conj(rhs(j2+2,k));
|
197
|
+
blockB[count+3] = numext::conj(rhs(j2+3,k));
|
198
|
+
count += 4;
|
199
|
+
}
|
200
|
+
// symmetric
|
201
|
+
Index h = 0;
|
202
|
+
for(Index k=j2; k<j2+4; k++)
|
203
|
+
{
|
204
|
+
// normal
|
205
|
+
for (Index w=0 ; w<h; ++w)
|
206
|
+
blockB[count+w] = rhs(k,j2+w);
|
207
|
+
|
208
|
+
blockB[count+h] = numext::real(rhs(k,k));
|
209
|
+
|
210
|
+
// transpose
|
211
|
+
for (Index w=h+1 ; w<4; ++w)
|
212
|
+
blockB[count+w] = numext::conj(rhs(j2+w,k));
|
213
|
+
count += 4;
|
214
|
+
++h;
|
215
|
+
}
|
216
|
+
// normal
|
217
|
+
for(Index k=j2+4; k<end_k; k++)
|
218
|
+
{
|
219
|
+
blockB[count+0] = rhs(k,j2+0);
|
220
|
+
blockB[count+1] = rhs(k,j2+1);
|
221
|
+
blockB[count+2] = rhs(k,j2+2);
|
222
|
+
blockB[count+3] = rhs(k,j2+3);
|
223
|
+
count += 4;
|
224
|
+
}
|
225
|
+
}
|
226
|
+
}
|
227
|
+
|
228
|
+
// third part: transposed
|
229
|
+
if(nr>=8)
|
230
|
+
{
|
231
|
+
for(Index j2=k2+rows; j2<packet_cols8; j2+=8)
|
232
|
+
{
|
233
|
+
for(Index k=k2; k<end_k; k++)
|
234
|
+
{
|
235
|
+
blockB[count+0] = numext::conj(rhs(j2+0,k));
|
236
|
+
blockB[count+1] = numext::conj(rhs(j2+1,k));
|
237
|
+
blockB[count+2] = numext::conj(rhs(j2+2,k));
|
238
|
+
blockB[count+3] = numext::conj(rhs(j2+3,k));
|
239
|
+
blockB[count+4] = numext::conj(rhs(j2+4,k));
|
240
|
+
blockB[count+5] = numext::conj(rhs(j2+5,k));
|
241
|
+
blockB[count+6] = numext::conj(rhs(j2+6,k));
|
242
|
+
blockB[count+7] = numext::conj(rhs(j2+7,k));
|
243
|
+
count += 8;
|
244
|
+
}
|
245
|
+
}
|
246
|
+
}
|
247
|
+
if(nr>=4)
|
248
|
+
{
|
249
|
+
for(Index j2=(std::max)(packet_cols8,k2+rows); j2<packet_cols4; j2+=4)
|
250
|
+
{
|
251
|
+
for(Index k=k2; k<end_k; k++)
|
252
|
+
{
|
253
|
+
blockB[count+0] = numext::conj(rhs(j2+0,k));
|
254
|
+
blockB[count+1] = numext::conj(rhs(j2+1,k));
|
255
|
+
blockB[count+2] = numext::conj(rhs(j2+2,k));
|
256
|
+
blockB[count+3] = numext::conj(rhs(j2+3,k));
|
257
|
+
count += 4;
|
258
|
+
}
|
259
|
+
}
|
260
|
+
}
|
261
|
+
|
262
|
+
// copy the remaining columns one at a time (=> the same with nr==1)
|
263
|
+
for(Index j2=packet_cols4; j2<cols; ++j2)
|
264
|
+
{
|
265
|
+
// transpose
|
266
|
+
Index half = (std::min)(end_k,j2);
|
267
|
+
for(Index k=k2; k<half; k++)
|
268
|
+
{
|
269
|
+
blockB[count] = numext::conj(rhs(j2,k));
|
270
|
+
count += 1;
|
271
|
+
}
|
272
|
+
|
273
|
+
if(half==j2 && half<k2+rows)
|
274
|
+
{
|
275
|
+
blockB[count] = numext::real(rhs(j2,j2));
|
276
|
+
count += 1;
|
277
|
+
}
|
278
|
+
else
|
279
|
+
half--;
|
280
|
+
|
281
|
+
// normal
|
282
|
+
for(Index k=half+1; k<k2+rows; k++)
|
283
|
+
{
|
284
|
+
blockB[count] = rhs(k,j2);
|
285
|
+
count += 1;
|
286
|
+
}
|
287
|
+
}
|
288
|
+
}
|
289
|
+
};
|
290
|
+
|
291
|
+
/* Optimized selfadjoint matrix * matrix (_SYMM) product built on top of
|
292
|
+
* the general matrix matrix product.
|
293
|
+
*/
|
294
|
+
template <typename Scalar, typename Index,
|
295
|
+
int LhsStorageOrder, bool LhsSelfAdjoint, bool ConjugateLhs,
|
296
|
+
int RhsStorageOrder, bool RhsSelfAdjoint, bool ConjugateRhs,
|
297
|
+
int ResStorageOrder, int ResInnerStride>
|
298
|
+
struct product_selfadjoint_matrix;
|
299
|
+
|
300
|
+
template <typename Scalar, typename Index,
|
301
|
+
int LhsStorageOrder, bool LhsSelfAdjoint, bool ConjugateLhs,
|
302
|
+
int RhsStorageOrder, bool RhsSelfAdjoint, bool ConjugateRhs,
|
303
|
+
int ResInnerStride>
|
304
|
+
struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,LhsSelfAdjoint,ConjugateLhs, RhsStorageOrder,RhsSelfAdjoint,ConjugateRhs,RowMajor,ResInnerStride>
|
305
|
+
{
|
306
|
+
|
307
|
+
static EIGEN_STRONG_INLINE void run(
|
308
|
+
Index rows, Index cols,
|
309
|
+
const Scalar* lhs, Index lhsStride,
|
310
|
+
const Scalar* rhs, Index rhsStride,
|
311
|
+
Scalar* res, Index resIncr, Index resStride,
|
312
|
+
const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking)
|
313
|
+
{
|
314
|
+
product_selfadjoint_matrix<Scalar, Index,
|
315
|
+
EIGEN_LOGICAL_XOR(RhsSelfAdjoint,RhsStorageOrder==RowMajor) ? ColMajor : RowMajor,
|
316
|
+
RhsSelfAdjoint, NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(RhsSelfAdjoint,ConjugateRhs),
|
317
|
+
EIGEN_LOGICAL_XOR(LhsSelfAdjoint,LhsStorageOrder==RowMajor) ? ColMajor : RowMajor,
|
318
|
+
LhsSelfAdjoint, NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(LhsSelfAdjoint,ConjugateLhs),
|
319
|
+
ColMajor,ResInnerStride>
|
320
|
+
::run(cols, rows, rhs, rhsStride, lhs, lhsStride, res, resIncr, resStride, alpha, blocking);
|
321
|
+
}
|
322
|
+
};
|
323
|
+
|
324
|
+
template <typename Scalar, typename Index,
|
325
|
+
int LhsStorageOrder, bool ConjugateLhs,
|
326
|
+
int RhsStorageOrder, bool ConjugateRhs,
|
327
|
+
int ResInnerStride>
|
328
|
+
struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,true,ConjugateLhs, RhsStorageOrder,false,ConjugateRhs,ColMajor,ResInnerStride>
|
329
|
+
{
|
330
|
+
|
331
|
+
static EIGEN_DONT_INLINE void run(
|
332
|
+
Index rows, Index cols,
|
333
|
+
const Scalar* _lhs, Index lhsStride,
|
334
|
+
const Scalar* _rhs, Index rhsStride,
|
335
|
+
Scalar* res, Index resIncr, Index resStride,
|
336
|
+
const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking);
|
337
|
+
};
|
338
|
+
|
339
|
+
template <typename Scalar, typename Index,
|
340
|
+
int LhsStorageOrder, bool ConjugateLhs,
|
341
|
+
int RhsStorageOrder, bool ConjugateRhs,
|
342
|
+
int ResInnerStride>
|
343
|
+
EIGEN_DONT_INLINE void product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,true,ConjugateLhs, RhsStorageOrder,false,ConjugateRhs,ColMajor,ResInnerStride>::run(
|
344
|
+
Index rows, Index cols,
|
345
|
+
const Scalar* _lhs, Index lhsStride,
|
346
|
+
const Scalar* _rhs, Index rhsStride,
|
347
|
+
Scalar* _res, Index resIncr, Index resStride,
|
348
|
+
const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking)
|
349
|
+
{
|
350
|
+
Index size = rows;
|
351
|
+
|
352
|
+
typedef gebp_traits<Scalar,Scalar> Traits;
|
353
|
+
|
354
|
+
typedef const_blas_data_mapper<Scalar, Index, LhsStorageOrder> LhsMapper;
|
355
|
+
typedef const_blas_data_mapper<Scalar, Index, (LhsStorageOrder == RowMajor) ? ColMajor : RowMajor> LhsTransposeMapper;
|
356
|
+
typedef const_blas_data_mapper<Scalar, Index, RhsStorageOrder> RhsMapper;
|
357
|
+
typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor, Unaligned, ResInnerStride> ResMapper;
|
358
|
+
LhsMapper lhs(_lhs,lhsStride);
|
359
|
+
LhsTransposeMapper lhs_transpose(_lhs,lhsStride);
|
360
|
+
RhsMapper rhs(_rhs,rhsStride);
|
361
|
+
ResMapper res(_res, resStride, resIncr);
|
362
|
+
|
363
|
+
Index kc = blocking.kc(); // cache block size along the K direction
|
364
|
+
Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction
|
365
|
+
// kc must be smaller than mc
|
366
|
+
kc = (std::min)(kc,mc);
|
367
|
+
std::size_t sizeA = kc*mc;
|
368
|
+
std::size_t sizeB = kc*cols;
|
369
|
+
ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA());
|
370
|
+
ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB());
|
371
|
+
|
372
|
+
gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
|
373
|
+
symm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs;
|
374
|
+
gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr,RhsStorageOrder> pack_rhs;
|
375
|
+
gemm_pack_lhs<Scalar, Index, LhsTransposeMapper, Traits::mr, Traits::LhsProgress, typename Traits::LhsPacket4Packing, LhsStorageOrder==RowMajor?ColMajor:RowMajor, true> pack_lhs_transposed;
|
376
|
+
|
377
|
+
for(Index k2=0; k2<size; k2+=kc)
|
378
|
+
{
|
379
|
+
const Index actual_kc = (std::min)(k2+kc,size)-k2;
|
380
|
+
|
381
|
+
// we have selected one row panel of rhs and one column panel of lhs
|
382
|
+
// pack rhs's panel into a sequential chunk of memory
|
383
|
+
// and expand each coeff to a constant packet for further reuse
|
384
|
+
pack_rhs(blockB, rhs.getSubMapper(k2,0), actual_kc, cols);
|
385
|
+
|
386
|
+
// the select lhs's panel has to be split in three different parts:
|
387
|
+
// 1 - the transposed panel above the diagonal block => transposed packed copy
|
388
|
+
// 2 - the diagonal block => special packed copy
|
389
|
+
// 3 - the panel below the diagonal block => generic packed copy
|
390
|
+
for(Index i2=0; i2<k2; i2+=mc)
|
391
|
+
{
|
392
|
+
const Index actual_mc = (std::min)(i2+mc,k2)-i2;
|
393
|
+
// transposed packed copy
|
394
|
+
pack_lhs_transposed(blockA, lhs_transpose.getSubMapper(i2, k2), actual_kc, actual_mc);
|
395
|
+
|
396
|
+
gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha);
|
397
|
+
}
|
398
|
+
// the block diagonal
|
399
|
+
{
|
400
|
+
const Index actual_mc = (std::min)(k2+kc,size)-k2;
|
401
|
+
// symmetric packed copy
|
402
|
+
pack_lhs(blockA, &lhs(k2,k2), lhsStride, actual_kc, actual_mc);
|
403
|
+
|
404
|
+
gebp_kernel(res.getSubMapper(k2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha);
|
405
|
+
}
|
406
|
+
|
407
|
+
for(Index i2=k2+kc; i2<size; i2+=mc)
|
408
|
+
{
|
409
|
+
const Index actual_mc = (std::min)(i2+mc,size)-i2;
|
410
|
+
gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, typename Traits::LhsPacket4Packing, LhsStorageOrder,false>()
|
411
|
+
(blockA, lhs.getSubMapper(i2, k2), actual_kc, actual_mc);
|
412
|
+
|
413
|
+
gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha);
|
414
|
+
}
|
415
|
+
}
|
416
|
+
}
|
417
|
+
|
418
|
+
// matrix * selfadjoint product
|
419
|
+
template <typename Scalar, typename Index,
|
420
|
+
int LhsStorageOrder, bool ConjugateLhs,
|
421
|
+
int RhsStorageOrder, bool ConjugateRhs,
|
422
|
+
int ResInnerStride>
|
423
|
+
struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,false,ConjugateLhs, RhsStorageOrder,true,ConjugateRhs,ColMajor,ResInnerStride>
|
424
|
+
{
|
425
|
+
|
426
|
+
static EIGEN_DONT_INLINE void run(
|
427
|
+
Index rows, Index cols,
|
428
|
+
const Scalar* _lhs, Index lhsStride,
|
429
|
+
const Scalar* _rhs, Index rhsStride,
|
430
|
+
Scalar* res, Index resIncr, Index resStride,
|
431
|
+
const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking);
|
432
|
+
};
|
433
|
+
|
434
|
+
template <typename Scalar, typename Index,
|
435
|
+
int LhsStorageOrder, bool ConjugateLhs,
|
436
|
+
int RhsStorageOrder, bool ConjugateRhs,
|
437
|
+
int ResInnerStride>
|
438
|
+
EIGEN_DONT_INLINE void product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,false,ConjugateLhs, RhsStorageOrder,true,ConjugateRhs,ColMajor,ResInnerStride>::run(
|
439
|
+
Index rows, Index cols,
|
440
|
+
const Scalar* _lhs, Index lhsStride,
|
441
|
+
const Scalar* _rhs, Index rhsStride,
|
442
|
+
Scalar* _res, Index resIncr, Index resStride,
|
443
|
+
const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking)
|
444
|
+
{
|
445
|
+
Index size = cols;
|
446
|
+
|
447
|
+
typedef gebp_traits<Scalar,Scalar> Traits;
|
448
|
+
|
449
|
+
typedef const_blas_data_mapper<Scalar, Index, LhsStorageOrder> LhsMapper;
|
450
|
+
typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor, Unaligned, ResInnerStride> ResMapper;
|
451
|
+
LhsMapper lhs(_lhs,lhsStride);
|
452
|
+
ResMapper res(_res,resStride, resIncr);
|
453
|
+
|
454
|
+
Index kc = blocking.kc(); // cache block size along the K direction
|
455
|
+
Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction
|
456
|
+
std::size_t sizeA = kc*mc;
|
457
|
+
std::size_t sizeB = kc*cols;
|
458
|
+
ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA());
|
459
|
+
ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB());
|
460
|
+
|
461
|
+
gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel;
|
462
|
+
gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, typename Traits::LhsPacket4Packing, LhsStorageOrder> pack_lhs;
|
463
|
+
symm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs;
|
464
|
+
|
465
|
+
for(Index k2=0; k2<size; k2+=kc)
|
466
|
+
{
|
467
|
+
const Index actual_kc = (std::min)(k2+kc,size)-k2;
|
468
|
+
|
469
|
+
pack_rhs(blockB, _rhs, rhsStride, actual_kc, cols, k2);
|
470
|
+
|
471
|
+
// => GEPP
|
472
|
+
for(Index i2=0; i2<rows; i2+=mc)
|
473
|
+
{
|
474
|
+
const Index actual_mc = (std::min)(i2+mc,rows)-i2;
|
475
|
+
pack_lhs(blockA, lhs.getSubMapper(i2, k2), actual_kc, actual_mc);
|
476
|
+
|
477
|
+
gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha);
|
478
|
+
}
|
479
|
+
}
|
480
|
+
}
|
481
|
+
|
482
|
+
} // end namespace internal
|
483
|
+
|
484
|
+
/***************************************************************************
|
485
|
+
* Wrapper to product_selfadjoint_matrix
|
486
|
+
***************************************************************************/
|
487
|
+
|
488
|
+
namespace internal {
|
489
|
+
|
490
|
+
template<typename Lhs, int LhsMode, typename Rhs, int RhsMode>
|
491
|
+
struct selfadjoint_product_impl<Lhs,LhsMode,false,Rhs,RhsMode,false>
|
492
|
+
{
|
493
|
+
typedef typename Product<Lhs,Rhs>::Scalar Scalar;
|
494
|
+
|
495
|
+
typedef internal::blas_traits<Lhs> LhsBlasTraits;
|
496
|
+
typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType;
|
497
|
+
typedef internal::blas_traits<Rhs> RhsBlasTraits;
|
498
|
+
typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType;
|
499
|
+
|
500
|
+
enum {
|
501
|
+
LhsIsUpper = (LhsMode&(Upper|Lower))==Upper,
|
502
|
+
LhsIsSelfAdjoint = (LhsMode&SelfAdjoint)==SelfAdjoint,
|
503
|
+
RhsIsUpper = (RhsMode&(Upper|Lower))==Upper,
|
504
|
+
RhsIsSelfAdjoint = (RhsMode&SelfAdjoint)==SelfAdjoint
|
505
|
+
};
|
506
|
+
|
507
|
+
template<typename Dest>
|
508
|
+
static void run(Dest &dst, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha)
|
509
|
+
{
|
510
|
+
eigen_assert(dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols());
|
511
|
+
|
512
|
+
typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(a_lhs);
|
513
|
+
typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(a_rhs);
|
514
|
+
|
515
|
+
Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs)
|
516
|
+
* RhsBlasTraits::extractScalarFactor(a_rhs);
|
517
|
+
|
518
|
+
typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar,
|
519
|
+
Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxColsAtCompileTime,1> BlockingType;
|
520
|
+
|
521
|
+
BlockingType blocking(lhs.rows(), rhs.cols(), lhs.cols(), 1, false);
|
522
|
+
|
523
|
+
internal::product_selfadjoint_matrix<Scalar, Index,
|
524
|
+
EIGEN_LOGICAL_XOR(LhsIsUpper,internal::traits<Lhs>::Flags &RowMajorBit) ? RowMajor : ColMajor, LhsIsSelfAdjoint,
|
525
|
+
NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(LhsIsUpper,bool(LhsBlasTraits::NeedToConjugate)),
|
526
|
+
EIGEN_LOGICAL_XOR(RhsIsUpper,internal::traits<Rhs>::Flags &RowMajorBit) ? RowMajor : ColMajor, RhsIsSelfAdjoint,
|
527
|
+
NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(RhsIsUpper,bool(RhsBlasTraits::NeedToConjugate)),
|
528
|
+
internal::traits<Dest>::Flags&RowMajorBit ? RowMajor : ColMajor,
|
529
|
+
Dest::InnerStrideAtCompileTime>
|
530
|
+
::run(
|
531
|
+
lhs.rows(), rhs.cols(), // sizes
|
532
|
+
&lhs.coeffRef(0,0), lhs.outerStride(), // lhs info
|
533
|
+
&rhs.coeffRef(0,0), rhs.outerStride(), // rhs info
|
534
|
+
&dst.coeffRef(0,0), dst.innerStride(), dst.outerStride(), // result info
|
535
|
+
actualAlpha, blocking // alpha
|
536
|
+
);
|
537
|
+
}
|
538
|
+
};
|
539
|
+
|
540
|
+
} // end namespace internal
|
541
|
+
|
542
|
+
} // end namespace Eigen
|
543
|
+
|
544
|
+
#endif // EIGEN_SELFADJOINT_MATRIX_MATRIX_H
|