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,186 @@
|
|
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_SPARSEUTIL_H
|
11
|
+
#define EIGEN_SPARSEUTIL_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
#ifdef NDEBUG
|
16
|
+
#define EIGEN_DBG_SPARSE(X)
|
17
|
+
#else
|
18
|
+
#define EIGEN_DBG_SPARSE(X) X
|
19
|
+
#endif
|
20
|
+
|
21
|
+
#define EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(Derived, Op) \
|
22
|
+
template<typename OtherDerived> \
|
23
|
+
EIGEN_STRONG_INLINE Derived& operator Op(const Eigen::SparseMatrixBase<OtherDerived>& other) \
|
24
|
+
{ \
|
25
|
+
return Base::operator Op(other.derived()); \
|
26
|
+
} \
|
27
|
+
EIGEN_STRONG_INLINE Derived& operator Op(const Derived& other) \
|
28
|
+
{ \
|
29
|
+
return Base::operator Op(other); \
|
30
|
+
}
|
31
|
+
|
32
|
+
#define EIGEN_SPARSE_INHERIT_SCALAR_ASSIGNMENT_OPERATOR(Derived, Op) \
|
33
|
+
template<typename Other> \
|
34
|
+
EIGEN_STRONG_INLINE Derived& operator Op(const Other& scalar) \
|
35
|
+
{ \
|
36
|
+
return Base::operator Op(scalar); \
|
37
|
+
}
|
38
|
+
|
39
|
+
#define EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATORS(Derived) \
|
40
|
+
EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(Derived, =)
|
41
|
+
|
42
|
+
|
43
|
+
#define EIGEN_SPARSE_PUBLIC_INTERFACE(Derived) \
|
44
|
+
EIGEN_GENERIC_PUBLIC_INTERFACE(Derived)
|
45
|
+
|
46
|
+
|
47
|
+
const int CoherentAccessPattern = 0x1;
|
48
|
+
const int InnerRandomAccessPattern = 0x2 | CoherentAccessPattern;
|
49
|
+
const int OuterRandomAccessPattern = 0x4 | CoherentAccessPattern;
|
50
|
+
const int RandomAccessPattern = 0x8 | OuterRandomAccessPattern | InnerRandomAccessPattern;
|
51
|
+
|
52
|
+
template<typename _Scalar, int _Flags = 0, typename _StorageIndex = int> class SparseMatrix;
|
53
|
+
template<typename _Scalar, int _Flags = 0, typename _StorageIndex = int> class DynamicSparseMatrix;
|
54
|
+
template<typename _Scalar, int _Flags = 0, typename _StorageIndex = int> class SparseVector;
|
55
|
+
template<typename _Scalar, int _Flags = 0, typename _StorageIndex = int> class MappedSparseMatrix;
|
56
|
+
|
57
|
+
template<typename MatrixType, unsigned int UpLo> class SparseSelfAdjointView;
|
58
|
+
template<typename Lhs, typename Rhs> class SparseDiagonalProduct;
|
59
|
+
template<typename MatrixType> class SparseView;
|
60
|
+
|
61
|
+
template<typename Lhs, typename Rhs> class SparseSparseProduct;
|
62
|
+
template<typename Lhs, typename Rhs> class SparseTimeDenseProduct;
|
63
|
+
template<typename Lhs, typename Rhs> class DenseTimeSparseProduct;
|
64
|
+
template<typename Lhs, typename Rhs, bool Transpose> class SparseDenseOuterProduct;
|
65
|
+
|
66
|
+
template<typename Lhs, typename Rhs> struct SparseSparseProductReturnType;
|
67
|
+
template<typename Lhs, typename Rhs,
|
68
|
+
int InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(internal::traits<Lhs>::ColsAtCompileTime,internal::traits<Rhs>::RowsAtCompileTime)> struct DenseSparseProductReturnType;
|
69
|
+
|
70
|
+
template<typename Lhs, typename Rhs,
|
71
|
+
int InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(internal::traits<Lhs>::ColsAtCompileTime,internal::traits<Rhs>::RowsAtCompileTime)> struct SparseDenseProductReturnType;
|
72
|
+
template<typename MatrixType,int UpLo> class SparseSymmetricPermutationProduct;
|
73
|
+
|
74
|
+
namespace internal {
|
75
|
+
|
76
|
+
template<typename T,int Rows,int Cols,int Flags> struct sparse_eval;
|
77
|
+
|
78
|
+
template<typename T> struct eval<T,Sparse>
|
79
|
+
: sparse_eval<T, traits<T>::RowsAtCompileTime,traits<T>::ColsAtCompileTime,traits<T>::Flags>
|
80
|
+
{};
|
81
|
+
|
82
|
+
template<typename T,int Cols,int Flags> struct sparse_eval<T,1,Cols,Flags> {
|
83
|
+
typedef typename traits<T>::Scalar _Scalar;
|
84
|
+
typedef typename traits<T>::StorageIndex _StorageIndex;
|
85
|
+
public:
|
86
|
+
typedef SparseVector<_Scalar, RowMajor, _StorageIndex> type;
|
87
|
+
};
|
88
|
+
|
89
|
+
template<typename T,int Rows,int Flags> struct sparse_eval<T,Rows,1,Flags> {
|
90
|
+
typedef typename traits<T>::Scalar _Scalar;
|
91
|
+
typedef typename traits<T>::StorageIndex _StorageIndex;
|
92
|
+
public:
|
93
|
+
typedef SparseVector<_Scalar, ColMajor, _StorageIndex> type;
|
94
|
+
};
|
95
|
+
|
96
|
+
// TODO this seems almost identical to plain_matrix_type<T, Sparse>
|
97
|
+
template<typename T,int Rows,int Cols,int Flags> struct sparse_eval {
|
98
|
+
typedef typename traits<T>::Scalar _Scalar;
|
99
|
+
typedef typename traits<T>::StorageIndex _StorageIndex;
|
100
|
+
enum { _Options = ((Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor };
|
101
|
+
public:
|
102
|
+
typedef SparseMatrix<_Scalar, _Options, _StorageIndex> type;
|
103
|
+
};
|
104
|
+
|
105
|
+
template<typename T,int Flags> struct sparse_eval<T,1,1,Flags> {
|
106
|
+
typedef typename traits<T>::Scalar _Scalar;
|
107
|
+
public:
|
108
|
+
typedef Matrix<_Scalar, 1, 1> type;
|
109
|
+
};
|
110
|
+
|
111
|
+
template<typename T> struct plain_matrix_type<T,Sparse>
|
112
|
+
{
|
113
|
+
typedef typename traits<T>::Scalar _Scalar;
|
114
|
+
typedef typename traits<T>::StorageIndex _StorageIndex;
|
115
|
+
enum { _Options = ((evaluator<T>::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor };
|
116
|
+
public:
|
117
|
+
typedef SparseMatrix<_Scalar, _Options, _StorageIndex> type;
|
118
|
+
};
|
119
|
+
|
120
|
+
template<typename T>
|
121
|
+
struct plain_object_eval<T,Sparse>
|
122
|
+
: sparse_eval<T, traits<T>::RowsAtCompileTime,traits<T>::ColsAtCompileTime, evaluator<T>::Flags>
|
123
|
+
{};
|
124
|
+
|
125
|
+
template<typename Decomposition, typename RhsType>
|
126
|
+
struct solve_traits<Decomposition,RhsType,Sparse>
|
127
|
+
{
|
128
|
+
typedef typename sparse_eval<RhsType, RhsType::RowsAtCompileTime, RhsType::ColsAtCompileTime,traits<RhsType>::Flags>::type PlainObject;
|
129
|
+
};
|
130
|
+
|
131
|
+
template<typename Derived>
|
132
|
+
struct generic_xpr_base<Derived, MatrixXpr, Sparse>
|
133
|
+
{
|
134
|
+
typedef SparseMatrixBase<Derived> type;
|
135
|
+
};
|
136
|
+
|
137
|
+
struct SparseTriangularShape { static std::string debugName() { return "SparseTriangularShape"; } };
|
138
|
+
struct SparseSelfAdjointShape { static std::string debugName() { return "SparseSelfAdjointShape"; } };
|
139
|
+
|
140
|
+
template<> struct glue_shapes<SparseShape,SelfAdjointShape> { typedef SparseSelfAdjointShape type; };
|
141
|
+
template<> struct glue_shapes<SparseShape,TriangularShape > { typedef SparseTriangularShape type; };
|
142
|
+
|
143
|
+
// return type of SparseCompressedBase::lower_bound;
|
144
|
+
struct LowerBoundIndex {
|
145
|
+
LowerBoundIndex() : value(-1), found(false) {}
|
146
|
+
LowerBoundIndex(Index val, bool ok) : value(val), found(ok) {}
|
147
|
+
Index value;
|
148
|
+
bool found;
|
149
|
+
};
|
150
|
+
|
151
|
+
} // end namespace internal
|
152
|
+
|
153
|
+
/** \ingroup SparseCore_Module
|
154
|
+
*
|
155
|
+
* \class Triplet
|
156
|
+
*
|
157
|
+
* \brief A small structure to hold a non zero as a triplet (i,j,value).
|
158
|
+
*
|
159
|
+
* \sa SparseMatrix::setFromTriplets()
|
160
|
+
*/
|
161
|
+
template<typename Scalar, typename StorageIndex=typename SparseMatrix<Scalar>::StorageIndex >
|
162
|
+
class Triplet
|
163
|
+
{
|
164
|
+
public:
|
165
|
+
Triplet() : m_row(0), m_col(0), m_value(0) {}
|
166
|
+
|
167
|
+
Triplet(const StorageIndex& i, const StorageIndex& j, const Scalar& v = Scalar(0))
|
168
|
+
: m_row(i), m_col(j), m_value(v)
|
169
|
+
{}
|
170
|
+
|
171
|
+
/** \returns the row index of the element */
|
172
|
+
const StorageIndex& row() const { return m_row; }
|
173
|
+
|
174
|
+
/** \returns the column index of the element */
|
175
|
+
const StorageIndex& col() const { return m_col; }
|
176
|
+
|
177
|
+
/** \returns the value of the element */
|
178
|
+
const Scalar& value() const { return m_value; }
|
179
|
+
protected:
|
180
|
+
StorageIndex m_row, m_col;
|
181
|
+
Scalar m_value;
|
182
|
+
};
|
183
|
+
|
184
|
+
} // end namespace Eigen
|
185
|
+
|
186
|
+
#endif // EIGEN_SPARSEUTIL_H
|
@@ -0,0 +1,478 @@
|
|
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_SPARSEVECTOR_H
|
11
|
+
#define EIGEN_SPARSEVECTOR_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
/** \ingroup SparseCore_Module
|
16
|
+
* \class SparseVector
|
17
|
+
*
|
18
|
+
* \brief a sparse vector class
|
19
|
+
*
|
20
|
+
* \tparam _Scalar the scalar type, i.e. the type of the coefficients
|
21
|
+
*
|
22
|
+
* See http://www.netlib.org/linalg/html_templates/node91.html for details on the storage scheme.
|
23
|
+
*
|
24
|
+
* This class can be extended with the help of the plugin mechanism described on the page
|
25
|
+
* \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_SPARSEVECTOR_PLUGIN.
|
26
|
+
*/
|
27
|
+
|
28
|
+
namespace internal {
|
29
|
+
template<typename _Scalar, int _Options, typename _StorageIndex>
|
30
|
+
struct traits<SparseVector<_Scalar, _Options, _StorageIndex> >
|
31
|
+
{
|
32
|
+
typedef _Scalar Scalar;
|
33
|
+
typedef _StorageIndex StorageIndex;
|
34
|
+
typedef Sparse StorageKind;
|
35
|
+
typedef MatrixXpr XprKind;
|
36
|
+
enum {
|
37
|
+
IsColVector = (_Options & RowMajorBit) ? 0 : 1,
|
38
|
+
|
39
|
+
RowsAtCompileTime = IsColVector ? Dynamic : 1,
|
40
|
+
ColsAtCompileTime = IsColVector ? 1 : Dynamic,
|
41
|
+
MaxRowsAtCompileTime = RowsAtCompileTime,
|
42
|
+
MaxColsAtCompileTime = ColsAtCompileTime,
|
43
|
+
Flags = _Options | NestByRefBit | LvalueBit | (IsColVector ? 0 : RowMajorBit) | CompressedAccessBit,
|
44
|
+
SupportedAccessPatterns = InnerRandomAccessPattern
|
45
|
+
};
|
46
|
+
};
|
47
|
+
|
48
|
+
// Sparse-Vector-Assignment kinds:
|
49
|
+
enum {
|
50
|
+
SVA_RuntimeSwitch,
|
51
|
+
SVA_Inner,
|
52
|
+
SVA_Outer
|
53
|
+
};
|
54
|
+
|
55
|
+
template< typename Dest, typename Src,
|
56
|
+
int AssignmentKind = !bool(Src::IsVectorAtCompileTime) ? SVA_RuntimeSwitch
|
57
|
+
: Src::InnerSizeAtCompileTime==1 ? SVA_Outer
|
58
|
+
: SVA_Inner>
|
59
|
+
struct sparse_vector_assign_selector;
|
60
|
+
|
61
|
+
}
|
62
|
+
|
63
|
+
template<typename _Scalar, int _Options, typename _StorageIndex>
|
64
|
+
class SparseVector
|
65
|
+
: public SparseCompressedBase<SparseVector<_Scalar, _Options, _StorageIndex> >
|
66
|
+
{
|
67
|
+
typedef SparseCompressedBase<SparseVector> Base;
|
68
|
+
using Base::convert_index;
|
69
|
+
public:
|
70
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(SparseVector)
|
71
|
+
EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(SparseVector, +=)
|
72
|
+
EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(SparseVector, -=)
|
73
|
+
|
74
|
+
typedef internal::CompressedStorage<Scalar,StorageIndex> Storage;
|
75
|
+
enum { IsColVector = internal::traits<SparseVector>::IsColVector };
|
76
|
+
|
77
|
+
enum {
|
78
|
+
Options = _Options
|
79
|
+
};
|
80
|
+
|
81
|
+
EIGEN_STRONG_INLINE Index rows() const { return IsColVector ? m_size : 1; }
|
82
|
+
EIGEN_STRONG_INLINE Index cols() const { return IsColVector ? 1 : m_size; }
|
83
|
+
EIGEN_STRONG_INLINE Index innerSize() const { return m_size; }
|
84
|
+
EIGEN_STRONG_INLINE Index outerSize() const { return 1; }
|
85
|
+
|
86
|
+
EIGEN_STRONG_INLINE const Scalar* valuePtr() const { return m_data.valuePtr(); }
|
87
|
+
EIGEN_STRONG_INLINE Scalar* valuePtr() { return m_data.valuePtr(); }
|
88
|
+
|
89
|
+
EIGEN_STRONG_INLINE const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); }
|
90
|
+
EIGEN_STRONG_INLINE StorageIndex* innerIndexPtr() { return m_data.indexPtr(); }
|
91
|
+
|
92
|
+
inline const StorageIndex* outerIndexPtr() const { return 0; }
|
93
|
+
inline StorageIndex* outerIndexPtr() { return 0; }
|
94
|
+
inline const StorageIndex* innerNonZeroPtr() const { return 0; }
|
95
|
+
inline StorageIndex* innerNonZeroPtr() { return 0; }
|
96
|
+
|
97
|
+
/** \internal */
|
98
|
+
inline Storage& data() { return m_data; }
|
99
|
+
/** \internal */
|
100
|
+
inline const Storage& data() const { return m_data; }
|
101
|
+
|
102
|
+
inline Scalar coeff(Index row, Index col) const
|
103
|
+
{
|
104
|
+
eigen_assert(IsColVector ? (col==0 && row>=0 && row<m_size) : (row==0 && col>=0 && col<m_size));
|
105
|
+
return coeff(IsColVector ? row : col);
|
106
|
+
}
|
107
|
+
inline Scalar coeff(Index i) const
|
108
|
+
{
|
109
|
+
eigen_assert(i>=0 && i<m_size);
|
110
|
+
return m_data.at(StorageIndex(i));
|
111
|
+
}
|
112
|
+
|
113
|
+
inline Scalar& coeffRef(Index row, Index col)
|
114
|
+
{
|
115
|
+
eigen_assert(IsColVector ? (col==0 && row>=0 && row<m_size) : (row==0 && col>=0 && col<m_size));
|
116
|
+
return coeffRef(IsColVector ? row : col);
|
117
|
+
}
|
118
|
+
|
119
|
+
/** \returns a reference to the coefficient value at given index \a i
|
120
|
+
* This operation involes a log(rho*size) binary search. If the coefficient does not
|
121
|
+
* exist yet, then a sorted insertion into a sequential buffer is performed.
|
122
|
+
*
|
123
|
+
* This insertion might be very costly if the number of nonzeros above \a i is large.
|
124
|
+
*/
|
125
|
+
inline Scalar& coeffRef(Index i)
|
126
|
+
{
|
127
|
+
eigen_assert(i>=0 && i<m_size);
|
128
|
+
|
129
|
+
return m_data.atWithInsertion(StorageIndex(i));
|
130
|
+
}
|
131
|
+
|
132
|
+
public:
|
133
|
+
|
134
|
+
typedef typename Base::InnerIterator InnerIterator;
|
135
|
+
typedef typename Base::ReverseInnerIterator ReverseInnerIterator;
|
136
|
+
|
137
|
+
inline void setZero() { m_data.clear(); }
|
138
|
+
|
139
|
+
/** \returns the number of non zero coefficients */
|
140
|
+
inline Index nonZeros() const { return m_data.size(); }
|
141
|
+
|
142
|
+
inline void startVec(Index outer)
|
143
|
+
{
|
144
|
+
EIGEN_UNUSED_VARIABLE(outer);
|
145
|
+
eigen_assert(outer==0);
|
146
|
+
}
|
147
|
+
|
148
|
+
inline Scalar& insertBackByOuterInner(Index outer, Index inner)
|
149
|
+
{
|
150
|
+
EIGEN_UNUSED_VARIABLE(outer);
|
151
|
+
eigen_assert(outer==0);
|
152
|
+
return insertBack(inner);
|
153
|
+
}
|
154
|
+
inline Scalar& insertBack(Index i)
|
155
|
+
{
|
156
|
+
m_data.append(0, i);
|
157
|
+
return m_data.value(m_data.size()-1);
|
158
|
+
}
|
159
|
+
|
160
|
+
Scalar& insertBackByOuterInnerUnordered(Index outer, Index inner)
|
161
|
+
{
|
162
|
+
EIGEN_UNUSED_VARIABLE(outer);
|
163
|
+
eigen_assert(outer==0);
|
164
|
+
return insertBackUnordered(inner);
|
165
|
+
}
|
166
|
+
inline Scalar& insertBackUnordered(Index i)
|
167
|
+
{
|
168
|
+
m_data.append(0, i);
|
169
|
+
return m_data.value(m_data.size()-1);
|
170
|
+
}
|
171
|
+
|
172
|
+
inline Scalar& insert(Index row, Index col)
|
173
|
+
{
|
174
|
+
eigen_assert(IsColVector ? (col==0 && row>=0 && row<m_size) : (row==0 && col>=0 && col<m_size));
|
175
|
+
|
176
|
+
Index inner = IsColVector ? row : col;
|
177
|
+
Index outer = IsColVector ? col : row;
|
178
|
+
EIGEN_ONLY_USED_FOR_DEBUG(outer);
|
179
|
+
eigen_assert(outer==0);
|
180
|
+
return insert(inner);
|
181
|
+
}
|
182
|
+
Scalar& insert(Index i)
|
183
|
+
{
|
184
|
+
eigen_assert(i>=0 && i<m_size);
|
185
|
+
|
186
|
+
Index startId = 0;
|
187
|
+
Index p = Index(m_data.size()) - 1;
|
188
|
+
// TODO smart realloc
|
189
|
+
m_data.resize(p+2,1);
|
190
|
+
|
191
|
+
while ( (p >= startId) && (m_data.index(p) > i) )
|
192
|
+
{
|
193
|
+
m_data.index(p+1) = m_data.index(p);
|
194
|
+
m_data.value(p+1) = m_data.value(p);
|
195
|
+
--p;
|
196
|
+
}
|
197
|
+
m_data.index(p+1) = convert_index(i);
|
198
|
+
m_data.value(p+1) = 0;
|
199
|
+
return m_data.value(p+1);
|
200
|
+
}
|
201
|
+
|
202
|
+
/**
|
203
|
+
*/
|
204
|
+
inline void reserve(Index reserveSize) { m_data.reserve(reserveSize); }
|
205
|
+
|
206
|
+
|
207
|
+
inline void finalize() {}
|
208
|
+
|
209
|
+
/** \copydoc SparseMatrix::prune(const Scalar&,const RealScalar&) */
|
210
|
+
void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits<RealScalar>::dummy_precision())
|
211
|
+
{
|
212
|
+
m_data.prune(reference,epsilon);
|
213
|
+
}
|
214
|
+
|
215
|
+
/** Resizes the sparse vector to \a rows x \a cols
|
216
|
+
*
|
217
|
+
* This method is provided for compatibility with matrices.
|
218
|
+
* For a column vector, \a cols must be equal to 1.
|
219
|
+
* For a row vector, \a rows must be equal to 1.
|
220
|
+
*
|
221
|
+
* \sa resize(Index)
|
222
|
+
*/
|
223
|
+
void resize(Index rows, Index cols)
|
224
|
+
{
|
225
|
+
eigen_assert((IsColVector ? cols : rows)==1 && "Outer dimension must equal 1");
|
226
|
+
resize(IsColVector ? rows : cols);
|
227
|
+
}
|
228
|
+
|
229
|
+
/** Resizes the sparse vector to \a newSize
|
230
|
+
* This method deletes all entries, thus leaving an empty sparse vector
|
231
|
+
*
|
232
|
+
* \sa conservativeResize(), setZero() */
|
233
|
+
void resize(Index newSize)
|
234
|
+
{
|
235
|
+
m_size = newSize;
|
236
|
+
m_data.clear();
|
237
|
+
}
|
238
|
+
|
239
|
+
/** Resizes the sparse vector to \a newSize, while leaving old values untouched.
|
240
|
+
*
|
241
|
+
* If the size of the vector is decreased, then the storage of the out-of bounds coefficients is kept and reserved.
|
242
|
+
* Call .data().squeeze() to free extra memory.
|
243
|
+
*
|
244
|
+
* \sa reserve(), setZero()
|
245
|
+
*/
|
246
|
+
void conservativeResize(Index newSize)
|
247
|
+
{
|
248
|
+
if (newSize < m_size)
|
249
|
+
{
|
250
|
+
Index i = 0;
|
251
|
+
while (i<m_data.size() && m_data.index(i)<newSize) ++i;
|
252
|
+
m_data.resize(i);
|
253
|
+
}
|
254
|
+
m_size = newSize;
|
255
|
+
}
|
256
|
+
|
257
|
+
void resizeNonZeros(Index size) { m_data.resize(size); }
|
258
|
+
|
259
|
+
inline SparseVector() : m_size(0) { check_template_parameters(); resize(0); }
|
260
|
+
|
261
|
+
explicit inline SparseVector(Index size) : m_size(0) { check_template_parameters(); resize(size); }
|
262
|
+
|
263
|
+
inline SparseVector(Index rows, Index cols) : m_size(0) { check_template_parameters(); resize(rows,cols); }
|
264
|
+
|
265
|
+
template<typename OtherDerived>
|
266
|
+
inline SparseVector(const SparseMatrixBase<OtherDerived>& other)
|
267
|
+
: m_size(0)
|
268
|
+
{
|
269
|
+
#ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
|
270
|
+
EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN
|
271
|
+
#endif
|
272
|
+
check_template_parameters();
|
273
|
+
*this = other.derived();
|
274
|
+
}
|
275
|
+
|
276
|
+
inline SparseVector(const SparseVector& other)
|
277
|
+
: Base(other), m_size(0)
|
278
|
+
{
|
279
|
+
check_template_parameters();
|
280
|
+
*this = other.derived();
|
281
|
+
}
|
282
|
+
|
283
|
+
/** Swaps the values of \c *this and \a other.
|
284
|
+
* Overloaded for performance: this version performs a \em shallow swap by swapping pointers and attributes only.
|
285
|
+
* \sa SparseMatrixBase::swap()
|
286
|
+
*/
|
287
|
+
inline void swap(SparseVector& other)
|
288
|
+
{
|
289
|
+
std::swap(m_size, other.m_size);
|
290
|
+
m_data.swap(other.m_data);
|
291
|
+
}
|
292
|
+
|
293
|
+
template<int OtherOptions>
|
294
|
+
inline void swap(SparseMatrix<Scalar,OtherOptions,StorageIndex>& other)
|
295
|
+
{
|
296
|
+
eigen_assert(other.outerSize()==1);
|
297
|
+
std::swap(m_size, other.m_innerSize);
|
298
|
+
m_data.swap(other.m_data);
|
299
|
+
}
|
300
|
+
|
301
|
+
inline SparseVector& operator=(const SparseVector& other)
|
302
|
+
{
|
303
|
+
if (other.isRValue())
|
304
|
+
{
|
305
|
+
swap(other.const_cast_derived());
|
306
|
+
}
|
307
|
+
else
|
308
|
+
{
|
309
|
+
resize(other.size());
|
310
|
+
m_data = other.m_data;
|
311
|
+
}
|
312
|
+
return *this;
|
313
|
+
}
|
314
|
+
|
315
|
+
template<typename OtherDerived>
|
316
|
+
inline SparseVector& operator=(const SparseMatrixBase<OtherDerived>& other)
|
317
|
+
{
|
318
|
+
SparseVector tmp(other.size());
|
319
|
+
internal::sparse_vector_assign_selector<SparseVector,OtherDerived>::run(tmp,other.derived());
|
320
|
+
this->swap(tmp);
|
321
|
+
return *this;
|
322
|
+
}
|
323
|
+
|
324
|
+
#ifndef EIGEN_PARSED_BY_DOXYGEN
|
325
|
+
template<typename Lhs, typename Rhs>
|
326
|
+
inline SparseVector& operator=(const SparseSparseProduct<Lhs,Rhs>& product)
|
327
|
+
{
|
328
|
+
return Base::operator=(product);
|
329
|
+
}
|
330
|
+
#endif
|
331
|
+
|
332
|
+
friend std::ostream & operator << (std::ostream & s, const SparseVector& m)
|
333
|
+
{
|
334
|
+
for (Index i=0; i<m.nonZeros(); ++i)
|
335
|
+
s << "(" << m.m_data.value(i) << "," << m.m_data.index(i) << ") ";
|
336
|
+
s << std::endl;
|
337
|
+
return s;
|
338
|
+
}
|
339
|
+
|
340
|
+
/** Destructor */
|
341
|
+
inline ~SparseVector() {}
|
342
|
+
|
343
|
+
/** Overloaded for performance */
|
344
|
+
Scalar sum() const;
|
345
|
+
|
346
|
+
public:
|
347
|
+
|
348
|
+
/** \internal \deprecated use setZero() and reserve() */
|
349
|
+
EIGEN_DEPRECATED void startFill(Index reserve)
|
350
|
+
{
|
351
|
+
setZero();
|
352
|
+
m_data.reserve(reserve);
|
353
|
+
}
|
354
|
+
|
355
|
+
/** \internal \deprecated use insertBack(Index,Index) */
|
356
|
+
EIGEN_DEPRECATED Scalar& fill(Index r, Index c)
|
357
|
+
{
|
358
|
+
eigen_assert(r==0 || c==0);
|
359
|
+
return fill(IsColVector ? r : c);
|
360
|
+
}
|
361
|
+
|
362
|
+
/** \internal \deprecated use insertBack(Index) */
|
363
|
+
EIGEN_DEPRECATED Scalar& fill(Index i)
|
364
|
+
{
|
365
|
+
m_data.append(0, i);
|
366
|
+
return m_data.value(m_data.size()-1);
|
367
|
+
}
|
368
|
+
|
369
|
+
/** \internal \deprecated use insert(Index,Index) */
|
370
|
+
EIGEN_DEPRECATED Scalar& fillrand(Index r, Index c)
|
371
|
+
{
|
372
|
+
eigen_assert(r==0 || c==0);
|
373
|
+
return fillrand(IsColVector ? r : c);
|
374
|
+
}
|
375
|
+
|
376
|
+
/** \internal \deprecated use insert(Index) */
|
377
|
+
EIGEN_DEPRECATED Scalar& fillrand(Index i)
|
378
|
+
{
|
379
|
+
return insert(i);
|
380
|
+
}
|
381
|
+
|
382
|
+
/** \internal \deprecated use finalize() */
|
383
|
+
EIGEN_DEPRECATED void endFill() {}
|
384
|
+
|
385
|
+
// These two functions were here in the 3.1 release, so let's keep them in case some code rely on them.
|
386
|
+
/** \internal \deprecated use data() */
|
387
|
+
EIGEN_DEPRECATED Storage& _data() { return m_data; }
|
388
|
+
/** \internal \deprecated use data() */
|
389
|
+
EIGEN_DEPRECATED const Storage& _data() const { return m_data; }
|
390
|
+
|
391
|
+
# ifdef EIGEN_SPARSEVECTOR_PLUGIN
|
392
|
+
# include EIGEN_SPARSEVECTOR_PLUGIN
|
393
|
+
# endif
|
394
|
+
|
395
|
+
protected:
|
396
|
+
|
397
|
+
static void check_template_parameters()
|
398
|
+
{
|
399
|
+
EIGEN_STATIC_ASSERT(NumTraits<StorageIndex>::IsSigned,THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE);
|
400
|
+
EIGEN_STATIC_ASSERT((_Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS);
|
401
|
+
}
|
402
|
+
|
403
|
+
Storage m_data;
|
404
|
+
Index m_size;
|
405
|
+
};
|
406
|
+
|
407
|
+
namespace internal {
|
408
|
+
|
409
|
+
template<typename _Scalar, int _Options, typename _Index>
|
410
|
+
struct evaluator<SparseVector<_Scalar,_Options,_Index> >
|
411
|
+
: evaluator_base<SparseVector<_Scalar,_Options,_Index> >
|
412
|
+
{
|
413
|
+
typedef SparseVector<_Scalar,_Options,_Index> SparseVectorType;
|
414
|
+
typedef evaluator_base<SparseVectorType> Base;
|
415
|
+
typedef typename SparseVectorType::InnerIterator InnerIterator;
|
416
|
+
typedef typename SparseVectorType::ReverseInnerIterator ReverseInnerIterator;
|
417
|
+
|
418
|
+
enum {
|
419
|
+
CoeffReadCost = NumTraits<_Scalar>::ReadCost,
|
420
|
+
Flags = SparseVectorType::Flags
|
421
|
+
};
|
422
|
+
|
423
|
+
evaluator() : Base() {}
|
424
|
+
|
425
|
+
explicit evaluator(const SparseVectorType &mat) : m_matrix(&mat)
|
426
|
+
{
|
427
|
+
EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost);
|
428
|
+
}
|
429
|
+
|
430
|
+
inline Index nonZerosEstimate() const {
|
431
|
+
return m_matrix->nonZeros();
|
432
|
+
}
|
433
|
+
|
434
|
+
operator SparseVectorType&() { return m_matrix->const_cast_derived(); }
|
435
|
+
operator const SparseVectorType&() const { return *m_matrix; }
|
436
|
+
|
437
|
+
const SparseVectorType *m_matrix;
|
438
|
+
};
|
439
|
+
|
440
|
+
template< typename Dest, typename Src>
|
441
|
+
struct sparse_vector_assign_selector<Dest,Src,SVA_Inner> {
|
442
|
+
static void run(Dest& dst, const Src& src) {
|
443
|
+
eigen_internal_assert(src.innerSize()==src.size());
|
444
|
+
typedef internal::evaluator<Src> SrcEvaluatorType;
|
445
|
+
SrcEvaluatorType srcEval(src);
|
446
|
+
for(typename SrcEvaluatorType::InnerIterator it(srcEval, 0); it; ++it)
|
447
|
+
dst.insert(it.index()) = it.value();
|
448
|
+
}
|
449
|
+
};
|
450
|
+
|
451
|
+
template< typename Dest, typename Src>
|
452
|
+
struct sparse_vector_assign_selector<Dest,Src,SVA_Outer> {
|
453
|
+
static void run(Dest& dst, const Src& src) {
|
454
|
+
eigen_internal_assert(src.outerSize()==src.size());
|
455
|
+
typedef internal::evaluator<Src> SrcEvaluatorType;
|
456
|
+
SrcEvaluatorType srcEval(src);
|
457
|
+
for(Index i=0; i<src.size(); ++i)
|
458
|
+
{
|
459
|
+
typename SrcEvaluatorType::InnerIterator it(srcEval, i);
|
460
|
+
if(it)
|
461
|
+
dst.insert(i) = it.value();
|
462
|
+
}
|
463
|
+
}
|
464
|
+
};
|
465
|
+
|
466
|
+
template< typename Dest, typename Src>
|
467
|
+
struct sparse_vector_assign_selector<Dest,Src,SVA_RuntimeSwitch> {
|
468
|
+
static void run(Dest& dst, const Src& src) {
|
469
|
+
if(src.outerSize()==1) sparse_vector_assign_selector<Dest,Src,SVA_Inner>::run(dst, src);
|
470
|
+
else sparse_vector_assign_selector<Dest,Src,SVA_Outer>::run(dst, src);
|
471
|
+
}
|
472
|
+
};
|
473
|
+
|
474
|
+
}
|
475
|
+
|
476
|
+
} // end namespace Eigen
|
477
|
+
|
478
|
+
#endif // EIGEN_SPARSEVECTOR_H
|