ruby-eigen 0.0.9 → 0.0.10.pre1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/LICENSE +22 -0
- data/README.md +21 -0
- data/ext/eigen/eigen3/COPYING.BSD +26 -0
- data/ext/eigen/eigen3/COPYING.MPL2 +373 -0
- data/ext/eigen/eigen3/COPYING.README +18 -0
- data/ext/eigen/eigen3/Eigen/Array +11 -0
- data/ext/eigen/eigen3/Eigen/Cholesky +32 -0
- data/ext/eigen/eigen3/Eigen/CholmodSupport +45 -0
- data/ext/eigen/eigen3/Eigen/Core +376 -0
- data/ext/eigen/eigen3/Eigen/Dense +7 -0
- data/ext/eigen/eigen3/Eigen/Eigen +2 -0
- data/ext/eigen/eigen3/Eigen/Eigen2Support +95 -0
- data/ext/eigen/eigen3/Eigen/Eigenvalues +48 -0
- data/ext/eigen/eigen3/Eigen/Geometry +63 -0
- data/ext/eigen/eigen3/Eigen/Householder +23 -0
- data/ext/eigen/eigen3/Eigen/IterativeLinearSolvers +40 -0
- data/ext/eigen/eigen3/Eigen/Jacobi +26 -0
- data/ext/eigen/eigen3/Eigen/LU +41 -0
- data/ext/eigen/eigen3/Eigen/LeastSquares +32 -0
- data/ext/eigen/eigen3/Eigen/MetisSupport +28 -0
- data/ext/eigen/eigen3/Eigen/PaStiXSupport +46 -0
- data/ext/eigen/eigen3/Eigen/PardisoSupport +30 -0
- data/ext/eigen/eigen3/Eigen/QR +45 -0
- data/ext/eigen/eigen3/Eigen/QtAlignedMalloc +34 -0
- data/ext/eigen/eigen3/Eigen/SPQRSupport +29 -0
- data/ext/eigen/eigen3/Eigen/SVD +37 -0
- data/ext/eigen/eigen3/Eigen/Sparse +27 -0
- data/ext/eigen/eigen3/Eigen/SparseCore +64 -0
- data/ext/eigen/eigen3/Eigen/SparseLU +49 -0
- data/ext/eigen/eigen3/Eigen/SparseQR +33 -0
- data/ext/eigen/eigen3/Eigen/StdDeque +27 -0
- data/ext/eigen/eigen3/Eigen/StdList +26 -0
- data/ext/eigen/eigen3/Eigen/StdVector +27 -0
- data/ext/eigen/eigen3/Eigen/SuperLUSupport +59 -0
- data/ext/eigen/eigen3/Eigen/UmfPackSupport +36 -0
- data/ext/eigen/eigen3/Eigen/src/Cholesky/LDLT.h +611 -0
- data/ext/eigen/eigen3/Eigen/src/Cholesky/LLT.h +498 -0
- data/ext/eigen/eigen3/Eigen/src/Cholesky/LLT_MKL.h +102 -0
- data/ext/eigen/eigen3/Eigen/src/CholmodSupport/CholmodSupport.h +607 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Array.h +323 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ArrayBase.h +226 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ArrayWrapper.h +264 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Assign.h +590 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Assign_MKL.h +224 -0
- data/ext/eigen/eigen3/Eigen/src/Core/BandMatrix.h +334 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Block.h +406 -0
- data/ext/eigen/eigen3/Eigen/src/Core/BooleanRedux.h +154 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CommaInitializer.h +154 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CoreIterators.h +61 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseBinaryOp.h +230 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseNullaryOp.h +864 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseUnaryOp.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/Core/CwiseUnaryView.h +139 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DenseBase.h +521 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DenseCoeffsBase.h +754 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DenseStorage.h +434 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Diagonal.h +237 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DiagonalMatrix.h +313 -0
- data/ext/eigen/eigen3/Eigen/src/Core/DiagonalProduct.h +131 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Dot.h +263 -0
- data/ext/eigen/eigen3/Eigen/src/Core/EigenBase.h +131 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Flagged.h +140 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ForceAlignedAccess.h +146 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Functors.h +1026 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Fuzzy.h +150 -0
- data/ext/eigen/eigen3/Eigen/src/Core/GeneralProduct.h +635 -0
- data/ext/eigen/eigen3/Eigen/src/Core/GenericPacketMath.h +350 -0
- data/ext/eigen/eigen3/Eigen/src/Core/GlobalFunctions.h +92 -0
- data/ext/eigen/eigen3/Eigen/src/Core/IO.h +250 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Map.h +192 -0
- data/ext/eigen/eigen3/Eigen/src/Core/MapBase.h +247 -0
- data/ext/eigen/eigen3/Eigen/src/Core/MathFunctions.h +768 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Matrix.h +420 -0
- data/ext/eigen/eigen3/Eigen/src/Core/MatrixBase.h +563 -0
- data/ext/eigen/eigen3/Eigen/src/Core/NestByValue.h +111 -0
- data/ext/eigen/eigen3/Eigen/src/Core/NoAlias.h +134 -0
- data/ext/eigen/eigen3/Eigen/src/Core/NumTraits.h +150 -0
- data/ext/eigen/eigen3/Eigen/src/Core/PermutationMatrix.h +721 -0
- data/ext/eigen/eigen3/Eigen/src/Core/PlainObjectBase.h +822 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ProductBase.h +290 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Random.h +152 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Redux.h +409 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Ref.h +278 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Replicate.h +177 -0
- data/ext/eigen/eigen3/Eigen/src/Core/ReturnByValue.h +99 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Reverse.h +224 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Select.h +162 -0
- data/ext/eigen/eigen3/Eigen/src/Core/SelfAdjointView.h +314 -0
- data/ext/eigen/eigen3/Eigen/src/Core/SelfCwiseBinaryOp.h +191 -0
- data/ext/eigen/eigen3/Eigen/src/Core/SolveTriangular.h +260 -0
- data/ext/eigen/eigen3/Eigen/src/Core/StableNorm.h +203 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Stride.h +108 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Swap.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Transpose.h +419 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Transpositions.h +436 -0
- data/ext/eigen/eigen3/Eigen/src/Core/TriangularMatrix.h +839 -0
- data/ext/eigen/eigen3/Eigen/src/Core/VectorBlock.h +95 -0
- data/ext/eigen/eigen3/Eigen/src/Core/VectorwiseOp.h +642 -0
- data/ext/eigen/eigen3/Eigen/src/Core/Visitor.h +237 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/AltiVec/Complex.h +217 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/AltiVec/PacketMath.h +501 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/Default/Settings.h +49 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/NEON/Complex.h +253 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/NEON/PacketMath.h +420 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/SSE/Complex.h +442 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/SSE/MathFunctions.h +475 -0
- data/ext/eigen/eigen3/Eigen/src/Core/arch/SSE/PacketMath.h +649 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/CoeffBasedProduct.h +476 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralBlockPanelKernel.h +1341 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrix.h +427 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h +278 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_MKL.h +146 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixMatrix_MKL.h +118 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixVector.h +566 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/GeneralMatrixVector_MKL.h +131 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/Parallelizer.h +162 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixMatrix.h +436 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixMatrix_MKL.h +295 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixVector.h +281 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointMatrixVector_MKL.h +114 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointProduct.h +123 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/SelfadjointRank2Update.h +93 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixMatrix.h +427 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixMatrix_MKL.h +309 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixVector.h +348 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularMatrixVector_MKL.h +247 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularSolverMatrix.h +332 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularSolverMatrix_MKL.h +155 -0
- data/ext/eigen/eigen3/Eigen/src/Core/products/TriangularSolverVector.h +139 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/BlasUtil.h +264 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Constants.h +451 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/DisableStupidWarnings.h +40 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/ForwardDeclarations.h +302 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/MKL_support.h +158 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Macros.h +451 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Memory.h +977 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/Meta.h +243 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/NonMPL2.h +3 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/ReenableStupidWarnings.h +14 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/StaticAssert.h +208 -0
- data/ext/eigen/eigen3/Eigen/src/Core/util/XprHelper.h +469 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Block.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Cwise.h +192 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/CwiseOperators.h +298 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/AlignedBox.h +159 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/All.h +115 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/AngleAxis.h +214 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Hyperplane.h +254 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/ParametrizedLine.h +141 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Quaternion.h +495 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Rotation2D.h +145 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/RotationBase.h +123 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Scaling.h +167 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Transform.h +786 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Geometry/Translation.h +184 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/LU.h +120 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Lazy.h +71 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/LeastSquares.h +169 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Macros.h +20 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/MathFunctions.h +57 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Memory.h +45 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Meta.h +75 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/Minor.h +117 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/QR.h +67 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/SVD.h +637 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/TriangularSolver.h +42 -0
- data/ext/eigen/eigen3/Eigen/src/Eigen2Support/VectorBlock.h +94 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/ComplexEigenSolver.h +341 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/ComplexSchur.h +456 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/ComplexSchur_MKL.h +94 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/EigenSolver.h +607 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h +350 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h +227 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/HessenbergDecomposition.h +373 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h +160 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/RealQZ.h +624 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/RealSchur.h +525 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/RealSchur_MKL.h +83 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h +801 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_MKL.h +92 -0
- data/ext/eigen/eigen3/Eigen/src/Eigenvalues/Tridiagonalization.h +557 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/AlignedBox.h +392 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/AngleAxis.h +233 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/EulerAngles.h +104 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Homogeneous.h +307 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Hyperplane.h +280 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/OrthoMethods.h +218 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/ParametrizedLine.h +195 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Quaternion.h +776 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Rotation2D.h +160 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/RotationBase.h +206 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Scaling.h +166 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Transform.h +1455 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Translation.h +206 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/Umeyama.h +177 -0
- data/ext/eigen/eigen3/Eigen/src/Geometry/arch/Geometry_SSE.h +115 -0
- data/ext/eigen/eigen3/Eigen/src/Householder/BlockHouseholder.h +68 -0
- data/ext/eigen/eigen3/Eigen/src/Householder/Householder.h +171 -0
- data/ext/eigen/eigen3/Eigen/src/Householder/HouseholderSequence.h +441 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h +149 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +263 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h +256 -0
- data/ext/eigen/eigen3/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h +282 -0
- data/ext/eigen/eigen3/Eigen/src/Jacobi/Jacobi.h +433 -0
- data/ext/eigen/eigen3/Eigen/src/LU/Determinant.h +101 -0
- data/ext/eigen/eigen3/Eigen/src/LU/FullPivLU.h +751 -0
- data/ext/eigen/eigen3/Eigen/src/LU/Inverse.h +400 -0
- data/ext/eigen/eigen3/Eigen/src/LU/PartialPivLU.h +509 -0
- data/ext/eigen/eigen3/Eigen/src/LU/PartialPivLU_MKL.h +85 -0
- data/ext/eigen/eigen3/Eigen/src/LU/arch/Inverse_SSE.h +329 -0
- data/ext/eigen/eigen3/Eigen/src/MetisSupport/MetisSupport.h +137 -0
- data/ext/eigen/eigen3/Eigen/src/OrderingMethods/Amd.h +444 -0
- data/ext/eigen/eigen3/Eigen/src/OrderingMethods/Eigen_Colamd.h +1850 -0
- data/ext/eigen/eigen3/Eigen/src/PaStiXSupport/PaStiXSupport.h +721 -0
- data/ext/eigen/eigen3/Eigen/src/PardisoSupport/PardisoSupport.h +592 -0
- data/ext/eigen/eigen3/Eigen/src/QR/ColPivHouseholderQR.h +580 -0
- data/ext/eigen/eigen3/Eigen/src/QR/ColPivHouseholderQR_MKL.h +99 -0
- data/ext/eigen/eigen3/Eigen/src/QR/FullPivHouseholderQR.h +622 -0
- data/ext/eigen/eigen3/Eigen/src/QR/HouseholderQR.h +388 -0
- data/ext/eigen/eigen3/Eigen/src/QR/HouseholderQR_MKL.h +71 -0
- data/ext/eigen/eigen3/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h +338 -0
- data/ext/eigen/eigen3/Eigen/src/SVD/JacobiSVD.h +976 -0
- data/ext/eigen/eigen3/Eigen/src/SVD/JacobiSVD_MKL.h +92 -0
- data/ext/eigen/eigen3/Eigen/src/SVD/UpperBidiagonalization.h +148 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCholesky/SimplicialCholesky.h +671 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h +199 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/AmbiVector.h +373 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/CompressedStorage.h +233 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h +245 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/MappedSparseMatrix.h +181 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseBlock.h +537 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseColEtree.h +206 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseCwiseBinaryOp.h +325 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseCwiseUnaryOp.h +163 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseDenseProduct.h +311 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseDiagonalProduct.h +196 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseDot.h +101 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseFuzzy.h +26 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseMatrix.h +1262 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseMatrixBase.h +461 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparsePermutation.h +148 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseProduct.h +188 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseRedux.h +45 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseSelfAdjointView.h +507 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseSparseProductWithPruning.h +150 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseTranspose.h +63 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseTriangularView.h +179 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseUtil.h +172 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseVector.h +448 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/SparseView.h +99 -0
- data/ext/eigen/eigen3/Eigen/src/SparseCore/TriangularSolver.h +334 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU.h +806 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLUImpl.h +66 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_Memory.h +227 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_Structs.h +111 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h +298 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_Utils.h +80 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_column_bmod.h +180 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_column_dfs.h +177 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h +106 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_gemm_kernel.h +279 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h +127 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_kernel_bmod.h +130 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_panel_bmod.h +223 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_panel_dfs.h +258 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_pivotL.h +137 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_pruneL.h +135 -0
- data/ext/eigen/eigen3/Eigen/src/SparseLU/SparseLU_relax_snode.h +83 -0
- data/ext/eigen/eigen3/Eigen/src/SparseQR/SparseQR.h +714 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/StdDeque.h +134 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/StdList.h +114 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/StdVector.h +126 -0
- data/ext/eigen/eigen3/Eigen/src/StlSupport/details.h +84 -0
- data/ext/eigen/eigen3/Eigen/src/SuperLUSupport/SuperLUSupport.h +1026 -0
- data/ext/eigen/eigen3/Eigen/src/UmfPackSupport/UmfPackSupport.h +474 -0
- data/ext/eigen/eigen3/Eigen/src/misc/Image.h +84 -0
- data/ext/eigen/eigen3/Eigen/src/misc/Kernel.h +81 -0
- data/ext/eigen/eigen3/Eigen/src/misc/Solve.h +76 -0
- data/ext/eigen/eigen3/Eigen/src/misc/SparseSolve.h +128 -0
- data/ext/eigen/eigen3/Eigen/src/misc/blas.h +658 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/ArrayCwiseBinaryOps.h +253 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/ArrayCwiseUnaryOps.h +187 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/BlockMethods.h +935 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/CommonCwiseBinaryOps.h +46 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/CommonCwiseUnaryOps.h +172 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/MatrixCwiseBinaryOps.h +143 -0
- data/ext/eigen/eigen3/Eigen/src/plugins/MatrixCwiseUnaryOps.h +52 -0
- data/ext/eigen/eigen3/signature_of_eigen3_matrix_library +1 -0
- data/ext/eigen/eigen_wrap.cxx +19420 -10396
- data/ext/eigen/extconf.rb +37 -2
- data/lib/eigen.rb +146 -3
- metadata +294 -7
@@ -0,0 +1,233 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
//
|
6
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
7
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
8
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
9
|
+
|
10
|
+
#ifndef EIGEN_COMPRESSED_STORAGE_H
|
11
|
+
#define EIGEN_COMPRESSED_STORAGE_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
/** \internal
|
18
|
+
* Stores a sparse set of values as a list of values and a list of indices.
|
19
|
+
*
|
20
|
+
*/
|
21
|
+
template<typename _Scalar,typename _Index>
|
22
|
+
class CompressedStorage
|
23
|
+
{
|
24
|
+
public:
|
25
|
+
|
26
|
+
typedef _Scalar Scalar;
|
27
|
+
typedef _Index Index;
|
28
|
+
|
29
|
+
protected:
|
30
|
+
|
31
|
+
typedef typename NumTraits<Scalar>::Real RealScalar;
|
32
|
+
|
33
|
+
public:
|
34
|
+
|
35
|
+
CompressedStorage()
|
36
|
+
: m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
|
37
|
+
{}
|
38
|
+
|
39
|
+
CompressedStorage(size_t size)
|
40
|
+
: m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
|
41
|
+
{
|
42
|
+
resize(size);
|
43
|
+
}
|
44
|
+
|
45
|
+
CompressedStorage(const CompressedStorage& other)
|
46
|
+
: m_values(0), m_indices(0), m_size(0), m_allocatedSize(0)
|
47
|
+
{
|
48
|
+
*this = other;
|
49
|
+
}
|
50
|
+
|
51
|
+
CompressedStorage& operator=(const CompressedStorage& other)
|
52
|
+
{
|
53
|
+
resize(other.size());
|
54
|
+
internal::smart_copy(other.m_values, other.m_values + m_size, m_values);
|
55
|
+
internal::smart_copy(other.m_indices, other.m_indices + m_size, m_indices);
|
56
|
+
return *this;
|
57
|
+
}
|
58
|
+
|
59
|
+
void swap(CompressedStorage& other)
|
60
|
+
{
|
61
|
+
std::swap(m_values, other.m_values);
|
62
|
+
std::swap(m_indices, other.m_indices);
|
63
|
+
std::swap(m_size, other.m_size);
|
64
|
+
std::swap(m_allocatedSize, other.m_allocatedSize);
|
65
|
+
}
|
66
|
+
|
67
|
+
~CompressedStorage()
|
68
|
+
{
|
69
|
+
delete[] m_values;
|
70
|
+
delete[] m_indices;
|
71
|
+
}
|
72
|
+
|
73
|
+
void reserve(size_t size)
|
74
|
+
{
|
75
|
+
size_t newAllocatedSize = m_size + size;
|
76
|
+
if (newAllocatedSize > m_allocatedSize)
|
77
|
+
reallocate(newAllocatedSize);
|
78
|
+
}
|
79
|
+
|
80
|
+
void squeeze()
|
81
|
+
{
|
82
|
+
if (m_allocatedSize>m_size)
|
83
|
+
reallocate(m_size);
|
84
|
+
}
|
85
|
+
|
86
|
+
void resize(size_t size, double reserveSizeFactor = 0)
|
87
|
+
{
|
88
|
+
if (m_allocatedSize<size)
|
89
|
+
reallocate(size + size_t(reserveSizeFactor*double(size)));
|
90
|
+
m_size = size;
|
91
|
+
}
|
92
|
+
|
93
|
+
void append(const Scalar& v, Index i)
|
94
|
+
{
|
95
|
+
Index id = static_cast<Index>(m_size);
|
96
|
+
resize(m_size+1, 1);
|
97
|
+
m_values[id] = v;
|
98
|
+
m_indices[id] = i;
|
99
|
+
}
|
100
|
+
|
101
|
+
inline size_t size() const { return m_size; }
|
102
|
+
inline size_t allocatedSize() const { return m_allocatedSize; }
|
103
|
+
inline void clear() { m_size = 0; }
|
104
|
+
|
105
|
+
inline Scalar& value(size_t i) { return m_values[i]; }
|
106
|
+
inline const Scalar& value(size_t i) const { return m_values[i]; }
|
107
|
+
|
108
|
+
inline Index& index(size_t i) { return m_indices[i]; }
|
109
|
+
inline const Index& index(size_t i) const { return m_indices[i]; }
|
110
|
+
|
111
|
+
static CompressedStorage Map(Index* indices, Scalar* values, size_t size)
|
112
|
+
{
|
113
|
+
CompressedStorage res;
|
114
|
+
res.m_indices = indices;
|
115
|
+
res.m_values = values;
|
116
|
+
res.m_allocatedSize = res.m_size = size;
|
117
|
+
return res;
|
118
|
+
}
|
119
|
+
|
120
|
+
/** \returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */
|
121
|
+
inline Index searchLowerIndex(Index key) const
|
122
|
+
{
|
123
|
+
return searchLowerIndex(0, m_size, key);
|
124
|
+
}
|
125
|
+
|
126
|
+
/** \returns the largest \c k in [start,end) such that for all \c j in [start,k) index[\c j]\<\a key */
|
127
|
+
inline Index searchLowerIndex(size_t start, size_t end, Index key) const
|
128
|
+
{
|
129
|
+
while(end>start)
|
130
|
+
{
|
131
|
+
size_t mid = (end+start)>>1;
|
132
|
+
if (m_indices[mid]<key)
|
133
|
+
start = mid+1;
|
134
|
+
else
|
135
|
+
end = mid;
|
136
|
+
}
|
137
|
+
return static_cast<Index>(start);
|
138
|
+
}
|
139
|
+
|
140
|
+
/** \returns the stored value at index \a key
|
141
|
+
* If the value does not exist, then the value \a defaultValue is returned without any insertion. */
|
142
|
+
inline Scalar at(Index key, const Scalar& defaultValue = Scalar(0)) const
|
143
|
+
{
|
144
|
+
if (m_size==0)
|
145
|
+
return defaultValue;
|
146
|
+
else if (key==m_indices[m_size-1])
|
147
|
+
return m_values[m_size-1];
|
148
|
+
// ^^ optimization: let's first check if it is the last coefficient
|
149
|
+
// (very common in high level algorithms)
|
150
|
+
const size_t id = searchLowerIndex(0,m_size-1,key);
|
151
|
+
return ((id<m_size) && (m_indices[id]==key)) ? m_values[id] : defaultValue;
|
152
|
+
}
|
153
|
+
|
154
|
+
/** Like at(), but the search is performed in the range [start,end) */
|
155
|
+
inline Scalar atInRange(size_t start, size_t end, Index key, const Scalar& defaultValue = Scalar(0)) const
|
156
|
+
{
|
157
|
+
if (start>=end)
|
158
|
+
return Scalar(0);
|
159
|
+
else if (end>start && key==m_indices[end-1])
|
160
|
+
return m_values[end-1];
|
161
|
+
// ^^ optimization: let's first check if it is the last coefficient
|
162
|
+
// (very common in high level algorithms)
|
163
|
+
const size_t id = searchLowerIndex(start,end-1,key);
|
164
|
+
return ((id<end) && (m_indices[id]==key)) ? m_values[id] : defaultValue;
|
165
|
+
}
|
166
|
+
|
167
|
+
/** \returns a reference to the value at index \a key
|
168
|
+
* If the value does not exist, then the value \a defaultValue is inserted
|
169
|
+
* such that the keys are sorted. */
|
170
|
+
inline Scalar& atWithInsertion(Index key, const Scalar& defaultValue = Scalar(0))
|
171
|
+
{
|
172
|
+
size_t id = searchLowerIndex(0,m_size,key);
|
173
|
+
if (id>=m_size || m_indices[id]!=key)
|
174
|
+
{
|
175
|
+
resize(m_size+1,1);
|
176
|
+
for (size_t j=m_size-1; j>id; --j)
|
177
|
+
{
|
178
|
+
m_indices[j] = m_indices[j-1];
|
179
|
+
m_values[j] = m_values[j-1];
|
180
|
+
}
|
181
|
+
m_indices[id] = key;
|
182
|
+
m_values[id] = defaultValue;
|
183
|
+
}
|
184
|
+
return m_values[id];
|
185
|
+
}
|
186
|
+
|
187
|
+
void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits<RealScalar>::dummy_precision())
|
188
|
+
{
|
189
|
+
size_t k = 0;
|
190
|
+
size_t n = size();
|
191
|
+
for (size_t i=0; i<n; ++i)
|
192
|
+
{
|
193
|
+
if (!internal::isMuchSmallerThan(value(i), reference, epsilon))
|
194
|
+
{
|
195
|
+
value(k) = value(i);
|
196
|
+
index(k) = index(i);
|
197
|
+
++k;
|
198
|
+
}
|
199
|
+
}
|
200
|
+
resize(k,0);
|
201
|
+
}
|
202
|
+
|
203
|
+
protected:
|
204
|
+
|
205
|
+
inline void reallocate(size_t size)
|
206
|
+
{
|
207
|
+
Scalar* newValues = new Scalar[size];
|
208
|
+
Index* newIndices = new Index[size];
|
209
|
+
size_t copySize = (std::min)(size, m_size);
|
210
|
+
// copy
|
211
|
+
internal::smart_copy(m_values, m_values+copySize, newValues);
|
212
|
+
internal::smart_copy(m_indices, m_indices+copySize, newIndices);
|
213
|
+
// delete old stuff
|
214
|
+
delete[] m_values;
|
215
|
+
delete[] m_indices;
|
216
|
+
m_values = newValues;
|
217
|
+
m_indices = newIndices;
|
218
|
+
m_allocatedSize = size;
|
219
|
+
}
|
220
|
+
|
221
|
+
protected:
|
222
|
+
Scalar* m_values;
|
223
|
+
Index* m_indices;
|
224
|
+
size_t m_size;
|
225
|
+
size_t m_allocatedSize;
|
226
|
+
|
227
|
+
};
|
228
|
+
|
229
|
+
} // end namespace internal
|
230
|
+
|
231
|
+
} // end namespace Eigen
|
232
|
+
|
233
|
+
#endif // EIGEN_COMPRESSED_STORAGE_H
|
@@ -0,0 +1,245 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008-2011 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_CONSERVATIVESPARSESPARSEPRODUCT_H
|
11
|
+
#define EIGEN_CONSERVATIVESPARSESPARSEPRODUCT_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
18
|
+
static void conservative_sparse_sparse_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
19
|
+
{
|
20
|
+
typedef typename remove_all<Lhs>::type::Scalar Scalar;
|
21
|
+
typedef typename remove_all<Lhs>::type::Index Index;
|
22
|
+
|
23
|
+
// make sure to call innerSize/outerSize since we fake the storage order.
|
24
|
+
Index rows = lhs.innerSize();
|
25
|
+
Index cols = rhs.outerSize();
|
26
|
+
eigen_assert(lhs.outerSize() == rhs.innerSize());
|
27
|
+
|
28
|
+
std::vector<bool> mask(rows,false);
|
29
|
+
Matrix<Scalar,Dynamic,1> values(rows);
|
30
|
+
Matrix<Index,Dynamic,1> indices(rows);
|
31
|
+
|
32
|
+
// estimate the number of non zero entries
|
33
|
+
// given a rhs column containing Y non zeros, we assume that the respective Y columns
|
34
|
+
// of the lhs differs in average of one non zeros, thus the number of non zeros for
|
35
|
+
// the product of a rhs column with the lhs is X+Y where X is the average number of non zero
|
36
|
+
// per column of the lhs.
|
37
|
+
// Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs)
|
38
|
+
Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
|
39
|
+
|
40
|
+
res.setZero();
|
41
|
+
res.reserve(Index(estimated_nnz_prod));
|
42
|
+
// we compute each column of the result, one after the other
|
43
|
+
for (Index j=0; j<cols; ++j)
|
44
|
+
{
|
45
|
+
|
46
|
+
res.startVec(j);
|
47
|
+
Index nnz = 0;
|
48
|
+
for (typename Rhs::InnerIterator rhsIt(rhs, j); rhsIt; ++rhsIt)
|
49
|
+
{
|
50
|
+
Scalar y = rhsIt.value();
|
51
|
+
Index k = rhsIt.index();
|
52
|
+
for (typename Lhs::InnerIterator lhsIt(lhs, k); lhsIt; ++lhsIt)
|
53
|
+
{
|
54
|
+
Index i = lhsIt.index();
|
55
|
+
Scalar x = lhsIt.value();
|
56
|
+
if(!mask[i])
|
57
|
+
{
|
58
|
+
mask[i] = true;
|
59
|
+
values[i] = x * y;
|
60
|
+
indices[nnz] = i;
|
61
|
+
++nnz;
|
62
|
+
}
|
63
|
+
else
|
64
|
+
values[i] += x * y;
|
65
|
+
}
|
66
|
+
}
|
67
|
+
|
68
|
+
// unordered insertion
|
69
|
+
for(Index k=0; k<nnz; ++k)
|
70
|
+
{
|
71
|
+
Index i = indices[k];
|
72
|
+
res.insertBackByOuterInnerUnordered(j,i) = values[i];
|
73
|
+
mask[i] = false;
|
74
|
+
}
|
75
|
+
|
76
|
+
#if 0
|
77
|
+
// alternative ordered insertion code:
|
78
|
+
|
79
|
+
Index t200 = rows/(log2(200)*1.39);
|
80
|
+
Index t = (rows*100)/139;
|
81
|
+
|
82
|
+
// FIXME reserve nnz non zeros
|
83
|
+
// FIXME implement fast sort algorithms for very small nnz
|
84
|
+
// if the result is sparse enough => use a quick sort
|
85
|
+
// otherwise => loop through the entire vector
|
86
|
+
// In order to avoid to perform an expensive log2 when the
|
87
|
+
// result is clearly very sparse we use a linear bound up to 200.
|
88
|
+
//if((nnz<200 && nnz<t200) || nnz * log2(nnz) < t)
|
89
|
+
//res.startVec(j);
|
90
|
+
if(true)
|
91
|
+
{
|
92
|
+
if(nnz>1) std::sort(indices.data(),indices.data()+nnz);
|
93
|
+
for(Index k=0; k<nnz; ++k)
|
94
|
+
{
|
95
|
+
Index i = indices[k];
|
96
|
+
res.insertBackByOuterInner(j,i) = values[i];
|
97
|
+
mask[i] = false;
|
98
|
+
}
|
99
|
+
}
|
100
|
+
else
|
101
|
+
{
|
102
|
+
// dense path
|
103
|
+
for(Index i=0; i<rows; ++i)
|
104
|
+
{
|
105
|
+
if(mask[i])
|
106
|
+
{
|
107
|
+
mask[i] = false;
|
108
|
+
res.insertBackByOuterInner(j,i) = values[i];
|
109
|
+
}
|
110
|
+
}
|
111
|
+
}
|
112
|
+
#endif
|
113
|
+
|
114
|
+
}
|
115
|
+
res.finalize();
|
116
|
+
}
|
117
|
+
|
118
|
+
|
119
|
+
} // end namespace internal
|
120
|
+
|
121
|
+
namespace internal {
|
122
|
+
|
123
|
+
template<typename Lhs, typename Rhs, typename ResultType,
|
124
|
+
int LhsStorageOrder = (traits<Lhs>::Flags&RowMajorBit) ? RowMajor : ColMajor,
|
125
|
+
int RhsStorageOrder = (traits<Rhs>::Flags&RowMajorBit) ? RowMajor : ColMajor,
|
126
|
+
int ResStorageOrder = (traits<ResultType>::Flags&RowMajorBit) ? RowMajor : ColMajor>
|
127
|
+
struct conservative_sparse_sparse_product_selector;
|
128
|
+
|
129
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
130
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,ColMajor>
|
131
|
+
{
|
132
|
+
typedef typename remove_all<Lhs>::type LhsCleaned;
|
133
|
+
typedef typename LhsCleaned::Scalar Scalar;
|
134
|
+
|
135
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
136
|
+
{
|
137
|
+
typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatrix;
|
138
|
+
typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatrix;
|
139
|
+
ColMajorMatrix resCol(lhs.rows(),rhs.cols());
|
140
|
+
internal::conservative_sparse_sparse_product_impl<Lhs,Rhs,ColMajorMatrix>(lhs, rhs, resCol);
|
141
|
+
// sort the non zeros:
|
142
|
+
RowMajorMatrix resRow(resCol);
|
143
|
+
res = resRow;
|
144
|
+
}
|
145
|
+
};
|
146
|
+
|
147
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
148
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,RowMajor,ColMajor,ColMajor>
|
149
|
+
{
|
150
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
151
|
+
{
|
152
|
+
typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatrix;
|
153
|
+
RowMajorMatrix rhsRow = rhs;
|
154
|
+
RowMajorMatrix resRow(lhs.rows(), rhs.cols());
|
155
|
+
internal::conservative_sparse_sparse_product_impl<RowMajorMatrix,Lhs,RowMajorMatrix>(rhsRow, lhs, resRow);
|
156
|
+
res = resRow;
|
157
|
+
}
|
158
|
+
};
|
159
|
+
|
160
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
161
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,ColMajor,RowMajor,ColMajor>
|
162
|
+
{
|
163
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
164
|
+
{
|
165
|
+
typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatrix;
|
166
|
+
RowMajorMatrix lhsRow = lhs;
|
167
|
+
RowMajorMatrix resRow(lhs.rows(), rhs.cols());
|
168
|
+
internal::conservative_sparse_sparse_product_impl<Rhs,RowMajorMatrix,RowMajorMatrix>(rhs, lhsRow, resRow);
|
169
|
+
res = resRow;
|
170
|
+
}
|
171
|
+
};
|
172
|
+
|
173
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
174
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,RowMajor,RowMajor,ColMajor>
|
175
|
+
{
|
176
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
177
|
+
{
|
178
|
+
typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatrix;
|
179
|
+
RowMajorMatrix resRow(lhs.rows(), rhs.cols());
|
180
|
+
internal::conservative_sparse_sparse_product_impl<Rhs,Lhs,RowMajorMatrix>(rhs, lhs, resRow);
|
181
|
+
res = resRow;
|
182
|
+
}
|
183
|
+
};
|
184
|
+
|
185
|
+
|
186
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
187
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,ColMajor,ColMajor,RowMajor>
|
188
|
+
{
|
189
|
+
typedef typename traits<typename remove_all<Lhs>::type>::Scalar Scalar;
|
190
|
+
|
191
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
192
|
+
{
|
193
|
+
typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatrix;
|
194
|
+
ColMajorMatrix resCol(lhs.rows(), rhs.cols());
|
195
|
+
internal::conservative_sparse_sparse_product_impl<Lhs,Rhs,ColMajorMatrix>(lhs, rhs, resCol);
|
196
|
+
res = resCol;
|
197
|
+
}
|
198
|
+
};
|
199
|
+
|
200
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
201
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,RowMajor,ColMajor,RowMajor>
|
202
|
+
{
|
203
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
204
|
+
{
|
205
|
+
typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatrix;
|
206
|
+
ColMajorMatrix lhsCol = lhs;
|
207
|
+
ColMajorMatrix resCol(lhs.rows(), rhs.cols());
|
208
|
+
internal::conservative_sparse_sparse_product_impl<ColMajorMatrix,Rhs,ColMajorMatrix>(lhsCol, rhs, resCol);
|
209
|
+
res = resCol;
|
210
|
+
}
|
211
|
+
};
|
212
|
+
|
213
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
214
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,ColMajor,RowMajor,RowMajor>
|
215
|
+
{
|
216
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
217
|
+
{
|
218
|
+
typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatrix;
|
219
|
+
ColMajorMatrix rhsCol = rhs;
|
220
|
+
ColMajorMatrix resCol(lhs.rows(), rhs.cols());
|
221
|
+
internal::conservative_sparse_sparse_product_impl<Lhs,ColMajorMatrix,ColMajorMatrix>(lhs, rhsCol, resCol);
|
222
|
+
res = resCol;
|
223
|
+
}
|
224
|
+
};
|
225
|
+
|
226
|
+
template<typename Lhs, typename Rhs, typename ResultType>
|
227
|
+
struct conservative_sparse_sparse_product_selector<Lhs,Rhs,ResultType,RowMajor,RowMajor,RowMajor>
|
228
|
+
{
|
229
|
+
static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res)
|
230
|
+
{
|
231
|
+
typedef SparseMatrix<typename ResultType::Scalar,RowMajor,typename ResultType::Index> RowMajorMatrix;
|
232
|
+
typedef SparseMatrix<typename ResultType::Scalar,ColMajor,typename ResultType::Index> ColMajorMatrix;
|
233
|
+
RowMajorMatrix resRow(lhs.rows(),rhs.cols());
|
234
|
+
internal::conservative_sparse_sparse_product_impl<Rhs,Lhs,RowMajorMatrix>(rhs, lhs, resRow);
|
235
|
+
// sort the non zeros:
|
236
|
+
ColMajorMatrix resCol(resRow);
|
237
|
+
res = resCol;
|
238
|
+
}
|
239
|
+
};
|
240
|
+
|
241
|
+
} // end namespace internal
|
242
|
+
|
243
|
+
} // end namespace Eigen
|
244
|
+
|
245
|
+
#endif // EIGEN_CONSERVATIVESPARSESPARSEPRODUCT_H
|