/external/eigen/test/ |
H A D | triangular.cpp | 22 typename MatrixType::Index rows = m.rows(); local 25 MatrixType m1 = MatrixType::Random(rows, cols), 26 m2 = MatrixType::Random(rows, cols), 27 m3(rows, cols), 28 m4(rows, cols), 29 r1(rows, cols), 30 r2(rows, cols); 31 VectorType v2 = VectorType::Random(rows); 36 if (rows*col 127 Index rows = m.rows(); local [all...] |
H A D | vectorwiseop.cpp | 21 Index rows = m.rows(); local 23 Index r = internal::random<Index>(0, rows-1), 26 ArrayType m1 = ArrayType::Random(rows, cols), 27 m2(rows, cols), 28 m3(rows, cols); 30 ColVectorType colvec = ColVectorType::Random(rows); 126 Index rows = m.rows(); local 128 Index r = internal::random<Index>(0, rows [all...] |
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteLU.h | 34 Index rows() const { return m_lu.rows(); } function in class:Eigen::IncompleteLU 84 eigen_assert(cols()==b.rows() 85 && "IncompleteLU::solve(): invalid number of rows of the right hand side matrix b");
|
/external/eigen/unsupported/test/ |
H A D | matrix_exponential.cpp | 103 typename MatrixType::Index rows = m.rows(); local 105 MatrixType m1(rows, cols), m2(rows, cols), identity = MatrixType::Identity(rows, cols); 110 m1 = MatrixType::Random(rows, cols);
|
H A D | sparse_extra.cpp | 53 const Index rows = ref.rows(); local 58 double density = (std::max)(8./(rows*cols), 0.01); 63 SparseMatrixType m(rows, cols); 64 DenseMatrix refMat = DenseMatrix::Zero(rows, cols); 65 DenseVector vec1 = DenseVector::Random(rows); 118 SparseMatrixType m1(rows,cols), m2(rows,cols); 119 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows); [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | virtio_console.h | 48 /* rows of the screens */ 49 __u16 rows; member in struct:virtio_console_config
|
/external/mesa3d/src/glsl/tests/ |
H A D | set_uniform_initializer_tests.cpp | 165 unsigned columns, unsigned rows) 168 glsl_type::get_instance(base_type, rows, columns); 174 generate_data(mem_ctx, base_type, columns, rows, val); 312 unsigned columns, unsigned rows, unsigned array_size, 316 glsl_type::get_instance(base_type, rows, columns); 329 generate_array_data(mem_ctx, base_type, columns, rows, 162 non_array_test(void *mem_ctx, struct gl_shader_program *prog, unsigned actual_index, const char *name, enum glsl_base_type base_type, unsigned columns, unsigned rows) argument 309 array_test(void *mem_ctx, struct gl_shader_program *prog, unsigned actual_index, const char *name, enum glsl_base_type base_type, unsigned columns, unsigned rows, unsigned array_size, unsigned excess_data_size) argument
|
H A D | uniform_initializer_utils.cpp | 133 unsigned columns, unsigned rows, 139 glsl_type::get_instance(base_type, rows, columns); 147 unsigned columns, unsigned rows, unsigned array_size, 153 glsl_type::get_instance(base_type, rows, columns); 132 generate_data(void *mem_ctx, enum glsl_base_type base_type, unsigned columns, unsigned rows, ir_constant *&val) argument 146 generate_array_data(void *mem_ctx, enum glsl_base_type base_type, unsigned columns, unsigned rows, unsigned array_size, ir_constant *&val) argument
|
/external/opencv/cv/src/ |
H A D | cvadapthresh.cpp | 53 int i, j, rows, cols; local 66 rows = src->rows; 72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 )); 86 for( i = 0; i < rows; i++ )
|
/external/openssl/crypto/bio/ |
H A D | b_dump.c | 82 int i,j,rows,trc; local 103 rows=(len/dump_width); 104 if ((rows*dump_width)<len) 105 rows++; 106 for(i=0;i<rows;i++)
|
/external/qemu/distrib/sdl-1.2.15/src/video/ |
H A D | SDL_yuv_mmx.c | 83 int rows, int cols, int mod ) 88 unsigned char* y = lum +cols*rows; // Pointer to the end 244 int rows, int cols, int mod ) 249 unsigned char* y = lum +cols*rows; /* Pointer to the end */ 80 ColorRGBDitherYV12MMX1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument 241 Color565DitherYV12MMX1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
|
/external/skia/src/utils/ |
H A D | SkBoundaryPatch.cpp | 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) { argument 45 if (rows < 2 || cols < 2) { 49 const SkScalar invR = SkScalarInvert(SkIntToScalar(rows - 1)); 54 for (int x = 0; x < rows; x++) {
|
/external/ceres-solver/internal/ceres/ |
H A D | compressed_col_sparse_matrix_utils_test.cc | 91 int* rows, 106 rows[offset] = row_pos + r; 134 int* rows = tsm.mutable_rows(); local 142 rows + offset, cols + offset); 200 rows.resize(7); 204 rows[0] = 0; 208 rows[1] = 1; 212 rows[2] = 1; 214 rows[3] = 2; 218 rows[ 87 FillBlock(const vector<int>& row_blocks, const vector<int>& col_blocks, const int row_block_id, const int col_block_id, int* rows, int* cols) argument 229 vector<int> rows; member in class:ceres::internal::SolveUpperTriangularTest [all...] |
H A D | compressed_row_jacobian_writer.cc | 114 int* rows = jacobian->mutable_rows(); local 117 rows[0] = 0; 146 rows[row_pos + j + 1] = rows[row_pos + j] + num_derivatives; 161 const int column_block_begin = rows[row_pos + r] + col_pos; 171 CHECK_EQ(num_jacobian_nonzeros, rows[total_num_residuals]); 186 const int* jacobian_rows = jacobian->rows();
|
H A D | dynamic_compressed_row_sparse_matrix_test.cc | 52 // should have no effect on the number of rows, columns or nonzeros. 85 std::vector<int> rows, cols; local 90 rows.push_back(r); 100 std::copy(rows.begin(), rows.end(), tsm->mutable_rows()); 133 EXPECT_EQ(dense_from_dcrsm.rows(), num_rows); 147 ConstIntVectorRef crsm_rows(crsm->rows(), crsm->num_rows() + 1); 148 ConstIntVectorRef dcrsm_rows(dcrsm->rows(), dcrsm->num_rows() + 1);
|
H A D | linear_least_squares_problems.cc | 192 int* rows = A->mutable_rows(); local 200 rows[nnz] = 0; 204 rows[nnz] = 0; 211 rows[nnz] = 1; 215 rows[nnz] = 1; 222 rows[nnz] = 2; 226 rows[nnz] = 2; 233 rows[nnz] = 3; 237 rows[nnz] = 3; 244 rows[nn [all...] |
H A D | program_test.cc | 272 int* rows = expected_block_sparse_jacobian.mutable_rows(); local 275 rows[0] = 0; 278 rows[1] = 2; 280 rows[2] = 0; 283 rows[3] = 2; 285 rows[4] = 1; 288 rows[5] = 2; 290 rows[6] = 1; 293 rows[7] = 0; 295 rows[ 369 int* rows = expected_block_sparse_jacobian.mutable_rows(); local [all...] |
/external/chromium_org/chrome/browser/extensions/api/braille_display_private/ |
H A D | brlapi_connection.cc | 171 unsigned int columns, rows; local 173 handle_.get(), &columns, &rows) < 0) { 177 *size = columns * rows;
|
/external/chromium_org/chrome/browser/history/ |
H A D | url_database_unittest.cc | 292 // We should get 2 rows for |keyword|. 293 std::vector<KeywordSearchTermRow> rows; local 294 ASSERT_TRUE(GetKeywordSearchTermRows(keyword, &rows)); 295 ASSERT_EQ(2u, rows.size()); 296 if (rows[0].url_id == url_id1) { 297 EXPECT_EQ(keyword, rows[0].term); 298 EXPECT_EQ(keyword, rows[1].term); 299 EXPECT_EQ(url_id2, rows[1].url_id); 301 EXPECT_EQ(keyword, rows[0].term); 302 EXPECT_EQ(url_id1, rows[ [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | GridCoordinate.h | 41 // A span in a single direction (either rows or columns). Note that |resolvedInitialPosition| 138 // This represents a grid area that spans in both rows' and columns' direction. 143 , rows(0, 0) 149 , rows(r) 155 return columns == o.columns && rows == o.rows; 171 return rows.resolvedInitialPosition; 173 return rows.resolvedFinalPosition; 180 GridSpan rows; member in struct:WebCore::GridCoordinate
|
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/ |
H A D | loadimage.h | 295 int rows = (height + (blockHeight - 1)) / blockHeight; local 299 for (int y = 0; y < rows; ++y)
|
/external/chromium_org/third_party/freetype/src/sfnt/ |
H A D | pngshim.c | 196 png_byte* *rows; local 200 y_offset < 0 || y_offset + metrics->height > map->rows || 310 if ( FT_NEW_ARRAY( rows, imgHeight ) ) 317 rows[i] = map->buffer + ( y_offset + i ) * map->pitch + x_offset * 4; 319 png_read_image( png, rows ); 321 FT_FREE( rows );
|
/external/chromium_org/third_party/libyuv/source/ |
H A D | convert_jpeg.cc | 37 int rows) { 45 dest->w, rows); 46 dest->y += rows * dest->y_stride; 47 dest->u += ((rows + 1) >> 1) * dest->u_stride; 48 dest->v += ((rows + 1) >> 1) * dest->v_stride; 49 dest->h -= rows; 55 int rows) { 63 dest->w, rows); 64 dest->y += rows * dest->y_stride; 65 dest->u += ((rows 34 JpegCopyI420(void* opaque, const uint8* const* data, const int* strides, int rows) argument 52 JpegI422ToI420(void* opaque, const uint8* const* data, const int* strides, int rows) argument 70 JpegI444ToI420(void* opaque, const uint8* const* data, const int* strides, int rows) argument 88 JpegI411ToI420(void* opaque, const uint8* const* data, const int* strides, int rows) argument 106 JpegI400ToI420(void* opaque, const uint8* const* data, const int* strides, int rows) argument 232 JpegI420ToARGB(void* opaque, const uint8* const* data, const int* strides, int rows) argument 246 JpegI422ToARGB(void* opaque, const uint8* const* data, const int* strides, int rows) argument 260 JpegI444ToARGB(void* opaque, const uint8* const* data, const int* strides, int rows) argument 274 JpegI411ToARGB(void* opaque, const uint8* const* data, const int* strides, int rows) argument 288 JpegI400ToARGB(void* opaque, const uint8* const* data, const int* strides, int rows) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/winsys/sw/fbdev/ |
H A D | fbdev_sw_winsys.c | 59 unsigned rows; member in struct:fbdev_sw_winsys 94 if (dst->y + dst->height > fbdev->rows) { 96 if (dst->y >= fbdev->rows) 99 height = fbdev->rows - dst->y; 224 fbdev->rows = fbdev->finfo.smem_len / fbdev->finfo.line_length;
|
/external/chromium_org/third_party/skia/tools/bug_chomper/res/third_party/ |
H A D | jquery.tablednd.js | 2 * TableDnD plug-in for JQuery, allows you to drag and drop table rows 25 * and the row that was dropped. You can work out the new order of the rows by using 26 * table.rows. 41 * Add class="nodrop" to any rows for which you don't want to allow dropping, and class="nodrag" to any rows 46 * an ID as must all the rows. 86 // Now make the rows draggable 100 /** This function makes all the rows on the table draggable apart from those marked as "NoDrag" */ 102 // Now initialise the rows 103 var rows 298 var rows = jQuery.tableDnD.currentTable.rows; variable [all...] |