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,124 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2014 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_SPARSESOLVERBASE_H
|
11
|
+
#define EIGEN_SPARSESOLVERBASE_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
/** \internal
|
18
|
+
* Helper functions to solve with a sparse right-hand-side and result.
|
19
|
+
* The rhs is decomposed into small vertical panels which are solved through dense temporaries.
|
20
|
+
*/
|
21
|
+
template<typename Decomposition, typename Rhs, typename Dest>
|
22
|
+
typename enable_if<Rhs::ColsAtCompileTime!=1 && Dest::ColsAtCompileTime!=1>::type
|
23
|
+
solve_sparse_through_dense_panels(const Decomposition &dec, const Rhs& rhs, Dest &dest)
|
24
|
+
{
|
25
|
+
EIGEN_STATIC_ASSERT((Dest::Flags&RowMajorBit)==0,THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES);
|
26
|
+
typedef typename Dest::Scalar DestScalar;
|
27
|
+
// we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix.
|
28
|
+
static const Index NbColsAtOnce = 4;
|
29
|
+
Index rhsCols = rhs.cols();
|
30
|
+
Index size = rhs.rows();
|
31
|
+
// the temporary matrices do not need more columns than NbColsAtOnce:
|
32
|
+
Index tmpCols = (std::min)(rhsCols, NbColsAtOnce);
|
33
|
+
Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmp(size,tmpCols);
|
34
|
+
Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmpX(size,tmpCols);
|
35
|
+
for(Index k=0; k<rhsCols; k+=NbColsAtOnce)
|
36
|
+
{
|
37
|
+
Index actualCols = std::min<Index>(rhsCols-k, NbColsAtOnce);
|
38
|
+
tmp.leftCols(actualCols) = rhs.middleCols(k,actualCols);
|
39
|
+
tmpX.leftCols(actualCols) = dec.solve(tmp.leftCols(actualCols));
|
40
|
+
dest.middleCols(k,actualCols) = tmpX.leftCols(actualCols).sparseView();
|
41
|
+
}
|
42
|
+
}
|
43
|
+
|
44
|
+
// Overload for vector as rhs
|
45
|
+
template<typename Decomposition, typename Rhs, typename Dest>
|
46
|
+
typename enable_if<Rhs::ColsAtCompileTime==1 || Dest::ColsAtCompileTime==1>::type
|
47
|
+
solve_sparse_through_dense_panels(const Decomposition &dec, const Rhs& rhs, Dest &dest)
|
48
|
+
{
|
49
|
+
typedef typename Dest::Scalar DestScalar;
|
50
|
+
Index size = rhs.rows();
|
51
|
+
Eigen::Matrix<DestScalar,Dynamic,1> rhs_dense(rhs);
|
52
|
+
Eigen::Matrix<DestScalar,Dynamic,1> dest_dense(size);
|
53
|
+
dest_dense = dec.solve(rhs_dense);
|
54
|
+
dest = dest_dense.sparseView();
|
55
|
+
}
|
56
|
+
|
57
|
+
} // end namespace internal
|
58
|
+
|
59
|
+
/** \class SparseSolverBase
|
60
|
+
* \ingroup SparseCore_Module
|
61
|
+
* \brief A base class for sparse solvers
|
62
|
+
*
|
63
|
+
* \tparam Derived the actual type of the solver.
|
64
|
+
*
|
65
|
+
*/
|
66
|
+
template<typename Derived>
|
67
|
+
class SparseSolverBase : internal::noncopyable
|
68
|
+
{
|
69
|
+
public:
|
70
|
+
|
71
|
+
/** Default constructor */
|
72
|
+
SparseSolverBase()
|
73
|
+
: m_isInitialized(false)
|
74
|
+
{}
|
75
|
+
|
76
|
+
~SparseSolverBase()
|
77
|
+
{}
|
78
|
+
|
79
|
+
Derived& derived() { return *static_cast<Derived*>(this); }
|
80
|
+
const Derived& derived() const { return *static_cast<const Derived*>(this); }
|
81
|
+
|
82
|
+
/** \returns an expression of the solution x of \f$ A x = b \f$ using the current decomposition of A.
|
83
|
+
*
|
84
|
+
* \sa compute()
|
85
|
+
*/
|
86
|
+
template<typename Rhs>
|
87
|
+
inline const Solve<Derived, Rhs>
|
88
|
+
solve(const MatrixBase<Rhs>& b) const
|
89
|
+
{
|
90
|
+
eigen_assert(m_isInitialized && "Solver is not initialized.");
|
91
|
+
eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
|
92
|
+
return Solve<Derived, Rhs>(derived(), b.derived());
|
93
|
+
}
|
94
|
+
|
95
|
+
/** \returns an expression of the solution x of \f$ A x = b \f$ using the current decomposition of A.
|
96
|
+
*
|
97
|
+
* \sa compute()
|
98
|
+
*/
|
99
|
+
template<typename Rhs>
|
100
|
+
inline const Solve<Derived, Rhs>
|
101
|
+
solve(const SparseMatrixBase<Rhs>& b) const
|
102
|
+
{
|
103
|
+
eigen_assert(m_isInitialized && "Solver is not initialized.");
|
104
|
+
eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
|
105
|
+
return Solve<Derived, Rhs>(derived(), b.derived());
|
106
|
+
}
|
107
|
+
|
108
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
109
|
+
/** \internal default implementation of solving with a sparse rhs */
|
110
|
+
template<typename Rhs,typename Dest>
|
111
|
+
void _solve_impl(const SparseMatrixBase<Rhs> &b, SparseMatrixBase<Dest> &dest) const
|
112
|
+
{
|
113
|
+
internal::solve_sparse_through_dense_panels(derived(), b.derived(), dest.derived());
|
114
|
+
}
|
115
|
+
#endif // EIGEN_PARSED_BY_DOXYGEN
|
116
|
+
|
117
|
+
protected:
|
118
|
+
|
119
|
+
mutable bool m_isInitialized;
|
120
|
+
};
|
121
|
+
|
122
|
+
} // end namespace Eigen
|
123
|
+
|
124
|
+
#endif // EIGEN_SPARSESOLVERBASE_H
|
@@ -0,0 +1,198 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008-2014 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_SPARSESPARSEPRODUCTWITHPRUNING_H
|
11
|
+
#define EIGEN_SPARSESPARSEPRODUCTWITHPRUNING_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
|
18
|
+
// perform a pseudo in-place sparse * sparse product assuming all matrices are col major
|
19
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
20
|
+
static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, const typename ResultType::RealScalar& tolerance)
|
21
|
+
{
|
22
|
+
// return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res);
|
23
|
+
|
24
|
+
typedef typename remove_all<Rhs>::type::Scalar RhsScalar;
|
25
|
+
typedef typename remove_all<ResultType>::type::Scalar ResScalar;
|
26
|
+
typedef typename remove_all<Lhs>::type::StorageIndex StorageIndex;
|
27
|
+
|
28
|
+
// make sure to call innerSize/outerSize since we fake the storage order.
|
29
|
+
Index rows = lhs.innerSize();
|
30
|
+
Index cols = rhs.outerSize();
|
31
|
+
//Index size = lhs.outerSize();
|
32
|
+
eigen_assert(lhs.outerSize() == rhs.innerSize());
|
33
|
+
|
34
|
+
// allocate a temporary buffer
|
35
|
+
AmbiVector<ResScalar,StorageIndex> tempVector(rows);
|
36
|
+
|
37
|
+
// mimics a resizeByInnerOuter:
|
38
|
+
if(ResultType::IsRowMajor)
|
39
|
+
res.resize(cols, rows);
|
40
|
+
else
|
41
|
+
res.resize(rows, cols);
|
42
|
+
|
43
|
+
evaluator<Lhs> lhsEval(lhs);
|
44
|
+
evaluator<Rhs> rhsEval(rhs);
|
45
|
+
|
46
|
+
// estimate the number of non zero entries
|
47
|
+
// given a rhs column containing Y non zeros, we assume that the respective Y columns
|
48
|
+
// of the lhs differs in average of one non zeros, thus the number of non zeros for
|
49
|
+
// the product of a rhs column with the lhs is X+Y where X is the average number of non zero
|
50
|
+
// per column of the lhs.
|
51
|
+
// Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs)
|
52
|
+
Index estimated_nnz_prod = lhsEval.nonZerosEstimate() + rhsEval.nonZerosEstimate();
|
53
|
+
|
54
|
+
res.reserve(estimated_nnz_prod);
|
55
|
+
double ratioColRes = double(estimated_nnz_prod)/(double(lhs.rows())*double(rhs.cols()));
|
56
|
+
for (Index j=0; j<cols; ++j)
|
57
|
+
{
|
58
|
+
// FIXME:
|
59
|
+
//double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
|
60
|
+
// let's do a more accurate determination of the nnz ratio for the current column j of res
|
61
|
+
tempVector.init(ratioColRes);
|
62
|
+
tempVector.setZero();
|
63
|
+
for (typename evaluator<Rhs>::InnerIterator rhsIt(rhsEval, j); rhsIt; ++rhsIt)
|
64
|
+
{
|
65
|
+
// FIXME should be written like this: tmp += rhsIt.value() * lhs.col(rhsIt.index())
|
66
|
+
tempVector.restart();
|
67
|
+
RhsScalar x = rhsIt.value();
|
68
|
+
for (typename evaluator<Lhs>::InnerIterator lhsIt(lhsEval, rhsIt.index()); lhsIt; ++lhsIt)
|
69
|
+
{
|
70
|
+
tempVector.coeffRef(lhsIt.index()) += lhsIt.value() * x;
|
71
|
+
}
|
72
|
+
}
|
73
|
+
res.startVec(j);
|
74
|
+
for (typename AmbiVector<ResScalar,StorageIndex>::Iterator it(tempVector,tolerance); it; ++it)
|
75
|
+
res.insertBackByOuterInner(j,it.index()) = it.value();
|
76
|
+
}
|
77
|
+
res.finalize();
|
78
|
+
}
|
79
|
+
|
80
|
+
template<typename Lhs, typename Rhs, typename ResultType,
|
81
|
+
int LhsStorageOrder = traits<Lhs>::Flags&RowMajorBit,
|
82
|
+
int RhsStorageOrder = traits<Rhs>::Flags&RowMajorBit,
|
83
|
+
int ResStorageOrder = traits<ResultType>::Flags&RowMajorBit>
|
84
|
+
struct sparse_sparse_product_with_pruning_selector;
|
85
|
+
|
86
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
87
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,ColMajor>
|
88
|
+
{
|
89
|
+
typedef typename ResultType::RealScalar RealScalar;
|
90
|
+
|
91
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
92
|
+
{
|
93
|
+
typename remove_all<ResultType>::type _res(res.rows(), res.cols());
|
94
|
+
internal::sparse_sparse_product_with_pruning_impl<Lhs,Rhs,ResultType>(lhs, rhs, _res, tolerance);
|
95
|
+
res.swap(_res);
|
96
|
+
}
|
97
|
+
};
|
98
|
+
|
99
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
100
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,RowMajor>
|
101
|
+
{
|
102
|
+
typedef typename ResultType::RealScalar RealScalar;
|
103
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
104
|
+
{
|
105
|
+
// we need a col-major matrix to hold the result
|
106
|
+
typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::StorageIndex> SparseTemporaryType;
|
107
|
+
SparseTemporaryType _res(res.rows(), res.cols());
|
108
|
+
internal::sparse_sparse_product_with_pruning_impl<Lhs,Rhs,SparseTemporaryType>(lhs, rhs, _res, tolerance);
|
109
|
+
res = _res;
|
110
|
+
}
|
111
|
+
};
|
112
|
+
|
113
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
114
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,RowMajor,RowMajor,RowMajor>
|
115
|
+
{
|
116
|
+
typedef typename ResultType::RealScalar RealScalar;
|
117
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
118
|
+
{
|
119
|
+
// let's transpose the product to get a column x column product
|
120
|
+
typename remove_all<ResultType>::type _res(res.rows(), res.cols());
|
121
|
+
internal::sparse_sparse_product_with_pruning_impl<Rhs,Lhs,ResultType>(rhs, lhs, _res, tolerance);
|
122
|
+
res.swap(_res);
|
123
|
+
}
|
124
|
+
};
|
125
|
+
|
126
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
127
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,RowMajor,RowMajor,ColMajor>
|
128
|
+
{
|
129
|
+
typedef typename ResultType::RealScalar RealScalar;
|
130
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
131
|
+
{
|
132
|
+
typedef SparseMatrix<typename Lhs::Scalar,ColMajor,typename Lhs::StorageIndex> ColMajorMatrixLhs;
|
133
|
+
typedef SparseMatrix<typename Rhs::Scalar,ColMajor,typename Lhs::StorageIndex> ColMajorMatrixRhs;
|
134
|
+
ColMajorMatrixLhs colLhs(lhs);
|
135
|
+
ColMajorMatrixRhs colRhs(rhs);
|
136
|
+
internal::sparse_sparse_product_with_pruning_impl<ColMajorMatrixLhs,ColMajorMatrixRhs,ResultType>(colLhs, colRhs, res, tolerance);
|
137
|
+
|
138
|
+
// let's transpose the product to get a column x column product
|
139
|
+
// typedef SparseMatrix<typename ResultType::Scalar> SparseTemporaryType;
|
140
|
+
// SparseTemporaryType _res(res.cols(), res.rows());
|
141
|
+
// sparse_sparse_product_with_pruning_impl<Rhs,Lhs,SparseTemporaryType>(rhs, lhs, _res);
|
142
|
+
// res = _res.transpose();
|
143
|
+
}
|
144
|
+
};
|
145
|
+
|
146
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
147
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,RowMajor,RowMajor>
|
148
|
+
{
|
149
|
+
typedef typename ResultType::RealScalar RealScalar;
|
150
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
151
|
+
{
|
152
|
+
typedef SparseMatrix<typename Lhs::Scalar,RowMajor,typename Lhs::StorageIndex> RowMajorMatrixLhs;
|
153
|
+
RowMajorMatrixLhs rowLhs(lhs);
|
154
|
+
sparse_sparse_product_with_pruning_selector<RowMajorMatrixLhs,Rhs,ResultType,RowMajor,RowMajor>(rowLhs,rhs,res,tolerance);
|
155
|
+
}
|
156
|
+
};
|
157
|
+
|
158
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
159
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,RowMajor,ColMajor,RowMajor>
|
160
|
+
{
|
161
|
+
typedef typename ResultType::RealScalar RealScalar;
|
162
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
163
|
+
{
|
164
|
+
typedef SparseMatrix<typename Rhs::Scalar,RowMajor,typename Lhs::StorageIndex> RowMajorMatrixRhs;
|
165
|
+
RowMajorMatrixRhs rowRhs(rhs);
|
166
|
+
sparse_sparse_product_with_pruning_selector<Lhs,RowMajorMatrixRhs,ResultType,RowMajor,RowMajor,RowMajor>(lhs,rowRhs,res,tolerance);
|
167
|
+
}
|
168
|
+
};
|
169
|
+
|
170
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
171
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,ColMajor,RowMajor,ColMajor>
|
172
|
+
{
|
173
|
+
typedef typename ResultType::RealScalar RealScalar;
|
174
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
175
|
+
{
|
176
|
+
typedef SparseMatrix<typename Rhs::Scalar,ColMajor,typename Lhs::StorageIndex> ColMajorMatrixRhs;
|
177
|
+
ColMajorMatrixRhs colRhs(rhs);
|
178
|
+
internal::sparse_sparse_product_with_pruning_impl<Lhs,ColMajorMatrixRhs,ResultType>(lhs, colRhs, res, tolerance);
|
179
|
+
}
|
180
|
+
};
|
181
|
+
|
182
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
183
|
+
struct sparse_sparse_product_with_pruning_selector<Lhs,Rhs,ResultType,RowMajor,ColMajor,ColMajor>
|
184
|
+
{
|
185
|
+
typedef typename ResultType::RealScalar RealScalar;
|
186
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance)
|
187
|
+
{
|
188
|
+
typedef SparseMatrix<typename Lhs::Scalar,ColMajor,typename Lhs::StorageIndex> ColMajorMatrixLhs;
|
189
|
+
ColMajorMatrixLhs colLhs(lhs);
|
190
|
+
internal::sparse_sparse_product_with_pruning_impl<ColMajorMatrixLhs,Rhs,ResultType>(colLhs, rhs, res, tolerance);
|
191
|
+
}
|
192
|
+
};
|
193
|
+
|
194
|
+
} // end namespace internal
|
195
|
+
|
196
|
+
} // end namespace Eigen
|
197
|
+
|
198
|
+
#endif // EIGEN_SPARSESPARSEPRODUCTWITHPRUNING_H
|
@@ -0,0 +1,92 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008-2015 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_SPARSETRANSPOSE_H
|
11
|
+
#define EIGEN_SPARSETRANSPOSE_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
template<typename MatrixType,int CompressedAccess=int(MatrixType::Flags&CompressedAccessBit)>
|
17
|
+
class SparseTransposeImpl
|
18
|
+
: public SparseMatrixBase<Transpose<MatrixType> >
|
19
|
+
{};
|
20
|
+
|
21
|
+
template<typename MatrixType>
|
22
|
+
class SparseTransposeImpl<MatrixType,CompressedAccessBit>
|
23
|
+
: public SparseCompressedBase<Transpose<MatrixType> >
|
24
|
+
{
|
25
|
+
typedef SparseCompressedBase<Transpose<MatrixType> > Base;
|
26
|
+
public:
|
27
|
+
using Base::derived;
|
28
|
+
typedef typename Base::Scalar Scalar;
|
29
|
+
typedef typename Base::StorageIndex StorageIndex;
|
30
|
+
|
31
|
+
inline Index nonZeros() const { return derived().nestedExpression().nonZeros(); }
|
32
|
+
|
33
|
+
inline const Scalar* valuePtr() const { return derived().nestedExpression().valuePtr(); }
|
34
|
+
inline const StorageIndex* innerIndexPtr() const { return derived().nestedExpression().innerIndexPtr(); }
|
35
|
+
inline const StorageIndex* outerIndexPtr() const { return derived().nestedExpression().outerIndexPtr(); }
|
36
|
+
inline const StorageIndex* innerNonZeroPtr() const { return derived().nestedExpression().innerNonZeroPtr(); }
|
37
|
+
|
38
|
+
inline Scalar* valuePtr() { return derived().nestedExpression().valuePtr(); }
|
39
|
+
inline StorageIndex* innerIndexPtr() { return derived().nestedExpression().innerIndexPtr(); }
|
40
|
+
inline StorageIndex* outerIndexPtr() { return derived().nestedExpression().outerIndexPtr(); }
|
41
|
+
inline StorageIndex* innerNonZeroPtr() { return derived().nestedExpression().innerNonZeroPtr(); }
|
42
|
+
};
|
43
|
+
}
|
44
|
+
|
45
|
+
template<typename MatrixType> class TransposeImpl<MatrixType,Sparse>
|
46
|
+
: public internal::SparseTransposeImpl<MatrixType>
|
47
|
+
{
|
48
|
+
protected:
|
49
|
+
typedef internal::SparseTransposeImpl<MatrixType> Base;
|
50
|
+
};
|
51
|
+
|
52
|
+
namespace internal {
|
53
|
+
|
54
|
+
template<typename ArgType>
|
55
|
+
struct unary_evaluator<Transpose<ArgType>, IteratorBased>
|
56
|
+
: public evaluator_base<Transpose<ArgType> >
|
57
|
+
{
|
58
|
+
typedef typename evaluator<ArgType>::InnerIterator EvalIterator;
|
59
|
+
public:
|
60
|
+
typedef Transpose<ArgType> XprType;
|
61
|
+
|
62
|
+
inline Index nonZerosEstimate() const {
|
63
|
+
return m_argImpl.nonZerosEstimate();
|
64
|
+
}
|
65
|
+
|
66
|
+
class InnerIterator : public EvalIterator
|
67
|
+
{
|
68
|
+
public:
|
69
|
+
EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& unaryOp, Index outer)
|
70
|
+
: EvalIterator(unaryOp.m_argImpl,outer)
|
71
|
+
{}
|
72
|
+
|
73
|
+
Index row() const { return EvalIterator::col(); }
|
74
|
+
Index col() const { return EvalIterator::row(); }
|
75
|
+
};
|
76
|
+
|
77
|
+
enum {
|
78
|
+
CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
|
79
|
+
Flags = XprType::Flags
|
80
|
+
};
|
81
|
+
|
82
|
+
explicit unary_evaluator(const XprType& op) :m_argImpl(op.nestedExpression()) {}
|
83
|
+
|
84
|
+
protected:
|
85
|
+
evaluator<ArgType> m_argImpl;
|
86
|
+
};
|
87
|
+
|
88
|
+
} // end namespace internal
|
89
|
+
|
90
|
+
} // end namespace Eigen
|
91
|
+
|
92
|
+
#endif // EIGEN_SPARSETRANSPOSE_H
|
@@ -0,0 +1,189 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@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_SPARSE_TRIANGULARVIEW_H
|
12
|
+
#define EIGEN_SPARSE_TRIANGULARVIEW_H
|
13
|
+
|
14
|
+
namespace Eigen {
|
15
|
+
|
16
|
+
/** \ingroup SparseCore_Module
|
17
|
+
*
|
18
|
+
* \brief Base class for a triangular part in a \b sparse matrix
|
19
|
+
*
|
20
|
+
* This class is an abstract base class of class TriangularView, and objects of type TriangularViewImpl cannot be instantiated.
|
21
|
+
* It extends class TriangularView with additional methods which are available for sparse expressions only.
|
22
|
+
*
|
23
|
+
* \sa class TriangularView, SparseMatrixBase::triangularView()
|
24
|
+
*/
|
25
|
+
template<typename MatrixType, unsigned int Mode> class TriangularViewImpl<MatrixType,Mode,Sparse>
|
26
|
+
: public SparseMatrixBase<TriangularView<MatrixType,Mode> >
|
27
|
+
{
|
28
|
+
enum { SkipFirst = ((Mode&Lower) && !(MatrixType::Flags&RowMajorBit))
|
29
|
+
|| ((Mode&Upper) && (MatrixType::Flags&RowMajorBit)),
|
30
|
+
SkipLast = !SkipFirst,
|
31
|
+
SkipDiag = (Mode&ZeroDiag) ? 1 : 0,
|
32
|
+
HasUnitDiag = (Mode&UnitDiag) ? 1 : 0
|
33
|
+
};
|
34
|
+
|
35
|
+
typedef TriangularView<MatrixType,Mode> TriangularViewType;
|
36
|
+
|
37
|
+
protected:
|
38
|
+
// dummy solve function to make TriangularView happy.
|
39
|
+
void solve() const;
|
40
|
+
|
41
|
+
typedef SparseMatrixBase<TriangularViewType> Base;
|
42
|
+
public:
|
43
|
+
|
44
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(TriangularViewType)
|
45
|
+
|
46
|
+
typedef typename MatrixType::Nested MatrixTypeNested;
|
47
|
+
typedef typename internal::remove_reference<MatrixTypeNested>::type MatrixTypeNestedNonRef;
|
48
|
+
typedef typename internal::remove_all<MatrixTypeNested>::type MatrixTypeNestedCleaned;
|
49
|
+
|
50
|
+
template<typename RhsType, typename DstType>
|
51
|
+
EIGEN_DEVICE_FUNC
|
52
|
+
EIGEN_STRONG_INLINE void _solve_impl(const RhsType &rhs, DstType &dst) const {
|
53
|
+
if(!(internal::is_same<RhsType,DstType>::value && internal::extract_data(dst) == internal::extract_data(rhs)))
|
54
|
+
dst = rhs;
|
55
|
+
this->solveInPlace(dst);
|
56
|
+
}
|
57
|
+
|
58
|
+
/** Applies the inverse of \c *this to the dense vector or matrix \a other, "in-place" */
|
59
|
+
template<typename OtherDerived> void solveInPlace(MatrixBase<OtherDerived>& other) const;
|
60
|
+
|
61
|
+
/** Applies the inverse of \c *this to the sparse vector or matrix \a other, "in-place" */
|
62
|
+
template<typename OtherDerived> void solveInPlace(SparseMatrixBase<OtherDerived>& other) const;
|
63
|
+
|
64
|
+
};
|
65
|
+
|
66
|
+
namespace internal {
|
67
|
+
|
68
|
+
template<typename ArgType, unsigned int Mode>
|
69
|
+
struct unary_evaluator<TriangularView<ArgType,Mode>, IteratorBased>
|
70
|
+
: evaluator_base<TriangularView<ArgType,Mode> >
|
71
|
+
{
|
72
|
+
typedef TriangularView<ArgType,Mode> XprType;
|
73
|
+
|
74
|
+
protected:
|
75
|
+
|
76
|
+
typedef typename XprType::Scalar Scalar;
|
77
|
+
typedef typename XprType::StorageIndex StorageIndex;
|
78
|
+
typedef typename evaluator<ArgType>::InnerIterator EvalIterator;
|
79
|
+
|
80
|
+
enum { SkipFirst = ((Mode&Lower) && !(ArgType::Flags&RowMajorBit))
|
81
|
+
|| ((Mode&Upper) && (ArgType::Flags&RowMajorBit)),
|
82
|
+
SkipLast = !SkipFirst,
|
83
|
+
SkipDiag = (Mode&ZeroDiag) ? 1 : 0,
|
84
|
+
HasUnitDiag = (Mode&UnitDiag) ? 1 : 0
|
85
|
+
};
|
86
|
+
|
87
|
+
public:
|
88
|
+
|
89
|
+
enum {
|
90
|
+
CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
|
91
|
+
Flags = XprType::Flags
|
92
|
+
};
|
93
|
+
|
94
|
+
explicit unary_evaluator(const XprType &xpr) : m_argImpl(xpr.nestedExpression()), m_arg(xpr.nestedExpression()) {}
|
95
|
+
|
96
|
+
inline Index nonZerosEstimate() const {
|
97
|
+
return m_argImpl.nonZerosEstimate();
|
98
|
+
}
|
99
|
+
|
100
|
+
class InnerIterator : public EvalIterator
|
101
|
+
{
|
102
|
+
typedef EvalIterator Base;
|
103
|
+
public:
|
104
|
+
|
105
|
+
EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& xprEval, Index outer)
|
106
|
+
: Base(xprEval.m_argImpl,outer), m_returnOne(false), m_containsDiag(Base::outer()<xprEval.m_arg.innerSize())
|
107
|
+
{
|
108
|
+
if(SkipFirst)
|
109
|
+
{
|
110
|
+
while((*this) && ((HasUnitDiag||SkipDiag) ? this->index()<=outer : this->index()<outer))
|
111
|
+
Base::operator++();
|
112
|
+
if(HasUnitDiag)
|
113
|
+
m_returnOne = m_containsDiag;
|
114
|
+
}
|
115
|
+
else if(HasUnitDiag && ((!Base::operator bool()) || Base::index()>=Base::outer()))
|
116
|
+
{
|
117
|
+
if((!SkipFirst) && Base::operator bool())
|
118
|
+
Base::operator++();
|
119
|
+
m_returnOne = m_containsDiag;
|
120
|
+
}
|
121
|
+
}
|
122
|
+
|
123
|
+
EIGEN_STRONG_INLINE InnerIterator& operator++()
|
124
|
+
{
|
125
|
+
if(HasUnitDiag && m_returnOne)
|
126
|
+
m_returnOne = false;
|
127
|
+
else
|
128
|
+
{
|
129
|
+
Base::operator++();
|
130
|
+
if(HasUnitDiag && (!SkipFirst) && ((!Base::operator bool()) || Base::index()>=Base::outer()))
|
131
|
+
{
|
132
|
+
if((!SkipFirst) && Base::operator bool())
|
133
|
+
Base::operator++();
|
134
|
+
m_returnOne = m_containsDiag;
|
135
|
+
}
|
136
|
+
}
|
137
|
+
return *this;
|
138
|
+
}
|
139
|
+
|
140
|
+
EIGEN_STRONG_INLINE operator bool() const
|
141
|
+
{
|
142
|
+
if(HasUnitDiag && m_returnOne)
|
143
|
+
return true;
|
144
|
+
if(SkipFirst) return Base::operator bool();
|
145
|
+
else
|
146
|
+
{
|
147
|
+
if (SkipDiag) return (Base::operator bool() && this->index() < this->outer());
|
148
|
+
else return (Base::operator bool() && this->index() <= this->outer());
|
149
|
+
}
|
150
|
+
}
|
151
|
+
|
152
|
+
// inline Index row() const { return (ArgType::Flags&RowMajorBit ? Base::outer() : this->index()); }
|
153
|
+
// inline Index col() const { return (ArgType::Flags&RowMajorBit ? this->index() : Base::outer()); }
|
154
|
+
inline StorageIndex index() const
|
155
|
+
{
|
156
|
+
if(HasUnitDiag && m_returnOne) return internal::convert_index<StorageIndex>(Base::outer());
|
157
|
+
else return Base::index();
|
158
|
+
}
|
159
|
+
inline Scalar value() const
|
160
|
+
{
|
161
|
+
if(HasUnitDiag && m_returnOne) return Scalar(1);
|
162
|
+
else return Base::value();
|
163
|
+
}
|
164
|
+
|
165
|
+
protected:
|
166
|
+
bool m_returnOne;
|
167
|
+
bool m_containsDiag;
|
168
|
+
private:
|
169
|
+
Scalar& valueRef();
|
170
|
+
};
|
171
|
+
|
172
|
+
protected:
|
173
|
+
evaluator<ArgType> m_argImpl;
|
174
|
+
const ArgType& m_arg;
|
175
|
+
};
|
176
|
+
|
177
|
+
} // end namespace internal
|
178
|
+
|
179
|
+
template<typename Derived>
|
180
|
+
template<int Mode>
|
181
|
+
inline const TriangularView<const Derived, Mode>
|
182
|
+
SparseMatrixBase<Derived>::triangularView() const
|
183
|
+
{
|
184
|
+
return TriangularView<const Derived, Mode>(derived());
|
185
|
+
}
|
186
|
+
|
187
|
+
} // end namespace Eigen
|
188
|
+
|
189
|
+
#endif // EIGEN_SPARSE_TRIANGULARVIEW_H
|