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,254 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
// Copyright (C) 2010 Daniel Lowengrub <lowdanie@gmail.com>
|
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_SPARSEVIEW_H
|
12
|
+
#define EIGEN_SPARSEVIEW_H
|
13
|
+
|
14
|
+
namespace Eigen {
|
15
|
+
|
16
|
+
namespace internal {
|
17
|
+
|
18
|
+
template<typename MatrixType>
|
19
|
+
struct traits<SparseView<MatrixType> > : traits<MatrixType>
|
20
|
+
{
|
21
|
+
typedef typename MatrixType::StorageIndex StorageIndex;
|
22
|
+
typedef Sparse StorageKind;
|
23
|
+
enum {
|
24
|
+
Flags = int(traits<MatrixType>::Flags) & (RowMajorBit)
|
25
|
+
};
|
26
|
+
};
|
27
|
+
|
28
|
+
} // end namespace internal
|
29
|
+
|
30
|
+
/** \ingroup SparseCore_Module
|
31
|
+
* \class SparseView
|
32
|
+
*
|
33
|
+
* \brief Expression of a dense or sparse matrix with zero or too small values removed
|
34
|
+
*
|
35
|
+
* \tparam MatrixType the type of the object of which we are removing the small entries
|
36
|
+
*
|
37
|
+
* This class represents an expression of a given dense or sparse matrix with
|
38
|
+
* entries smaller than \c reference * \c epsilon are removed.
|
39
|
+
* It is the return type of MatrixBase::sparseView() and SparseMatrixBase::pruned()
|
40
|
+
* and most of the time this is the only way it is used.
|
41
|
+
*
|
42
|
+
* \sa MatrixBase::sparseView(), SparseMatrixBase::pruned()
|
43
|
+
*/
|
44
|
+
template<typename MatrixType>
|
45
|
+
class SparseView : public SparseMatrixBase<SparseView<MatrixType> >
|
46
|
+
{
|
47
|
+
typedef typename MatrixType::Nested MatrixTypeNested;
|
48
|
+
typedef typename internal::remove_all<MatrixTypeNested>::type _MatrixTypeNested;
|
49
|
+
typedef SparseMatrixBase<SparseView > Base;
|
50
|
+
public:
|
51
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(SparseView)
|
52
|
+
typedef typename internal::remove_all<MatrixType>::type NestedExpression;
|
53
|
+
|
54
|
+
explicit SparseView(const MatrixType& mat, const Scalar& reference = Scalar(0),
|
55
|
+
const RealScalar &epsilon = NumTraits<Scalar>::dummy_precision())
|
56
|
+
: m_matrix(mat), m_reference(reference), m_epsilon(epsilon) {}
|
57
|
+
|
58
|
+
inline Index rows() const { return m_matrix.rows(); }
|
59
|
+
inline Index cols() const { return m_matrix.cols(); }
|
60
|
+
|
61
|
+
inline Index innerSize() const { return m_matrix.innerSize(); }
|
62
|
+
inline Index outerSize() const { return m_matrix.outerSize(); }
|
63
|
+
|
64
|
+
/** \returns the nested expression */
|
65
|
+
const typename internal::remove_all<MatrixTypeNested>::type&
|
66
|
+
nestedExpression() const { return m_matrix; }
|
67
|
+
|
68
|
+
Scalar reference() const { return m_reference; }
|
69
|
+
RealScalar epsilon() const { return m_epsilon; }
|
70
|
+
|
71
|
+
protected:
|
72
|
+
MatrixTypeNested m_matrix;
|
73
|
+
Scalar m_reference;
|
74
|
+
RealScalar m_epsilon;
|
75
|
+
};
|
76
|
+
|
77
|
+
namespace internal {
|
78
|
+
|
79
|
+
// TODO find a way to unify the two following variants
|
80
|
+
// This is tricky because implementing an inner iterator on top of an IndexBased evaluator is
|
81
|
+
// not easy because the evaluators do not expose the sizes of the underlying expression.
|
82
|
+
|
83
|
+
template<typename ArgType>
|
84
|
+
struct unary_evaluator<SparseView<ArgType>, IteratorBased>
|
85
|
+
: public evaluator_base<SparseView<ArgType> >
|
86
|
+
{
|
87
|
+
typedef typename evaluator<ArgType>::InnerIterator EvalIterator;
|
88
|
+
public:
|
89
|
+
typedef SparseView<ArgType> XprType;
|
90
|
+
|
91
|
+
class InnerIterator : public EvalIterator
|
92
|
+
{
|
93
|
+
protected:
|
94
|
+
typedef typename XprType::Scalar Scalar;
|
95
|
+
public:
|
96
|
+
|
97
|
+
EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& sve, Index outer)
|
98
|
+
: EvalIterator(sve.m_argImpl,outer), m_view(sve.m_view)
|
99
|
+
{
|
100
|
+
incrementToNonZero();
|
101
|
+
}
|
102
|
+
|
103
|
+
EIGEN_STRONG_INLINE InnerIterator& operator++()
|
104
|
+
{
|
105
|
+
EvalIterator::operator++();
|
106
|
+
incrementToNonZero();
|
107
|
+
return *this;
|
108
|
+
}
|
109
|
+
|
110
|
+
using EvalIterator::value;
|
111
|
+
|
112
|
+
protected:
|
113
|
+
const XprType &m_view;
|
114
|
+
|
115
|
+
private:
|
116
|
+
void incrementToNonZero()
|
117
|
+
{
|
118
|
+
while((bool(*this)) && internal::isMuchSmallerThan(value(), m_view.reference(), m_view.epsilon()))
|
119
|
+
{
|
120
|
+
EvalIterator::operator++();
|
121
|
+
}
|
122
|
+
}
|
123
|
+
};
|
124
|
+
|
125
|
+
enum {
|
126
|
+
CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
|
127
|
+
Flags = XprType::Flags
|
128
|
+
};
|
129
|
+
|
130
|
+
explicit unary_evaluator(const XprType& xpr) : m_argImpl(xpr.nestedExpression()), m_view(xpr) {}
|
131
|
+
|
132
|
+
protected:
|
133
|
+
evaluator<ArgType> m_argImpl;
|
134
|
+
const XprType &m_view;
|
135
|
+
};
|
136
|
+
|
137
|
+
template<typename ArgType>
|
138
|
+
struct unary_evaluator<SparseView<ArgType>, IndexBased>
|
139
|
+
: public evaluator_base<SparseView<ArgType> >
|
140
|
+
{
|
141
|
+
public:
|
142
|
+
typedef SparseView<ArgType> XprType;
|
143
|
+
protected:
|
144
|
+
enum { IsRowMajor = (XprType::Flags&RowMajorBit)==RowMajorBit };
|
145
|
+
typedef typename XprType::Scalar Scalar;
|
146
|
+
typedef typename XprType::StorageIndex StorageIndex;
|
147
|
+
public:
|
148
|
+
|
149
|
+
class InnerIterator
|
150
|
+
{
|
151
|
+
public:
|
152
|
+
|
153
|
+
EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& sve, Index outer)
|
154
|
+
: m_sve(sve), m_inner(0), m_outer(outer), m_end(sve.m_view.innerSize())
|
155
|
+
{
|
156
|
+
incrementToNonZero();
|
157
|
+
}
|
158
|
+
|
159
|
+
EIGEN_STRONG_INLINE InnerIterator& operator++()
|
160
|
+
{
|
161
|
+
m_inner++;
|
162
|
+
incrementToNonZero();
|
163
|
+
return *this;
|
164
|
+
}
|
165
|
+
|
166
|
+
EIGEN_STRONG_INLINE Scalar value() const
|
167
|
+
{
|
168
|
+
return (IsRowMajor) ? m_sve.m_argImpl.coeff(m_outer, m_inner)
|
169
|
+
: m_sve.m_argImpl.coeff(m_inner, m_outer);
|
170
|
+
}
|
171
|
+
|
172
|
+
EIGEN_STRONG_INLINE StorageIndex index() const { return m_inner; }
|
173
|
+
inline Index row() const { return IsRowMajor ? m_outer : index(); }
|
174
|
+
inline Index col() const { return IsRowMajor ? index() : m_outer; }
|
175
|
+
|
176
|
+
EIGEN_STRONG_INLINE operator bool() const { return m_inner < m_end && m_inner>=0; }
|
177
|
+
|
178
|
+
protected:
|
179
|
+
const unary_evaluator &m_sve;
|
180
|
+
Index m_inner;
|
181
|
+
const Index m_outer;
|
182
|
+
const Index m_end;
|
183
|
+
|
184
|
+
private:
|
185
|
+
void incrementToNonZero()
|
186
|
+
{
|
187
|
+
while((bool(*this)) && internal::isMuchSmallerThan(value(), m_sve.m_view.reference(), m_sve.m_view.epsilon()))
|
188
|
+
{
|
189
|
+
m_inner++;
|
190
|
+
}
|
191
|
+
}
|
192
|
+
};
|
193
|
+
|
194
|
+
enum {
|
195
|
+
CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
|
196
|
+
Flags = XprType::Flags
|
197
|
+
};
|
198
|
+
|
199
|
+
explicit unary_evaluator(const XprType& xpr) : m_argImpl(xpr.nestedExpression()), m_view(xpr) {}
|
200
|
+
|
201
|
+
protected:
|
202
|
+
evaluator<ArgType> m_argImpl;
|
203
|
+
const XprType &m_view;
|
204
|
+
};
|
205
|
+
|
206
|
+
} // end namespace internal
|
207
|
+
|
208
|
+
/** \ingroup SparseCore_Module
|
209
|
+
*
|
210
|
+
* \returns a sparse expression of the dense expression \c *this with values smaller than
|
211
|
+
* \a reference * \a epsilon removed.
|
212
|
+
*
|
213
|
+
* This method is typically used when prototyping to convert a quickly assembled dense Matrix \c D to a SparseMatrix \c S:
|
214
|
+
* \code
|
215
|
+
* MatrixXd D(n,m);
|
216
|
+
* SparseMatrix<double> S;
|
217
|
+
* S = D.sparseView(); // suppress numerical zeros (exact)
|
218
|
+
* S = D.sparseView(reference);
|
219
|
+
* S = D.sparseView(reference,epsilon);
|
220
|
+
* \endcode
|
221
|
+
* where \a reference is a meaningful non zero reference value,
|
222
|
+
* and \a epsilon is a tolerance factor defaulting to NumTraits<Scalar>::dummy_precision().
|
223
|
+
*
|
224
|
+
* \sa SparseMatrixBase::pruned(), class SparseView */
|
225
|
+
template<typename Derived>
|
226
|
+
const SparseView<Derived> MatrixBase<Derived>::sparseView(const Scalar& reference,
|
227
|
+
const typename NumTraits<Scalar>::Real& epsilon) const
|
228
|
+
{
|
229
|
+
return SparseView<Derived>(derived(), reference, epsilon);
|
230
|
+
}
|
231
|
+
|
232
|
+
/** \returns an expression of \c *this with values smaller than
|
233
|
+
* \a reference * \a epsilon removed.
|
234
|
+
*
|
235
|
+
* This method is typically used in conjunction with the product of two sparse matrices
|
236
|
+
* to automatically prune the smallest values as follows:
|
237
|
+
* \code
|
238
|
+
* C = (A*B).pruned(); // suppress numerical zeros (exact)
|
239
|
+
* C = (A*B).pruned(ref);
|
240
|
+
* C = (A*B).pruned(ref,epsilon);
|
241
|
+
* \endcode
|
242
|
+
* where \c ref is a meaningful non zero reference value.
|
243
|
+
* */
|
244
|
+
template<typename Derived>
|
245
|
+
const SparseView<Derived>
|
246
|
+
SparseMatrixBase<Derived>::pruned(const Scalar& reference,
|
247
|
+
const RealScalar& epsilon) const
|
248
|
+
{
|
249
|
+
return SparseView<Derived>(derived(), reference, epsilon);
|
250
|
+
}
|
251
|
+
|
252
|
+
} // end namespace Eigen
|
253
|
+
|
254
|
+
#endif
|
@@ -0,0 +1,315 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008 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_SPARSETRIANGULARSOLVER_H
|
11
|
+
#define EIGEN_SPARSETRIANGULARSOLVER_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
template<typename Lhs, typename Rhs, int Mode,
|
18
|
+
int UpLo = (Mode & Lower)
|
19
|
+
? Lower
|
20
|
+
: (Mode & Upper)
|
21
|
+
? Upper
|
22
|
+
: -1,
|
23
|
+
int StorageOrder = int(traits<Lhs>::Flags) & RowMajorBit>
|
24
|
+
struct sparse_solve_triangular_selector;
|
25
|
+
|
26
|
+
// forward substitution, row-major
|
27
|
+
template<typename Lhs, typename Rhs, int Mode>
|
28
|
+
struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,RowMajor>
|
29
|
+
{
|
30
|
+
typedef typename Rhs::Scalar Scalar;
|
31
|
+
typedef evaluator<Lhs> LhsEval;
|
32
|
+
typedef typename evaluator<Lhs>::InnerIterator LhsIterator;
|
33
|
+
static void run(const Lhs& lhs, Rhs& other)
|
34
|
+
{
|
35
|
+
LhsEval lhsEval(lhs);
|
36
|
+
for(Index col=0 ; col<other.cols() ; ++col)
|
37
|
+
{
|
38
|
+
for(Index i=0; i<lhs.rows(); ++i)
|
39
|
+
{
|
40
|
+
Scalar tmp = other.coeff(i,col);
|
41
|
+
Scalar lastVal(0);
|
42
|
+
Index lastIndex = 0;
|
43
|
+
for(LhsIterator it(lhsEval, i); it; ++it)
|
44
|
+
{
|
45
|
+
lastVal = it.value();
|
46
|
+
lastIndex = it.index();
|
47
|
+
if(lastIndex==i)
|
48
|
+
break;
|
49
|
+
tmp -= lastVal * other.coeff(lastIndex,col);
|
50
|
+
}
|
51
|
+
if (Mode & UnitDiag)
|
52
|
+
other.coeffRef(i,col) = tmp;
|
53
|
+
else
|
54
|
+
{
|
55
|
+
eigen_assert(lastIndex==i);
|
56
|
+
other.coeffRef(i,col) = tmp/lastVal;
|
57
|
+
}
|
58
|
+
}
|
59
|
+
}
|
60
|
+
}
|
61
|
+
};
|
62
|
+
|
63
|
+
// backward substitution, row-major
|
64
|
+
template<typename Lhs, typename Rhs, int Mode>
|
65
|
+
struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,RowMajor>
|
66
|
+
{
|
67
|
+
typedef typename Rhs::Scalar Scalar;
|
68
|
+
typedef evaluator<Lhs> LhsEval;
|
69
|
+
typedef typename evaluator<Lhs>::InnerIterator LhsIterator;
|
70
|
+
static void run(const Lhs& lhs, Rhs& other)
|
71
|
+
{
|
72
|
+
LhsEval lhsEval(lhs);
|
73
|
+
for(Index col=0 ; col<other.cols() ; ++col)
|
74
|
+
{
|
75
|
+
for(Index i=lhs.rows()-1 ; i>=0 ; --i)
|
76
|
+
{
|
77
|
+
Scalar tmp = other.coeff(i,col);
|
78
|
+
Scalar l_ii(0);
|
79
|
+
LhsIterator it(lhsEval, i);
|
80
|
+
while(it && it.index()<i)
|
81
|
+
++it;
|
82
|
+
if(!(Mode & UnitDiag))
|
83
|
+
{
|
84
|
+
eigen_assert(it && it.index()==i);
|
85
|
+
l_ii = it.value();
|
86
|
+
++it;
|
87
|
+
}
|
88
|
+
else if (it && it.index() == i)
|
89
|
+
++it;
|
90
|
+
for(; it; ++it)
|
91
|
+
{
|
92
|
+
tmp -= it.value() * other.coeff(it.index(),col);
|
93
|
+
}
|
94
|
+
|
95
|
+
if (Mode & UnitDiag) other.coeffRef(i,col) = tmp;
|
96
|
+
else other.coeffRef(i,col) = tmp/l_ii;
|
97
|
+
}
|
98
|
+
}
|
99
|
+
}
|
100
|
+
};
|
101
|
+
|
102
|
+
// forward substitution, col-major
|
103
|
+
template<typename Lhs, typename Rhs, int Mode>
|
104
|
+
struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,ColMajor>
|
105
|
+
{
|
106
|
+
typedef typename Rhs::Scalar Scalar;
|
107
|
+
typedef evaluator<Lhs> LhsEval;
|
108
|
+
typedef typename evaluator<Lhs>::InnerIterator LhsIterator;
|
109
|
+
static void run(const Lhs& lhs, Rhs& other)
|
110
|
+
{
|
111
|
+
LhsEval lhsEval(lhs);
|
112
|
+
for(Index col=0 ; col<other.cols() ; ++col)
|
113
|
+
{
|
114
|
+
for(Index i=0; i<lhs.cols(); ++i)
|
115
|
+
{
|
116
|
+
Scalar& tmp = other.coeffRef(i,col);
|
117
|
+
if (tmp!=Scalar(0)) // optimization when other is actually sparse
|
118
|
+
{
|
119
|
+
LhsIterator it(lhsEval, i);
|
120
|
+
while(it && it.index()<i)
|
121
|
+
++it;
|
122
|
+
if(!(Mode & UnitDiag))
|
123
|
+
{
|
124
|
+
eigen_assert(it && it.index()==i);
|
125
|
+
tmp /= it.value();
|
126
|
+
}
|
127
|
+
if (it && it.index()==i)
|
128
|
+
++it;
|
129
|
+
for(; it; ++it)
|
130
|
+
other.coeffRef(it.index(), col) -= tmp * it.value();
|
131
|
+
}
|
132
|
+
}
|
133
|
+
}
|
134
|
+
}
|
135
|
+
};
|
136
|
+
|
137
|
+
// backward substitution, col-major
|
138
|
+
template<typename Lhs, typename Rhs, int Mode>
|
139
|
+
struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Upper,ColMajor>
|
140
|
+
{
|
141
|
+
typedef typename Rhs::Scalar Scalar;
|
142
|
+
typedef evaluator<Lhs> LhsEval;
|
143
|
+
typedef typename evaluator<Lhs>::InnerIterator LhsIterator;
|
144
|
+
static void run(const Lhs& lhs, Rhs& other)
|
145
|
+
{
|
146
|
+
LhsEval lhsEval(lhs);
|
147
|
+
for(Index col=0 ; col<other.cols() ; ++col)
|
148
|
+
{
|
149
|
+
for(Index i=lhs.cols()-1; i>=0; --i)
|
150
|
+
{
|
151
|
+
Scalar& tmp = other.coeffRef(i,col);
|
152
|
+
if (tmp!=Scalar(0)) // optimization when other is actually sparse
|
153
|
+
{
|
154
|
+
if(!(Mode & UnitDiag))
|
155
|
+
{
|
156
|
+
// TODO replace this by a binary search. make sure the binary search is safe for partially sorted elements
|
157
|
+
LhsIterator it(lhsEval, i);
|
158
|
+
while(it && it.index()!=i)
|
159
|
+
++it;
|
160
|
+
eigen_assert(it && it.index()==i);
|
161
|
+
other.coeffRef(i,col) /= it.value();
|
162
|
+
}
|
163
|
+
LhsIterator it(lhsEval, i);
|
164
|
+
for(; it && it.index()<i; ++it)
|
165
|
+
other.coeffRef(it.index(), col) -= tmp * it.value();
|
166
|
+
}
|
167
|
+
}
|
168
|
+
}
|
169
|
+
}
|
170
|
+
};
|
171
|
+
|
172
|
+
} // end namespace internal
|
173
|
+
|
174
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
175
|
+
|
176
|
+
template<typename ExpressionType,unsigned int Mode>
|
177
|
+
template<typename OtherDerived>
|
178
|
+
void TriangularViewImpl<ExpressionType,Mode,Sparse>::solveInPlace(MatrixBase<OtherDerived>& other) const
|
179
|
+
{
|
180
|
+
eigen_assert(derived().cols() == derived().rows() && derived().cols() == other.rows());
|
181
|
+
eigen_assert((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower)));
|
182
|
+
|
183
|
+
enum { copy = internal::traits<OtherDerived>::Flags & RowMajorBit };
|
184
|
+
|
185
|
+
typedef typename internal::conditional<copy,
|
186
|
+
typename internal::plain_matrix_type_column_major<OtherDerived>::type, OtherDerived&>::type OtherCopy;
|
187
|
+
OtherCopy otherCopy(other.derived());
|
188
|
+
|
189
|
+
internal::sparse_solve_triangular_selector<ExpressionType, typename internal::remove_reference<OtherCopy>::type, Mode>::run(derived().nestedExpression(), otherCopy);
|
190
|
+
|
191
|
+
if (copy)
|
192
|
+
other = otherCopy;
|
193
|
+
}
|
194
|
+
#endif
|
195
|
+
|
196
|
+
// pure sparse path
|
197
|
+
|
198
|
+
namespace internal {
|
199
|
+
|
200
|
+
template<typename Lhs, typename Rhs, int Mode,
|
201
|
+
int UpLo = (Mode & Lower)
|
202
|
+
? Lower
|
203
|
+
: (Mode & Upper)
|
204
|
+
? Upper
|
205
|
+
: -1,
|
206
|
+
int StorageOrder = int(Lhs::Flags) & (RowMajorBit)>
|
207
|
+
struct sparse_solve_triangular_sparse_selector;
|
208
|
+
|
209
|
+
// forward substitution, col-major
|
210
|
+
template<typename Lhs, typename Rhs, int Mode, int UpLo>
|
211
|
+
struct sparse_solve_triangular_sparse_selector<Lhs,Rhs,Mode,UpLo,ColMajor>
|
212
|
+
{
|
213
|
+
typedef typename Rhs::Scalar Scalar;
|
214
|
+
typedef typename promote_index_type<typename traits<Lhs>::StorageIndex,
|
215
|
+
typename traits<Rhs>::StorageIndex>::type StorageIndex;
|
216
|
+
static void run(const Lhs& lhs, Rhs& other)
|
217
|
+
{
|
218
|
+
const bool IsLower = (UpLo==Lower);
|
219
|
+
AmbiVector<Scalar,StorageIndex> tempVector(other.rows()*2);
|
220
|
+
tempVector.setBounds(0,other.rows());
|
221
|
+
|
222
|
+
Rhs res(other.rows(), other.cols());
|
223
|
+
res.reserve(other.nonZeros());
|
224
|
+
|
225
|
+
for(Index col=0 ; col<other.cols() ; ++col)
|
226
|
+
{
|
227
|
+
// FIXME estimate number of non zeros
|
228
|
+
tempVector.init(.99/*float(other.col(col).nonZeros())/float(other.rows())*/);
|
229
|
+
tempVector.setZero();
|
230
|
+
tempVector.restart();
|
231
|
+
for (typename Rhs::InnerIterator rhsIt(other, col); rhsIt; ++rhsIt)
|
232
|
+
{
|
233
|
+
tempVector.coeffRef(rhsIt.index()) = rhsIt.value();
|
234
|
+
}
|
235
|
+
|
236
|
+
for(Index i=IsLower?0:lhs.cols()-1;
|
237
|
+
IsLower?i<lhs.cols():i>=0;
|
238
|
+
i+=IsLower?1:-1)
|
239
|
+
{
|
240
|
+
tempVector.restart();
|
241
|
+
Scalar& ci = tempVector.coeffRef(i);
|
242
|
+
if (ci!=Scalar(0))
|
243
|
+
{
|
244
|
+
// find
|
245
|
+
typename Lhs::InnerIterator it(lhs, i);
|
246
|
+
if(!(Mode & UnitDiag))
|
247
|
+
{
|
248
|
+
if (IsLower)
|
249
|
+
{
|
250
|
+
eigen_assert(it.index()==i);
|
251
|
+
ci /= it.value();
|
252
|
+
}
|
253
|
+
else
|
254
|
+
ci /= lhs.coeff(i,i);
|
255
|
+
}
|
256
|
+
tempVector.restart();
|
257
|
+
if (IsLower)
|
258
|
+
{
|
259
|
+
if (it.index()==i)
|
260
|
+
++it;
|
261
|
+
for(; it; ++it)
|
262
|
+
tempVector.coeffRef(it.index()) -= ci * it.value();
|
263
|
+
}
|
264
|
+
else
|
265
|
+
{
|
266
|
+
for(; it && it.index()<i; ++it)
|
267
|
+
tempVector.coeffRef(it.index()) -= ci * it.value();
|
268
|
+
}
|
269
|
+
}
|
270
|
+
}
|
271
|
+
|
272
|
+
|
273
|
+
Index count = 0;
|
274
|
+
// FIXME compute a reference value to filter zeros
|
275
|
+
for (typename AmbiVector<Scalar,StorageIndex>::Iterator it(tempVector/*,1e-12*/); it; ++it)
|
276
|
+
{
|
277
|
+
++ count;
|
278
|
+
// std::cerr << "fill " << it.index() << ", " << col << "\n";
|
279
|
+
// std::cout << it.value() << " ";
|
280
|
+
// FIXME use insertBack
|
281
|
+
res.insert(it.index(), col) = it.value();
|
282
|
+
}
|
283
|
+
// std::cout << "tempVector.nonZeros() == " << int(count) << " / " << (other.rows()) << "\n";
|
284
|
+
}
|
285
|
+
res.finalize();
|
286
|
+
other = res.markAsRValue();
|
287
|
+
}
|
288
|
+
};
|
289
|
+
|
290
|
+
} // end namespace internal
|
291
|
+
|
292
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
293
|
+
template<typename ExpressionType,unsigned int Mode>
|
294
|
+
template<typename OtherDerived>
|
295
|
+
void TriangularViewImpl<ExpressionType,Mode,Sparse>::solveInPlace(SparseMatrixBase<OtherDerived>& other) const
|
296
|
+
{
|
297
|
+
eigen_assert(derived().cols() == derived().rows() && derived().cols() == other.rows());
|
298
|
+
eigen_assert( (!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower)));
|
299
|
+
|
300
|
+
// enum { copy = internal::traits<OtherDerived>::Flags & RowMajorBit };
|
301
|
+
|
302
|
+
// typedef typename internal::conditional<copy,
|
303
|
+
// typename internal::plain_matrix_type_column_major<OtherDerived>::type, OtherDerived&>::type OtherCopy;
|
304
|
+
// OtherCopy otherCopy(other.derived());
|
305
|
+
|
306
|
+
internal::sparse_solve_triangular_sparse_selector<ExpressionType, OtherDerived, Mode>::run(derived().nestedExpression(), other.derived());
|
307
|
+
|
308
|
+
// if (copy)
|
309
|
+
// other = otherCopy;
|
310
|
+
}
|
311
|
+
#endif
|
312
|
+
|
313
|
+
} // end namespace Eigen
|
314
|
+
|
315
|
+
#endif // EIGEN_SPARSETRIANGULARSOLVER_H
|