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,155 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>
|
5
|
+
// Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef EIGEN_FUZZY_H
|
12
|
+
#define EIGEN_FUZZY_H
|
13
|
+
|
14
|
+
namespace Eigen {
|
15
|
+
|
16
|
+
namespace internal
|
17
|
+
{
|
18
|
+
|
19
|
+
template<typename Derived, typename OtherDerived, bool is_integer = NumTraits<typename Derived::Scalar>::IsInteger>
|
20
|
+
struct isApprox_selector
|
21
|
+
{
|
22
|
+
EIGEN_DEVICE_FUNC
|
23
|
+
static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar& prec)
|
24
|
+
{
|
25
|
+
typename internal::nested_eval<Derived,2>::type nested(x);
|
26
|
+
typename internal::nested_eval<OtherDerived,2>::type otherNested(y);
|
27
|
+
return (nested - otherNested).cwiseAbs2().sum() <= prec * prec * numext::mini(nested.cwiseAbs2().sum(), otherNested.cwiseAbs2().sum());
|
28
|
+
}
|
29
|
+
};
|
30
|
+
|
31
|
+
template<typename Derived, typename OtherDerived>
|
32
|
+
struct isApprox_selector<Derived, OtherDerived, true>
|
33
|
+
{
|
34
|
+
EIGEN_DEVICE_FUNC
|
35
|
+
static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar&)
|
36
|
+
{
|
37
|
+
return x.matrix() == y.matrix();
|
38
|
+
}
|
39
|
+
};
|
40
|
+
|
41
|
+
template<typename Derived, typename OtherDerived, bool is_integer = NumTraits<typename Derived::Scalar>::IsInteger>
|
42
|
+
struct isMuchSmallerThan_object_selector
|
43
|
+
{
|
44
|
+
EIGEN_DEVICE_FUNC
|
45
|
+
static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar& prec)
|
46
|
+
{
|
47
|
+
return x.cwiseAbs2().sum() <= numext::abs2(prec) * y.cwiseAbs2().sum();
|
48
|
+
}
|
49
|
+
};
|
50
|
+
|
51
|
+
template<typename Derived, typename OtherDerived>
|
52
|
+
struct isMuchSmallerThan_object_selector<Derived, OtherDerived, true>
|
53
|
+
{
|
54
|
+
EIGEN_DEVICE_FUNC
|
55
|
+
static bool run(const Derived& x, const OtherDerived&, const typename Derived::RealScalar&)
|
56
|
+
{
|
57
|
+
return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix();
|
58
|
+
}
|
59
|
+
};
|
60
|
+
|
61
|
+
template<typename Derived, bool is_integer = NumTraits<typename Derived::Scalar>::IsInteger>
|
62
|
+
struct isMuchSmallerThan_scalar_selector
|
63
|
+
{
|
64
|
+
EIGEN_DEVICE_FUNC
|
65
|
+
static bool run(const Derived& x, const typename Derived::RealScalar& y, const typename Derived::RealScalar& prec)
|
66
|
+
{
|
67
|
+
return x.cwiseAbs2().sum() <= numext::abs2(prec * y);
|
68
|
+
}
|
69
|
+
};
|
70
|
+
|
71
|
+
template<typename Derived>
|
72
|
+
struct isMuchSmallerThan_scalar_selector<Derived, true>
|
73
|
+
{
|
74
|
+
EIGEN_DEVICE_FUNC
|
75
|
+
static bool run(const Derived& x, const typename Derived::RealScalar&, const typename Derived::RealScalar&)
|
76
|
+
{
|
77
|
+
return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix();
|
78
|
+
}
|
79
|
+
};
|
80
|
+
|
81
|
+
} // end namespace internal
|
82
|
+
|
83
|
+
|
84
|
+
/** \returns \c true if \c *this is approximately equal to \a other, within the precision
|
85
|
+
* determined by \a prec.
|
86
|
+
*
|
87
|
+
* \note The fuzzy compares are done multiplicatively. Two vectors \f$ v \f$ and \f$ w \f$
|
88
|
+
* are considered to be approximately equal within precision \f$ p \f$ if
|
89
|
+
* \f[ \Vert v - w \Vert \leqslant p\,\min(\Vert v\Vert, \Vert w\Vert). \f]
|
90
|
+
* For matrices, the comparison is done using the Hilbert-Schmidt norm (aka Frobenius norm
|
91
|
+
* L2 norm).
|
92
|
+
*
|
93
|
+
* \note Because of the multiplicativeness of this comparison, one can't use this function
|
94
|
+
* to check whether \c *this is approximately equal to the zero matrix or vector.
|
95
|
+
* Indeed, \c isApprox(zero) returns false unless \c *this itself is exactly the zero matrix
|
96
|
+
* or vector. If you want to test whether \c *this is zero, use internal::isMuchSmallerThan(const
|
97
|
+
* RealScalar&, RealScalar) instead.
|
98
|
+
*
|
99
|
+
* \sa internal::isMuchSmallerThan(const RealScalar&, RealScalar) const
|
100
|
+
*/
|
101
|
+
template<typename Derived>
|
102
|
+
template<typename OtherDerived>
|
103
|
+
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isApprox(
|
104
|
+
const DenseBase<OtherDerived>& other,
|
105
|
+
const RealScalar& prec
|
106
|
+
) const
|
107
|
+
{
|
108
|
+
return internal::isApprox_selector<Derived, OtherDerived>::run(derived(), other.derived(), prec);
|
109
|
+
}
|
110
|
+
|
111
|
+
/** \returns \c true if the norm of \c *this is much smaller than \a other,
|
112
|
+
* within the precision determined by \a prec.
|
113
|
+
*
|
114
|
+
* \note The fuzzy compares are done multiplicatively. A vector \f$ v \f$ is
|
115
|
+
* considered to be much smaller than \f$ x \f$ within precision \f$ p \f$ if
|
116
|
+
* \f[ \Vert v \Vert \leqslant p\,\vert x\vert. \f]
|
117
|
+
*
|
118
|
+
* For matrices, the comparison is done using the Hilbert-Schmidt norm. For this reason,
|
119
|
+
* the value of the reference scalar \a other should come from the Hilbert-Schmidt norm
|
120
|
+
* of a reference matrix of same dimensions.
|
121
|
+
*
|
122
|
+
* \sa isApprox(), isMuchSmallerThan(const DenseBase<OtherDerived>&, RealScalar) const
|
123
|
+
*/
|
124
|
+
template<typename Derived>
|
125
|
+
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isMuchSmallerThan(
|
126
|
+
const typename NumTraits<Scalar>::Real& other,
|
127
|
+
const RealScalar& prec
|
128
|
+
) const
|
129
|
+
{
|
130
|
+
return internal::isMuchSmallerThan_scalar_selector<Derived>::run(derived(), other, prec);
|
131
|
+
}
|
132
|
+
|
133
|
+
/** \returns \c true if the norm of \c *this is much smaller than the norm of \a other,
|
134
|
+
* within the precision determined by \a prec.
|
135
|
+
*
|
136
|
+
* \note The fuzzy compares are done multiplicatively. A vector \f$ v \f$ is
|
137
|
+
* considered to be much smaller than a vector \f$ w \f$ within precision \f$ p \f$ if
|
138
|
+
* \f[ \Vert v \Vert \leqslant p\,\Vert w\Vert. \f]
|
139
|
+
* For matrices, the comparison is done using the Hilbert-Schmidt norm.
|
140
|
+
*
|
141
|
+
* \sa isApprox(), isMuchSmallerThan(const RealScalar&, RealScalar) const
|
142
|
+
*/
|
143
|
+
template<typename Derived>
|
144
|
+
template<typename OtherDerived>
|
145
|
+
EIGEN_DEVICE_FUNC bool DenseBase<Derived>::isMuchSmallerThan(
|
146
|
+
const DenseBase<OtherDerived>& other,
|
147
|
+
const RealScalar& prec
|
148
|
+
) const
|
149
|
+
{
|
150
|
+
return internal::isMuchSmallerThan_object_selector<Derived, OtherDerived>::run(derived(), other.derived(), prec);
|
151
|
+
}
|
152
|
+
|
153
|
+
} // end namespace Eigen
|
154
|
+
|
155
|
+
#endif // EIGEN_FUZZY_H
|
@@ -0,0 +1,465 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>
|
5
|
+
// Copyright (C) 2008-2011 Gael Guennebaud <gael.guennebaud@inria.fr>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef EIGEN_GENERAL_PRODUCT_H
|
12
|
+
#define EIGEN_GENERAL_PRODUCT_H
|
13
|
+
|
14
|
+
namespace Eigen {
|
15
|
+
|
16
|
+
enum {
|
17
|
+
Large = 2,
|
18
|
+
Small = 3
|
19
|
+
};
|
20
|
+
|
21
|
+
// Define the threshold value to fallback from the generic matrix-matrix product
|
22
|
+
// implementation (heavy) to the lightweight coeff-based product one.
|
23
|
+
// See generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,GemmProduct>
|
24
|
+
// in products/GeneralMatrixMatrix.h for more details.
|
25
|
+
// TODO This threshold should also be used in the compile-time selector below.
|
26
|
+
#ifndef EIGEN_GEMM_TO_COEFFBASED_THRESHOLD
|
27
|
+
// This default value has been obtained on a Haswell architecture.
|
28
|
+
#define EIGEN_GEMM_TO_COEFFBASED_THRESHOLD 20
|
29
|
+
#endif
|
30
|
+
|
31
|
+
namespace internal {
|
32
|
+
|
33
|
+
template<int Rows, int Cols, int Depth> struct product_type_selector;
|
34
|
+
|
35
|
+
template<int Size, int MaxSize> struct product_size_category
|
36
|
+
{
|
37
|
+
enum {
|
38
|
+
#ifndef EIGEN_GPU_COMPILE_PHASE
|
39
|
+
is_large = MaxSize == Dynamic ||
|
40
|
+
Size >= EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD ||
|
41
|
+
(Size==Dynamic && MaxSize>=EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD),
|
42
|
+
#else
|
43
|
+
is_large = 0,
|
44
|
+
#endif
|
45
|
+
value = is_large ? Large
|
46
|
+
: Size == 1 ? 1
|
47
|
+
: Small
|
48
|
+
};
|
49
|
+
};
|
50
|
+
|
51
|
+
template<typename Lhs, typename Rhs> struct product_type
|
52
|
+
{
|
53
|
+
typedef typename remove_all<Lhs>::type _Lhs;
|
54
|
+
typedef typename remove_all<Rhs>::type _Rhs;
|
55
|
+
enum {
|
56
|
+
MaxRows = traits<_Lhs>::MaxRowsAtCompileTime,
|
57
|
+
Rows = traits<_Lhs>::RowsAtCompileTime,
|
58
|
+
MaxCols = traits<_Rhs>::MaxColsAtCompileTime,
|
59
|
+
Cols = traits<_Rhs>::ColsAtCompileTime,
|
60
|
+
MaxDepth = EIGEN_SIZE_MIN_PREFER_FIXED(traits<_Lhs>::MaxColsAtCompileTime,
|
61
|
+
traits<_Rhs>::MaxRowsAtCompileTime),
|
62
|
+
Depth = EIGEN_SIZE_MIN_PREFER_FIXED(traits<_Lhs>::ColsAtCompileTime,
|
63
|
+
traits<_Rhs>::RowsAtCompileTime)
|
64
|
+
};
|
65
|
+
|
66
|
+
// the splitting into different lines of code here, introducing the _select enums and the typedef below,
|
67
|
+
// is to work around an internal compiler error with gcc 4.1 and 4.2.
|
68
|
+
private:
|
69
|
+
enum {
|
70
|
+
rows_select = product_size_category<Rows,MaxRows>::value,
|
71
|
+
cols_select = product_size_category<Cols,MaxCols>::value,
|
72
|
+
depth_select = product_size_category<Depth,MaxDepth>::value
|
73
|
+
};
|
74
|
+
typedef product_type_selector<rows_select, cols_select, depth_select> selector;
|
75
|
+
|
76
|
+
public:
|
77
|
+
enum {
|
78
|
+
value = selector::ret,
|
79
|
+
ret = selector::ret
|
80
|
+
};
|
81
|
+
#ifdef EIGEN_DEBUG_PRODUCT
|
82
|
+
static void debug()
|
83
|
+
{
|
84
|
+
EIGEN_DEBUG_VAR(Rows);
|
85
|
+
EIGEN_DEBUG_VAR(Cols);
|
86
|
+
EIGEN_DEBUG_VAR(Depth);
|
87
|
+
EIGEN_DEBUG_VAR(rows_select);
|
88
|
+
EIGEN_DEBUG_VAR(cols_select);
|
89
|
+
EIGEN_DEBUG_VAR(depth_select);
|
90
|
+
EIGEN_DEBUG_VAR(value);
|
91
|
+
}
|
92
|
+
#endif
|
93
|
+
};
|
94
|
+
|
95
|
+
/* The following allows to select the kind of product at compile time
|
96
|
+
* based on the three dimensions of the product.
|
97
|
+
* This is a compile time mapping from {1,Small,Large}^3 -> {product types} */
|
98
|
+
// FIXME I'm not sure the current mapping is the ideal one.
|
99
|
+
template<int M, int N> struct product_type_selector<M,N,1> { enum { ret = OuterProduct }; };
|
100
|
+
template<int M> struct product_type_selector<M, 1, 1> { enum { ret = LazyCoeffBasedProductMode }; };
|
101
|
+
template<int N> struct product_type_selector<1, N, 1> { enum { ret = LazyCoeffBasedProductMode }; };
|
102
|
+
template<int Depth> struct product_type_selector<1, 1, Depth> { enum { ret = InnerProduct }; };
|
103
|
+
template<> struct product_type_selector<1, 1, 1> { enum { ret = InnerProduct }; };
|
104
|
+
template<> struct product_type_selector<Small,1, Small> { enum { ret = CoeffBasedProductMode }; };
|
105
|
+
template<> struct product_type_selector<1, Small,Small> { enum { ret = CoeffBasedProductMode }; };
|
106
|
+
template<> struct product_type_selector<Small,Small,Small> { enum { ret = CoeffBasedProductMode }; };
|
107
|
+
template<> struct product_type_selector<Small, Small, 1> { enum { ret = LazyCoeffBasedProductMode }; };
|
108
|
+
template<> struct product_type_selector<Small, Large, 1> { enum { ret = LazyCoeffBasedProductMode }; };
|
109
|
+
template<> struct product_type_selector<Large, Small, 1> { enum { ret = LazyCoeffBasedProductMode }; };
|
110
|
+
template<> struct product_type_selector<1, Large,Small> { enum { ret = CoeffBasedProductMode }; };
|
111
|
+
template<> struct product_type_selector<1, Large,Large> { enum { ret = GemvProduct }; };
|
112
|
+
template<> struct product_type_selector<1, Small,Large> { enum { ret = CoeffBasedProductMode }; };
|
113
|
+
template<> struct product_type_selector<Large,1, Small> { enum { ret = CoeffBasedProductMode }; };
|
114
|
+
template<> struct product_type_selector<Large,1, Large> { enum { ret = GemvProduct }; };
|
115
|
+
template<> struct product_type_selector<Small,1, Large> { enum { ret = CoeffBasedProductMode }; };
|
116
|
+
template<> struct product_type_selector<Small,Small,Large> { enum { ret = GemmProduct }; };
|
117
|
+
template<> struct product_type_selector<Large,Small,Large> { enum { ret = GemmProduct }; };
|
118
|
+
template<> struct product_type_selector<Small,Large,Large> { enum { ret = GemmProduct }; };
|
119
|
+
template<> struct product_type_selector<Large,Large,Large> { enum { ret = GemmProduct }; };
|
120
|
+
template<> struct product_type_selector<Large,Small,Small> { enum { ret = CoeffBasedProductMode }; };
|
121
|
+
template<> struct product_type_selector<Small,Large,Small> { enum { ret = CoeffBasedProductMode }; };
|
122
|
+
template<> struct product_type_selector<Large,Large,Small> { enum { ret = GemmProduct }; };
|
123
|
+
|
124
|
+
} // end namespace internal
|
125
|
+
|
126
|
+
/***********************************************************************
|
127
|
+
* Implementation of Inner Vector Vector Product
|
128
|
+
***********************************************************************/
|
129
|
+
|
130
|
+
// FIXME : maybe the "inner product" could return a Scalar
|
131
|
+
// instead of a 1x1 matrix ??
|
132
|
+
// Pro: more natural for the user
|
133
|
+
// Cons: this could be a problem if in a meta unrolled algorithm a matrix-matrix
|
134
|
+
// product ends up to a row-vector times col-vector product... To tackle this use
|
135
|
+
// case, we could have a specialization for Block<MatrixType,1,1> with: operator=(Scalar x);
|
136
|
+
|
137
|
+
/***********************************************************************
|
138
|
+
* Implementation of Outer Vector Vector Product
|
139
|
+
***********************************************************************/
|
140
|
+
|
141
|
+
/***********************************************************************
|
142
|
+
* Implementation of General Matrix Vector Product
|
143
|
+
***********************************************************************/
|
144
|
+
|
145
|
+
/* According to the shape/flags of the matrix we have to distinghish 3 different cases:
|
146
|
+
* 1 - the matrix is col-major, BLAS compatible and M is large => call fast BLAS-like colmajor routine
|
147
|
+
* 2 - the matrix is row-major, BLAS compatible and N is large => call fast BLAS-like rowmajor routine
|
148
|
+
* 3 - all other cases are handled using a simple loop along the outer-storage direction.
|
149
|
+
* Therefore we need a lower level meta selector.
|
150
|
+
* Furthermore, if the matrix is the rhs, then the product has to be transposed.
|
151
|
+
*/
|
152
|
+
namespace internal {
|
153
|
+
|
154
|
+
template<int Side, int StorageOrder, bool BlasCompatible>
|
155
|
+
struct gemv_dense_selector;
|
156
|
+
|
157
|
+
} // end namespace internal
|
158
|
+
|
159
|
+
namespace internal {
|
160
|
+
|
161
|
+
template<typename Scalar,int Size,int MaxSize,bool Cond> struct gemv_static_vector_if;
|
162
|
+
|
163
|
+
template<typename Scalar,int Size,int MaxSize>
|
164
|
+
struct gemv_static_vector_if<Scalar,Size,MaxSize,false>
|
165
|
+
{
|
166
|
+
EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Scalar* data() { eigen_internal_assert(false && "should never be called"); return 0; }
|
167
|
+
};
|
168
|
+
|
169
|
+
template<typename Scalar,int Size>
|
170
|
+
struct gemv_static_vector_if<Scalar,Size,Dynamic,true>
|
171
|
+
{
|
172
|
+
EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Scalar* data() { return 0; }
|
173
|
+
};
|
174
|
+
|
175
|
+
template<typename Scalar,int Size,int MaxSize>
|
176
|
+
struct gemv_static_vector_if<Scalar,Size,MaxSize,true>
|
177
|
+
{
|
178
|
+
enum {
|
179
|
+
ForceAlignment = internal::packet_traits<Scalar>::Vectorizable,
|
180
|
+
PacketSize = internal::packet_traits<Scalar>::size
|
181
|
+
};
|
182
|
+
#if EIGEN_MAX_STATIC_ALIGN_BYTES!=0
|
183
|
+
internal::plain_array<Scalar,EIGEN_SIZE_MIN_PREFER_FIXED(Size,MaxSize),0,EIGEN_PLAIN_ENUM_MIN(AlignedMax,PacketSize)> m_data;
|
184
|
+
EIGEN_STRONG_INLINE Scalar* data() { return m_data.array; }
|
185
|
+
#else
|
186
|
+
// Some architectures cannot align on the stack,
|
187
|
+
// => let's manually enforce alignment by allocating more data and return the address of the first aligned element.
|
188
|
+
internal::plain_array<Scalar,EIGEN_SIZE_MIN_PREFER_FIXED(Size,MaxSize)+(ForceAlignment?EIGEN_MAX_ALIGN_BYTES:0),0> m_data;
|
189
|
+
EIGEN_STRONG_INLINE Scalar* data() {
|
190
|
+
return ForceAlignment
|
191
|
+
? reinterpret_cast<Scalar*>((internal::UIntPtr(m_data.array) & ~(std::size_t(EIGEN_MAX_ALIGN_BYTES-1))) + EIGEN_MAX_ALIGN_BYTES)
|
192
|
+
: m_data.array;
|
193
|
+
}
|
194
|
+
#endif
|
195
|
+
};
|
196
|
+
|
197
|
+
// The vector is on the left => transposition
|
198
|
+
template<int StorageOrder, bool BlasCompatible>
|
199
|
+
struct gemv_dense_selector<OnTheLeft,StorageOrder,BlasCompatible>
|
200
|
+
{
|
201
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
202
|
+
static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
203
|
+
{
|
204
|
+
Transpose<Dest> destT(dest);
|
205
|
+
enum { OtherStorageOrder = StorageOrder == RowMajor ? ColMajor : RowMajor };
|
206
|
+
gemv_dense_selector<OnTheRight,OtherStorageOrder,BlasCompatible>
|
207
|
+
::run(rhs.transpose(), lhs.transpose(), destT, alpha);
|
208
|
+
}
|
209
|
+
};
|
210
|
+
|
211
|
+
template<> struct gemv_dense_selector<OnTheRight,ColMajor,true>
|
212
|
+
{
|
213
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
214
|
+
static inline void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
215
|
+
{
|
216
|
+
typedef typename Lhs::Scalar LhsScalar;
|
217
|
+
typedef typename Rhs::Scalar RhsScalar;
|
218
|
+
typedef typename Dest::Scalar ResScalar;
|
219
|
+
typedef typename Dest::RealScalar RealScalar;
|
220
|
+
|
221
|
+
typedef internal::blas_traits<Lhs> LhsBlasTraits;
|
222
|
+
typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType;
|
223
|
+
typedef internal::blas_traits<Rhs> RhsBlasTraits;
|
224
|
+
typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType;
|
225
|
+
|
226
|
+
typedef Map<Matrix<ResScalar,Dynamic,1>, EIGEN_PLAIN_ENUM_MIN(AlignedMax,internal::packet_traits<ResScalar>::size)> MappedDest;
|
227
|
+
|
228
|
+
ActualLhsType actualLhs = LhsBlasTraits::extract(lhs);
|
229
|
+
ActualRhsType actualRhs = RhsBlasTraits::extract(rhs);
|
230
|
+
|
231
|
+
ResScalar actualAlpha = combine_scalar_factors(alpha, lhs, rhs);
|
232
|
+
|
233
|
+
// make sure Dest is a compile-time vector type (bug 1166)
|
234
|
+
typedef typename conditional<Dest::IsVectorAtCompileTime, Dest, typename Dest::ColXpr>::type ActualDest;
|
235
|
+
|
236
|
+
enum {
|
237
|
+
// FIXME find a way to allow an inner stride on the result if packet_traits<Scalar>::size==1
|
238
|
+
// on, the other hand it is good for the cache to pack the vector anyways...
|
239
|
+
EvalToDestAtCompileTime = (ActualDest::InnerStrideAtCompileTime==1),
|
240
|
+
ComplexByReal = (NumTraits<LhsScalar>::IsComplex) && (!NumTraits<RhsScalar>::IsComplex),
|
241
|
+
MightCannotUseDest = ((!EvalToDestAtCompileTime) || ComplexByReal) && (ActualDest::MaxSizeAtCompileTime!=0)
|
242
|
+
};
|
243
|
+
|
244
|
+
typedef const_blas_data_mapper<LhsScalar,Index,ColMajor> LhsMapper;
|
245
|
+
typedef const_blas_data_mapper<RhsScalar,Index,RowMajor> RhsMapper;
|
246
|
+
RhsScalar compatibleAlpha = get_factor<ResScalar,RhsScalar>::run(actualAlpha);
|
247
|
+
|
248
|
+
if(!MightCannotUseDest)
|
249
|
+
{
|
250
|
+
// shortcut if we are sure to be able to use dest directly,
|
251
|
+
// this ease the compiler to generate cleaner and more optimzized code for most common cases
|
252
|
+
general_matrix_vector_product
|
253
|
+
<Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
|
254
|
+
actualLhs.rows(), actualLhs.cols(),
|
255
|
+
LhsMapper(actualLhs.data(), actualLhs.outerStride()),
|
256
|
+
RhsMapper(actualRhs.data(), actualRhs.innerStride()),
|
257
|
+
dest.data(), 1,
|
258
|
+
compatibleAlpha);
|
259
|
+
}
|
260
|
+
else
|
261
|
+
{
|
262
|
+
gemv_static_vector_if<ResScalar,ActualDest::SizeAtCompileTime,ActualDest::MaxSizeAtCompileTime,MightCannotUseDest> static_dest;
|
263
|
+
|
264
|
+
const bool alphaIsCompatible = (!ComplexByReal) || (numext::imag(actualAlpha)==RealScalar(0));
|
265
|
+
const bool evalToDest = EvalToDestAtCompileTime && alphaIsCompatible;
|
266
|
+
|
267
|
+
ei_declare_aligned_stack_constructed_variable(ResScalar,actualDestPtr,dest.size(),
|
268
|
+
evalToDest ? dest.data() : static_dest.data());
|
269
|
+
|
270
|
+
if(!evalToDest)
|
271
|
+
{
|
272
|
+
#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
273
|
+
Index size = dest.size();
|
274
|
+
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
275
|
+
#endif
|
276
|
+
if(!alphaIsCompatible)
|
277
|
+
{
|
278
|
+
MappedDest(actualDestPtr, dest.size()).setZero();
|
279
|
+
compatibleAlpha = RhsScalar(1);
|
280
|
+
}
|
281
|
+
else
|
282
|
+
MappedDest(actualDestPtr, dest.size()) = dest;
|
283
|
+
}
|
284
|
+
|
285
|
+
general_matrix_vector_product
|
286
|
+
<Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
|
287
|
+
actualLhs.rows(), actualLhs.cols(),
|
288
|
+
LhsMapper(actualLhs.data(), actualLhs.outerStride()),
|
289
|
+
RhsMapper(actualRhs.data(), actualRhs.innerStride()),
|
290
|
+
actualDestPtr, 1,
|
291
|
+
compatibleAlpha);
|
292
|
+
|
293
|
+
if (!evalToDest)
|
294
|
+
{
|
295
|
+
if(!alphaIsCompatible)
|
296
|
+
dest.matrix() += actualAlpha * MappedDest(actualDestPtr, dest.size());
|
297
|
+
else
|
298
|
+
dest = MappedDest(actualDestPtr, dest.size());
|
299
|
+
}
|
300
|
+
}
|
301
|
+
}
|
302
|
+
};
|
303
|
+
|
304
|
+
template<> struct gemv_dense_selector<OnTheRight,RowMajor,true>
|
305
|
+
{
|
306
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
307
|
+
static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
308
|
+
{
|
309
|
+
typedef typename Lhs::Scalar LhsScalar;
|
310
|
+
typedef typename Rhs::Scalar RhsScalar;
|
311
|
+
typedef typename Dest::Scalar ResScalar;
|
312
|
+
|
313
|
+
typedef internal::blas_traits<Lhs> LhsBlasTraits;
|
314
|
+
typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType;
|
315
|
+
typedef internal::blas_traits<Rhs> RhsBlasTraits;
|
316
|
+
typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType;
|
317
|
+
typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned;
|
318
|
+
|
319
|
+
typename add_const<ActualLhsType>::type actualLhs = LhsBlasTraits::extract(lhs);
|
320
|
+
typename add_const<ActualRhsType>::type actualRhs = RhsBlasTraits::extract(rhs);
|
321
|
+
|
322
|
+
ResScalar actualAlpha = combine_scalar_factors(alpha, lhs, rhs);
|
323
|
+
|
324
|
+
enum {
|
325
|
+
// FIXME find a way to allow an inner stride on the result if packet_traits<Scalar>::size==1
|
326
|
+
// on, the other hand it is good for the cache to pack the vector anyways...
|
327
|
+
DirectlyUseRhs = ActualRhsTypeCleaned::InnerStrideAtCompileTime==1 || ActualRhsTypeCleaned::MaxSizeAtCompileTime==0
|
328
|
+
};
|
329
|
+
|
330
|
+
gemv_static_vector_if<RhsScalar,ActualRhsTypeCleaned::SizeAtCompileTime,ActualRhsTypeCleaned::MaxSizeAtCompileTime,!DirectlyUseRhs> static_rhs;
|
331
|
+
|
332
|
+
ei_declare_aligned_stack_constructed_variable(RhsScalar,actualRhsPtr,actualRhs.size(),
|
333
|
+
DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data());
|
334
|
+
|
335
|
+
if(!DirectlyUseRhs)
|
336
|
+
{
|
337
|
+
#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
338
|
+
Index size = actualRhs.size();
|
339
|
+
EIGEN_DENSE_STORAGE_CTOR_PLUGIN
|
340
|
+
#endif
|
341
|
+
Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, actualRhs.size()) = actualRhs;
|
342
|
+
}
|
343
|
+
|
344
|
+
typedef const_blas_data_mapper<LhsScalar,Index,RowMajor> LhsMapper;
|
345
|
+
typedef const_blas_data_mapper<RhsScalar,Index,ColMajor> RhsMapper;
|
346
|
+
general_matrix_vector_product
|
347
|
+
<Index,LhsScalar,LhsMapper,RowMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run(
|
348
|
+
actualLhs.rows(), actualLhs.cols(),
|
349
|
+
LhsMapper(actualLhs.data(), actualLhs.outerStride()),
|
350
|
+
RhsMapper(actualRhsPtr, 1),
|
351
|
+
dest.data(), dest.col(0).innerStride(), //NOTE if dest is not a vector at compile-time, then dest.innerStride() might be wrong. (bug 1166)
|
352
|
+
actualAlpha);
|
353
|
+
}
|
354
|
+
};
|
355
|
+
|
356
|
+
template<> struct gemv_dense_selector<OnTheRight,ColMajor,false>
|
357
|
+
{
|
358
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
359
|
+
static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
360
|
+
{
|
361
|
+
EIGEN_STATIC_ASSERT((!nested_eval<Lhs,1>::Evaluate),EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE);
|
362
|
+
// TODO if rhs is large enough it might be beneficial to make sure that dest is sequentially stored in memory, otherwise use a temp
|
363
|
+
typename nested_eval<Rhs,1>::type actual_rhs(rhs);
|
364
|
+
const Index size = rhs.rows();
|
365
|
+
for(Index k=0; k<size; ++k)
|
366
|
+
dest += (alpha*actual_rhs.coeff(k)) * lhs.col(k);
|
367
|
+
}
|
368
|
+
};
|
369
|
+
|
370
|
+
template<> struct gemv_dense_selector<OnTheRight,RowMajor,false>
|
371
|
+
{
|
372
|
+
template<typename Lhs, typename Rhs, typename Dest>
|
373
|
+
static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha)
|
374
|
+
{
|
375
|
+
EIGEN_STATIC_ASSERT((!nested_eval<Lhs,1>::Evaluate),EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE);
|
376
|
+
typename nested_eval<Rhs,Lhs::RowsAtCompileTime>::type actual_rhs(rhs);
|
377
|
+
const Index rows = dest.rows();
|
378
|
+
for(Index i=0; i<rows; ++i)
|
379
|
+
dest.coeffRef(i) += alpha * (lhs.row(i).cwiseProduct(actual_rhs.transpose())).sum();
|
380
|
+
}
|
381
|
+
};
|
382
|
+
|
383
|
+
} // end namespace internal
|
384
|
+
|
385
|
+
/***************************************************************************
|
386
|
+
* Implementation of matrix base methods
|
387
|
+
***************************************************************************/
|
388
|
+
|
389
|
+
/** \returns the matrix product of \c *this and \a other.
|
390
|
+
*
|
391
|
+
* \note If instead of the matrix product you want the coefficient-wise product, see Cwise::operator*().
|
392
|
+
*
|
393
|
+
* \sa lazyProduct(), operator*=(const MatrixBase&), Cwise::operator*()
|
394
|
+
*/
|
395
|
+
template<typename Derived>
|
396
|
+
template<typename OtherDerived>
|
397
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
|
398
|
+
const Product<Derived, OtherDerived>
|
399
|
+
MatrixBase<Derived>::operator*(const MatrixBase<OtherDerived> &other) const
|
400
|
+
{
|
401
|
+
// A note regarding the function declaration: In MSVC, this function will sometimes
|
402
|
+
// not be inlined since DenseStorage is an unwindable object for dynamic
|
403
|
+
// matrices and product types are holding a member to store the result.
|
404
|
+
// Thus it does not help tagging this function with EIGEN_STRONG_INLINE.
|
405
|
+
enum {
|
406
|
+
ProductIsValid = Derived::ColsAtCompileTime==Dynamic
|
407
|
+
|| OtherDerived::RowsAtCompileTime==Dynamic
|
408
|
+
|| int(Derived::ColsAtCompileTime)==int(OtherDerived::RowsAtCompileTime),
|
409
|
+
AreVectors = Derived::IsVectorAtCompileTime && OtherDerived::IsVectorAtCompileTime,
|
410
|
+
SameSizes = EIGEN_PREDICATE_SAME_MATRIX_SIZE(Derived,OtherDerived)
|
411
|
+
};
|
412
|
+
// note to the lost user:
|
413
|
+
// * for a dot product use: v1.dot(v2)
|
414
|
+
// * for a coeff-wise product use: v1.cwiseProduct(v2)
|
415
|
+
EIGEN_STATIC_ASSERT(ProductIsValid || !(AreVectors && SameSizes),
|
416
|
+
INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS)
|
417
|
+
EIGEN_STATIC_ASSERT(ProductIsValid || !(SameSizes && !AreVectors),
|
418
|
+
INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION)
|
419
|
+
EIGEN_STATIC_ASSERT(ProductIsValid || SameSizes, INVALID_MATRIX_PRODUCT)
|
420
|
+
#ifdef EIGEN_DEBUG_PRODUCT
|
421
|
+
internal::product_type<Derived,OtherDerived>::debug();
|
422
|
+
#endif
|
423
|
+
|
424
|
+
return Product<Derived, OtherDerived>(derived(), other.derived());
|
425
|
+
}
|
426
|
+
|
427
|
+
/** \returns an expression of the matrix product of \c *this and \a other without implicit evaluation.
|
428
|
+
*
|
429
|
+
* The returned product will behave like any other expressions: the coefficients of the product will be
|
430
|
+
* computed once at a time as requested. This might be useful in some extremely rare cases when only
|
431
|
+
* a small and no coherent fraction of the result's coefficients have to be computed.
|
432
|
+
*
|
433
|
+
* \warning This version of the matrix product can be much much slower. So use it only if you know
|
434
|
+
* what you are doing and that you measured a true speed improvement.
|
435
|
+
*
|
436
|
+
* \sa operator*(const MatrixBase&)
|
437
|
+
*/
|
438
|
+
template<typename Derived>
|
439
|
+
template<typename OtherDerived>
|
440
|
+
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE
|
441
|
+
const Product<Derived,OtherDerived,LazyProduct>
|
442
|
+
MatrixBase<Derived>::lazyProduct(const MatrixBase<OtherDerived> &other) const
|
443
|
+
{
|
444
|
+
enum {
|
445
|
+
ProductIsValid = Derived::ColsAtCompileTime==Dynamic
|
446
|
+
|| OtherDerived::RowsAtCompileTime==Dynamic
|
447
|
+
|| int(Derived::ColsAtCompileTime)==int(OtherDerived::RowsAtCompileTime),
|
448
|
+
AreVectors = Derived::IsVectorAtCompileTime && OtherDerived::IsVectorAtCompileTime,
|
449
|
+
SameSizes = EIGEN_PREDICATE_SAME_MATRIX_SIZE(Derived,OtherDerived)
|
450
|
+
};
|
451
|
+
// note to the lost user:
|
452
|
+
// * for a dot product use: v1.dot(v2)
|
453
|
+
// * for a coeff-wise product use: v1.cwiseProduct(v2)
|
454
|
+
EIGEN_STATIC_ASSERT(ProductIsValid || !(AreVectors && SameSizes),
|
455
|
+
INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS)
|
456
|
+
EIGEN_STATIC_ASSERT(ProductIsValid || !(SameSizes && !AreVectors),
|
457
|
+
INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION)
|
458
|
+
EIGEN_STATIC_ASSERT(ProductIsValid || SameSizes, INVALID_MATRIX_PRODUCT)
|
459
|
+
|
460
|
+
return Product<Derived,OtherDerived,LazyProduct>(derived(), other.derived());
|
461
|
+
}
|
462
|
+
|
463
|
+
} // end namespace Eigen
|
464
|
+
|
465
|
+
#endif // EIGEN_PRODUCT_H
|