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,174 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2008-2012 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
|
+
/*
|
11
|
+
NOTE: these functions have been adapted from the LDL library:
|
12
|
+
|
13
|
+
LDL Copyright (c) 2005 by Timothy A. Davis. All Rights Reserved.
|
14
|
+
|
15
|
+
The author of LDL, Timothy A. Davis., has executed a license with Google LLC
|
16
|
+
to permit distribution of this code and derivative works as part of Eigen under
|
17
|
+
the Mozilla Public License v. 2.0, as stated at the top of this file.
|
18
|
+
*/
|
19
|
+
|
20
|
+
#ifndef EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H
|
21
|
+
#define EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H
|
22
|
+
|
23
|
+
namespace Eigen {
|
24
|
+
|
25
|
+
template<typename Derived>
|
26
|
+
void SimplicialCholeskyBase<Derived>::analyzePattern_preordered(const CholMatrixType& ap, bool doLDLT)
|
27
|
+
{
|
28
|
+
const StorageIndex size = StorageIndex(ap.rows());
|
29
|
+
m_matrix.resize(size, size);
|
30
|
+
m_parent.resize(size);
|
31
|
+
m_nonZerosPerCol.resize(size);
|
32
|
+
|
33
|
+
ei_declare_aligned_stack_constructed_variable(StorageIndex, tags, size, 0);
|
34
|
+
|
35
|
+
for(StorageIndex k = 0; k < size; ++k)
|
36
|
+
{
|
37
|
+
/* L(k,:) pattern: all nodes reachable in etree from nz in A(0:k-1,k) */
|
38
|
+
m_parent[k] = -1; /* parent of k is not yet known */
|
39
|
+
tags[k] = k; /* mark node k as visited */
|
40
|
+
m_nonZerosPerCol[k] = 0; /* count of nonzeros in column k of L */
|
41
|
+
for(typename CholMatrixType::InnerIterator it(ap,k); it; ++it)
|
42
|
+
{
|
43
|
+
StorageIndex i = it.index();
|
44
|
+
if(i < k)
|
45
|
+
{
|
46
|
+
/* follow path from i to root of etree, stop at flagged node */
|
47
|
+
for(; tags[i] != k; i = m_parent[i])
|
48
|
+
{
|
49
|
+
/* find parent of i if not yet determined */
|
50
|
+
if (m_parent[i] == -1)
|
51
|
+
m_parent[i] = k;
|
52
|
+
m_nonZerosPerCol[i]++; /* L (k,i) is nonzero */
|
53
|
+
tags[i] = k; /* mark i as visited */
|
54
|
+
}
|
55
|
+
}
|
56
|
+
}
|
57
|
+
}
|
58
|
+
|
59
|
+
/* construct Lp index array from m_nonZerosPerCol column counts */
|
60
|
+
StorageIndex* Lp = m_matrix.outerIndexPtr();
|
61
|
+
Lp[0] = 0;
|
62
|
+
for(StorageIndex k = 0; k < size; ++k)
|
63
|
+
Lp[k+1] = Lp[k] + m_nonZerosPerCol[k] + (doLDLT ? 0 : 1);
|
64
|
+
|
65
|
+
m_matrix.resizeNonZeros(Lp[size]);
|
66
|
+
|
67
|
+
m_isInitialized = true;
|
68
|
+
m_info = Success;
|
69
|
+
m_analysisIsOk = true;
|
70
|
+
m_factorizationIsOk = false;
|
71
|
+
}
|
72
|
+
|
73
|
+
|
74
|
+
template<typename Derived>
|
75
|
+
template<bool DoLDLT>
|
76
|
+
void SimplicialCholeskyBase<Derived>::factorize_preordered(const CholMatrixType& ap)
|
77
|
+
{
|
78
|
+
using std::sqrt;
|
79
|
+
|
80
|
+
eigen_assert(m_analysisIsOk && "You must first call analyzePattern()");
|
81
|
+
eigen_assert(ap.rows()==ap.cols());
|
82
|
+
eigen_assert(m_parent.size()==ap.rows());
|
83
|
+
eigen_assert(m_nonZerosPerCol.size()==ap.rows());
|
84
|
+
|
85
|
+
const StorageIndex size = StorageIndex(ap.rows());
|
86
|
+
const StorageIndex* Lp = m_matrix.outerIndexPtr();
|
87
|
+
StorageIndex* Li = m_matrix.innerIndexPtr();
|
88
|
+
Scalar* Lx = m_matrix.valuePtr();
|
89
|
+
|
90
|
+
ei_declare_aligned_stack_constructed_variable(Scalar, y, size, 0);
|
91
|
+
ei_declare_aligned_stack_constructed_variable(StorageIndex, pattern, size, 0);
|
92
|
+
ei_declare_aligned_stack_constructed_variable(StorageIndex, tags, size, 0);
|
93
|
+
|
94
|
+
bool ok = true;
|
95
|
+
m_diag.resize(DoLDLT ? size : 0);
|
96
|
+
|
97
|
+
for(StorageIndex k = 0; k < size; ++k)
|
98
|
+
{
|
99
|
+
// compute nonzero pattern of kth row of L, in topological order
|
100
|
+
y[k] = Scalar(0); // Y(0:k) is now all zero
|
101
|
+
StorageIndex top = size; // stack for pattern is empty
|
102
|
+
tags[k] = k; // mark node k as visited
|
103
|
+
m_nonZerosPerCol[k] = 0; // count of nonzeros in column k of L
|
104
|
+
for(typename CholMatrixType::InnerIterator it(ap,k); it; ++it)
|
105
|
+
{
|
106
|
+
StorageIndex i = it.index();
|
107
|
+
if(i <= k)
|
108
|
+
{
|
109
|
+
y[i] += numext::conj(it.value()); /* scatter A(i,k) into Y (sum duplicates) */
|
110
|
+
Index len;
|
111
|
+
for(len = 0; tags[i] != k; i = m_parent[i])
|
112
|
+
{
|
113
|
+
pattern[len++] = i; /* L(k,i) is nonzero */
|
114
|
+
tags[i] = k; /* mark i as visited */
|
115
|
+
}
|
116
|
+
while(len > 0)
|
117
|
+
pattern[--top] = pattern[--len];
|
118
|
+
}
|
119
|
+
}
|
120
|
+
|
121
|
+
/* compute numerical values kth row of L (a sparse triangular solve) */
|
122
|
+
|
123
|
+
RealScalar d = numext::real(y[k]) * m_shiftScale + m_shiftOffset; // get D(k,k), apply the shift function, and clear Y(k)
|
124
|
+
y[k] = Scalar(0);
|
125
|
+
for(; top < size; ++top)
|
126
|
+
{
|
127
|
+
Index i = pattern[top]; /* pattern[top:n-1] is pattern of L(:,k) */
|
128
|
+
Scalar yi = y[i]; /* get and clear Y(i) */
|
129
|
+
y[i] = Scalar(0);
|
130
|
+
|
131
|
+
/* the nonzero entry L(k,i) */
|
132
|
+
Scalar l_ki;
|
133
|
+
if(DoLDLT)
|
134
|
+
l_ki = yi / numext::real(m_diag[i]);
|
135
|
+
else
|
136
|
+
yi = l_ki = yi / Lx[Lp[i]];
|
137
|
+
|
138
|
+
Index p2 = Lp[i] + m_nonZerosPerCol[i];
|
139
|
+
Index p;
|
140
|
+
for(p = Lp[i] + (DoLDLT ? 0 : 1); p < p2; ++p)
|
141
|
+
y[Li[p]] -= numext::conj(Lx[p]) * yi;
|
142
|
+
d -= numext::real(l_ki * numext::conj(yi));
|
143
|
+
Li[p] = k; /* store L(k,i) in column form of L */
|
144
|
+
Lx[p] = l_ki;
|
145
|
+
++m_nonZerosPerCol[i]; /* increment count of nonzeros in col i */
|
146
|
+
}
|
147
|
+
if(DoLDLT)
|
148
|
+
{
|
149
|
+
m_diag[k] = d;
|
150
|
+
if(d == RealScalar(0))
|
151
|
+
{
|
152
|
+
ok = false; /* failure, D(k,k) is zero */
|
153
|
+
break;
|
154
|
+
}
|
155
|
+
}
|
156
|
+
else
|
157
|
+
{
|
158
|
+
Index p = Lp[k] + m_nonZerosPerCol[k]++;
|
159
|
+
Li[p] = k ; /* store L(k,k) = sqrt (d) in column k */
|
160
|
+
if(d <= RealScalar(0)) {
|
161
|
+
ok = false; /* failure, matrix is not positive definite */
|
162
|
+
break;
|
163
|
+
}
|
164
|
+
Lx[p] = sqrt(d) ;
|
165
|
+
}
|
166
|
+
}
|
167
|
+
|
168
|
+
m_info = ok ? Success : NumericalIssue;
|
169
|
+
m_factorizationIsOk = true;
|
170
|
+
}
|
171
|
+
|
172
|
+
} // end namespace Eigen
|
173
|
+
|
174
|
+
#endif // EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H
|
@@ -0,0 +1,378 @@
|
|
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_AMBIVECTOR_H
|
11
|
+
#define EIGEN_AMBIVECTOR_H
|
12
|
+
|
13
|
+
namespace Eigen {
|
14
|
+
|
15
|
+
namespace internal {
|
16
|
+
|
17
|
+
/** \internal
|
18
|
+
* Hybrid sparse/dense vector class designed for intensive read-write operations.
|
19
|
+
*
|
20
|
+
* See BasicSparseLLT and SparseProduct for usage examples.
|
21
|
+
*/
|
22
|
+
template<typename _Scalar, typename _StorageIndex>
|
23
|
+
class AmbiVector
|
24
|
+
{
|
25
|
+
public:
|
26
|
+
typedef _Scalar Scalar;
|
27
|
+
typedef _StorageIndex StorageIndex;
|
28
|
+
typedef typename NumTraits<Scalar>::Real RealScalar;
|
29
|
+
|
30
|
+
explicit AmbiVector(Index size)
|
31
|
+
: m_buffer(0), m_zero(0), m_size(0), m_end(0), m_allocatedSize(0), m_allocatedElements(0), m_mode(-1)
|
32
|
+
{
|
33
|
+
resize(size);
|
34
|
+
}
|
35
|
+
|
36
|
+
void init(double estimatedDensity);
|
37
|
+
void init(int mode);
|
38
|
+
|
39
|
+
Index nonZeros() const;
|
40
|
+
|
41
|
+
/** Specifies a sub-vector to work on */
|
42
|
+
void setBounds(Index start, Index end) { m_start = convert_index(start); m_end = convert_index(end); }
|
43
|
+
|
44
|
+
void setZero();
|
45
|
+
|
46
|
+
void restart();
|
47
|
+
Scalar& coeffRef(Index i);
|
48
|
+
Scalar& coeff(Index i);
|
49
|
+
|
50
|
+
class Iterator;
|
51
|
+
|
52
|
+
~AmbiVector() { delete[] m_buffer; }
|
53
|
+
|
54
|
+
void resize(Index size)
|
55
|
+
{
|
56
|
+
if (m_allocatedSize < size)
|
57
|
+
reallocate(size);
|
58
|
+
m_size = convert_index(size);
|
59
|
+
}
|
60
|
+
|
61
|
+
StorageIndex size() const { return m_size; }
|
62
|
+
|
63
|
+
protected:
|
64
|
+
StorageIndex convert_index(Index idx)
|
65
|
+
{
|
66
|
+
return internal::convert_index<StorageIndex>(idx);
|
67
|
+
}
|
68
|
+
|
69
|
+
void reallocate(Index size)
|
70
|
+
{
|
71
|
+
// if the size of the matrix is not too large, let's allocate a bit more than needed such
|
72
|
+
// that we can handle dense vector even in sparse mode.
|
73
|
+
delete[] m_buffer;
|
74
|
+
if (size<1000)
|
75
|
+
{
|
76
|
+
Index allocSize = (size * sizeof(ListEl) + sizeof(Scalar) - 1)/sizeof(Scalar);
|
77
|
+
m_allocatedElements = convert_index((allocSize*sizeof(Scalar))/sizeof(ListEl));
|
78
|
+
m_buffer = new Scalar[allocSize];
|
79
|
+
}
|
80
|
+
else
|
81
|
+
{
|
82
|
+
m_allocatedElements = convert_index((size*sizeof(Scalar))/sizeof(ListEl));
|
83
|
+
m_buffer = new Scalar[size];
|
84
|
+
}
|
85
|
+
m_size = convert_index(size);
|
86
|
+
m_start = 0;
|
87
|
+
m_end = m_size;
|
88
|
+
}
|
89
|
+
|
90
|
+
void reallocateSparse()
|
91
|
+
{
|
92
|
+
Index copyElements = m_allocatedElements;
|
93
|
+
m_allocatedElements = (std::min)(StorageIndex(m_allocatedElements*1.5),m_size);
|
94
|
+
Index allocSize = m_allocatedElements * sizeof(ListEl);
|
95
|
+
allocSize = (allocSize + sizeof(Scalar) - 1)/sizeof(Scalar);
|
96
|
+
Scalar* newBuffer = new Scalar[allocSize];
|
97
|
+
std::memcpy(newBuffer, m_buffer, copyElements * sizeof(ListEl));
|
98
|
+
delete[] m_buffer;
|
99
|
+
m_buffer = newBuffer;
|
100
|
+
}
|
101
|
+
|
102
|
+
protected:
|
103
|
+
// element type of the linked list
|
104
|
+
struct ListEl
|
105
|
+
{
|
106
|
+
StorageIndex next;
|
107
|
+
StorageIndex index;
|
108
|
+
Scalar value;
|
109
|
+
};
|
110
|
+
|
111
|
+
// used to store data in both mode
|
112
|
+
Scalar* m_buffer;
|
113
|
+
Scalar m_zero;
|
114
|
+
StorageIndex m_size;
|
115
|
+
StorageIndex m_start;
|
116
|
+
StorageIndex m_end;
|
117
|
+
StorageIndex m_allocatedSize;
|
118
|
+
StorageIndex m_allocatedElements;
|
119
|
+
StorageIndex m_mode;
|
120
|
+
|
121
|
+
// linked list mode
|
122
|
+
StorageIndex m_llStart;
|
123
|
+
StorageIndex m_llCurrent;
|
124
|
+
StorageIndex m_llSize;
|
125
|
+
};
|
126
|
+
|
127
|
+
/** \returns the number of non zeros in the current sub vector */
|
128
|
+
template<typename _Scalar,typename _StorageIndex>
|
129
|
+
Index AmbiVector<_Scalar,_StorageIndex>::nonZeros() const
|
130
|
+
{
|
131
|
+
if (m_mode==IsSparse)
|
132
|
+
return m_llSize;
|
133
|
+
else
|
134
|
+
return m_end - m_start;
|
135
|
+
}
|
136
|
+
|
137
|
+
template<typename _Scalar,typename _StorageIndex>
|
138
|
+
void AmbiVector<_Scalar,_StorageIndex>::init(double estimatedDensity)
|
139
|
+
{
|
140
|
+
if (estimatedDensity>0.1)
|
141
|
+
init(IsDense);
|
142
|
+
else
|
143
|
+
init(IsSparse);
|
144
|
+
}
|
145
|
+
|
146
|
+
template<typename _Scalar,typename _StorageIndex>
|
147
|
+
void AmbiVector<_Scalar,_StorageIndex>::init(int mode)
|
148
|
+
{
|
149
|
+
m_mode = mode;
|
150
|
+
// This is only necessary in sparse mode, but we set these unconditionally to avoid some maybe-uninitialized warnings
|
151
|
+
// if (m_mode==IsSparse)
|
152
|
+
{
|
153
|
+
m_llSize = 0;
|
154
|
+
m_llStart = -1;
|
155
|
+
}
|
156
|
+
}
|
157
|
+
|
158
|
+
/** Must be called whenever we might perform a write access
|
159
|
+
* with an index smaller than the previous one.
|
160
|
+
*
|
161
|
+
* Don't worry, this function is extremely cheap.
|
162
|
+
*/
|
163
|
+
template<typename _Scalar,typename _StorageIndex>
|
164
|
+
void AmbiVector<_Scalar,_StorageIndex>::restart()
|
165
|
+
{
|
166
|
+
m_llCurrent = m_llStart;
|
167
|
+
}
|
168
|
+
|
169
|
+
/** Set all coefficients of current subvector to zero */
|
170
|
+
template<typename _Scalar,typename _StorageIndex>
|
171
|
+
void AmbiVector<_Scalar,_StorageIndex>::setZero()
|
172
|
+
{
|
173
|
+
if (m_mode==IsDense)
|
174
|
+
{
|
175
|
+
for (Index i=m_start; i<m_end; ++i)
|
176
|
+
m_buffer[i] = Scalar(0);
|
177
|
+
}
|
178
|
+
else
|
179
|
+
{
|
180
|
+
eigen_assert(m_mode==IsSparse);
|
181
|
+
m_llSize = 0;
|
182
|
+
m_llStart = -1;
|
183
|
+
}
|
184
|
+
}
|
185
|
+
|
186
|
+
template<typename _Scalar,typename _StorageIndex>
|
187
|
+
_Scalar& AmbiVector<_Scalar,_StorageIndex>::coeffRef(Index i)
|
188
|
+
{
|
189
|
+
if (m_mode==IsDense)
|
190
|
+
return m_buffer[i];
|
191
|
+
else
|
192
|
+
{
|
193
|
+
ListEl* EIGEN_RESTRICT llElements = reinterpret_cast<ListEl*>(m_buffer);
|
194
|
+
// TODO factorize the following code to reduce code generation
|
195
|
+
eigen_assert(m_mode==IsSparse);
|
196
|
+
if (m_llSize==0)
|
197
|
+
{
|
198
|
+
// this is the first element
|
199
|
+
m_llStart = 0;
|
200
|
+
m_llCurrent = 0;
|
201
|
+
++m_llSize;
|
202
|
+
llElements[0].value = Scalar(0);
|
203
|
+
llElements[0].index = convert_index(i);
|
204
|
+
llElements[0].next = -1;
|
205
|
+
return llElements[0].value;
|
206
|
+
}
|
207
|
+
else if (i<llElements[m_llStart].index)
|
208
|
+
{
|
209
|
+
// this is going to be the new first element of the list
|
210
|
+
ListEl& el = llElements[m_llSize];
|
211
|
+
el.value = Scalar(0);
|
212
|
+
el.index = convert_index(i);
|
213
|
+
el.next = m_llStart;
|
214
|
+
m_llStart = m_llSize;
|
215
|
+
++m_llSize;
|
216
|
+
m_llCurrent = m_llStart;
|
217
|
+
return el.value;
|
218
|
+
}
|
219
|
+
else
|
220
|
+
{
|
221
|
+
StorageIndex nextel = llElements[m_llCurrent].next;
|
222
|
+
eigen_assert(i>=llElements[m_llCurrent].index && "you must call restart() before inserting an element with lower or equal index");
|
223
|
+
while (nextel >= 0 && llElements[nextel].index<=i)
|
224
|
+
{
|
225
|
+
m_llCurrent = nextel;
|
226
|
+
nextel = llElements[nextel].next;
|
227
|
+
}
|
228
|
+
|
229
|
+
if (llElements[m_llCurrent].index==i)
|
230
|
+
{
|
231
|
+
// the coefficient already exists and we found it !
|
232
|
+
return llElements[m_llCurrent].value;
|
233
|
+
}
|
234
|
+
else
|
235
|
+
{
|
236
|
+
if (m_llSize>=m_allocatedElements)
|
237
|
+
{
|
238
|
+
reallocateSparse();
|
239
|
+
llElements = reinterpret_cast<ListEl*>(m_buffer);
|
240
|
+
}
|
241
|
+
eigen_internal_assert(m_llSize<m_allocatedElements && "internal error: overflow in sparse mode");
|
242
|
+
// let's insert a new coefficient
|
243
|
+
ListEl& el = llElements[m_llSize];
|
244
|
+
el.value = Scalar(0);
|
245
|
+
el.index = convert_index(i);
|
246
|
+
el.next = llElements[m_llCurrent].next;
|
247
|
+
llElements[m_llCurrent].next = m_llSize;
|
248
|
+
++m_llSize;
|
249
|
+
return el.value;
|
250
|
+
}
|
251
|
+
}
|
252
|
+
}
|
253
|
+
}
|
254
|
+
|
255
|
+
template<typename _Scalar,typename _StorageIndex>
|
256
|
+
_Scalar& AmbiVector<_Scalar,_StorageIndex>::coeff(Index i)
|
257
|
+
{
|
258
|
+
if (m_mode==IsDense)
|
259
|
+
return m_buffer[i];
|
260
|
+
else
|
261
|
+
{
|
262
|
+
ListEl* EIGEN_RESTRICT llElements = reinterpret_cast<ListEl*>(m_buffer);
|
263
|
+
eigen_assert(m_mode==IsSparse);
|
264
|
+
if ((m_llSize==0) || (i<llElements[m_llStart].index))
|
265
|
+
{
|
266
|
+
return m_zero;
|
267
|
+
}
|
268
|
+
else
|
269
|
+
{
|
270
|
+
Index elid = m_llStart;
|
271
|
+
while (elid >= 0 && llElements[elid].index<i)
|
272
|
+
elid = llElements[elid].next;
|
273
|
+
|
274
|
+
if (llElements[elid].index==i)
|
275
|
+
return llElements[m_llCurrent].value;
|
276
|
+
else
|
277
|
+
return m_zero;
|
278
|
+
}
|
279
|
+
}
|
280
|
+
}
|
281
|
+
|
282
|
+
/** Iterator over the nonzero coefficients */
|
283
|
+
template<typename _Scalar,typename _StorageIndex>
|
284
|
+
class AmbiVector<_Scalar,_StorageIndex>::Iterator
|
285
|
+
{
|
286
|
+
public:
|
287
|
+
typedef _Scalar Scalar;
|
288
|
+
typedef typename NumTraits<Scalar>::Real RealScalar;
|
289
|
+
|
290
|
+
/** Default constructor
|
291
|
+
* \param vec the vector on which we iterate
|
292
|
+
* \param epsilon the minimal value used to prune zero coefficients.
|
293
|
+
* In practice, all coefficients having a magnitude smaller than \a epsilon
|
294
|
+
* are skipped.
|
295
|
+
*/
|
296
|
+
explicit Iterator(const AmbiVector& vec, const RealScalar& epsilon = 0)
|
297
|
+
: m_vector(vec)
|
298
|
+
{
|
299
|
+
using std::abs;
|
300
|
+
m_epsilon = epsilon;
|
301
|
+
m_isDense = m_vector.m_mode==IsDense;
|
302
|
+
if (m_isDense)
|
303
|
+
{
|
304
|
+
m_currentEl = 0; // this is to avoid a compilation warning
|
305
|
+
m_cachedValue = 0; // this is to avoid a compilation warning
|
306
|
+
m_cachedIndex = m_vector.m_start-1;
|
307
|
+
++(*this);
|
308
|
+
}
|
309
|
+
else
|
310
|
+
{
|
311
|
+
ListEl* EIGEN_RESTRICT llElements = reinterpret_cast<ListEl*>(m_vector.m_buffer);
|
312
|
+
m_currentEl = m_vector.m_llStart;
|
313
|
+
while (m_currentEl>=0 && abs(llElements[m_currentEl].value)<=m_epsilon)
|
314
|
+
m_currentEl = llElements[m_currentEl].next;
|
315
|
+
if (m_currentEl<0)
|
316
|
+
{
|
317
|
+
m_cachedValue = 0; // this is to avoid a compilation warning
|
318
|
+
m_cachedIndex = -1;
|
319
|
+
}
|
320
|
+
else
|
321
|
+
{
|
322
|
+
m_cachedIndex = llElements[m_currentEl].index;
|
323
|
+
m_cachedValue = llElements[m_currentEl].value;
|
324
|
+
}
|
325
|
+
}
|
326
|
+
}
|
327
|
+
|
328
|
+
StorageIndex index() const { return m_cachedIndex; }
|
329
|
+
Scalar value() const { return m_cachedValue; }
|
330
|
+
|
331
|
+
operator bool() const { return m_cachedIndex>=0; }
|
332
|
+
|
333
|
+
Iterator& operator++()
|
334
|
+
{
|
335
|
+
using std::abs;
|
336
|
+
if (m_isDense)
|
337
|
+
{
|
338
|
+
do {
|
339
|
+
++m_cachedIndex;
|
340
|
+
} while (m_cachedIndex<m_vector.m_end && abs(m_vector.m_buffer[m_cachedIndex])<=m_epsilon);
|
341
|
+
if (m_cachedIndex<m_vector.m_end)
|
342
|
+
m_cachedValue = m_vector.m_buffer[m_cachedIndex];
|
343
|
+
else
|
344
|
+
m_cachedIndex=-1;
|
345
|
+
}
|
346
|
+
else
|
347
|
+
{
|
348
|
+
ListEl* EIGEN_RESTRICT llElements = reinterpret_cast<ListEl*>(m_vector.m_buffer);
|
349
|
+
do {
|
350
|
+
m_currentEl = llElements[m_currentEl].next;
|
351
|
+
} while (m_currentEl>=0 && abs(llElements[m_currentEl].value)<=m_epsilon);
|
352
|
+
if (m_currentEl<0)
|
353
|
+
{
|
354
|
+
m_cachedIndex = -1;
|
355
|
+
}
|
356
|
+
else
|
357
|
+
{
|
358
|
+
m_cachedIndex = llElements[m_currentEl].index;
|
359
|
+
m_cachedValue = llElements[m_currentEl].value;
|
360
|
+
}
|
361
|
+
}
|
362
|
+
return *this;
|
363
|
+
}
|
364
|
+
|
365
|
+
protected:
|
366
|
+
const AmbiVector& m_vector; // the target vector
|
367
|
+
StorageIndex m_currentEl; // the current element in sparse/linked-list mode
|
368
|
+
RealScalar m_epsilon; // epsilon used to prune zero coefficients
|
369
|
+
StorageIndex m_cachedIndex; // current coordinate
|
370
|
+
Scalar m_cachedValue; // current value
|
371
|
+
bool m_isDense; // mode of the vector
|
372
|
+
};
|
373
|
+
|
374
|
+
} // end namespace internal
|
375
|
+
|
376
|
+
} // end namespace Eigen
|
377
|
+
|
378
|
+
#endif // EIGEN_AMBIVECTOR_H
|