| /external/eigen/Eigen/src/SparseCore/ |
| SparsePermutation.h | 82 PermutationMatrix<Dynamic,Dynamic,Index> perm;
|
| /external/eigen/bench/ |
| sparse_dense_product.cpp | 124 Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
125 Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
146 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV1[0], cols) = v1;
147 // Map<Matrix<Scalar,Dynamic,1> >(&gmmV2[0], cols) = v2;
|
| /external/eigen/blas/ |
| level2_real_impl.h | 89 Matrix<Scalar,Dynamic,Dynamic> m2(matrix(c,*n,*n,*ldc));
|
| /external/eigen/test/eigen2/ |
| eigen2_triangular.cpp | 156 CALL_SUBTEST_7( triangular(Matrix<float,Dynamic,Dynamic,RowMajor>(5, 5)) );
|
| /external/eigen/test/ |
| eigensolver_selfadjoint.cpp | 130 CALL_SUBTEST_9( selfadjointeigensolver(Matrix<std::complex<double>,Dynamic,Dynamic,RowMajor>(s,s)) );
|
| geo_homogeneous.cpp | 74 Matrix<Scalar, Size, Dynamic> pts;
75 Matrix<Scalar, Size+1, Dynamic> pts1, pts2;
|
| permutationmatrices.cpp | 114 CALL_SUBTEST_6( permutationmatrices(Matrix<double,Dynamic,Dynamic,RowMajor>(20, 30)) );
|
| product_trmv.cpp | 86 CALL_SUBTEST_6( trmv(Matrix<float,Dynamic,Dynamic,RowMajor>(s, s)) );
|
| packetmath.cpp | 32 std::cout << "[" << Map<const Matrix<Scalar,1,Dynamic> >(a,size) << "]" << " != " << Map<const Matrix<Scalar,1,Dynamic> >(b,size) << "\n";
45 std::cout << "[" << Map<const Matrix<Scalar,1,Dynamic> >(a,size) << "]" << " != " << Map<const Matrix<Scalar,1,Dynamic> >(b,size) << "\n";
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 57 typedef Matrix<Scalar,Dynamic,1> TmpVec;
112 typedef Matrix<Scalar,Dynamic,1> TmpVec;
|
| /external/eigen/unsupported/test/ |
| autodiff.cpp | 31 template<typename _Scalar, int NX=Dynamic, int NY=Dynamic>
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 128 typedef Matrix<Scalar,Dynamic,1> Vector;
171 Eigen::Matrix<DestScalar,Dynamic,Dynamic> tmp(size,rhsCols);
290 mutable Matrix<Index,Dynamic,1> m_perm; // Permutation vector
291 mutable Matrix<Index,Dynamic,1> m_invp; // Inverse permutation vector
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 136 typedef Matrix<Index, Dynamic, 1> DynamicIntVectorType;
139 typedef Matrix<Scalar, Dynamic, Dynamic, Options, RowsAtCompileTime, ColsAtCompileTime> DynMatrixType;
518 typedef Matrix<ComplexScalar, Dynamic, Dynamic, Options, RowsAtCompileTime, ColsAtCompileTime> DynMatrixType;
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| HybridNonLinearSolver.h | 66 typedef Matrix< Scalar, Dynamic, 1 > FVectorType;
67 typedef Matrix< Scalar, Dynamic, Dynamic > JacobianType;
69 typedef Matrix< Scalar, Dynamic, Dynamic > UpperTriangularType;
|
| /external/eigen/Eigen/src/Core/ |
| Assign.h | 50 MayInnerVectorize = MightVectorize && int(InnerSize)!=Dynamic && int(InnerSize)%int(PacketSize)==0
54 && (DstIsAligned || MaxSizeAtCompileTime == Dynamic),
58 && (int(InnerMaxSize)==Dynamic || int(InnerMaxSize)>=3*PacketSize)
60 indicated by InnerMaxSize rather than InnerSize, think of the case of a dynamic block
79 MayUnrollCompletely = int(Derived::SizeAtCompileTime) != Dynamic
80 && int(OtherDerived::CoeffReadCost) != Dynamic
82 MayUnrollInner = int(InnerSize) != Dynamic
83 && int(OtherDerived::CoeffReadCost) != Dynamic
|
| GeneralProduct.h | 49 enum { is_large = MaxSize == Dynamic ||
357 struct gemv_static_vector_if<Scalar,Size,Dynamic,true>
398 typedef Map<Matrix<ResScalar,Dynamic,1>, Aligned> MappedDest;
552 // not be inlined since DenseStorage is an unwindable object for dynamic
556 ProductIsValid = Derived::ColsAtCompileTime==Dynamic
557 || OtherDerived::RowsAtCompileTime==Dynamic
593 ProductIsValid = Derived::ColsAtCompileTime==Dynamic
594 || OtherDerived::RowsAtCompileTime==Dynamic
|
| VectorwiseOp.h | 385 typedef Replicate<ExpressionType,Direction==Vertical?Dynamic:1,Direction==Horizontal?Dynamic:1> ReplicateReturnType;
521 HNormalized_SizeMinusOne = HNormalized_Size==Dynamic ? Dynamic : HNormalized_Size-1
|
| /external/ceres-solver/examples/ |
| nist.cc | 122 using Eigen::Dynamic;
124 typedef Eigen::Matrix<double, Dynamic, 1> Vector;
125 typedef Eigen::Matrix<double, Dynamic, Dynamic, RowMajor> Matrix;
|
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| block-scoping.js | 46 // Dynamic lookup in and through block contexts.
85 // Dynamic lookup from closure.
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 316 Block<MatrixType,Dynamic,1> A21(mat,k+1,k,rs,1);
317 Block<MatrixType,1,Dynamic> A10(mat,k,0,1,k);
318 Block<MatrixType,Dynamic,Dynamic> A20(mat,k+1,0,rs,k);
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix.h | 238 bool FiniteAtCompileTime = MaxRows!=Dynamic && MaxCols!=Dynamic && MaxDepth != Dynamic> class gemm_blocking_space;
422 internal::parallelize_gemm<(Dest::MaxRowsAtCompileTime>32 || Dest::MaxRowsAtCompileTime==Dynamic)>(GemmFunctor(lhs, rhs, dst, actualAlpha, blocking), this->rows(), this->cols(), Dest::Flags&RowMajorBit);
|
| GeneralMatrixVector_MKL.h | 93 typedef Matrix<EIGTYPE,Dynamic,1,ColMajor> GEMVVector;\
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 576 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
588 Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, MatrixType::Options,
644 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
|
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/debug/ |
| WireSphere.java | 89 pvb.setupData(Usage.Dynamic, 3, Format.Float, pb);
|
| /external/v8/test/mjsunit/harmony/ |
| block-scoping.js | 46 // Dynamic lookup in and through block contexts.
85 // Dynamic lookup from closure.
|
