HomeSort by relevance Sort by last modified time
    Searched refs:cols (Results 51 - 75 of 787) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/libvpx/libvpx/vp8/common/
debugmodes.c 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame)
30 for (mb_col = 0; mb_col < cols; mb_col++)
49 for (mb_col = 0; mb_col < cols; mb_col++)
69 for (mb_col = 0; mb_col < cols; mb_col++)
94 for (b_col = 0; b_col < 4 * cols; b_col++)
96 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
117 for (mb_col = 0; mb_col < cols; mb_col++)
142 for (b_col = 0; b_col < 4 * cols; b_col++)
144 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/
debugmodes.c 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame)
30 for (mb_col = 0; mb_col < cols; mb_col++)
49 for (mb_col = 0; mb_col < cols; mb_col++)
69 for (mb_col = 0; mb_col < cols; mb_col++)
94 for (b_col = 0; b_col < 4 * cols; b_col++)
96 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
117 for (mb_col = 0; mb_col < cols; mb_col++)
142 for (b_col = 0; b_col < 4 * cols; b_col++)
144 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
  /external/eigen/Eigen/src/misc/
Kernel.h 27 // is the number of cols of the original matrix
47 m_cols(m_rank==dec.cols() ? 1 : dec.cols() - m_rank)
50 inline Index rows() const { return m_dec.cols(); }
51 inline Index cols() const { return m_cols; } function in struct:Eigen::internal::kernel_retval_base
76 using Base::cols; \
  /external/eigen/test/eigen2/
eigen2_miscmatrices.cpp 22 int cols = m.cols(); local
24 int r = ei_random<int>(0, rows-1), r2 = ei_random<int>(0, rows-1), c = ei_random<int>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
eigen2_qr.cpp 19 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
41 b = SquareMatrixType::Random(cols,cols);
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));
product.h 37 int cols = m.cols(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 mzero = MatrixType::Zero(rows, cols);
50 square2 = ColSquareMatrixType::Random(cols, cols),
51 res2 = ColSquareMatrixType::Random(cols, cols);
    [all...]
eigen2_basicstuff.cpp 18 int cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
36 c = ei_random<int>(0, cols-1);
68 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
78 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)
80 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)))
    [all...]
eigen2_linearstructure.cpp 22 int 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);
35 c = ei_random<int>(0, cols-1);
66 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
67 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
68 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1)
    [all...]
  /external/eigen/test/
lu.cpp 21 Index rows, cols, cols2; local
32 cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
37 cols2 = cols = MatrixType::ColsAtCompileTime;
51 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
54 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
56 MatrixType m1(rows, cols), m3(rows, cols2);
57 CMatrixType m2(cols, cols2);
58 createRandomPIMatrixOfRank(rank, rows, cols, m1)
134 Index cols = rows; local
    [all...]
miscmatrices.cpp 21 Index cols = m.cols(); local
23 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
24 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
25 MatrixType m1 = MatrixType::Ones(rows,cols);
corners.cpp 20 Index cols = m.cols(); local
23 Index c = internal::random<Index>(1,cols);
25 MatrixType matrix = MatrixType::Random(rows,cols);
26 const MatrixType const_matrix = MatrixType::Random(rows,cols);
29 COMPARE_CORNER(topRightCorner(r,c), block(0,cols-c,r,c));
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c));
35 Index sc = internal::random<Index>(1,cols) - 1;
36 Index nc = internal::random<Index>(1,cols-sc);
38 COMPARE_CORNER(topRows(r), block(0,0,r,cols));
53 cols = MatrixType::ColsAtCompileTime, enumerator in enum:__anon25651
    [all...]
product.h 35 Index cols = m.cols(); local
39 MatrixType m1 = MatrixType::Random(rows, cols),
40 m2 = MatrixType::Random(rows, cols),
41 m3(rows, cols);
47 square2 = ColSquareMatrixType::Random(cols, cols),
48 res2 = ColSquareMatrixType::Random(cols, cols);
50 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols)
    [all...]
eigensolver_generalized_real.cpp 21 Index cols = m.cols(); local
26 MatrixType a = MatrixType::Random(rows,cols);
27 MatrixType b = MatrixType::Random(rows,cols);
28 MatrixType a1 = MatrixType::Random(rows,cols);
29 MatrixType b1 = MatrixType::Random(rows,cols);
swap.cpp 32 typename MatrixType::Index 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/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_linear.h 62 unsigned cols; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
97 if (t->stride != t->block.size * t->cols * t->tiles_x)
  /external/mesa3d/src/gallium/auxiliary/util/
u_linear.h 62 unsigned cols; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
97 if (t->stride != t->block.size * t->cols * t->tiles_x)
  /external/ceres-solver/internal/ceres/
detect_structure.cc 71 *e_block_size = bs.cols[e_block_id].size;
73 *e_block_size != bs.cols[e_block_id].size) {
76 << bs.cols[e_block_id].size;
83 *f_block_size = bs.cols[f_block_id].size;
87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) {
90 << bs.cols[row.cells[c].block_id].size;
compressed_col_sparse_matrix_utils_test.cc 92 int* cols) {
107 cols[offset] = col_pos + c;
135 int* cols = tsm.mutable_cols(); local
142 rows + offset, cols + offset);
199 cols.resize(5);
203 cols[0] = 0;
207 cols[1] = 1;
211 cols[2] = 2;
217 cols[3] = 4;
225 cols[4] = 7
228 vector<int> cols; member in class:ceres::internal::SolveUpperTriangularTest
    [all...]
  /external/eigen/bench/
bench_reverse.cpp 21 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
32 int c = internal::random<int>(0,cols-1);
50 std::cout << rows << " x " << cols << " \t"
sparse_randomsetter.cpp 48 int cols = sm1.cols(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
68 int cols = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1
    [all...]
sparse_trisolver.cpp 40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst)
42 dst.startFill(rows*cols*density);
43 for(int j = 0; j < cols; j++)
59 int cols = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
65 DenseVector b = DenseVector::Random(cols);
66 DenseVector x = DenseVector::Random(cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
    [all...]
spmv.cpp 28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
41 int cols = size; local
55 cols = atoi(argv[i]+1);
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, cols, sm);
96 DenseMatrix dm(rows,cols), (rows,cols) local
    [all...]
  /external/eigen/Eigen/src/Eigen2Support/
Block.h 43 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
63 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
95 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
116 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
120 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
  /external/lldb/test/pexpect-2.4/examples/
bd_client.py 13 #cols = int(s.recv(4))
15 cols = 80
17 packet_size = cols * rows * 2 # double it for good measure

Completed in 352 milliseconds

1 23 4 5 6 7 8 91011>>