/external/eigen/doc/snippets/ |
H A D | Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable 2 MatrixXf m(rows,cols); 4 MatrixXf::Zero(3,cols-3), 6 MatrixXf::Identity(rows-3,cols-3);
|
H A D | Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl; 6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
H A D | Matrix_resize_NoChange_int.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
H A D | Matrix_resize_int_NoChange.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
H A D | tut_matrix_assignment_resizing.cpp | 2 std::cout << "a is of size " << a.rows() << "x" << a.cols() << std::endl; 5 std::cout << "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
|
/external/eigen/test/ |
H A D | resize.cpp | 12 template<DenseIndex rows, DenseIndex cols> 15 MatrixXf A(rows, cols); 17 Matrix<double, rows, cols> C; 20 VERIFY(B.rows() == rows && B.cols() == cols); 25 VERIFY(y.rows() == 1 && y.cols() == rows); 27 y.resize(cols); 29 VERIFY(x.rows() == cols && x.cols() == 1);
|
H A D | bandmatrix.cpp | 20 Index cols = _m.cols(); local 24 MatrixType m(rows,cols,supers,subs); 26 DenseMatrixType dm1(rows,cols); 44 for (int i=0; i<cols; ++i) 49 Index d = (std::min)(rows,cols); 50 Index a = std::max<Index>(0,cols-d-supers); 53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero(); 55 if(b>0) dm1.block(d+subs,0,b,cols) 69 Index cols = internal::random<Index>(1,10); local [all...] |
H A D | array_reverse.cpp | 23 Index cols = m.cols(); local 27 MatrixType m1 = MatrixType::Random(rows, cols); 33 for ( int j = 0; j < cols; j++ ) { 34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j)); 41 for ( int j = 0; j < cols; j++ ) { 42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j)); 49 for ( int j = 0; j < cols; j++ ) { 50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j)); 57 for ( int j = 0; j < cols; [all...] |
H A D | array_replicate.cpp | 24 Index cols = m.cols(); local 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2 = MatrixType::Random(rows, cols); 37 x1.resize(rows*f1,cols*f2); 40 x1.block(i*rows,j*cols,rows,cols) = m1; 43 x2.resize(2*rows,3*cols);
|
/external/eigen/failtest/ |
H A D | map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf> m(ptr, rows, cols);
|
H A D | map_nonconst_ctor_on_const_ptr_3.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
|
H A D | map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
/external/eigen/doc/examples/ |
H A D | class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) argument 10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols); 15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) argument 17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
H A D | tut_matrix_resize_fixed_size.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
|
H A D | tut_matrix_resize.cpp | 11 << m.rows() << "x" << m.cols() << std::endl; 17 << v.rows() << "x" << v.cols() << std::endl;
|
/external/ceres-solver/internal/ceres/ |
H A D | compressed_col_sparse_matrix_utils.h | 72 const IntegerType* cols, 76 rhs_and_solution[c] /= values[cols[c + 1] - 1]; 77 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) { 93 const IntegerType* cols, 97 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) { 102 rhs_and_solution[c] = rhs_and_solution[c] / values[cols[c + 1] - 1]; 119 const IntegerType* cols, 124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_inde 70 SolveUpperTriangularInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 91 SolveUpperTriangularTransposeInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument [all...] |
H A D | dense_sparse_matrix.cc | 69 const int *cols = m.cols(); local 73 m_(rows[i], cols[i]) += values[i]; 112 m_.resize(m_.rows() + m_.cols(), m_.cols()); 114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp; 118 m_.bottomLeftCorner(m_.cols(), m_.cols()) = 119 ConstVectorRef(d, m_.cols()).asDiagonal(); 131 return m_.rows() - m_.cols(); [all...] |
H A D | block_jacobi_preconditioner.cc | 49 for (int c = 0; c < block_structure_.cols.size(); ++c) { 50 int size = block_structure_.cols[c].size; 55 blocks_.resize(block_structure_.cols.size()); 60 for (int c = 0; c < block_structure_.cols.size(); ++c) { 61 int size = block_structure_.cols[c].size; 80 const int col_block_size = bs->cols[cells[c].block_id].size; 105 for (int c = 0; c < bs->cols.size(); ++c) { 106 const int size = block_structure_.cols[c].size; 107 const int position = block_structure_.cols[c].position; 124 for (int c = 0; c < block_structure_.cols [all...] |
/external/libavc/common/ |
H A D | ih264_chroma_intra_pred_filters.c | 314 WORD32 rows, cols; /* loop variables*/ local 320 for(cols = 0; cols < 16; cols += 2) 322 *(pu1_dst + rows * dst_strd + cols) = *pu1_left; 324 *(pu1_dst + rows * dst_strd + cols + 1) = *(pu1_left + 1); 438 WORD32 rows, cols; /* loop variables*/ local 450 for(cols = 0; cols < 4; cols [all...] |
/external/eigen/bench/ |
H A D | sparse_transpose.cpp | 39 int cols = SIZE; local 42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols); 47 fillMatrix(density, rows, cols, sm1); 52 DenseMatrix m1(rows,cols), m3(rows,cols); 59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n"; 81 GmmDynSparse gmmT3(rows,cols); 82 GmmSparse m1(rows,cols), m3(rows,cols); [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_svd.cpp | 19 int cols = m.cols(); local 23 MatrixType a = MatrixType::Random(rows,cols); 26 Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> x(cols,1), x2(cols,1); 34 MatrixType sigma = MatrixType::Zero(rows,cols); 36 sigma.block(0,0,cols,cols) = svd.singularValues().asDiagonal(); 37 matU.block(0,0,rows,cols) = svd.matrixU(); 42 if (rows==cols) [all...] |
H A D | eigen2_swap.cpp | 32 int cols = m.cols(); local 35 MatrixType m1 = MatrixType::Random(rows,cols); 36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols); 37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols); 58 m1.swap(m2.block(0,0,rows,cols));
|
/external/ceres-solver/include/ceres/ |
H A D | crs_matrix.h | 49 // rows, cols and values. 51 // rows is a num_rows + 1 sized array that points into the cols and 54 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the 60 // cols and values contain as many entries as there are non-zeros in 74 // cols = [ 1, 3, 1, 2, 3, 0, 1] 77 vector<int> cols; member in struct:ceres::CRSMatrix
|
/external/skia/include/utils/ |
H A D | SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) { argument 24 return this->init(NULL, NULL, texW, texH, rows, cols); 28 int texW, int texH, int rows, int cols); 45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
/external/skia/src/utils/ |
H A D | SkMeshUtils.cpp | 21 int texW, int texH, int rows, int cols) { 22 if (rows < 2 || cols < 2) { 34 fTexCount = rows * cols; 36 cols -= 1; 37 fIndexCount = rows * cols * 6; 53 for (int y = 0; y < cols; y++) { 73 const SkScalar dy = SkIntToScalar(texH) / cols; 74 for (int y = 0; y <= cols; y++) { 89 int rows, int cols, const SkPoint verts[], 93 if (idx.init(bitmap.width(), bitmap.height(), rows, cols)) { 20 init(SkPoint tex[], uint16_t indices[], int texW, int texH, int rows, int cols) argument 88 Draw(SkCanvas* canvas, const SkBitmap& bitmap, int rows, int cols, const SkPoint verts[], const SkColor colors[], const SkPaint& paint) argument [all...] |