| /external/libogg/win32/VS6/ |
| build_ogg_dynamic.bat | 2 echo ---+++--- Building Ogg (Dynamic) ---+++---
|
| build_ogg_dynamic_debug.bat | 2 echo ---+++--- Building Ogg (Dynamic) ---+++---
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixMatrix_MKL.h | 106 typedef Matrix<EIGTYPE, Dynamic, Dynamic, LhsStorageOrder> MatrixLhs; \
107 typedef Matrix<EIGTYPE, Dynamic, Dynamic, RhsStorageOrder> MatrixRhs; \
125 gemm_blocking_space<ColMajor,EIGTYPE,EIGTYPE,Dynamic,Dynamic,Dynamic> blocking(_rows,_cols,_depth); \
220 typedef Matrix<EIGTYPE, Dynamic, Dynamic, LhsStorageOrder> MatrixLhs; \
221 typedef Matrix<EIGTYPE, Dynamic, Dynamic, RhsStorageOrder> MatrixRhs;
[all...] |
| TriangularSolverMatrix_MKL.h | 71 typedef Matrix<EIGTYPE, Dynamic, Dynamic, TriStorageOrder> MatrixTri; \
126 typedef Matrix<EIGTYPE, Dynamic, Dynamic, TriStorageOrder> MatrixTri; \
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 53 * it is set to the \a Dynamic constant.
59 * it is set to the \a Dynamic constant.
66 * rows times the number of columns, or to \a Dynamic if this is not
122 typedef CwiseNullaryOp<internal::scalar_constant_op<Scalar>,Matrix<Scalar,Dynamic,Dynamic> > ConstantReturnType;
361 SparseSymmetricPermutationProduct<Derived,Upper|Lower> twistedBy(const PermutationMatrix<Dynamic,Dynamic,Index>& perm) const
404 SparseInnerVectorSet<Derived,Dynamic> subrows(Index start, Index size);
405 const SparseInnerVectorSet<Derived,Dynamic> subrows(Index start, Index size) const;
406 SparseInnerVectorSet<Derived,Dynamic> subcols(Index start, Index size)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| residual_block.cc | 47 using Eigen::Dynamic;
145 MatrixMatrixMultiply<Dynamic, Dynamic, Dynamic, Dynamic, 0>(
|
| runtime_numeric_diff_cost_function.cc | 57 using Eigen::Dynamic;
60 typedef Matrix<double, Dynamic, 1> ResidualVector;
61 typedef Matrix<double, Dynamic, 1> ParameterVector;
62 typedef Matrix<double, Dynamic, Dynamic, RowMajor> JacobianMatrix;
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 66 SizeMinusOne = Size == Dynamic ? Dynamic : Size - 1,
69 MaxSizeMinusOne = MaxSize == Dynamic ? Dynamic : MaxSize - 1
100 HessenbergDecomposition(Index size = Size==Dynamic ? 2 : Size)
|
| /external/eigen/test/eigen2/ |
| sparse.h | 46 Matrix<Scalar,Dynamic,Dynamic>& refMat,
89 Matrix<Scalar,Dynamic,Dynamic>& refMat,
132 Matrix<Scalar,Dynamic,1>& refVec,
|
| eigen2_sparse_solvers.cpp | 14 Matrix<Scalar,Dynamic,Dynamic>& refMat,
17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
36 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
37 typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
| eigen2_sparse_vector.cpp | 16 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
17 typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
| /external/eigen/bench/ |
| sparse_trisolver.cpp | 64 typedef Matrix<Scalar,Dynamic,1> DenseVector;
82 Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
143 Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols) = x;
144 Map<Matrix<Scalar,Dynamic,1> >(&gmmB[0], cols) = b;
149 // std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
155 // std::cerr << Map<Matrix<Scalar,Dynamic,1> >(&gmmX[0], cols).transpose() << "\n";
|
| benchCholesky.cpp | 76 if (MatrixType::RowsAtCompileTime==Dynamic)
88 if (MatrixType::RowsAtCompileTime==Dynamic)
129 benchLLT(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
|
| vdw_new.cpp | 18 typedef Matrix<SCALAR, Eigen::Dynamic, 1> Vec;
|
| /external/eigen/test/ |
| integer_types.cpp | 145 CALL_SUBTEST_3( integer_type_tests(Matrix<char, 2, Dynamic>(2, 10)) );
146 CALL_SUBTEST_3( signed_integer_type_tests(Matrix<signed char, 2, Dynamic>(2, 10)) );
149 CALL_SUBTEST_4( integer_type_tests(Matrix<unsigned char, Dynamic, Dynamic>(20, 20)) );
151 CALL_SUBTEST_5( integer_type_tests(Matrix<short, Dynamic, 4>(7, 4)) );
152 CALL_SUBTEST_5( signed_integer_type_tests(Matrix<short, Dynamic, 4>(7, 4)) );
159 CALL_SUBTEST_8( integer_type_tests(Matrix<unsigned long long, Dynamic, 5>(1, 5)) );
|
| sparse_solvers.cpp | 14 Matrix<Scalar,Dynamic,Dynamic>& refMat,
17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
36 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
37 typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
| array_replicate.cpp | 21 typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
22 typedef Matrix<Scalar, Dynamic, 1> VectorX;
|
| exceptions.cpp | 90 typedef Eigen::Matrix<ScalarWithExceptions,Dynamic,1> VectorType;
91 typedef Eigen::Matrix<ScalarWithExceptions,Dynamic,Dynamic> MatrixType;
|
| /external/eigen/Eigen/src/Core/ |
| Block.h | 19 * \brief Expression of a fixed-size or dynamic-size block
26 * This class represents an expression of either a fixed-size or dynamic-size block. It is the return
34 * Here is an example illustrating the dynamic case:
38 * \note Even though this expression has dynamic size, in the case where \a XprType
40 * it does not cause a dynamic memory allocation.
64 : RowsAtCompileTime != Dynamic ? int(RowsAtCompileTime)
67 : ColsAtCompileTime != Dynamic ? int(ColsAtCompileTime)
81 MaskPacketAccessBit = (InnerSize == Dynamic || (InnerSize % packet_traits<Scalar>::size) == 0)
84 MaskAlignedBit = (InnerPanel && (OuterStrideAtCompileTime!=Dynamic) && (((OuterStrideAtCompileTime * int(sizeof(Scalar))) % 16) == 0)) ? AlignedBit : 0,
131 EIGEN_STATIC_ASSERT(RowsAtCompileTime!=Dynamic && ColsAtCompileTime!=Dynamic,THIS_METHOD_IS_ONLY_FOR_FIXED_SIZE
[all...] |
| CommaInitializer.h | 79 if (OtherDerived::SizeAtCompileTime != Dynamic)
80 m_xpr.template block<OtherDerived::RowsAtCompileTime != Dynamic ? OtherDerived::RowsAtCompileTime : 1,
81 OtherDerived::ColsAtCompileTime != Dynamic ? OtherDerived::ColsAtCompileTime : 1>
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 36 typedef Matrix<Scalar,Dynamic,1> Vector;
41 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 19 typedef Matrix<Scalar,Dynamic,1> Vector;
24 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| covar.h | 7 Matrix< Scalar, Dynamic, Dynamic > &r,
21 Matrix< Scalar, Dynamic, 1 > wa(n);
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/combined/ |
| CombinedParser.m | 64 #pragma mark Dynamic Global Scopes
66 #pragma mark Dynamic Rule Scopes
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| AlignedBox.h | 22 * \param _AmbientDim the dimension of the ambient space, can be a compile time value or Dynamic.
30 EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)
38 { if (AmbientDimAtCompileTime!=Dynamic) setNull(); }
53 inline int dim() const { return AmbientDimAtCompileTime==Dynamic ? m_min.size()-1 : AmbientDimAtCompileTime; }
|
