/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
qrsolv.h | 8 Matrix< Scalar, Dynamic, Dynamic > &s, 11 const Matrix< Scalar, Dynamic, 1 > &diag, 12 const Matrix< Scalar, Dynamic, 1 > &qtb, 13 Matrix< Scalar, Dynamic, 1 > &x, 14 Matrix< Scalar, Dynamic, 1 > &sdiag) 23 Matrix< Scalar, Dynamic, 1 > wa(n);
|
fdjac1.h | 8 Matrix< Scalar, Dynamic, 1 > &x, 9 Matrix< Scalar, Dynamic, 1 > &fvec, 10 Matrix< Scalar, Dynamic, Dynamic > &fjac, 31 Matrix< Scalar, Dynamic, 1 > wa1(n); 32 Matrix< Scalar, Dynamic, 1 > wa2(n);
|
lmpar.h | 7 Matrix< Scalar, Dynamic, Dynamic > &r, 9 const Matrix< Scalar, Dynamic, 1 > &diag, 10 const Matrix< Scalar, Dynamic, 1 > &qtb, 13 Matrix< Scalar, Dynamic, 1 > &x) 36 Matrix< Scalar, Dynamic, 1 > wa1, wa2; 116 Matrix< Scalar, Dynamic, 1 > sdiag(n); 165 const ColPivHouseholderQR<Matrix< Scalar, Dynamic, Dynamic> > &qr, 166 const Matrix< Scalar, Dynamic, 1 > &diag [all...] |
r1updt.h | 7 Matrix< Scalar, Dynamic, Dynamic > &s, 8 const Matrix< Scalar, Dynamic, 1> &u, 11 Matrix< Scalar, Dynamic, 1> &v, 12 Matrix< Scalar, Dynamic, 1> &w,
|
/external/eigen/Eigen/src/Core/util/ |
StaticAssert.h | 132 EIGEN_STATIC_ASSERT(TYPE::SizeAtCompileTime!=Eigen::Dynamic, \ 135 // static assertion failing if the type \a TYPE is not dynamic-size 137 EIGEN_STATIC_ASSERT(TYPE::SizeAtCompileTime==Eigen::Dynamic, \ 150 // static assertion failing if the two vector expression types are not compatible (same fixed-size or dynamic size) 153 (int(TYPE0::SizeAtCompileTime)==Eigen::Dynamic \ 154 || int(TYPE1::SizeAtCompileTime)==Eigen::Dynamic \ 162 (int(TYPE0::RowsAtCompileTime)==Eigen::Dynamic \ 163 || int(TYPE1::RowsAtCompileTime)==Eigen::Dynamic \ 165 && (int(TYPE0::ColsAtCompileTime)==Eigen::Dynamic \ 166 || int(TYPE1::ColsAtCompileTime)==Eigen::Dynamic \ [all...] |
/external/eigen/Eigen/src/Core/ |
Replicate.h | 39 Factor = (RowFactor==Dynamic || ColFactor==Dynamic) ? Dynamic : RowFactor*ColFactor 44 RowsAtCompileTime = RowFactor==Dynamic || int(MatrixType::RowsAtCompileTime)==Dynamic 45 ? Dynamic 47 ColsAtCompileTime = ColFactor==Dynamic || int(MatrixType::ColsAtCompileTime)==Dynamic 48 ? Dynamic 78 eigen_assert(RowFactor!=Dynamic && ColFactor!=Dynamic) [all...] |
BandMatrix.h | 41 DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) 43 : Dynamic, 68 inline Block<CoefficientsType,Dynamic,1> col(Index i) 80 return Block<CoefficientsType,Dynamic,1>(coeffs(), start, i, len, 1); 96 DiagonalSize = (RowsAtCompileTime==Dynamic || ColsAtCompileTime==Dynamic) 97 ? Dynamic 121 inline Block<CoefficientsType,1,Dynamic> diagonal(Index i) 124 return Block<CoefficientsType,1,Dynamic>(coeffs(), supers()-i, std::max<Index>(0,i), 1, diagonalLength(i)) [all...] |
NumTraits.h | 139 ReadCost = ArrayType::SizeAtCompileTime==Dynamic ? Dynamic : ArrayType::SizeAtCompileTime * NumTraits<Scalar>::ReadCost, 140 AddCost = ArrayType::SizeAtCompileTime==Dynamic ? Dynamic : ArrayType::SizeAtCompileTime * NumTraits<Scalar>::AddCost, 141 MulCost = ArrayType::SizeAtCompileTime==Dynamic ? Dynamic : ArrayType::SizeAtCompileTime * NumTraits<Scalar>::MulCost
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
LMqrsolv.h | 25 const PermutationMatrix<Dynamic,Dynamic,Index> &iPerm, 26 const Matrix<Scalar,Dynamic,1> &diag, 27 const Matrix<Scalar,Dynamic,1> &qtb, 28 Matrix<Scalar,Dynamic,1> &x, 29 Matrix<Scalar,Dynamic,1> &sdiag) 36 Matrix<Scalar,Dynamic,1> wa(n); 105 const PermutationMatrix<Dynamic,Dynamic> &iPerm, 106 const Matrix<Scalar,Dynamic,1> &diag [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/output1/ |
SymbolTableParser.h | 25 #pragma mark Dynamic Global Scopes 44 #pragma mark Dynamic Rule Scopes
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
LangDumpDecl.h | 37 #pragma mark Dynamic Global Scopes 38 #pragma mark Dynamic Rule Scopes
|
/external/eigen/bench/ |
geometry.cpp | 19 typedef Matrix<RealScalar,Dynamic,Dynamic> A; 20 typedef Matrix</*Real*/Scalar,Dynamic,Dynamic> B; 21 typedef Matrix<Scalar,Dynamic,Dynamic> C; 22 typedef Matrix<RealScalar,Dynamic,Dynamic> M;
|
bench_reverse.cpp | 46 if (MatrixType::RowsAtCompileTime==Dynamic) 70 bench_reverse(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i])); 71 bench_reverse(Matrix<Scalar,Dynamic,1>(dynsizes[i]*dynsizes[i]));
|
basicbenchmark.h | 18 if (MatrixType::SizeAtCompileTime!=Eigen::Dynamic) asm("#fixedsize"); 24 if (MatrixType::SizeAtCompileTime!=Eigen::Dynamic) asm("#fixedsize"); 30 if (MatrixType::SizeAtCompileTime!=Eigen::Dynamic) asm("#fixedsize");
|
/external/eigen/test/ |
sizeof.cpp | 15 if (MatrixType::RowsAtCompileTime!=Dynamic && MatrixType::ColsAtCompileTime!=Dynamic)
|
corners.cpp | 65 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<r,Dynamic>(r,c))); 66 VERIFY_IS_EQUAL((matrix.template topRightCorner<r,c>()), (matrix.template topRightCorner<r,Dynamic>(r,c))); 67 VERIFY_IS_EQUAL((matrix.template bottomLeftCorner<r,c>()), (matrix.template bottomLeftCorner<r,Dynamic>(r,c))); 68 VERIFY_IS_EQUAL((matrix.template bottomRightCorner<r,c>()), (matrix.template bottomRightCorner<r,Dynamic>(r,c))); 70 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<Dynamic,c>(r,c))); 71 VERIFY_IS_EQUAL((matrix.template topRightCorner<r,c>()), (matrix.template topRightCorner<Dynamic,c>(r,c))); 72 VERIFY_IS_EQUAL((matrix.template bottomLeftCorner<r,c>()), (matrix.template bottomLeftCorner<Dynamic,c>(r,c))); 73 VERIFY_IS_EQUAL((matrix.template bottomRightCorner<r,c>()), (matrix.template bottomRightCorner<Dynamic,c>(r,c))); 87 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template topLeftCorner<r,Dynamic>(r,c))); 88 VERIFY_IS_EQUAL((const_matrix.template topRightCorner<r,c>()), (const_matrix.template topRightCorner<r,Dynamic>(r,c))) [all...] |
product_symm.cpp | 84 CALL_SUBTEST_1(( symm<float,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 85 CALL_SUBTEST_2(( symm<double,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 86 CALL_SUBTEST_3(( symm<std::complex<float>,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2),internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2)) )); 87 CALL_SUBTEST_4(( symm<std::complex<double>,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2),internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2)) )); 89 CALL_SUBTEST_5(( symm<float,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )); 90 CALL_SUBTEST_6(( symm<double,Dynamic,1>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) )) [all...] |
product_trsolve.cpp | 41 Matrix<Scalar,Dynamic,Dynamic,colmajor> ref(size,cols); 81 CALL_SUBTEST_1((trsolve<float,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)))); 82 CALL_SUBTEST_2((trsolve<double,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE),internal::random<int>(1,EIGEN_TEST_MAX_SIZE)))); 83 CALL_SUBTEST_3((trsolve<std::complex<float>,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2),internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2)))); 84 CALL_SUBTEST_4((trsolve<std::complex<double>,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2),internal::random<int>(1,EIGEN_TEST_MAX_SIZE/2)))) [all...] |
spqr_support.cpp | 32 Matrix<Scalar,Dynamic,Dynamic> dA; 33 typedef Matrix<Scalar,Dynamic,1> DenseVector;
|
mapstride.cpp | 39 Map<VectorType, Unaligned, InnerStride<Dynamic> > map(array, size, InnerStride<Dynamic>(2)); 67 // test no inner stride and some dynamic outer stride 69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1)); 85 OuterStrideAtCompileTime = InnerSize==Dynamic ? Dynamic : InnerSize+4 101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2)) [all...] |
mapstaticmethods.cpp | 16 bool IsDynamicSize = PlainObjectType::SizeAtCompileTime == Dynamic, 55 PlainObjectType::Map(ptr, Stride<Dynamic, Dynamic>(i,j)).setZero(); 56 PlainObjectType::MapAligned(ptr, Stride<2,Dynamic>(2,i)).setZero(); 57 PlainObjectType::Map(const_ptr, Stride<Dynamic,3>(i,3)).sum(); 58 PlainObjectType::MapAligned(const_ptr, Stride<Dynamic, Dynamic>(i,j)).sum(); 101 PlainObjectType::Map(ptr, rows, cols, Stride<Dynamic, Dynamic>(i,j)).setZero(); 102 PlainObjectType::MapAligned(ptr, rows, cols, Stride<2,Dynamic>(2,i)).setZero() [all...] |
/external/ceres-solver/internal/ceres/ |
partitioned_matrix_view.h | 112 template <int kRowBlockSize = Eigen::Dynamic, 113 int kEBlockSize = Eigen::Dynamic, 114 int kFBlockSize = Eigen::Dynamic >
|
preconditioner.h | 55 row_block_size(Eigen::Dynamic), 56 e_block_size(Eigen::Dynamic), 57 f_block_size(Eigen::Dynamic) {
|
/external/eigen/bench/spbench/ |
test_sparseLU.cpp | 23 typedef Matrix<scalar, Dynamic, Dynamic> DenseMatrix; 24 typedef Matrix<scalar, Dynamic, 1> DenseRhs; 25 Matrix<scalar, Dynamic, 1> b, x, tmp; 87 Matrix<scalar, Dynamic, 1> tmp2 = b - A*x;
|
/external/eigen/Eigen/src/SparseLU/ |
SparseLU_SupernodalMatrix.h | 38 typedef Matrix<Index,Dynamic,1> IndexVector; 39 typedef Matrix<Scalar,Dynamic,1> ScalarVector; 239 Matrix<Scalar,Dynamic,Dynamic> work(n, nrhs); // working vector 270 Map<const Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > A( &(Lval[luptr]), nsupc, nsupc, OuterStride<>(lda) ); 271 Map< Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > U (&(X(fsupc,0)), nsupc, nrhs, OuterStride<>(n) ); 275 new (&A) Map<const Matrix<Scalar,Dynamic,Dynamic>, 0, OuterStride<> > ( &(Lval[luptr+nsupc]), nrow, nsupc, OuterStride<>(lda) ); [all...] |