/external/eigen/doc/snippets/ |
Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable 2 MatrixXf m(rows,cols); 5 MatrixXf::Zero(rows-3,3), 6 MatrixXf::Identity(rows-3,cols-3);
|
/external/ImageMagick/Magick++/tests/ |
exceptions.cpp | 57 size_t rows = 480; local 58 Geometry geometry(columns,rows);
|
attributes.cpp | 27 size_t rows = 480; local 28 Geometry geometry(columns,rows); 276 if ( image.baseRows() != rows ) 282 << ") != rows (" 283 << rows 1240 // rows 1242 if ( image.rows() != rows ) 1246 << ", rows is canvas rows as expected" << endl [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
virtio_console.h | 15 /* rows of the screens */ 16 __u16 rows; member in struct:virtio_console_config
|
/external/eigen/doc/ |
tutorial.cpp | 27 int rows = 3, cols = 3; local
|
/external/libvpx/libvpx/vp9/common/ |
vp9_idct.h | 30 transform_1d cols, rows; // vertical and horizontal member in struct:__anon18020 37 highbd_transform_1d cols, rows; // vertical and horizontal member in struct:__anon18021
|
vp9_debugmodes.c | 29 int rows = cm->mi_rows; local 34 for (mi_row = 0; mi_row < rows; mi_row++) { 53 int rows = cm->mi_rows; local 64 for (mi_row = 0; mi_row < rows; mi_row++) { 78 for (mi_row = 0; mi_row < rows; mi_row++) {
|
vp9_thread_common.h | 35 int rows; member in struct:VP9LfSyncData 43 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, struct VP9Common *cm, int rows,
|
/external/opencv3/modules/cudev/include/opencv2/cudev/grid/ |
integral.hpp | 62 const int rows = getRows(src); local 65 dst.create(rows, cols); 67 integral_detail::integral(shrinkPtr(src), shrinkPtr(dst), rows, cols, StreamAccessor::getStream(stream)); local
|
copy.hpp | 66 const int rows = getRows(src); local 69 CV_Assert( getRows(mask) == rows && getCols(mask) == cols ); 71 dst.create(rows, cols); 73 grid_copy_detail::copy<Policy>(shrinkPtr(src), shrinkPtr(dst), shrinkPtr(mask), rows, cols, StreamAccessor::getStream(stream)); local 79 const int rows = getRows(src); local 82 CV_Assert( getRows(dst) == rows && getCols(dst) == cols ); 83 CV_Assert( getRows(mask) == rows && getCols(mask) == cols ); 85 grid_copy_detail::copy<Policy>(shrinkPtr(src), shrinkPtr(dst), shrinkPtr(mask), rows, cols, StreamAccessor::getStream(stream)); local 91 const int rows = getRows(src); local 94 dst.create(rows, cols) 96 grid_copy_detail::copy<Policy>(shrinkPtr(src), shrinkPtr(dst), WithOutMask(), rows, cols, StreamAccessor::getStream(stream)); local 102 const int rows = getRows(src); local 107 grid_copy_detail::copy<Policy>(shrinkPtr(src), shrinkPtr(dst), WithOutMask(), rows, cols, StreamAccessor::getStream(stream)); local 115 const int rows = getRows(src); local 126 rows, cols, local 135 const int rows = getRows(src); local 145 rows, cols, local 154 const int rows = getRows(src); local 172 const int rows = getRows(src); local 190 const int rows = getRows(src); local 202 rows, cols, local 211 const int rows = getRows(src); local 222 rows, cols, local 231 const int rows = getRows(src); local 250 const int rows = getRows(src); local 269 const int rows = getRows(src); local 282 rows, cols, local 291 const int rows = getRows(src); local 303 rows, cols, local 312 const int rows = getRows(src); local 332 const int rows = getRows(src); local [all...] |
pyramids.hpp | 64 const int rows = getRows(src); local 67 dst.create(divUp(rows, 2), divUp(cols, 2)); 69 pyramids_detail::pyrDown<Brd>(shrinkPtr(src), shrinkPtr(dst), rows, cols, dst.rows, dst.cols, StreamAccessor::getStream(stream)); local 81 const int rows = getRows(src); local 84 dst.create(rows * 2, cols * 2); 86 pyramids_detail::pyrUp(shrinkPtr(src), shrinkPtr(dst), rows, cols, dst.rows, dst.cols, StreamAccessor::getStream(stream)); local
|
transpose.hpp | 63 const int rows = getRows(src); local 66 dst.create(cols, rows); 68 transpose_detail::transpose<Policy>(shrinkPtr(src), shrinkPtr(dst), rows, cols, StreamAccessor::getStream(stream)); local 74 const int rows = getRows(src); local 77 CV_Assert( getRows(dst) == cols && getCols(dst) == rows ); 79 transpose_detail::transpose<Policy>(shrinkPtr(src), shrinkPtr(dst), rows, cols, StreamAccessor::getStream(stream)); local
|
/external/ceres-solver/include/ceres/ |
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 57 // values[rows[i]] .. values[rows[i + 1] - 1] are the values of the 73 // rows = [ 0, 2, 5, 7] 78 vector<int> rows; member in struct:ceres::CRSMatrix
|
/external/eigen/bench/ |
basicbenchmark.h | 43 const int rows = mat.rows(); local 46 MatrixType I(rows,cols); 47 MatrixType m(rows,cols);
|
sparse_transpose.cpp | 38 int rows = 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/ |
diagonal.cpp | 17 Index rows = m.rows(); local 20 MatrixType m1 = MatrixType::Random(rows, cols), 21 m2 = MatrixType::Random(rows, cols); 28 if (rows>2)
|
selfadjoint.cpp | 20 Index rows = m.rows(); local 23 MatrixType m1 = MatrixType::Random(rows, cols), 24 m3(rows, cols);
|
upperbidiagonalization.cpp | 15 const typename MatrixType::Index rows = m.rows(); local 21 MatrixType a = MatrixType::Random(rows,cols); 23 RealMatrixType b(rows, cols);
|
bandmatrix.cpp | 19 Index rows = _m.rows(); local 24 MatrixType m(rows,cols,supers,subs); 26 DenseMatrixType dm1(rows,cols); 49 Index d = (std::min)(rows,cols); 51 Index b = std::max<Index>(0,rows-d-subs); 52 if(a>0) dm1.block(0,d+supers,rows,a).setZero(); 54 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero(); 68 Index rows = internal::random<Index>(1,10) local [all...] |
/external/eigen/test/eigen2/ |
eigen2_inverse.cpp | 19 int rows = m.rows(); local 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2(rows, cols), 28 identity = MatrixType::Identity(rows, rows); 30 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8) 32 m1 = MatrixType::Random(rows, cols);
|
eigen2_qr.cpp | 18 int rows = m.rows(); local 25 MatrixType a = MatrixType::Random(rows,cols); 28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
|
/external/libmpeg2/decoder/ |
impeg2d_globals.h | 29 UWORD32 rows; member in struct:__anon16803
|
/external/skia/src/codec/ |
SkBmpMaskCodec.cpp | 52 int rows = this->decodeRows(dstInfo, dst, dstRowBytes, opts); local 53 if (rows != dstInfo.height()) { 54 *rowsDecoded = rows; 76 // Iterate over rows of the image
|
/external/ImageMagick/coders/ |
psd-private.h | 31 rows, member in struct:_PSDInfo
|
/external/ceres-solver/internal/ceres/ |
incomplete_lq_factorization_test.cc | 48 EXPECT_EQ(expected.rows()[i], actual.rows()[i]); 84 int* rows = matrix.mutable_rows(); local 90 rows[i] = idx; 100 rows[10] = idx; 148 for (int idx = matrix.rows()[1]; idx < matrix.rows()[2]; ++idx) { 149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]); 150 EXPECT_EQ(matrix.values()[idx], dense_vector(idx - matrix.rows()[1])); 159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0) [all...] |