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,571 @@
|
|
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_SPARSE_BLOCK_H
|
11
|
+
#define EIGEN_SPARSE_BLOCK_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
// Subset of columns or rows
|
16
|
+
template<typename XprType, int BlockRows, int BlockCols>
|
17
|
+
class BlockImpl<XprType,BlockRows,BlockCols,true,Sparse>
|
18
|
+
: public SparseMatrixBase<Block<XprType,BlockRows,BlockCols,true> >
|
19
|
+
{
|
20
|
+
typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
|
21
|
+
typedef Block<XprType, BlockRows, BlockCols, true> BlockType;
|
22
|
+
public:
|
23
|
+
enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
|
24
|
+
protected:
|
25
|
+
enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
|
26
|
+
typedef SparseMatrixBase<BlockType> Base;
|
27
|
+
using Base::convert_index;
|
28
|
+
public:
|
29
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
|
30
|
+
|
31
|
+
inline BlockImpl(XprType& xpr, Index i)
|
32
|
+
: m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize)
|
33
|
+
{}
|
34
|
+
|
35
|
+
inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
|
36
|
+
: m_matrix(xpr), m_outerStart(convert_index(IsRowMajor ? startRow : startCol)), m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols))
|
37
|
+
{}
|
38
|
+
|
39
|
+
EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
|
40
|
+
EIGEN_STRONG_INLINE Index cols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
|
41
|
+
|
42
|
+
Index nonZeros() const
|
43
|
+
{
|
44
|
+
typedef internal::evaluator<XprType> EvaluatorType;
|
45
|
+
EvaluatorType matEval(m_matrix);
|
46
|
+
Index nnz = 0;
|
47
|
+
Index end = m_outerStart + m_outerSize.value();
|
48
|
+
for(Index j=m_outerStart; j<end; ++j)
|
49
|
+
for(typename EvaluatorType::InnerIterator it(matEval, j); it; ++it)
|
50
|
+
++nnz;
|
51
|
+
return nnz;
|
52
|
+
}
|
53
|
+
|
54
|
+
inline const Scalar coeff(Index row, Index col) const
|
55
|
+
{
|
56
|
+
return m_matrix.coeff(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
|
57
|
+
}
|
58
|
+
|
59
|
+
inline const Scalar coeff(Index index) const
|
60
|
+
{
|
61
|
+
return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
|
62
|
+
}
|
63
|
+
|
64
|
+
inline const XprType& nestedExpression() const { return m_matrix; }
|
65
|
+
inline XprType& nestedExpression() { return m_matrix; }
|
66
|
+
Index startRow() const { return IsRowMajor ? m_outerStart : 0; }
|
67
|
+
Index startCol() const { return IsRowMajor ? 0 : m_outerStart; }
|
68
|
+
Index blockRows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
|
69
|
+
Index blockCols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
|
70
|
+
|
71
|
+
protected:
|
72
|
+
|
73
|
+
typename internal::ref_selector<XprType>::non_const_type m_matrix;
|
74
|
+
Index m_outerStart;
|
75
|
+
const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
|
76
|
+
|
77
|
+
protected:
|
78
|
+
// Disable assignment with clear error message.
|
79
|
+
// Note that simply removing operator= yields compilation errors with ICC+MSVC
|
80
|
+
template<typename T>
|
81
|
+
BlockImpl& operator=(const T&)
|
82
|
+
{
|
83
|
+
EIGEN_STATIC_ASSERT(sizeof(T)==0, THIS_SPARSE_BLOCK_SUBEXPRESSION_IS_READ_ONLY);
|
84
|
+
return *this;
|
85
|
+
}
|
86
|
+
};
|
87
|
+
|
88
|
+
|
89
|
+
/***************************************************************************
|
90
|
+
* specialization for SparseMatrix
|
91
|
+
***************************************************************************/
|
92
|
+
|
93
|
+
namespace internal {
|
94
|
+
|
95
|
+
template<typename SparseMatrixType, int BlockRows, int BlockCols>
|
96
|
+
class sparse_matrix_block_impl
|
97
|
+
: public SparseCompressedBase<Block<SparseMatrixType,BlockRows,BlockCols,true> >
|
98
|
+
{
|
99
|
+
typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _MatrixTypeNested;
|
100
|
+
typedef Block<SparseMatrixType, BlockRows, BlockCols, true> BlockType;
|
101
|
+
typedef SparseCompressedBase<Block<SparseMatrixType,BlockRows,BlockCols,true> > Base;
|
102
|
+
using Base::convert_index;
|
103
|
+
public:
|
104
|
+
enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
|
105
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
|
106
|
+
protected:
|
107
|
+
typedef typename Base::IndexVector IndexVector;
|
108
|
+
enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
|
109
|
+
public:
|
110
|
+
|
111
|
+
inline sparse_matrix_block_impl(SparseMatrixType& xpr, Index i)
|
112
|
+
: m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize)
|
113
|
+
{}
|
114
|
+
|
115
|
+
inline sparse_matrix_block_impl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
|
116
|
+
: m_matrix(xpr), m_outerStart(convert_index(IsRowMajor ? startRow : startCol)), m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols))
|
117
|
+
{}
|
118
|
+
|
119
|
+
template<typename OtherDerived>
|
120
|
+
inline BlockType& operator=(const SparseMatrixBase<OtherDerived>& other)
|
121
|
+
{
|
122
|
+
typedef typename internal::remove_all<typename SparseMatrixType::Nested>::type _NestedMatrixType;
|
123
|
+
_NestedMatrixType& matrix = m_matrix;
|
124
|
+
// This assignment is slow if this vector set is not empty
|
125
|
+
// and/or it is not at the end of the nonzeros of the underlying matrix.
|
126
|
+
|
127
|
+
// 1 - eval to a temporary to avoid transposition and/or aliasing issues
|
128
|
+
Ref<const SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, StorageIndex> > tmp(other.derived());
|
129
|
+
eigen_internal_assert(tmp.outerSize()==m_outerSize.value());
|
130
|
+
|
131
|
+
// 2 - let's check whether there is enough allocated memory
|
132
|
+
Index nnz = tmp.nonZeros();
|
133
|
+
Index start = m_outerStart==0 ? 0 : m_matrix.outerIndexPtr()[m_outerStart]; // starting position of the current block
|
134
|
+
Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()]; // ending position of the current block
|
135
|
+
Index block_size = end - start; // available room in the current block
|
136
|
+
Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
|
137
|
+
|
138
|
+
Index free_size = m_matrix.isCompressed()
|
139
|
+
? Index(matrix.data().allocatedSize()) + block_size
|
140
|
+
: block_size;
|
141
|
+
|
142
|
+
Index tmp_start = tmp.outerIndexPtr()[0];
|
143
|
+
|
144
|
+
bool update_trailing_pointers = false;
|
145
|
+
if(nnz>free_size)
|
146
|
+
{
|
147
|
+
// realloc manually to reduce copies
|
148
|
+
typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz);
|
149
|
+
|
150
|
+
internal::smart_copy(m_matrix.valuePtr(), m_matrix.valuePtr() + start, newdata.valuePtr());
|
151
|
+
internal::smart_copy(m_matrix.innerIndexPtr(), m_matrix.innerIndexPtr() + start, newdata.indexPtr());
|
152
|
+
|
153
|
+
internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, newdata.valuePtr() + start);
|
154
|
+
internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, newdata.indexPtr() + start);
|
155
|
+
|
156
|
+
internal::smart_copy(matrix.valuePtr()+end, matrix.valuePtr()+end + tail_size, newdata.valuePtr()+start+nnz);
|
157
|
+
internal::smart_copy(matrix.innerIndexPtr()+end, matrix.innerIndexPtr()+end + tail_size, newdata.indexPtr()+start+nnz);
|
158
|
+
|
159
|
+
newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
|
160
|
+
|
161
|
+
matrix.data().swap(newdata);
|
162
|
+
|
163
|
+
update_trailing_pointers = true;
|
164
|
+
}
|
165
|
+
else
|
166
|
+
{
|
167
|
+
if(m_matrix.isCompressed() && nnz!=block_size)
|
168
|
+
{
|
169
|
+
// no need to realloc, simply copy the tail at its respective position and insert tmp
|
170
|
+
matrix.data().resize(start + nnz + tail_size);
|
171
|
+
|
172
|
+
internal::smart_memmove(matrix.valuePtr()+end, matrix.valuePtr() + end+tail_size, matrix.valuePtr() + start+nnz);
|
173
|
+
internal::smart_memmove(matrix.innerIndexPtr()+end, matrix.innerIndexPtr() + end+tail_size, matrix.innerIndexPtr() + start+nnz);
|
174
|
+
|
175
|
+
update_trailing_pointers = true;
|
176
|
+
}
|
177
|
+
|
178
|
+
internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, matrix.valuePtr() + start);
|
179
|
+
internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, matrix.innerIndexPtr() + start);
|
180
|
+
}
|
181
|
+
|
182
|
+
// update outer index pointers and innerNonZeros
|
183
|
+
if(IsVectorAtCompileTime)
|
184
|
+
{
|
185
|
+
if(!m_matrix.isCompressed())
|
186
|
+
matrix.innerNonZeroPtr()[m_outerStart] = StorageIndex(nnz);
|
187
|
+
matrix.outerIndexPtr()[m_outerStart] = StorageIndex(start);
|
188
|
+
}
|
189
|
+
else
|
190
|
+
{
|
191
|
+
StorageIndex p = StorageIndex(start);
|
192
|
+
for(Index k=0; k<m_outerSize.value(); ++k)
|
193
|
+
{
|
194
|
+
StorageIndex nnz_k = internal::convert_index<StorageIndex>(tmp.innerVector(k).nonZeros());
|
195
|
+
if(!m_matrix.isCompressed())
|
196
|
+
matrix.innerNonZeroPtr()[m_outerStart+k] = nnz_k;
|
197
|
+
matrix.outerIndexPtr()[m_outerStart+k] = p;
|
198
|
+
p += nnz_k;
|
199
|
+
}
|
200
|
+
}
|
201
|
+
|
202
|
+
if(update_trailing_pointers)
|
203
|
+
{
|
204
|
+
StorageIndex offset = internal::convert_index<StorageIndex>(nnz - block_size);
|
205
|
+
for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
|
206
|
+
{
|
207
|
+
matrix.outerIndexPtr()[k] += offset;
|
208
|
+
}
|
209
|
+
}
|
210
|
+
|
211
|
+
return derived();
|
212
|
+
}
|
213
|
+
|
214
|
+
inline BlockType& operator=(const BlockType& other)
|
215
|
+
{
|
216
|
+
return operator=<BlockType>(other);
|
217
|
+
}
|
218
|
+
|
219
|
+
inline const Scalar* valuePtr() const
|
220
|
+
{ return m_matrix.valuePtr(); }
|
221
|
+
inline Scalar* valuePtr()
|
222
|
+
{ return m_matrix.valuePtr(); }
|
223
|
+
|
224
|
+
inline const StorageIndex* innerIndexPtr() const
|
225
|
+
{ return m_matrix.innerIndexPtr(); }
|
226
|
+
inline StorageIndex* innerIndexPtr()
|
227
|
+
{ return m_matrix.innerIndexPtr(); }
|
228
|
+
|
229
|
+
inline const StorageIndex* outerIndexPtr() const
|
230
|
+
{ return m_matrix.outerIndexPtr() + m_outerStart; }
|
231
|
+
inline StorageIndex* outerIndexPtr()
|
232
|
+
{ return m_matrix.outerIndexPtr() + m_outerStart; }
|
233
|
+
|
234
|
+
inline const StorageIndex* innerNonZeroPtr() const
|
235
|
+
{ return isCompressed() ? 0 : (m_matrix.innerNonZeroPtr()+m_outerStart); }
|
236
|
+
inline StorageIndex* innerNonZeroPtr()
|
237
|
+
{ return isCompressed() ? 0 : (m_matrix.innerNonZeroPtr()+m_outerStart); }
|
238
|
+
|
239
|
+
bool isCompressed() const { return m_matrix.innerNonZeroPtr()==0; }
|
240
|
+
|
241
|
+
inline Scalar& coeffRef(Index row, Index col)
|
242
|
+
{
|
243
|
+
return m_matrix.coeffRef(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
|
244
|
+
}
|
245
|
+
|
246
|
+
inline const Scalar coeff(Index row, Index col) const
|
247
|
+
{
|
248
|
+
return m_matrix.coeff(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart));
|
249
|
+
}
|
250
|
+
|
251
|
+
inline const Scalar coeff(Index index) const
|
252
|
+
{
|
253
|
+
return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart);
|
254
|
+
}
|
255
|
+
|
256
|
+
const Scalar& lastCoeff() const
|
257
|
+
{
|
258
|
+
EIGEN_STATIC_ASSERT_VECTOR_ONLY(sparse_matrix_block_impl);
|
259
|
+
eigen_assert(Base::nonZeros()>0);
|
260
|
+
if(m_matrix.isCompressed())
|
261
|
+
return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1];
|
262
|
+
else
|
263
|
+
return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1];
|
264
|
+
}
|
265
|
+
|
266
|
+
EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
|
267
|
+
EIGEN_STRONG_INLINE Index cols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
|
268
|
+
|
269
|
+
inline const SparseMatrixType& nestedExpression() const { return m_matrix; }
|
270
|
+
inline SparseMatrixType& nestedExpression() { return m_matrix; }
|
271
|
+
Index startRow() const { return IsRowMajor ? m_outerStart : 0; }
|
272
|
+
Index startCol() const { return IsRowMajor ? 0 : m_outerStart; }
|
273
|
+
Index blockRows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
|
274
|
+
Index blockCols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); }
|
275
|
+
|
276
|
+
protected:
|
277
|
+
|
278
|
+
typename internal::ref_selector<SparseMatrixType>::non_const_type m_matrix;
|
279
|
+
Index m_outerStart;
|
280
|
+
const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
|
281
|
+
|
282
|
+
};
|
283
|
+
|
284
|
+
} // namespace internal
|
285
|
+
|
286
|
+
template<typename _Scalar, int _Options, typename _StorageIndex, int BlockRows, int BlockCols>
|
287
|
+
class BlockImpl<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true,Sparse>
|
288
|
+
: public internal::sparse_matrix_block_impl<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols>
|
289
|
+
{
|
290
|
+
public:
|
291
|
+
typedef _StorageIndex StorageIndex;
|
292
|
+
typedef SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType;
|
293
|
+
typedef internal::sparse_matrix_block_impl<SparseMatrixType,BlockRows,BlockCols> Base;
|
294
|
+
inline BlockImpl(SparseMatrixType& xpr, Index i)
|
295
|
+
: Base(xpr, i)
|
296
|
+
{}
|
297
|
+
|
298
|
+
inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
|
299
|
+
: Base(xpr, startRow, startCol, blockRows, blockCols)
|
300
|
+
{}
|
301
|
+
|
302
|
+
using Base::operator=;
|
303
|
+
};
|
304
|
+
|
305
|
+
template<typename _Scalar, int _Options, typename _StorageIndex, int BlockRows, int BlockCols>
|
306
|
+
class BlockImpl<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true,Sparse>
|
307
|
+
: public internal::sparse_matrix_block_impl<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols>
|
308
|
+
{
|
309
|
+
public:
|
310
|
+
typedef _StorageIndex StorageIndex;
|
311
|
+
typedef const SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType;
|
312
|
+
typedef internal::sparse_matrix_block_impl<SparseMatrixType,BlockRows,BlockCols> Base;
|
313
|
+
inline BlockImpl(SparseMatrixType& xpr, Index i)
|
314
|
+
: Base(xpr, i)
|
315
|
+
{}
|
316
|
+
|
317
|
+
inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
|
318
|
+
: Base(xpr, startRow, startCol, blockRows, blockCols)
|
319
|
+
{}
|
320
|
+
|
321
|
+
using Base::operator=;
|
322
|
+
private:
|
323
|
+
template<typename Derived> BlockImpl(const SparseMatrixBase<Derived>& xpr, Index i);
|
324
|
+
template<typename Derived> BlockImpl(const SparseMatrixBase<Derived>& xpr);
|
325
|
+
};
|
326
|
+
|
327
|
+
//----------
|
328
|
+
|
329
|
+
/** Generic implementation of sparse Block expression.
|
330
|
+
* Real-only.
|
331
|
+
*/
|
332
|
+
template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel>
|
333
|
+
class BlockImpl<XprType,BlockRows,BlockCols,InnerPanel,Sparse>
|
334
|
+
: public SparseMatrixBase<Block<XprType,BlockRows,BlockCols,InnerPanel> >, internal::no_assignment_operator
|
335
|
+
{
|
336
|
+
typedef Block<XprType, BlockRows, BlockCols, InnerPanel> BlockType;
|
337
|
+
typedef SparseMatrixBase<BlockType> Base;
|
338
|
+
using Base::convert_index;
|
339
|
+
public:
|
340
|
+
enum { IsRowMajor = internal::traits<BlockType>::IsRowMajor };
|
341
|
+
EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType)
|
342
|
+
|
343
|
+
typedef typename internal::remove_all<typename XprType::Nested>::type _MatrixTypeNested;
|
344
|
+
|
345
|
+
/** Column or Row constructor
|
346
|
+
*/
|
347
|
+
inline BlockImpl(XprType& xpr, Index i)
|
348
|
+
: m_matrix(xpr),
|
349
|
+
m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? convert_index(i) : 0),
|
350
|
+
m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? convert_index(i) : 0),
|
351
|
+
m_blockRows(BlockRows==1 ? 1 : xpr.rows()),
|
352
|
+
m_blockCols(BlockCols==1 ? 1 : xpr.cols())
|
353
|
+
{}
|
354
|
+
|
355
|
+
/** Dynamic-size constructor
|
356
|
+
*/
|
357
|
+
inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols)
|
358
|
+
: m_matrix(xpr), m_startRow(convert_index(startRow)), m_startCol(convert_index(startCol)), m_blockRows(convert_index(blockRows)), m_blockCols(convert_index(blockCols))
|
359
|
+
{}
|
360
|
+
|
361
|
+
inline Index rows() const { return m_blockRows.value(); }
|
362
|
+
inline Index cols() const { return m_blockCols.value(); }
|
363
|
+
|
364
|
+
inline Scalar& coeffRef(Index row, Index col)
|
365
|
+
{
|
366
|
+
return m_matrix.coeffRef(row + m_startRow.value(), col + m_startCol.value());
|
367
|
+
}
|
368
|
+
|
369
|
+
inline const Scalar coeff(Index row, Index col) const
|
370
|
+
{
|
371
|
+
return m_matrix.coeff(row + m_startRow.value(), col + m_startCol.value());
|
372
|
+
}
|
373
|
+
|
374
|
+
inline Scalar& coeffRef(Index index)
|
375
|
+
{
|
376
|
+
return m_matrix.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
|
377
|
+
m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
|
378
|
+
}
|
379
|
+
|
380
|
+
inline const Scalar coeff(Index index) const
|
381
|
+
{
|
382
|
+
return m_matrix.coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index),
|
383
|
+
m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0));
|
384
|
+
}
|
385
|
+
|
386
|
+
inline const XprType& nestedExpression() const { return m_matrix; }
|
387
|
+
inline XprType& nestedExpression() { return m_matrix; }
|
388
|
+
Index startRow() const { return m_startRow.value(); }
|
389
|
+
Index startCol() const { return m_startCol.value(); }
|
390
|
+
Index blockRows() const { return m_blockRows.value(); }
|
391
|
+
Index blockCols() const { return m_blockCols.value(); }
|
392
|
+
|
393
|
+
protected:
|
394
|
+
// friend class internal::GenericSparseBlockInnerIteratorImpl<XprType,BlockRows,BlockCols,InnerPanel>;
|
395
|
+
friend struct internal::unary_evaluator<Block<XprType,BlockRows,BlockCols,InnerPanel>, internal::IteratorBased, Scalar >;
|
396
|
+
|
397
|
+
Index nonZeros() const { return Dynamic; }
|
398
|
+
|
399
|
+
typename internal::ref_selector<XprType>::non_const_type m_matrix;
|
400
|
+
const internal::variable_if_dynamic<Index, XprType::RowsAtCompileTime == 1 ? 0 : Dynamic> m_startRow;
|
401
|
+
const internal::variable_if_dynamic<Index, XprType::ColsAtCompileTime == 1 ? 0 : Dynamic> m_startCol;
|
402
|
+
const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_blockRows;
|
403
|
+
const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_blockCols;
|
404
|
+
|
405
|
+
protected:
|
406
|
+
// Disable assignment with clear error message.
|
407
|
+
// Note that simply removing operator= yields compilation errors with ICC+MSVC
|
408
|
+
template<typename T>
|
409
|
+
BlockImpl& operator=(const T&)
|
410
|
+
{
|
411
|
+
EIGEN_STATIC_ASSERT(sizeof(T)==0, THIS_SPARSE_BLOCK_SUBEXPRESSION_IS_READ_ONLY);
|
412
|
+
return *this;
|
413
|
+
}
|
414
|
+
|
415
|
+
};
|
416
|
+
|
417
|
+
namespace internal {
|
418
|
+
|
419
|
+
template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel>
|
420
|
+
struct unary_evaluator<Block<ArgType,BlockRows,BlockCols,InnerPanel>, IteratorBased >
|
421
|
+
: public evaluator_base<Block<ArgType,BlockRows,BlockCols,InnerPanel> >
|
422
|
+
{
|
423
|
+
class InnerVectorInnerIterator;
|
424
|
+
class OuterVectorInnerIterator;
|
425
|
+
public:
|
426
|
+
typedef Block<ArgType,BlockRows,BlockCols,InnerPanel> XprType;
|
427
|
+
typedef typename XprType::StorageIndex StorageIndex;
|
428
|
+
typedef typename XprType::Scalar Scalar;
|
429
|
+
|
430
|
+
enum {
|
431
|
+
IsRowMajor = XprType::IsRowMajor,
|
432
|
+
|
433
|
+
OuterVector = (BlockCols==1 && ArgType::IsRowMajor)
|
434
|
+
| // FIXME | instead of || to please GCC 4.4.0 stupid warning "suggest parentheses around &&".
|
435
|
+
// revert to || as soon as not needed anymore.
|
436
|
+
(BlockRows==1 && !ArgType::IsRowMajor),
|
437
|
+
|
438
|
+
CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
|
439
|
+
Flags = XprType::Flags
|
440
|
+
};
|
441
|
+
|
442
|
+
typedef typename internal::conditional<OuterVector,OuterVectorInnerIterator,InnerVectorInnerIterator>::type InnerIterator;
|
443
|
+
|
444
|
+
explicit unary_evaluator(const XprType& op)
|
445
|
+
: m_argImpl(op.nestedExpression()), m_block(op)
|
446
|
+
{}
|
447
|
+
|
448
|
+
inline Index nonZerosEstimate() const {
|
449
|
+
const Index nnz = m_block.nonZeros();
|
450
|
+
if(nnz < 0) {
|
451
|
+
// Scale the non-zero estimate for the underlying expression linearly with block size.
|
452
|
+
// Return zero if the underlying block is empty.
|
453
|
+
const Index nested_sz = m_block.nestedExpression().size();
|
454
|
+
return nested_sz == 0 ? 0 : m_argImpl.nonZerosEstimate() * m_block.size() / nested_sz;
|
455
|
+
}
|
456
|
+
return nnz;
|
457
|
+
}
|
458
|
+
|
459
|
+
protected:
|
460
|
+
typedef typename evaluator<ArgType>::InnerIterator EvalIterator;
|
461
|
+
|
462
|
+
evaluator<ArgType> m_argImpl;
|
463
|
+
const XprType &m_block;
|
464
|
+
};
|
465
|
+
|
466
|
+
template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel>
|
467
|
+
class unary_evaluator<Block<ArgType,BlockRows,BlockCols,InnerPanel>, IteratorBased>::InnerVectorInnerIterator
|
468
|
+
: public EvalIterator
|
469
|
+
{
|
470
|
+
// NOTE MSVC fails to compile if we don't explicitely "import" IsRowMajor from unary_evaluator
|
471
|
+
// because the base class EvalIterator has a private IsRowMajor enum too. (bug #1786)
|
472
|
+
// NOTE We cannot call it IsRowMajor because it would shadow unary_evaluator::IsRowMajor
|
473
|
+
enum { XprIsRowMajor = unary_evaluator::IsRowMajor };
|
474
|
+
const XprType& m_block;
|
475
|
+
Index m_end;
|
476
|
+
public:
|
477
|
+
|
478
|
+
EIGEN_STRONG_INLINE InnerVectorInnerIterator(const unary_evaluator& aEval, Index outer)
|
479
|
+
: EvalIterator(aEval.m_argImpl, outer + (XprIsRowMajor ? aEval.m_block.startRow() : aEval.m_block.startCol())),
|
480
|
+
m_block(aEval.m_block),
|
481
|
+
m_end(XprIsRowMajor ? aEval.m_block.startCol()+aEval.m_block.blockCols() : aEval.m_block.startRow()+aEval.m_block.blockRows())
|
482
|
+
{
|
483
|
+
while( (EvalIterator::operator bool()) && (EvalIterator::index() < (XprIsRowMajor ? m_block.startCol() : m_block.startRow())) )
|
484
|
+
EvalIterator::operator++();
|
485
|
+
}
|
486
|
+
|
487
|
+
inline StorageIndex index() const { return EvalIterator::index() - convert_index<StorageIndex>(XprIsRowMajor ? m_block.startCol() : m_block.startRow()); }
|
488
|
+
inline Index outer() const { return EvalIterator::outer() - (XprIsRowMajor ? m_block.startRow() : m_block.startCol()); }
|
489
|
+
inline Index row() const { return EvalIterator::row() - m_block.startRow(); }
|
490
|
+
inline Index col() const { return EvalIterator::col() - m_block.startCol(); }
|
491
|
+
|
492
|
+
inline operator bool() const { return EvalIterator::operator bool() && EvalIterator::index() < m_end; }
|
493
|
+
};
|
494
|
+
|
495
|
+
template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel>
|
496
|
+
class unary_evaluator<Block<ArgType,BlockRows,BlockCols,InnerPanel>, IteratorBased>::OuterVectorInnerIterator
|
497
|
+
{
|
498
|
+
// NOTE see above
|
499
|
+
enum { XprIsRowMajor = unary_evaluator::IsRowMajor };
|
500
|
+
const unary_evaluator& m_eval;
|
501
|
+
Index m_outerPos;
|
502
|
+
const Index m_innerIndex;
|
503
|
+
Index m_end;
|
504
|
+
EvalIterator m_it;
|
505
|
+
public:
|
506
|
+
|
507
|
+
EIGEN_STRONG_INLINE OuterVectorInnerIterator(const unary_evaluator& aEval, Index outer)
|
508
|
+
: m_eval(aEval),
|
509
|
+
m_outerPos( (XprIsRowMajor ? aEval.m_block.startCol() : aEval.m_block.startRow()) ),
|
510
|
+
m_innerIndex(XprIsRowMajor ? aEval.m_block.startRow() : aEval.m_block.startCol()),
|
511
|
+
m_end(XprIsRowMajor ? aEval.m_block.startCol()+aEval.m_block.blockCols() : aEval.m_block.startRow()+aEval.m_block.blockRows()),
|
512
|
+
m_it(m_eval.m_argImpl, m_outerPos)
|
513
|
+
{
|
514
|
+
EIGEN_UNUSED_VARIABLE(outer);
|
515
|
+
eigen_assert(outer==0);
|
516
|
+
|
517
|
+
while(m_it && m_it.index() < m_innerIndex) ++m_it;
|
518
|
+
if((!m_it) || (m_it.index()!=m_innerIndex))
|
519
|
+
++(*this);
|
520
|
+
}
|
521
|
+
|
522
|
+
inline StorageIndex index() const { return convert_index<StorageIndex>(m_outerPos - (XprIsRowMajor ? m_eval.m_block.startCol() : m_eval.m_block.startRow())); }
|
523
|
+
inline Index outer() const { return 0; }
|
524
|
+
inline Index row() const { return XprIsRowMajor ? 0 : index(); }
|
525
|
+
inline Index col() const { return XprIsRowMajor ? index() : 0; }
|
526
|
+
|
527
|
+
inline Scalar value() const { return m_it.value(); }
|
528
|
+
inline Scalar& valueRef() { return m_it.valueRef(); }
|
529
|
+
|
530
|
+
inline OuterVectorInnerIterator& operator++()
|
531
|
+
{
|
532
|
+
// search next non-zero entry
|
533
|
+
while(++m_outerPos<m_end)
|
534
|
+
{
|
535
|
+
// Restart iterator at the next inner-vector:
|
536
|
+
m_it.~EvalIterator();
|
537
|
+
::new (&m_it) EvalIterator(m_eval.m_argImpl, m_outerPos);
|
538
|
+
// search for the key m_innerIndex in the current outer-vector
|
539
|
+
while(m_it && m_it.index() < m_innerIndex) ++m_it;
|
540
|
+
if(m_it && m_it.index()==m_innerIndex) break;
|
541
|
+
}
|
542
|
+
return *this;
|
543
|
+
}
|
544
|
+
|
545
|
+
inline operator bool() const { return m_outerPos < m_end; }
|
546
|
+
};
|
547
|
+
|
548
|
+
template<typename _Scalar, int _Options, typename _StorageIndex, int BlockRows, int BlockCols>
|
549
|
+
struct unary_evaluator<Block<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true>, IteratorBased>
|
550
|
+
: evaluator<SparseCompressedBase<Block<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> > >
|
551
|
+
{
|
552
|
+
typedef Block<SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> XprType;
|
553
|
+
typedef evaluator<SparseCompressedBase<XprType> > Base;
|
554
|
+
explicit unary_evaluator(const XprType &xpr) : Base(xpr) {}
|
555
|
+
};
|
556
|
+
|
557
|
+
template<typename _Scalar, int _Options, typename _StorageIndex, int BlockRows, int BlockCols>
|
558
|
+
struct unary_evaluator<Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true>, IteratorBased>
|
559
|
+
: evaluator<SparseCompressedBase<Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> > >
|
560
|
+
{
|
561
|
+
typedef Block<const SparseMatrix<_Scalar, _Options, _StorageIndex>,BlockRows,BlockCols,true> XprType;
|
562
|
+
typedef evaluator<SparseCompressedBase<XprType> > Base;
|
563
|
+
explicit unary_evaluator(const XprType &xpr) : Base(xpr) {}
|
564
|
+
};
|
565
|
+
|
566
|
+
} // end namespace internal
|
567
|
+
|
568
|
+
|
569
|
+
} // end namespace Eigen
|
570
|
+
|
571
|
+
#endif // EIGEN_SPARSE_BLOCK_H
|