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,116 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
// Copyright (C) 2009 Hauke Heibel <hauke.heibel@googlemail.com>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef EIGEN_STDDEQUE_H
|
12
|
+
#define EIGEN_STDDEQUE_H
|
13
|
+
|
14
|
+
#include "details.h"
|
15
|
+
|
16
|
+
/**
|
17
|
+
* This section contains a convenience MACRO which allows an easy specialization of
|
18
|
+
* std::deque such that for data types with alignment issues the correct allocator
|
19
|
+
* is used automatically.
|
20
|
+
*/
|
21
|
+
#define EIGEN_DEFINE_STL_DEQUE_SPECIALIZATION(...) \
|
22
|
+
namespace std \
|
23
|
+
{ \
|
24
|
+
template<> \
|
25
|
+
class deque<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
|
26
|
+
: public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
|
27
|
+
{ \
|
28
|
+
typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \
|
29
|
+
public: \
|
30
|
+
typedef __VA_ARGS__ value_type; \
|
31
|
+
typedef deque_base::allocator_type allocator_type; \
|
32
|
+
typedef deque_base::size_type size_type; \
|
33
|
+
typedef deque_base::iterator iterator; \
|
34
|
+
explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
|
35
|
+
template<typename InputIterator> \
|
36
|
+
deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \
|
37
|
+
deque(const deque& c) : deque_base(c) {} \
|
38
|
+
explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
|
39
|
+
deque(iterator start_, iterator end_) : deque_base(start_, end_) {} \
|
40
|
+
deque& operator=(const deque& x) { \
|
41
|
+
deque_base::operator=(x); \
|
42
|
+
return *this; \
|
43
|
+
} \
|
44
|
+
}; \
|
45
|
+
}
|
46
|
+
|
47
|
+
// check whether we really need the std::deque specialization
|
48
|
+
#if !EIGEN_HAS_CXX11_CONTAINERS && !(defined(_GLIBCXX_DEQUE) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::deque::resize(size_type,const T&). */
|
49
|
+
|
50
|
+
namespace std {
|
51
|
+
|
52
|
+
#define EIGEN_STD_DEQUE_SPECIALIZATION_BODY \
|
53
|
+
public: \
|
54
|
+
typedef T value_type; \
|
55
|
+
typedef typename deque_base::allocator_type allocator_type; \
|
56
|
+
typedef typename deque_base::size_type size_type; \
|
57
|
+
typedef typename deque_base::iterator iterator; \
|
58
|
+
typedef typename deque_base::const_iterator const_iterator; \
|
59
|
+
explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
|
60
|
+
template<typename InputIterator> \
|
61
|
+
deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
|
62
|
+
: deque_base(first, last, a) {} \
|
63
|
+
deque(const deque& c) : deque_base(c) {} \
|
64
|
+
explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
|
65
|
+
deque(iterator start_, iterator end_) : deque_base(start_, end_) {} \
|
66
|
+
deque& operator=(const deque& x) { \
|
67
|
+
deque_base::operator=(x); \
|
68
|
+
return *this; \
|
69
|
+
}
|
70
|
+
|
71
|
+
template<typename T>
|
72
|
+
class deque<T,EIGEN_ALIGNED_ALLOCATOR<T> >
|
73
|
+
: public deque<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
|
74
|
+
Eigen::aligned_allocator_indirection<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T)> >
|
75
|
+
{
|
76
|
+
typedef deque<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
|
77
|
+
Eigen::aligned_allocator_indirection<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T)> > deque_base;
|
78
|
+
EIGEN_STD_DEQUE_SPECIALIZATION_BODY
|
79
|
+
|
80
|
+
void resize(size_type new_size)
|
81
|
+
{ resize(new_size, T()); }
|
82
|
+
|
83
|
+
#if defined(_DEQUE_)
|
84
|
+
// workaround MSVC std::deque implementation
|
85
|
+
void resize(size_type new_size, const value_type& x)
|
86
|
+
{
|
87
|
+
if (deque_base::size() < new_size)
|
88
|
+
deque_base::_Insert_n(deque_base::end(), new_size - deque_base::size(), x);
|
89
|
+
else if (new_size < deque_base::size())
|
90
|
+
deque_base::erase(deque_base::begin() + new_size, deque_base::end());
|
91
|
+
}
|
92
|
+
void push_back(const value_type& x)
|
93
|
+
{ deque_base::push_back(x); }
|
94
|
+
void push_front(const value_type& x)
|
95
|
+
{ deque_base::push_front(x); }
|
96
|
+
using deque_base::insert;
|
97
|
+
iterator insert(const_iterator position, const value_type& x)
|
98
|
+
{ return deque_base::insert(position,x); }
|
99
|
+
void insert(const_iterator position, size_type new_size, const value_type& x)
|
100
|
+
{ deque_base::insert(position, new_size, x); }
|
101
|
+
#else
|
102
|
+
// default implementation which should always work.
|
103
|
+
void resize(size_type new_size, const value_type& x)
|
104
|
+
{
|
105
|
+
if (new_size < deque_base::size())
|
106
|
+
deque_base::erase(deque_base::begin() + new_size, deque_base::end());
|
107
|
+
else if (new_size > deque_base::size())
|
108
|
+
deque_base::insert(deque_base::end(), new_size - deque_base::size(), x);
|
109
|
+
}
|
110
|
+
#endif
|
111
|
+
};
|
112
|
+
}
|
113
|
+
|
114
|
+
#endif // check whether specialization is actually required
|
115
|
+
|
116
|
+
#endif // EIGEN_STDDEQUE_H
|
@@ -0,0 +1,106 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009 Hauke Heibel <hauke.heibel@googlemail.com>
|
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_STDLIST_H
|
11
|
+
#define EIGEN_STDLIST_H
|
12
|
+
|
13
|
+
#include "details.h"
|
14
|
+
|
15
|
+
/**
|
16
|
+
* This section contains a convenience MACRO which allows an easy specialization of
|
17
|
+
* std::list such that for data types with alignment issues the correct allocator
|
18
|
+
* is used automatically.
|
19
|
+
*/
|
20
|
+
#define EIGEN_DEFINE_STL_LIST_SPECIALIZATION(...) \
|
21
|
+
namespace std \
|
22
|
+
{ \
|
23
|
+
template<> \
|
24
|
+
class list<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
|
25
|
+
: public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
|
26
|
+
{ \
|
27
|
+
typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \
|
28
|
+
public: \
|
29
|
+
typedef __VA_ARGS__ value_type; \
|
30
|
+
typedef list_base::allocator_type allocator_type; \
|
31
|
+
typedef list_base::size_type size_type; \
|
32
|
+
typedef list_base::iterator iterator; \
|
33
|
+
explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \
|
34
|
+
template<typename InputIterator> \
|
35
|
+
list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \
|
36
|
+
list(const list& c) : list_base(c) {} \
|
37
|
+
explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {} \
|
38
|
+
list(iterator start_, iterator end_) : list_base(start_, end_) {} \
|
39
|
+
list& operator=(const list& x) { \
|
40
|
+
list_base::operator=(x); \
|
41
|
+
return *this; \
|
42
|
+
} \
|
43
|
+
}; \
|
44
|
+
}
|
45
|
+
|
46
|
+
// check whether we really need the std::list specialization
|
47
|
+
#if !EIGEN_HAS_CXX11_CONTAINERS && !(defined(_GLIBCXX_LIST) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::list::resize(size_type,const T&). */
|
48
|
+
|
49
|
+
namespace std
|
50
|
+
{
|
51
|
+
|
52
|
+
#define EIGEN_STD_LIST_SPECIALIZATION_BODY \
|
53
|
+
public: \
|
54
|
+
typedef T value_type; \
|
55
|
+
typedef typename list_base::allocator_type allocator_type; \
|
56
|
+
typedef typename list_base::size_type size_type; \
|
57
|
+
typedef typename list_base::iterator iterator; \
|
58
|
+
typedef typename list_base::const_iterator const_iterator; \
|
59
|
+
explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \
|
60
|
+
template<typename InputIterator> \
|
61
|
+
list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
|
62
|
+
: list_base(first, last, a) {} \
|
63
|
+
list(const list& c) : list_base(c) {} \
|
64
|
+
explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {} \
|
65
|
+
list(iterator start_, iterator end_) : list_base(start_, end_) {} \
|
66
|
+
list& operator=(const list& x) { \
|
67
|
+
list_base::operator=(x); \
|
68
|
+
return *this; \
|
69
|
+
}
|
70
|
+
|
71
|
+
template<typename T>
|
72
|
+
class list<T,EIGEN_ALIGNED_ALLOCATOR<T> >
|
73
|
+
: public list<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
|
74
|
+
Eigen::aligned_allocator_indirection<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T)> >
|
75
|
+
{
|
76
|
+
typedef list<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
|
77
|
+
Eigen::aligned_allocator_indirection<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T)> > list_base;
|
78
|
+
EIGEN_STD_LIST_SPECIALIZATION_BODY
|
79
|
+
|
80
|
+
void resize(size_type new_size)
|
81
|
+
{ resize(new_size, T()); }
|
82
|
+
|
83
|
+
void resize(size_type new_size, const value_type& x)
|
84
|
+
{
|
85
|
+
if (list_base::size() < new_size)
|
86
|
+
list_base::insert(list_base::end(), new_size - list_base::size(), x);
|
87
|
+
else
|
88
|
+
while (new_size < list_base::size()) list_base::pop_back();
|
89
|
+
}
|
90
|
+
|
91
|
+
#if defined(_LIST_)
|
92
|
+
// workaround MSVC std::list implementation
|
93
|
+
void push_back(const value_type& x)
|
94
|
+
{ list_base::push_back(x); }
|
95
|
+
using list_base::insert;
|
96
|
+
iterator insert(const_iterator position, const value_type& x)
|
97
|
+
{ return list_base::insert(position,x); }
|
98
|
+
void insert(const_iterator position, size_type new_size, const value_type& x)
|
99
|
+
{ list_base::insert(position, new_size, x); }
|
100
|
+
#endif
|
101
|
+
};
|
102
|
+
}
|
103
|
+
|
104
|
+
#endif // check whether specialization is actually required
|
105
|
+
|
106
|
+
#endif // EIGEN_STDLIST_H
|
@@ -0,0 +1,131 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
// Copyright (C) 2009 Hauke Heibel <hauke.heibel@googlemail.com>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef EIGEN_STDVECTOR_H
|
12
|
+
#define EIGEN_STDVECTOR_H
|
13
|
+
|
14
|
+
#include "details.h"
|
15
|
+
|
16
|
+
/**
|
17
|
+
* This section contains a convenience MACRO which allows an easy specialization of
|
18
|
+
* std::vector such that for data types with alignment issues the correct allocator
|
19
|
+
* is used automatically.
|
20
|
+
*/
|
21
|
+
#define EIGEN_DEFINE_STL_VECTOR_SPECIALIZATION(...) \
|
22
|
+
namespace std \
|
23
|
+
{ \
|
24
|
+
template<> \
|
25
|
+
class vector<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
|
26
|
+
: public vector<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
|
27
|
+
{ \
|
28
|
+
typedef vector<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > vector_base; \
|
29
|
+
public: \
|
30
|
+
typedef __VA_ARGS__ value_type; \
|
31
|
+
typedef vector_base::allocator_type allocator_type; \
|
32
|
+
typedef vector_base::size_type size_type; \
|
33
|
+
typedef vector_base::iterator iterator; \
|
34
|
+
explicit vector(const allocator_type& a = allocator_type()) : vector_base(a) {} \
|
35
|
+
template<typename InputIterator> \
|
36
|
+
vector(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : vector_base(first, last, a) {} \
|
37
|
+
vector(const vector& c) : vector_base(c) {} \
|
38
|
+
explicit vector(size_type num, const value_type& val = value_type()) : vector_base(num, val) {} \
|
39
|
+
vector(iterator start_, iterator end_) : vector_base(start_, end_) {} \
|
40
|
+
vector& operator=(const vector& x) { \
|
41
|
+
vector_base::operator=(x); \
|
42
|
+
return *this; \
|
43
|
+
} \
|
44
|
+
}; \
|
45
|
+
}
|
46
|
+
|
47
|
+
// Don't specialize if containers are implemented according to C++11
|
48
|
+
#if !EIGEN_HAS_CXX11_CONTAINERS
|
49
|
+
|
50
|
+
namespace std {
|
51
|
+
|
52
|
+
#define EIGEN_STD_VECTOR_SPECIALIZATION_BODY \
|
53
|
+
public: \
|
54
|
+
typedef T value_type; \
|
55
|
+
typedef typename vector_base::allocator_type allocator_type; \
|
56
|
+
typedef typename vector_base::size_type size_type; \
|
57
|
+
typedef typename vector_base::iterator iterator; \
|
58
|
+
typedef typename vector_base::const_iterator const_iterator; \
|
59
|
+
explicit vector(const allocator_type& a = allocator_type()) : vector_base(a) {} \
|
60
|
+
template<typename InputIterator> \
|
61
|
+
vector(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
|
62
|
+
: vector_base(first, last, a) {} \
|
63
|
+
vector(const vector& c) : vector_base(c) {} \
|
64
|
+
explicit vector(size_type num, const value_type& val = value_type()) : vector_base(num, val) {} \
|
65
|
+
vector(iterator start_, iterator end_) : vector_base(start_, end_) {} \
|
66
|
+
vector& operator=(const vector& x) { \
|
67
|
+
vector_base::operator=(x); \
|
68
|
+
return *this; \
|
69
|
+
}
|
70
|
+
|
71
|
+
template<typename T>
|
72
|
+
class vector<T,EIGEN_ALIGNED_ALLOCATOR<T> >
|
73
|
+
: public vector<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
|
74
|
+
Eigen::aligned_allocator_indirection<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T)> >
|
75
|
+
{
|
76
|
+
typedef vector<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
|
77
|
+
Eigen::aligned_allocator_indirection<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T)> > vector_base;
|
78
|
+
EIGEN_STD_VECTOR_SPECIALIZATION_BODY
|
79
|
+
|
80
|
+
void resize(size_type new_size)
|
81
|
+
{ resize(new_size, T()); }
|
82
|
+
|
83
|
+
#if defined(_VECTOR_)
|
84
|
+
// workaround MSVC std::vector implementation
|
85
|
+
void resize(size_type new_size, const value_type& x)
|
86
|
+
{
|
87
|
+
if (vector_base::size() < new_size)
|
88
|
+
vector_base::_Insert_n(vector_base::end(), new_size - vector_base::size(), x);
|
89
|
+
else if (new_size < vector_base::size())
|
90
|
+
vector_base::erase(vector_base::begin() + new_size, vector_base::end());
|
91
|
+
}
|
92
|
+
void push_back(const value_type& x)
|
93
|
+
{ vector_base::push_back(x); }
|
94
|
+
using vector_base::insert;
|
95
|
+
iterator insert(const_iterator position, const value_type& x)
|
96
|
+
{ return vector_base::insert(position,x); }
|
97
|
+
void insert(const_iterator position, size_type new_size, const value_type& x)
|
98
|
+
{ vector_base::insert(position, new_size, x); }
|
99
|
+
#elif defined(_GLIBCXX_VECTOR) && (!(EIGEN_GNUC_AT_LEAST(4,1)))
|
100
|
+
/* Note that before gcc-4.1 we already have: std::vector::resize(size_type,const T&).
|
101
|
+
* However, this specialization is still needed to make the above EIGEN_DEFINE_STL_VECTOR_SPECIALIZATION trick to work. */
|
102
|
+
void resize(size_type new_size, const value_type& x)
|
103
|
+
{
|
104
|
+
vector_base::resize(new_size,x);
|
105
|
+
}
|
106
|
+
#elif defined(_GLIBCXX_VECTOR) && EIGEN_GNUC_AT_LEAST(4,2)
|
107
|
+
// workaround GCC std::vector implementation
|
108
|
+
void resize(size_type new_size, const value_type& x)
|
109
|
+
{
|
110
|
+
if (new_size < vector_base::size())
|
111
|
+
vector_base::_M_erase_at_end(this->_M_impl._M_start + new_size);
|
112
|
+
else
|
113
|
+
vector_base::insert(vector_base::end(), new_size - vector_base::size(), x);
|
114
|
+
}
|
115
|
+
#else
|
116
|
+
// either GCC 4.1 or non-GCC
|
117
|
+
// default implementation which should always work.
|
118
|
+
void resize(size_type new_size, const value_type& x)
|
119
|
+
{
|
120
|
+
if (new_size < vector_base::size())
|
121
|
+
vector_base::erase(vector_base::begin() + new_size, vector_base::end());
|
122
|
+
else if (new_size > vector_base::size())
|
123
|
+
vector_base::insert(vector_base::end(), new_size - vector_base::size(), x);
|
124
|
+
}
|
125
|
+
#endif
|
126
|
+
};
|
127
|
+
}
|
128
|
+
#endif // !EIGEN_HAS_CXX11_CONTAINERS
|
129
|
+
|
130
|
+
|
131
|
+
#endif // EIGEN_STDVECTOR_H
|
@@ -0,0 +1,84 @@
|
|
1
|
+
// This file is part of Eigen, a lightweight C++ template library
|
2
|
+
// for linear algebra.
|
3
|
+
//
|
4
|
+
// Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
|
5
|
+
// Copyright (C) 2009 Hauke Heibel <hauke.heibel@googlemail.com>
|
6
|
+
//
|
7
|
+
// This Source Code Form is subject to the terms of the Mozilla
|
8
|
+
// Public License v. 2.0. If a copy of the MPL was not distributed
|
9
|
+
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
10
|
+
|
11
|
+
#ifndef EIGEN_STL_DETAILS_H
|
12
|
+
#define EIGEN_STL_DETAILS_H
|
13
|
+
|
14
|
+
#ifndef EIGEN_ALIGNED_ALLOCATOR
|
15
|
+
#define EIGEN_ALIGNED_ALLOCATOR Eigen::aligned_allocator
|
16
|
+
#endif
|
17
|
+
|
18
|
+
namespace Eigen {
|
19
|
+
|
20
|
+
// This one is needed to prevent reimplementing the whole std::vector.
|
21
|
+
template <class T>
|
22
|
+
class aligned_allocator_indirection : public EIGEN_ALIGNED_ALLOCATOR<T>
|
23
|
+
{
|
24
|
+
public:
|
25
|
+
typedef std::size_t size_type;
|
26
|
+
typedef std::ptrdiff_t difference_type;
|
27
|
+
typedef T* pointer;
|
28
|
+
typedef const T* const_pointer;
|
29
|
+
typedef T& reference;
|
30
|
+
typedef const T& const_reference;
|
31
|
+
typedef T value_type;
|
32
|
+
|
33
|
+
template<class U>
|
34
|
+
struct rebind
|
35
|
+
{
|
36
|
+
typedef aligned_allocator_indirection<U> other;
|
37
|
+
};
|
38
|
+
|
39
|
+
aligned_allocator_indirection() {}
|
40
|
+
aligned_allocator_indirection(const aligned_allocator_indirection& ) : EIGEN_ALIGNED_ALLOCATOR<T>() {}
|
41
|
+
aligned_allocator_indirection(const EIGEN_ALIGNED_ALLOCATOR<T>& ) {}
|
42
|
+
template<class U>
|
43
|
+
aligned_allocator_indirection(const aligned_allocator_indirection<U>& ) {}
|
44
|
+
template<class U>
|
45
|
+
aligned_allocator_indirection(const EIGEN_ALIGNED_ALLOCATOR<U>& ) {}
|
46
|
+
~aligned_allocator_indirection() {}
|
47
|
+
};
|
48
|
+
|
49
|
+
#if EIGEN_COMP_MSVC
|
50
|
+
|
51
|
+
// sometimes, MSVC detects, at compile time, that the argument x
|
52
|
+
// in std::vector::resize(size_t s,T x) won't be aligned and generate an error
|
53
|
+
// even if this function is never called. Whence this little wrapper.
|
54
|
+
#define EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T) \
|
55
|
+
typename Eigen::internal::conditional< \
|
56
|
+
Eigen::internal::is_arithmetic<T>::value, \
|
57
|
+
T, \
|
58
|
+
Eigen::internal::workaround_msvc_stl_support<T> \
|
59
|
+
>::type
|
60
|
+
|
61
|
+
namespace internal {
|
62
|
+
template<typename T> struct workaround_msvc_stl_support : public T
|
63
|
+
{
|
64
|
+
inline workaround_msvc_stl_support() : T() {}
|
65
|
+
inline workaround_msvc_stl_support(const T& other) : T(other) {}
|
66
|
+
inline operator T& () { return *static_cast<T*>(this); }
|
67
|
+
inline operator const T& () const { return *static_cast<const T*>(this); }
|
68
|
+
template<typename OtherT>
|
69
|
+
inline T& operator=(const OtherT& other)
|
70
|
+
{ T::operator=(other); return *this; }
|
71
|
+
inline workaround_msvc_stl_support& operator=(const workaround_msvc_stl_support& other)
|
72
|
+
{ T::operator=(other); return *this; }
|
73
|
+
};
|
74
|
+
}
|
75
|
+
|
76
|
+
#else
|
77
|
+
|
78
|
+
#define EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T) T
|
79
|
+
|
80
|
+
#endif
|
81
|
+
|
82
|
+
}
|
83
|
+
|
84
|
+
#endif // EIGEN_STL_DETAILS_H
|