| /external/eigen/blas/ |
| BandTriangularSolver.h | 25 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap;
26 typedef Map<Matrix<RhsScalar,Dynamic,1> > RhsMap;
61 typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap;
62 typedef Map<Matrix<RhsScalar,Dynamic,1> > RhsMap;
|
| Rank2Update.h | 23 typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
26 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) +=
41 typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) +=
|
| GeneralRank1Update.h | 24 typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
29 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i,rows) += alpha * cj(v[i]) * ConjRhsType(OtherMap(u,rows));
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| dogleg.h | 7 const Matrix< Scalar, Dynamic, Dynamic > &qrfac,
8 const Matrix< Scalar, Dynamic, 1 > &diag,
9 const Matrix< Scalar, Dynamic, 1 > &qtb,
11 Matrix< Scalar, Dynamic, 1 > &x)
30 Matrix< Scalar, Dynamic, 1 > wa1(n), wa2(n);
|
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator.h | 216 template <int kRowBlockSize = Eigen::Dynamic,
217 int kEBlockSize = Eigen::Dynamic,
218 int kFBlockSize = Eigen::Dynamic >
|
| /external/eigen/test/ |
| array_replicate.cpp | 20 typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
21 typedef Matrix<Scalar, Dynamic, 1> VectorX;
|
| product_mmtr.cpp | 22 typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> MatrixColMaj;
23 typedef Matrix<Scalar,Dynamic,Dynamic,RowMajor> MatrixRowMaj;
|
| jacobisvd.cpp | 80 typedef Matrix<Scalar, RowsAtCompileTime, Dynamic> RhsType;
81 typedef Matrix<Scalar, ColsAtCompileTime, Dynamic> SolutionType;
121 RankAtCompileTime2 = ColsAtCompileTime==Dynamic ? Dynamic : (ColsAtCompileTime)/2+1,
122 RowsAtCompileTime3 = ColsAtCompileTime==Dynamic ? Dynamic : ColsAtCompileTime+1
127 Index rank = RankAtCompileTime2==Dynamic ? internal::random<Index>(1,cols) : Index(RankAtCompileTime2);
137 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
151 Index rows3 = RowsAtCompileTime3==Dynamic ? internal::random<Index>(rank+1,2*cols) : Index(RowsAtCompileTime3);
152 Matrix<Scalar,RowsAtCompileTime3,Dynamic> C = Matrix<Scalar,RowsAtCompileTime3,Dynamic>::Random(rows3,rank)
[all...] |
| product_trmm.cpp | 15 int otherCols = OtherCols==Dynamic?internal::random<int>(1,EIGEN_TEST_MAX_SIZE):OtherCols)
17 typedef Matrix<Scalar,Dynamic,Dynamic,TriOrder> TriMatrix;
18 typedef Matrix<Scalar,Dynamic,OtherCols,OtherCols==1?ColMajor:OtherOrder> OnTheRight;
19 typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:OtherOrder> OnTheLeft;
21 typedef Matrix<Scalar,Dynamic,OtherCols,OtherCols==1?ColMajor:ResOrder> ResXS;
22 typedef Matrix<Scalar,OtherCols,Dynamic,OtherCols==1?RowMajor:ResOrder> ResSX;
72 trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols);
|
| selfadjoint.cpp | 55 CALL_SUBTEST_5( selfadjoint(Matrix<float,Dynamic,Dynamic,RowMajor>(s, s)) );
|
| /external/clang/unittests/ASTMatchers/ |
| Makefile | 12 PARALLEL_DIRS = Dynamic
|
| /external/eigen/doc/snippets/ |
| Tutorial_Map_using.cpp | 1 typedef Matrix<float,1,Dynamic> MatrixType;
|
| /external/eigen/unsupported/test/ |
| polynomialutils.cpp | 22 ret = (Size == Dynamic) ? Dynamic : Size+1
59 CALL_SUBTEST_9( (realRoots_to_monicPolynomial_test<_Scalar,Dynamic>(
100 CALL_SUBTEST_9( (CauchyBounds<_Scalar,Dynamic>(
|
| /external/eigen/Eigen/src/Core/ |
| DenseStorage.h | 113 * This class stores the data of fixed-size, dynamic-size or mixed matrices
155 template<typename T, int _Options> class DenseStorage<T, 0, Dynamic, Dynamic, _Options>
158 template<typename T, int _Rows, int _Options> class DenseStorage<T, 0, _Rows, Dynamic, _Options>
161 template<typename T, int _Cols, int _Options> class DenseStorage<T, 0, Dynamic, _Cols, _Options>
164 // dynamic-size matrix with fixed-size storage
165 template<typename T, int Size, int _Options> class DenseStorage<T, Size, Dynamic, Dynamic, _Options>
185 // dynamic-size matrix with fixed-size storage and fixed width
186 template<typename T, int Size, int _Cols, int _Options> class DenseStorage<T, Size, Dynamic, _Cols, _Options
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| Macros.h | 380 // followed by Dynamic, followed by other finite values. The reason for giving Dynamic the priority over
381 // finite values is that min(3, Dynamic) should be Dynamic, since that could be anything between 0 and 3.
384 : ((int)a == Dynamic || (int)b == Dynamic) ? Dynamic \
388 // now have priority over Dynamic, so that min(3, Dynamic) gives 3. Indeed, whatever the actual value is
392 : ((int)a == Dynamic && (int)b == Dynamic) ? Dynamic
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/ |
| SimpleCParser.h | 56 #pragma mark Dynamic Global Scopes
57 #pragma mark Dynamic Rule Scopes
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/ |
| SymbolTableParser.h | 41 #pragma mark Dynamic Global Scopes
65 #pragma mark Dynamic Rule Scopes
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| SimpleCTP.h | 53 #pragma mark Dynamic Global Scopes
77 #pragma mark Dynamic Rule Scopes
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| SimpleCTP.h | 37 #pragma mark Dynamic Global Scopes
57 #pragma mark Dynamic Rule Scopes
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| TreeRewriteParser.h | 32 #pragma mark Dynamic Global Scopes
33 #pragma mark Dynamic Rule Scopes
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/output1/ |
| TreeRewriteParser.h | 16 #pragma mark Dynamic Global Scopes
17 #pragma mark Dynamic Rule Scopes
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseRedux.h | 32 return Matrix<Scalar,1,Dynamic>::Map(&m_data.value(0), m_data.size()).sum();
40 return Matrix<Scalar,1,Dynamic>::Map(&m_data.value(0), m_data.size()).sum();
|
| /external/eigen/bench/ |
| benchmarkSlice.cpp | 20 typedef Matrix<SCALAR, Eigen::Dynamic, Eigen::Dynamic> Mat;
|
| /external/eigen/test/eigen2/ |
| eigen2_product_large.cpp | 19 CALL_SUBTEST_5( product(Matrix<float,Dynamic,Dynamic,RowMajor>(ei_random<int>(1,320), ei_random<int>(1,320))) );
|
| /external/libogg/win32/VS6/ |
| build_ogg_dynamic.bat | 2 echo ---+++--- Building Ogg (Dynamic) ---+++---
|
