| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/hoistedPredicates/ |
| TParser.m | 52 #pragma mark Dynamic Global Scopes
54 #pragma mark Dynamic Rule Scopes
65 #pragma mark Dynamic Rule Scopes
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| LangDumpDecl.m | 42 #pragma mark Dynamic Global Scopes
44 #pragma mark Dynamic Rule Scopes
73 #pragma mark Dynamic Rule Scopes
|
| /external/eigen/test/ |
| product_notemporary.cpp | 36 typedef Matrix<Scalar, 1, Dynamic> RowVectorType;
37 typedef Matrix<Scalar, Dynamic, 1> ColVectorType;
38 typedef Matrix<Scalar, Dynamic, Dynamic, ColMajor> ColMajorMatrixType;
39 typedef Matrix<Scalar, Dynamic, Dynamic, RowMajor> RowMajorMatrixType;
|
| bandmatrix.cpp | 17 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrixType;
|
| cholesky.cpp | 165 if(MatrixType::RowsAtCompileTime==Dynamic)
204 Matrix<Scalar,Dynamic,Dynamic> a = Matrix<Scalar,Dynamic,Dynamic>::Random(rows,r);
220 Matrix<Scalar,Dynamic,Dynamic> a = Matrix<Scalar,Dynamic,Dynamic>::Random(rows,rows);
221 Matrix<RealScalar,Dynamic,1> d = Matrix<RealScalar,Dynamic,1>::Random(rows)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view_impl.h | 154 MatrixVectorMultiply<Eigen::Dynamic, Eigen::Dynamic, 1>(
220 MatrixTransposeVectorMultiply<Eigen::Dynamic, Eigen::Dynamic, 1>(
370 <Eigen::Dynamic, Eigen::Dynamic, Eigen::Dynamic, Eigen::Dynamic, 1>(
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LU.h | 30 Dynamic, // we don't know at compile-time the dimension of the kernel
40 Dynamic, // we don't know at compile time the dimension of the image (the rank)
|
| /external/eigen/unsupported/test/ |
| NumericalDiff.cpp | 12 template<typename _Scalar, int NX=Dynamic, int NY=Dynamic>
|
| matrix_exponential.cpp | 78 Matrix<T,Dynamic,Dynamic> A(size,size), B(size,size), C(size,size);
140 CALL_SUBTEST_9(randomTest(Matrix<long double,Dynamic,Dynamic>(7,7), 1e-13));
|
| polynomialsolver.cpp | 23 ret = (Size == Dynamic) ? Dynamic : Size+1
208 CALL_SUBTEST_9( (polynomialsolver<float,Dynamic>(
211 CALL_SUBTEST_10((polynomialsolver<double,Dynamic>(
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 200 typedef Matrix<Scalar,Dynamic,1> TempVectorType;
276 Block<MatrixType,Dynamic,1> A21(mat,k+1,k,rs,1);
277 Block<MatrixType,1,Dynamic> A10(mat,k,0,1,k);
278 Block<MatrixType,Dynamic,Dynamic> A20(mat,k+1,0,rs,k);
312 Block<MatrixType,Dynamic,Dynamic> A11(m,k, k, bs,bs);
313 Block<MatrixType,Dynamic,Dynamic> A21(m,k+bs,k, rs,bs);
314 Block<MatrixType,Dynamic,Dynamic> A22(m,k+bs,k+bs,rs,rs)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| PlainObjectBase.h | 36 template<> struct check_rows_cols_for_overflow<Dynamic> {
129 enum { NeedsToAlign = SizeAtCompileTime != Dynamic && (internal::traits<Derived>::Flags & AlignedBit) != 0 };
221 * This method is intended for dynamic-size matrices, although it is legal to call it on any
237 eigen_assert( EIGEN_IMPLIES(RowsAtCompileTime!=Dynamic,nbRows==RowsAtCompileTime)
238 && EIGEN_IMPLIES(ColsAtCompileTime!=Dynamic,nbCols==ColsAtCompileTime)
239 && EIGEN_IMPLIES(RowsAtCompileTime==Dynamic && MaxRowsAtCompileTime!=Dynamic,nbRows<=MaxRowsAtCompileTime)
240 && EIGEN_IMPLIES(ColsAtCompileTime==Dynamic && MaxColsAtCompileTime!=Dynamic,nbCols<=MaxColsAtCompileTime)
257 * partially dynamic matrices when the static dimension is anything othe
[all...] |
| Array.h | 104 * For dynamic-size matrices, creates an empty matrix of size 0. Does not allocate any array. Such a matrix
129 * Note that this is only useful for dynamic-size vectors. For fixed-size vectors,
139 eigen_assert(SizeAtCompileTime == Dynamic || SizeAtCompileTime == dim);
153 * This is useful for dynamic-size matrices. For fixed-size matrices,
217 /** Override MatrixBase::swap() since for dynamic-sized matrices of same type it is enough to swap the
244 * \c ArrayRowsColsType where \c Rows and \c Cols can be \c 2,\c 3,\c 4 for fixed size square matrices or \c X for dynamic size,
248 * For example, \c Array33d is a fixed-size 3x3 array type of doubles, and \c ArrayXXf is a dynamic-size matrix of floats.
264 typedef Array<Type, Size, Dynamic> Array##Size##X##TypeSuffix; \
266 typedef Array<Type, Dynamic, Size> Array##X##Size##TypeSuffix;
272 EIGEN_MAKE_ARRAY_TYPEDEFS(Type, TypeSuffix, Dynamic, X)
[all...] |
| Matrix.h | 24 * The %Matrix class encompasses \em both fixed-size and dynamic-size objects (\ref fixedsize "note").
29 * \tparam _Rows Number of rows, or \b Dynamic
30 * \tparam _Cols Number of columns, or \b Dynamic
46 * \li \c MatrixXf is a dynamic-size matrix of floats (\c Matrix<float, Dynamic, Dynamic>)
47 * \li \c VectorXf is a dynamic-size vector of floats (\c Matrix<float, Dynamic, 1>)
49 * \li \c Matrix2Xf is a partially fixed-size (dynamic-size) matrix of floats (\c Matrix<float, 2, Dynamic>)
[all...] |
| Redux.h | 53 Cost = ( Derived::SizeAtCompileTime == Dynamic
54 || Derived::CoeffReadCost == Dynamic
55 || (Derived::SizeAtCompileTime!=1 && functor_traits<Func>::Cost == Dynamic)
56 ) ? Dynamic
64 Unrolling = Cost != Dynamic && Cost <= UnrollingLimit
239 // since this is dynamic-size hence inefficient anyway for such small sizes, don't try to optimize.
280 // since this is dynamic-size hence inefficient anyway for such small sizes, don't try to optimize.
361 if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0))
388 if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0))
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparsePermutation.h | 60 Matrix<Index,Dynamic,1> sizes(m_matrix.outerSize());
80 Matrix<Index,Dynamic,1> sizes(tmp.outerSize());
82 PermutationMatrix<Dynamic,Dynamic,Index> perm;
|
| SparseBlock.h | 268 Block<Derived,Dynamic,Dynamic,true> SparseMatrixBase<Derived>::innerVectors(Index outerStart, Index outerSize)
270 return Block<Derived,Dynamic,Dynamic,true>(derived(),
280 const Block<const Derived,Dynamic,Dynamic,true> SparseMatrixBase<Derived>::innerVectors(Index outerStart, Index outerSize) const
282 return Block<const Derived,Dynamic,Dynamic,true>(derived(),
311 /** Dynamic-size constructor
400 const internal::variable_if_dynamic<Index, XprType::RowsAtCompileTime == 1 ? 0 : Dynamic> m_startRow
[all...] |
| SparseSelfAdjointView.h | 56 typedef Matrix<Index,Dynamic,1> VectorI;
138 SparseSymmetricPermutationProduct<_MatrixTypeNested,UpLo> twistedBy(const PermutationMatrix<Dynamic,Dynamic,Index>& perm) const
153 PermutationMatrix<Dynamic> pnull;
160 PermutationMatrix<Dynamic> pnull;
319 typedef Matrix<Index,Dynamic,1> VectorI;
406 typedef Matrix<Index,Dynamic,1> VectorI;
472 typedef PermutationMatrix<Dynamic,Dynamic,Index> Perm;
474 typedef Matrix<Index,Dynamic,1> VectorI
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_kernel_bmod.h | 50 for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++)
68 Map<Matrix<Scalar,Dynamic,SegSizeAtCompileTime>, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) );
71 Map<Matrix<Scalar,Dynamic,1>, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) );
78 for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++)
|
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 29 Dynamic, // we don't know at compile-time the dimension of the kernel
|
| /external/eigen/bench/ |
| spmv.cpp | 177 Map<Matrix<Scalar,Dynamic,1> >(&uv[0], cols) = dv;
178 Map<Matrix<Scalar,Dynamic,1> >(&ures[0], rows) = res;
195 Map<Matrix<Scalar,Dynamic,1> >(&gv[0], cols) = dv;
196 Map<Matrix<Scalar,Dynamic,1> >(&gres[0], rows) = res;
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 32 EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_Deg==Dynamic ? Dynamic : _Deg)
310 * \param _Deg the degree of the polynomial, can be a compile time value or Dynamic.
334 EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_Deg==Dynamic ? Dynamic : _Deg)
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 81 template<typename XprType, int BlockRows=Dynamic, int BlockCols=Dynamic, bool InnerPanel = false> class Block;
83 template<typename MatrixType, int Size=Dynamic> class VectorBlock;
133 template<typename _Scalar, int Rows=Dynamic, int Cols=Dynamic, int Supers=Dynamic, int Subs=Dynamic, int Options=0> class BandMatrix;
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 100 typedef Matrix<Scalar,Dynamic,1> Vector;
106 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
197 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // Fill-reducing permutation
198 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // Inverse permutation
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| Tridiagonalization.h | 74 SizeMinusOne = Size == Dynamic ? Dynamic : (Size > 1 ? Size - 1 : 1),
77 MaxSizeMinusOne = MaxSize == Dynamic ? Dynamic : (MaxSize > 1 ? MaxSize - 1 : 1)
113 Tridiagonalization(Index size = Size==Dynamic ? 2 : Size)
|
