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,206 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@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
|
+
|
11
|
+
/*
|
12
|
+
|
13
|
+
* NOTE: This file is the modified version of sp_coletree.c file in SuperLU
|
14
|
+
|
15
|
+
* -- SuperLU routine (version 3.1) --
|
16
|
+
* Univ. of California Berkeley, Xerox Palo Alto Research Center,
|
17
|
+
* and Lawrence Berkeley National Lab.
|
18
|
+
* August 1, 2008
|
19
|
+
*
|
20
|
+
* Copyright (c) 1994 by Xerox Corporation. All rights reserved.
|
21
|
+
*
|
22
|
+
* THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
|
23
|
+
* EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
|
24
|
+
*
|
25
|
+
* Permission is hereby granted to use or copy this program for any
|
26
|
+
* purpose, provided the above notices are retained on all copies.
|
27
|
+
* Permission to modify the code and to distribute modified code is
|
28
|
+
* granted, provided the above notices are retained, and a notice that
|
29
|
+
* the code was modified is included with the above copyright notice.
|
30
|
+
*/
|
31
|
+
#ifndef SPARSE_COLETREE_H
|
32
|
+
#define SPARSE_COLETREE_H
|
33
|
+
|
34
|
+
namespace Eigen {
|
35
|
+
|
36
|
+
namespace internal {
|
37
|
+
|
38
|
+
/** Find the root of the tree/set containing the vertex i : Use Path halving */
|
39
|
+
template<typename Index, typename IndexVector>
|
40
|
+
Index etree_find (Index i, IndexVector& pp)
|
41
|
+
{
|
42
|
+
Index p = pp(i); // Parent
|
43
|
+
Index gp = pp(p); // Grand parent
|
44
|
+
while (gp != p)
|
45
|
+
{
|
46
|
+
pp(i) = gp; // Parent pointer on find path is changed to former grand parent
|
47
|
+
i = gp;
|
48
|
+
p = pp(i);
|
49
|
+
gp = pp(p);
|
50
|
+
}
|
51
|
+
return p;
|
52
|
+
}
|
53
|
+
|
54
|
+
/** Compute the column elimination tree of a sparse matrix
|
55
|
+
* \param mat The matrix in column-major format.
|
56
|
+
* \param parent The elimination tree
|
57
|
+
* \param firstRowElt The column index of the first element in each row
|
58
|
+
* \param perm The permutation to apply to the column of \b mat
|
59
|
+
*/
|
60
|
+
template <typename MatrixType, typename IndexVector>
|
61
|
+
int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowElt, typename MatrixType::StorageIndex *perm=0)
|
62
|
+
{
|
63
|
+
typedef typename MatrixType::StorageIndex StorageIndex;
|
64
|
+
StorageIndex nc = convert_index<StorageIndex>(mat.cols()); // Number of columns
|
65
|
+
StorageIndex m = convert_index<StorageIndex>(mat.rows());
|
66
|
+
StorageIndex diagSize = (std::min)(nc,m);
|
67
|
+
IndexVector root(nc); // root of subtree of etree
|
68
|
+
root.setZero();
|
69
|
+
IndexVector pp(nc); // disjoint sets
|
70
|
+
pp.setZero(); // Initialize disjoint sets
|
71
|
+
parent.resize(mat.cols());
|
72
|
+
//Compute first nonzero column in each row
|
73
|
+
firstRowElt.resize(m);
|
74
|
+
firstRowElt.setConstant(nc);
|
75
|
+
firstRowElt.segment(0, diagSize).setLinSpaced(diagSize, 0, diagSize-1);
|
76
|
+
bool found_diag;
|
77
|
+
for (StorageIndex col = 0; col < nc; col++)
|
78
|
+
{
|
79
|
+
StorageIndex pcol = col;
|
80
|
+
if(perm) pcol = perm[col];
|
81
|
+
for (typename MatrixType::InnerIterator it(mat, pcol); it; ++it)
|
82
|
+
{
|
83
|
+
Index row = it.row();
|
84
|
+
firstRowElt(row) = (std::min)(firstRowElt(row), col);
|
85
|
+
}
|
86
|
+
}
|
87
|
+
/* Compute etree by Liu's algorithm for symmetric matrices,
|
88
|
+
except use (firstRowElt[r],c) in place of an edge (r,c) of A.
|
89
|
+
Thus each row clique in A'*A is replaced by a star
|
90
|
+
centered at its first vertex, which has the same fill. */
|
91
|
+
StorageIndex rset, cset, rroot;
|
92
|
+
for (StorageIndex col = 0; col < nc; col++)
|
93
|
+
{
|
94
|
+
found_diag = col>=m;
|
95
|
+
pp(col) = col;
|
96
|
+
cset = col;
|
97
|
+
root(cset) = col;
|
98
|
+
parent(col) = nc;
|
99
|
+
/* The diagonal element is treated here even if it does not exist in the matrix
|
100
|
+
* hence the loop is executed once more */
|
101
|
+
StorageIndex pcol = col;
|
102
|
+
if(perm) pcol = perm[col];
|
103
|
+
for (typename MatrixType::InnerIterator it(mat, pcol); it||!found_diag; ++it)
|
104
|
+
{ // A sequence of interleaved find and union is performed
|
105
|
+
Index i = col;
|
106
|
+
if(it) i = it.index();
|
107
|
+
if (i == col) found_diag = true;
|
108
|
+
|
109
|
+
StorageIndex row = firstRowElt(i);
|
110
|
+
if (row >= col) continue;
|
111
|
+
rset = internal::etree_find(row, pp); // Find the name of the set containing row
|
112
|
+
rroot = root(rset);
|
113
|
+
if (rroot != col)
|
114
|
+
{
|
115
|
+
parent(rroot) = col;
|
116
|
+
pp(cset) = rset;
|
117
|
+
cset = rset;
|
118
|
+
root(cset) = col;
|
119
|
+
}
|
120
|
+
}
|
121
|
+
}
|
122
|
+
return 0;
|
123
|
+
}
|
124
|
+
|
125
|
+
/**
|
126
|
+
* Depth-first search from vertex n. No recursion.
|
127
|
+
* This routine was contributed by Cédric Doucet, CEDRAT Group, Meylan, France.
|
128
|
+
*/
|
129
|
+
template <typename IndexVector>
|
130
|
+
void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVector& post, typename IndexVector::Scalar postnum)
|
131
|
+
{
|
132
|
+
typedef typename IndexVector::Scalar StorageIndex;
|
133
|
+
StorageIndex current = n, first, next;
|
134
|
+
while (postnum != n)
|
135
|
+
{
|
136
|
+
// No kid for the current node
|
137
|
+
first = first_kid(current);
|
138
|
+
|
139
|
+
// no kid for the current node
|
140
|
+
if (first == -1)
|
141
|
+
{
|
142
|
+
// Numbering this node because it has no kid
|
143
|
+
post(current) = postnum++;
|
144
|
+
|
145
|
+
// looking for the next kid
|
146
|
+
next = next_kid(current);
|
147
|
+
while (next == -1)
|
148
|
+
{
|
149
|
+
// No more kids : back to the parent node
|
150
|
+
current = parent(current);
|
151
|
+
// numbering the parent node
|
152
|
+
post(current) = postnum++;
|
153
|
+
|
154
|
+
// Get the next kid
|
155
|
+
next = next_kid(current);
|
156
|
+
}
|
157
|
+
// stopping criterion
|
158
|
+
if (postnum == n+1) return;
|
159
|
+
|
160
|
+
// Updating current node
|
161
|
+
current = next;
|
162
|
+
}
|
163
|
+
else
|
164
|
+
{
|
165
|
+
current = first;
|
166
|
+
}
|
167
|
+
}
|
168
|
+
}
|
169
|
+
|
170
|
+
|
171
|
+
/**
|
172
|
+
* \brief Post order a tree
|
173
|
+
* \param n the number of nodes
|
174
|
+
* \param parent Input tree
|
175
|
+
* \param post postordered tree
|
176
|
+
*/
|
177
|
+
template <typename IndexVector>
|
178
|
+
void treePostorder(typename IndexVector::Scalar n, IndexVector& parent, IndexVector& post)
|
179
|
+
{
|
180
|
+
typedef typename IndexVector::Scalar StorageIndex;
|
181
|
+
IndexVector first_kid, next_kid; // Linked list of children
|
182
|
+
StorageIndex postnum;
|
183
|
+
// Allocate storage for working arrays and results
|
184
|
+
first_kid.resize(n+1);
|
185
|
+
next_kid.setZero(n+1);
|
186
|
+
post.setZero(n+1);
|
187
|
+
|
188
|
+
// Set up structure describing children
|
189
|
+
first_kid.setConstant(-1);
|
190
|
+
for (StorageIndex v = n-1; v >= 0; v--)
|
191
|
+
{
|
192
|
+
StorageIndex dad = parent(v);
|
193
|
+
next_kid(v) = first_kid(dad);
|
194
|
+
first_kid(dad) = v;
|
195
|
+
}
|
196
|
+
|
197
|
+
// Depth-first search from dummy root vertex #n
|
198
|
+
postnum = 0;
|
199
|
+
internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum);
|
200
|
+
}
|
201
|
+
|
202
|
+
} // end namespace internal
|
203
|
+
|
204
|
+
} // end namespace Eigen
|
205
|
+
|
206
|
+
#endif // SPARSE_COLETREE_H
|
@@ -0,0 +1,370 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 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_SPARSE_COMPRESSED_BASE_H
|
11
|
+
#define EIGEN_SPARSE_COMPRESSED_BASE_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
template<typename Derived> class SparseCompressedBase;
|
16
|
+
|
17
|
+
namespace internal {
|
18
|
+
|
19
|
+
template<typename Derived>
|
20
|
+
struct traits<SparseCompressedBase<Derived> > : traits<Derived>
|
21
|
+
{};
|
22
|
+
|
23
|
+
} // end namespace internal
|
24
|
+
|
25
|
+
/** \ingroup SparseCore_Module
|
26
|
+
* \class SparseCompressedBase
|
27
|
+
* \brief Common base class for sparse [compressed]-{row|column}-storage format.
|
28
|
+
*
|
29
|
+
* This class defines the common interface for all derived classes implementing the compressed sparse storage format, such as:
|
30
|
+
* - SparseMatrix
|
31
|
+
* - Ref<SparseMatrixType,Options>
|
32
|
+
* - Map<SparseMatrixType>
|
33
|
+
*
|
34
|
+
*/
|
35
|
+
template<typename Derived>
|
36
|
+
class SparseCompressedBase
|
37
|
+
: public SparseMatrixBase<Derived>
|
38
|
+
{
|
39
|
+
public:
|
40
|
+
typedef SparseMatrixBase<Derived> Base;
|
41
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(SparseCompressedBase)
|
42
|
+
using Base::operator=;
|
43
|
+
using Base::IsRowMajor;
|
44
|
+
|
45
|
+
class InnerIterator;
|
46
|
+
class ReverseInnerIterator;
|
47
|
+
|
48
|
+
protected:
|
49
|
+
typedef typename Base::IndexVector IndexVector;
|
50
|
+
Eigen::Map<IndexVector> innerNonZeros() { return Eigen::Map<IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
|
51
|
+
const Eigen::Map<const IndexVector> innerNonZeros() const { return Eigen::Map<const IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
|
52
|
+
|
53
|
+
public:
|
54
|
+
|
55
|
+
/** \returns the number of non zero coefficients */
|
56
|
+
inline Index nonZeros() const
|
57
|
+
{
|
58
|
+
if(Derived::IsVectorAtCompileTime && outerIndexPtr()==0)
|
59
|
+
return derived().nonZeros();
|
60
|
+
else if(isCompressed())
|
61
|
+
return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0];
|
62
|
+
else if(derived().outerSize()==0)
|
63
|
+
return 0;
|
64
|
+
else
|
65
|
+
return innerNonZeros().sum();
|
66
|
+
}
|
67
|
+
|
68
|
+
/** \returns a const pointer to the array of values.
|
69
|
+
* This function is aimed at interoperability with other libraries.
|
70
|
+
* \sa innerIndexPtr(), outerIndexPtr() */
|
71
|
+
inline const Scalar* valuePtr() const { return derived().valuePtr(); }
|
72
|
+
/** \returns a non-const pointer to the array of values.
|
73
|
+
* This function is aimed at interoperability with other libraries.
|
74
|
+
* \sa innerIndexPtr(), outerIndexPtr() */
|
75
|
+
inline Scalar* valuePtr() { return derived().valuePtr(); }
|
76
|
+
|
77
|
+
/** \returns a const pointer to the array of inner indices.
|
78
|
+
* This function is aimed at interoperability with other libraries.
|
79
|
+
* \sa valuePtr(), outerIndexPtr() */
|
80
|
+
inline const StorageIndex* innerIndexPtr() const { return derived().innerIndexPtr(); }
|
81
|
+
/** \returns a non-const pointer to the array of inner indices.
|
82
|
+
* This function is aimed at interoperability with other libraries.
|
83
|
+
* \sa valuePtr(), outerIndexPtr() */
|
84
|
+
inline StorageIndex* innerIndexPtr() { return derived().innerIndexPtr(); }
|
85
|
+
|
86
|
+
/** \returns a const pointer to the array of the starting positions of the inner vectors.
|
87
|
+
* This function is aimed at interoperability with other libraries.
|
88
|
+
* \warning it returns the null pointer 0 for SparseVector
|
89
|
+
* \sa valuePtr(), innerIndexPtr() */
|
90
|
+
inline const StorageIndex* outerIndexPtr() const { return derived().outerIndexPtr(); }
|
91
|
+
/** \returns a non-const pointer to the array of the starting positions of the inner vectors.
|
92
|
+
* This function is aimed at interoperability with other libraries.
|
93
|
+
* \warning it returns the null pointer 0 for SparseVector
|
94
|
+
* \sa valuePtr(), innerIndexPtr() */
|
95
|
+
inline StorageIndex* outerIndexPtr() { return derived().outerIndexPtr(); }
|
96
|
+
|
97
|
+
/** \returns a const pointer to the array of the number of non zeros of the inner vectors.
|
98
|
+
* This function is aimed at interoperability with other libraries.
|
99
|
+
* \warning it returns the null pointer 0 in compressed mode */
|
100
|
+
inline const StorageIndex* innerNonZeroPtr() const { return derived().innerNonZeroPtr(); }
|
101
|
+
/** \returns a non-const pointer to the array of the number of non zeros of the inner vectors.
|
102
|
+
* This function is aimed at interoperability with other libraries.
|
103
|
+
* \warning it returns the null pointer 0 in compressed mode */
|
104
|
+
inline StorageIndex* innerNonZeroPtr() { return derived().innerNonZeroPtr(); }
|
105
|
+
|
106
|
+
/** \returns whether \c *this is in compressed form. */
|
107
|
+
inline bool isCompressed() const { return innerNonZeroPtr()==0; }
|
108
|
+
|
109
|
+
/** \returns a read-only view of the stored coefficients as a 1D array expression.
|
110
|
+
*
|
111
|
+
* \warning this method is for \b compressed \b storage \b only, and it will trigger an assertion otherwise.
|
112
|
+
*
|
113
|
+
* \sa valuePtr(), isCompressed() */
|
114
|
+
const Map<const Array<Scalar,Dynamic,1> > coeffs() const { eigen_assert(isCompressed()); return Array<Scalar,Dynamic,1>::Map(valuePtr(),nonZeros()); }
|
115
|
+
|
116
|
+
/** \returns a read-write view of the stored coefficients as a 1D array expression
|
117
|
+
*
|
118
|
+
* \warning this method is for \b compressed \b storage \b only, and it will trigger an assertion otherwise.
|
119
|
+
*
|
120
|
+
* Here is an example:
|
121
|
+
* \include SparseMatrix_coeffs.cpp
|
122
|
+
* and the output is:
|
123
|
+
* \include SparseMatrix_coeffs.out
|
124
|
+
*
|
125
|
+
* \sa valuePtr(), isCompressed() */
|
126
|
+
Map<Array<Scalar,Dynamic,1> > coeffs() { eigen_assert(isCompressed()); return Array<Scalar,Dynamic,1>::Map(valuePtr(),nonZeros()); }
|
127
|
+
|
128
|
+
protected:
|
129
|
+
/** Default constructor. Do nothing. */
|
130
|
+
SparseCompressedBase() {}
|
131
|
+
|
132
|
+
/** \internal return the index of the coeff at (row,col) or just before if it does not exist.
|
133
|
+
* This is an analogue of std::lower_bound.
|
134
|
+
*/
|
135
|
+
internal::LowerBoundIndex lower_bound(Index row, Index col) const
|
136
|
+
{
|
137
|
+
eigen_internal_assert(row>=0 && row<this->rows() && col>=0 && col<this->cols());
|
138
|
+
|
139
|
+
const Index outer = Derived::IsRowMajor ? row : col;
|
140
|
+
const Index inner = Derived::IsRowMajor ? col : row;
|
141
|
+
|
142
|
+
Index start = this->outerIndexPtr()[outer];
|
143
|
+
Index end = this->isCompressed() ? this->outerIndexPtr()[outer+1] : this->outerIndexPtr()[outer] + this->innerNonZeroPtr()[outer];
|
144
|
+
eigen_assert(end>=start && "you are using a non finalized sparse matrix or written coefficient does not exist");
|
145
|
+
internal::LowerBoundIndex p;
|
146
|
+
p.value = std::lower_bound(this->innerIndexPtr()+start, this->innerIndexPtr()+end,inner) - this->innerIndexPtr();
|
147
|
+
p.found = (p.value<end) && (this->innerIndexPtr()[p.value]==inner);
|
148
|
+
return p;
|
149
|
+
}
|
150
|
+
|
151
|
+
friend struct internal::evaluator<SparseCompressedBase<Derived> >;
|
152
|
+
|
153
|
+
private:
|
154
|
+
template<typename OtherDerived> explicit SparseCompressedBase(const SparseCompressedBase<OtherDerived>&);
|
155
|
+
};
|
156
|
+
|
157
|
+
template<typename Derived>
|
158
|
+
class SparseCompressedBase<Derived>::InnerIterator
|
159
|
+
{
|
160
|
+
public:
|
161
|
+
InnerIterator()
|
162
|
+
: m_values(0), m_indices(0), m_outer(0), m_id(0), m_end(0)
|
163
|
+
{}
|
164
|
+
|
165
|
+
InnerIterator(const InnerIterator& other)
|
166
|
+
: m_values(other.m_values), m_indices(other.m_indices), m_outer(other.m_outer), m_id(other.m_id), m_end(other.m_end)
|
167
|
+
{}
|
168
|
+
|
169
|
+
InnerIterator& operator=(const InnerIterator& other)
|
170
|
+
{
|
171
|
+
m_values = other.m_values;
|
172
|
+
m_indices = other.m_indices;
|
173
|
+
const_cast<OuterType&>(m_outer).setValue(other.m_outer.value());
|
174
|
+
m_id = other.m_id;
|
175
|
+
m_end = other.m_end;
|
176
|
+
return *this;
|
177
|
+
}
|
178
|
+
|
179
|
+
InnerIterator(const SparseCompressedBase& mat, Index outer)
|
180
|
+
: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer)
|
181
|
+
{
|
182
|
+
if(Derived::IsVectorAtCompileTime && mat.outerIndexPtr()==0)
|
183
|
+
{
|
184
|
+
m_id = 0;
|
185
|
+
m_end = mat.nonZeros();
|
186
|
+
}
|
187
|
+
else
|
188
|
+
{
|
189
|
+
m_id = mat.outerIndexPtr()[outer];
|
190
|
+
if(mat.isCompressed())
|
191
|
+
m_end = mat.outerIndexPtr()[outer+1];
|
192
|
+
else
|
193
|
+
m_end = m_id + mat.innerNonZeroPtr()[outer];
|
194
|
+
}
|
195
|
+
}
|
196
|
+
|
197
|
+
explicit InnerIterator(const SparseCompressedBase& mat)
|
198
|
+
: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_id(0), m_end(mat.nonZeros())
|
199
|
+
{
|
200
|
+
EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived);
|
201
|
+
}
|
202
|
+
|
203
|
+
explicit InnerIterator(const internal::CompressedStorage<Scalar,StorageIndex>& data)
|
204
|
+
: m_values(data.valuePtr()), m_indices(data.indexPtr()), m_outer(0), m_id(0), m_end(data.size())
|
205
|
+
{
|
206
|
+
EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived);
|
207
|
+
}
|
208
|
+
|
209
|
+
inline InnerIterator& operator++() { m_id++; return *this; }
|
210
|
+
inline InnerIterator& operator+=(Index i) { m_id += i ; return *this; }
|
211
|
+
|
212
|
+
inline InnerIterator operator+(Index i)
|
213
|
+
{
|
214
|
+
InnerIterator result = *this;
|
215
|
+
result += i;
|
216
|
+
return result;
|
217
|
+
}
|
218
|
+
|
219
|
+
inline const Scalar& value() const { return m_values[m_id]; }
|
220
|
+
inline Scalar& valueRef() { return const_cast<Scalar&>(m_values[m_id]); }
|
221
|
+
|
222
|
+
inline StorageIndex index() const { return m_indices[m_id]; }
|
223
|
+
inline Index outer() const { return m_outer.value(); }
|
224
|
+
inline Index row() const { return IsRowMajor ? m_outer.value() : index(); }
|
225
|
+
inline Index col() const { return IsRowMajor ? index() : m_outer.value(); }
|
226
|
+
|
227
|
+
inline operator bool() const { return (m_id < m_end); }
|
228
|
+
|
229
|
+
protected:
|
230
|
+
const Scalar* m_values;
|
231
|
+
const StorageIndex* m_indices;
|
232
|
+
typedef internal::variable_if_dynamic<Index,Derived::IsVectorAtCompileTime?0:Dynamic> OuterType;
|
233
|
+
const OuterType m_outer;
|
234
|
+
Index m_id;
|
235
|
+
Index m_end;
|
236
|
+
private:
|
237
|
+
// If you get here, then you're not using the right InnerIterator type, e.g.:
|
238
|
+
// SparseMatrix<double,RowMajor> A;
|
239
|
+
// SparseMatrix<double>::InnerIterator it(A,0);
|
240
|
+
template<typename T> InnerIterator(const SparseMatrixBase<T>&, Index outer);
|
241
|
+
};
|
242
|
+
|
243
|
+
template<typename Derived>
|
244
|
+
class SparseCompressedBase<Derived>::ReverseInnerIterator
|
245
|
+
{
|
246
|
+
public:
|
247
|
+
ReverseInnerIterator(const SparseCompressedBase& mat, Index outer)
|
248
|
+
: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer)
|
249
|
+
{
|
250
|
+
if(Derived::IsVectorAtCompileTime && mat.outerIndexPtr()==0)
|
251
|
+
{
|
252
|
+
m_start = 0;
|
253
|
+
m_id = mat.nonZeros();
|
254
|
+
}
|
255
|
+
else
|
256
|
+
{
|
257
|
+
m_start = mat.outerIndexPtr()[outer];
|
258
|
+
if(mat.isCompressed())
|
259
|
+
m_id = mat.outerIndexPtr()[outer+1];
|
260
|
+
else
|
261
|
+
m_id = m_start + mat.innerNonZeroPtr()[outer];
|
262
|
+
}
|
263
|
+
}
|
264
|
+
|
265
|
+
explicit ReverseInnerIterator(const SparseCompressedBase& mat)
|
266
|
+
: m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_start(0), m_id(mat.nonZeros())
|
267
|
+
{
|
268
|
+
EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived);
|
269
|
+
}
|
270
|
+
|
271
|
+
explicit ReverseInnerIterator(const internal::CompressedStorage<Scalar,StorageIndex>& data)
|
272
|
+
: m_values(data.valuePtr()), m_indices(data.indexPtr()), m_outer(0), m_start(0), m_id(data.size())
|
273
|
+
{
|
274
|
+
EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived);
|
275
|
+
}
|
276
|
+
|
277
|
+
inline ReverseInnerIterator& operator--() { --m_id; return *this; }
|
278
|
+
inline ReverseInnerIterator& operator-=(Index i) { m_id -= i; return *this; }
|
279
|
+
|
280
|
+
inline ReverseInnerIterator operator-(Index i)
|
281
|
+
{
|
282
|
+
ReverseInnerIterator result = *this;
|
283
|
+
result -= i;
|
284
|
+
return result;
|
285
|
+
}
|
286
|
+
|
287
|
+
inline const Scalar& value() const { return m_values[m_id-1]; }
|
288
|
+
inline Scalar& valueRef() { return const_cast<Scalar&>(m_values[m_id-1]); }
|
289
|
+
|
290
|
+
inline StorageIndex index() const { return m_indices[m_id-1]; }
|
291
|
+
inline Index outer() const { return m_outer.value(); }
|
292
|
+
inline Index row() const { return IsRowMajor ? m_outer.value() : index(); }
|
293
|
+
inline Index col() const { return IsRowMajor ? index() : m_outer.value(); }
|
294
|
+
|
295
|
+
inline operator bool() const { return (m_id > m_start); }
|
296
|
+
|
297
|
+
protected:
|
298
|
+
const Scalar* m_values;
|
299
|
+
const StorageIndex* m_indices;
|
300
|
+
typedef internal::variable_if_dynamic<Index,Derived::IsVectorAtCompileTime?0:Dynamic> OuterType;
|
301
|
+
const OuterType m_outer;
|
302
|
+
Index m_start;
|
303
|
+
Index m_id;
|
304
|
+
};
|
305
|
+
|
306
|
+
namespace internal {
|
307
|
+
|
308
|
+
template<typename Derived>
|
309
|
+
struct evaluator<SparseCompressedBase<Derived> >
|
310
|
+
: evaluator_base<Derived>
|
311
|
+
{
|
312
|
+
typedef typename Derived::Scalar Scalar;
|
313
|
+
typedef typename Derived::InnerIterator InnerIterator;
|
314
|
+
|
315
|
+
enum {
|
316
|
+
CoeffReadCost = NumTraits<Scalar>::ReadCost,
|
317
|
+
Flags = Derived::Flags
|
318
|
+
};
|
319
|
+
|
320
|
+
evaluator() : m_matrix(0), m_zero(0)
|
321
|
+
{
|
322
|
+
EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost);
|
323
|
+
}
|
324
|
+
explicit evaluator(const Derived &mat) : m_matrix(&mat), m_zero(0)
|
325
|
+
{
|
326
|
+
EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost);
|
327
|
+
}
|
328
|
+
|
329
|
+
inline Index nonZerosEstimate() const {
|
330
|
+
return m_matrix->nonZeros();
|
331
|
+
}
|
332
|
+
|
333
|
+
operator Derived&() { return m_matrix->const_cast_derived(); }
|
334
|
+
operator const Derived&() const { return *m_matrix; }
|
335
|
+
|
336
|
+
typedef typename DenseCoeffsBase<Derived,ReadOnlyAccessors>::CoeffReturnType CoeffReturnType;
|
337
|
+
const Scalar& coeff(Index row, Index col) const
|
338
|
+
{
|
339
|
+
Index p = find(row,col);
|
340
|
+
|
341
|
+
if(p==Dynamic)
|
342
|
+
return m_zero;
|
343
|
+
else
|
344
|
+
return m_matrix->const_cast_derived().valuePtr()[p];
|
345
|
+
}
|
346
|
+
|
347
|
+
Scalar& coeffRef(Index row, Index col)
|
348
|
+
{
|
349
|
+
Index p = find(row,col);
|
350
|
+
eigen_assert(p!=Dynamic && "written coefficient does not exist");
|
351
|
+
return m_matrix->const_cast_derived().valuePtr()[p];
|
352
|
+
}
|
353
|
+
|
354
|
+
protected:
|
355
|
+
|
356
|
+
Index find(Index row, Index col) const
|
357
|
+
{
|
358
|
+
internal::LowerBoundIndex p = m_matrix->lower_bound(row,col);
|
359
|
+
return p.found ? p.value : Dynamic;
|
360
|
+
}
|
361
|
+
|
362
|
+
const Derived *m_matrix;
|
363
|
+
const Scalar m_zero;
|
364
|
+
};
|
365
|
+
|
366
|
+
}
|
367
|
+
|
368
|
+
} // end namespace Eigen
|
369
|
+
|
370
|
+
#endif // EIGEN_SPARSE_COMPRESSED_BASE_H
|