| /external/eigen/test/ |
| product_extra.cpp | 23 Index cols = m.cols(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
32 square2 = MatrixType::Random(cols, cols),
33 res2 = MatrixType::Random(cols, cols);
[all...] |
| integer_types.cpp | 28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
[all...] |
| eigensolver_complex.cpp | 23 VERIFY(vec1.cols() == 1);
24 VERIFY(vec2.cols() == 1);
40 Index cols = m.cols(); local
48 MatrixType a = MatrixType::Random(rows,cols);
67 MatrixType z = MatrixType::Zero(rows,cols);
71 MatrixType id = MatrixType::Identity(rows, cols);
89 MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
| zerosized.cpp | 21 VERIFY(t1.cols() == 0);
27 VERIFY(t2.cols() == 0);
|
| basicstuff.cpp | 22 Index cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
39 c = internal::random<Index>(0, cols-1);
71 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
82 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)
84 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)))
140 Index cols = m.cols(); local
[all...] |
| map.cpp | 52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols);
64 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
65 MatrixType ma1 = Map<MatrixType>(array1, rows, cols);
[all...] |
| block.cpp | 24 Index cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols),
29 m3(rows, cols),
30 ones = MatrixType::Ones(rows, cols);
37 Index c1 = internal::random<Index>(0,cols-1);
38 Index c2 = internal::random<Index>(c1,cols-1);
58 RowVectorType br1(m1.block(r1,0,1,cols));
71 if (rows>=5 && cols>=8
155 Index cols = m.cols(); local
189 Index cols = m.cols(); local
[all...] |
| cwiseop.cpp | 39 Index cols = m.cols(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 m4(rows, cols),
45 mzero = MatrixType::Zero(rows, cols),
46 mones = MatrixType::Ones(rows, cols),
54 c = internal::random<Index>(0, cols-1);
59 m3 = MatrixType::Constant(rows, cols, s1)
[all...] |
| /external/eigen/bench/ |
| BenchSparseUtil.h | 27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst)
29 dst.reserve(double(rows)*cols*density);
30 for(int j = 0; j < cols; j++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst)
44 // std::cout << "alloc " << nnzPerCol*cols << "\n";
45 dst.reserve(nnzPerCol*cols);
46 for(int j = 0; j < cols; j++)
65 for (int j=0; j<src.cols(); ++j)
76 GmmDynSparse tmp(src.rows(), src.cols());
77 for (int j=0; j<src.cols(); ++j
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_structure.h | 83 vector<Block> cols; member in struct:ceres::internal::CompressedRowBlockStructure
89 vector<CompressedColumn> cols; member in struct:ceres::internal::CompressedColumnBlockStructure
|
| partitioned_matrix_view.cc | 55 num_col_blocks_f_ = bs->cols.size() - num_col_blocks_a;
74 for (int c = 0; c < bs->cols.size(); ++c) {
75 const Block& block = bs->cols[c];
105 const int col_block_pos = bs->cols[col_block_id].position;
106 const int col_block_size = bs->cols[col_block_id].size;
129 const int col_block_pos = bs->cols[col_block_id].position;
130 const int col_block_size = bs->cols[col_block_id].size;
150 const int col_block_pos = bs->cols[col_block_id].position;
151 const int col_block_size = bs->cols[col_block_id].size;
174 const int col_block_pos = bs->cols[col_block_id].position
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLFrameSetElement.idl | 23 [Reflect] attribute DOMString cols;
|
| /external/eigen/Eigen/src/Core/ |
| Select.h | 69 eigen_assert(m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols());
73 Index cols() const { return m_condition.cols(); } function in class:Eigen::Select
142 derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar));
157 derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
|
| CwiseNullaryOp.h | 57 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
58 : m_rows(rows), m_cols(cols), m_functor(func)
62 && cols >= 0
63 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols));
67 EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); } function in class:Eigen::CwiseNullaryOp
69 EIGEN_STRONG_INLINE const Scalar coeff(Index rows, Index cols) const
71 return m_functor(rows, cols);
103 * The parameters \a rows and \a cols are the number of rows and of columns of
107 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
117 DenseBase<Derived>::NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 25 int cols = m.cols(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
93 SquareMatrixType symm = a0.block(0,0,rows,cols-4) * a0.block(0,0,rows,cols-4).adjoint();
|
| eigen2_map.cpp | 42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test non-const-correctness support in eigen2
54 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
55 MatrixType ma1 = Map<MatrixType>(array1, rows, cols);
[all...] |
| eigen2_triangular.cpp | 21 int cols = m.cols(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols),
26 m4(rows, cols),
27 r1(rows, cols),
28 r2(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 mones = MatrixType::Ones(rows, cols),
[all...] |
| eigen2_cwiseop.cpp | 29 int cols = m.cols(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols),
34 m4(rows, cols),
35 mzero = MatrixType::Zero(rows, cols),
36 mones = MatrixType::Ones(rows, cols),
47 c = ei_random<int>(0, cols-1);
52 m3 = MatrixType::Constant(rows, cols, s1)
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 76 inline Index cols() const { return m_matrix.cols() + (int(Direction)==Horizontal ? 1 : 0); } function in class:Eigen::Homogeneous
81 || (int(Direction)==Horizontal && col==m_matrix.cols()))
180 Direction==Horizontal ? _expression().cols()-1 : _expression().cols()).cwiseQuotient(
186 Direction==Horizontal ? _expression().cols()-1:0,
188 Direction==Horizontal ? 1 : _expression().cols()),
190 Direction==Horizontal ? _expression().cols()-1 : 1));
247 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_left_product_impl
286 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_right_product_impl
[all...] |
| /external/eigen/Eigen/src/misc/ |
| Solve.h | 44 inline Index rows() const { return m_dec.cols(); }
45 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_base
70 using Base::cols; \
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_debugmodes.c | 32 int cols = cm->mi_cols; local
39 for (mi_col = 0; mi_col < cols; mi_col++) {
57 int cols = cm->mi_cols; local
69 for (mi_col = 0; mi_col < cols; mi_col++) {
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| TiledWorld.java | 35 public TiledWorld(int cols, int rows) {
37 mTilesArray = new int[cols][rows];
39 mColCount = cols;
41 for (int x = 0; x < cols; x++) {
|
| /system/core/liblinenoise/ |
| linenoise.c | 187 static void refreshLine(int fd, const char *prompt, char *buf, size_t len, size_t pos, size_t cols) {
191 while((plen+pos) >= cols) {
196 while (plen+len > cols) {
218 size_t cols = getColumns(); local
254 refreshLine(fd,prompt,buf,len,pos,cols);
263 refreshLine(fd,prompt,buf,len,pos,cols);
284 refreshLine(fd,prompt,buf,len,pos,cols);
291 refreshLine(fd,prompt,buf,len,pos,cols);
313 refreshLine(fd,prompt,buf,len,pos,cols);
324 if (plen+len < cols) {
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseRedux.h | 19 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
31 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
39 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 27 struct C_MatrixXd* MatrixXd_new(int rows, int cols);
31 void MatrixXd_resize (struct C_MatrixXd *m, int rows, int cols);
50 struct C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols);
|
