/external/chromium/chrome/browser/ui/cocoa/ |
D | table_row_nsimage_cache_unittest.mm | 15 std::vector<SkBitmap>* rows() { 47 std::vector<SkBitmap>* rows = table.rows(); 48 rows->push_back(MakeImage(10, 10)); 49 rows->push_back(MakeImage(20, 20)); 50 rows->push_back(MakeImage(30, 30)); 57 COMPARE_SK_NS_IMG_SIZES(rows->at(0), image0); 58 COMPARE_SK_NS_IMG_SIZES(rows->at(1), image1); 59 COMPARE_SK_NS_IMG_SIZES(rows->at(2), image2); 61 rows->clear(); 63 rows->push_back(MakeImage(15, 15)); [all …]
|
D | table_model_array_controller.mm | 18 fromControllerRows:(NSIndexSet*)rows; 116 fromControllerRows:(NSIndexSet*)rows { 117 if ([rows count] == 0) 121 for (NSUInteger i = [rows firstIndex]; 123 i = [rows indexGreaterThanIndex:i]) { 130 for (NSUInteger i = [rows firstIndex]; 132 i = [rows indexGreaterThanIndex:i]) { 155 NSMutableArray* rows = [NSMutableArray arrayWithCapacity:range.length]; 157 [rows addObject:[self columnValuesForRow:i]]; 159 [self insertObjects:rows atArrangedObjectIndexes:indexes]; [all …]
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
D | Math.h | 116 Matrix(unsigned rows, unsigned cols) : in Matrix() argument 117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix() 122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) : in Matrix() argument 123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix() 124 std::fill(data, data + (rows * cols), initVal); in Matrix() 129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols]) { in Matrix() 130 std::copy(m.data, m.data + (rows * cols), data); in Matrix() 139 rows = m.rows; cols = m.cols; 140 data = new PBQPNum[rows * cols]; 141 std::copy(m.data, m.data + (rows * cols), data); [all …]
|
/external/skia/src/utils/ |
D | SkMeshUtils.cpp | 21 int texW, int texH, int rows, int cols) { in init() argument 22 if (rows < 2 || cols < 2) { in init() 34 fTexCount = rows * cols; in init() 35 rows -= 1; in init() 37 fIndexCount = rows * cols * 6; in init() 54 for (int x = 0; x < rows; x++) { in init() 56 *idx++ = index + rows + 1; in init() 60 *idx++ = index + rows + 1; in init() 61 *idx++ = index + rows + 2; in init() 72 const SkScalar dx = SkIntToScalar(texW) / rows; in init() [all …]
|
/external/chromium/chrome/browser/geolocation/ |
D | geolocation_exceptions_table_model_unittest.cc | 65 GeolocationExceptionsTableModel::Rows rows; in TEST_F() local 66 rows.insert(0U); in TEST_F() 67 EXPECT_TRUE(model_->CanRemoveRows(rows)); in TEST_F() 76 EXPECT_FALSE(model_->CanRemoveRows(rows)); in TEST_F() 79 rows.clear(); in TEST_F() 80 rows.insert(1U); in TEST_F() 81 rows.insert(2U); in TEST_F() 82 EXPECT_TRUE(model_->CanRemoveRows(rows)); in TEST_F() 91 GeolocationExceptionsTableModel::Rows rows; in TEST_F() local 92 rows.insert(0U); in TEST_F() [all …]
|
/external/webkit/Source/WebCore/inspector/front-end/ |
D | ResourceTimingView.js | 75 var rows = []; 84 rows.push(row); 120 for (var i = 0; i < rows.length; ++i) { 125 td.textContent = rows[i].title; 136 bar.className = "network-timing-bar " + rows[i].className; 137 bar.style.left = scale * rows[i].start + "px"; 138 bar.style.right = scale * (total - rows[i].end) + "px"; 139 bar.style.backgroundColor = rows[i].color; 145 if (total - rows[i].end < rows[i].start) 146 title.style.right = (scale * (total - rows[i].end) + 3) + "px"; [all …]
|
/external/valgrind/main/drd/tests/ |
D | matinv.c | 35 int rows; member 56 static elem_t* new_matrix(const int rows, const int cols) in new_matrix() argument 58 assert(rows > 0); in new_matrix() 60 return malloc(rows * cols * sizeof(elem_t)); in new_matrix() 70 static void init_matrix(elem_t* const a, const int rows, const int cols) in init_matrix() argument 73 for (i = 0; i < rows; i++) in init_matrix() 75 for (j = 0; j < rows; j++) in init_matrix() 84 const elem_t* const a, const int rows, const int cols) in print_matrix() argument 88 for (i = 0; i < rows; i++) in print_matrix() 174 const int rows = p->rows; in gj_threadfunc() local [all …]
|
D | omp_matinv.c | 44 static elem_t* new_matrix(const int rows, const int cols) in new_matrix() argument 46 assert(rows > 0); in new_matrix() 48 return malloc(rows * cols * sizeof(elem_t)); in new_matrix() 58 static void init_matrix(elem_t* const a, const int rows, const int cols) in init_matrix() argument 61 for (i = 0; i < rows; i++) in init_matrix() 63 for (j = 0; j < rows; j++) in init_matrix() 72 const elem_t* const a, const int rows, const int cols) in print_matrix() argument 76 for (i = 0; i < rows; i++) in print_matrix() 158 static void gj(elem_t* const a, const int rows, const int cols) in gj() argument 162 for (i = 0; i < rows; i++) in gj() [all …]
|
/external/opencv/cv/src/ |
D | cvkdtree.cpp | 91 assert(results->rows == d->rows); in find_nn() 92 assert(results->rows == dist->rows); in find_nn() 96 for (int j = 0; j < d->rows; ++j) { in find_nn() 120 int rn = results->rows * results->cols; in find_ortho_range() 141 std::vector<int> tmp(mat->rows); in CvFeatureTree() 174 assert(bounds_min->rows * bounds_min->cols == dims()); in find_ortho_range() 175 assert(bounds_max->rows * bounds_max->cols == dims()); in find_ortho_range() 218 if (results->rows != desc->rows && results->cols != k) in cvFindFeatures() 220 if (dist->rows != desc->rows && dist->cols != k) in cvFindFeatures() 229 desc = cvCreateMat(desc->rows, desc->cols, type); in cvFindFeatures() [all …]
|
D | cvtemplmatch.cpp | 103 if( img->cols < templ->cols || img->rows < templ->rows ) in icvCrossCorr() 107 if( corr->rows > img->rows + templ->rows - 1 || in icvCrossCorr() 115 blocksize.height = cvRound(templ->rows*block_scale); in icvCrossCorr() 116 blocksize.height = MAX( blocksize.height, min_block_size - templ->rows + 1 ); in icvCrossCorr() 117 blocksize.height = MIN( blocksize.height, corr->rows ); in icvCrossCorr() 122 dftsize.height = cvGetOptimalDFTSize(blocksize.height + templ->rows - 1); in icvCrossCorr() 129 blocksize.height = dftsize.height - templ->rows + 1; in icvCrossCorr() 130 blocksize.height = MIN( blocksize.height, corr->rows ); in icvCrossCorr() 140 buf_size = templ->cols*templ->rows*CV_ELEM_SIZE(templ_depth); in icvCrossCorr() 144 (blocksize.height + templ->rows - 1)*CV_ELEM_SIZE(depth)); in icvCrossCorr() [all …]
|
D | cvundistort.cpp | 150 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 || in cvUndistort2() 154 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) || in cvUndistort2() 155 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 && in cvUndistort2() 156 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) || in cvUndistort2() 163 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols, in cvUndistort2() 213 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 || in cvInitUndistortMap() 217 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) || in cvInitUndistortMap() 218 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 && in cvInitUndistortMap() 219 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) || in cvInitUndistortMap() 226 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols, in cvInitUndistortMap() [all …]
|
/external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/util/ |
D | sorttable.js | 55 the.appendChild(table.rows[0]); 61 if (table.tHead.rows.length != 1) return; // can't cope with two header rows 68 for (var i=0; i<table.rows.length; i++) { 69 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) { 70 sortbottomrows[sortbottomrows.length] = table.rows[i]; 86 headrow = table.tHead.rows[0].cells; 154 rows = this.sorttable_tbody.rows; 155 for (var j=1; j<rows.length-3; j++) { 156 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]]; 164 var noTestRow = tb.rows[tb.rows.length-3]; [all …]
|
/external/icu4c/common/ |
D | propsvec.c | 31 int32_t rows; member 67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP); in upvec_open() 71 uprv_memset(row, 0, pv->rows*columns*4); in upvec_open() 94 int32_t columns, i, start, limit, prevRow, rows; in _findRow() local 97 rows=limit=pv->rows; in _findRow() 199 int32_t count, rows; in upvec_setValue() local 201 rows=pv->rows; in upvec_setValue() 202 if((rows+splitFirstRow+splitLastRow)>pv->maxRows) { in upvec_setValue() 220 uprv_memcpy(newVectors, pv->v, rows*columns*4); in upvec_setValue() 229 count = (int32_t)((pv->v+rows*columns)-(lastRow+columns)); in upvec_setValue() [all …]
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/www/projectName/ |
D | searchcvs.php | 76 $rows = $row[0]; variable 78 $title = "<span>$rows results total</span>Showing results " . ($offset + 1) . "-" . ($offset + $pag… 79 $title = ($rows == 0 ? "No results found for " . sanitize($_GET["q"], "text") . "" : $title); 84 dopager($rows, $page, $pagesize); 103 dopager($rows, $page, $pagesize); 146 print $rows; 227 function dopager($rows, $page, $pagesize) argument 230 $endpage = ($page + 5 > $rows/$pagesize ? ceil($rows/$pagesize) : $page + 5); 232 if ($rows > 0) 240 print ($page < ceil($rows/$pagesize) ? pagelink($page + 1, false, "Next") : "");
|
/external/markdown/markdown/extensions/ |
D | tables.py | 25 rows = block.split('\n') 26 return (len(rows) > 2 and '|' in rows[0] and 27 '|' in rows[1] and '-' in rows[1] and 28 rows[1][0] in ['|', ':', '-']) 34 rows = block[2:] 55 for row in rows:
|
/external/chromium/chrome/browser/notifications/ |
D | notification_exceptions_table_model_unittest.cc | 109 RemoveRowsTableModel::Rows rows; in TEST_F() local 110 rows.insert(0); // allowed.com in TEST_F() 111 rows.insert(3); // e-allowed2.com in TEST_F() 112 model_->RemoveRows(rows); in TEST_F() 119 RemoveRowsTableModel::Rows rows; in TEST_F() local 120 rows.insert(0); in TEST_F() 121 rows.insert(1); in TEST_F() 122 rows.insert(2); in TEST_F() 123 model_->RemoveRows(rows); in TEST_F()
|
/external/doclava/res/assets/templates/ |
D | diff.cs | 71 if (tr.rowIndex + 1 < table.rows.length) { 72 var tbody = table.rows[tr.rowIndex + 1].parentNode; 79 if (tr.rowIndex + 1 < table.rows.length 80 && $(table.rows[tr.rowIndex + 1]).hasClass("class-entry")) { 81 var tbody = table.rows[tr.rowIndex + 1].parentNode; 99 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry")) { 100 $(table.rows[i++]).show(); 107 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry")) { 108 $(table.rows[i++]).hide();
|
/external/freetype/src/base/ |
D | ftbitmap.c | 63 size = (FT_ULong)( pitch * source->rows ); in FT_Bitmap_Copy() 73 target_size = (FT_ULong)( target_pitch * target->rows ); in FT_Bitmap_Copy() 112 height = bitmap->rows; in ft_bitmap_assure_buffer() 176 if ( FT_QALLOC_MULT( buffer, new_pitch, bitmap->rows + ypixels ) ) in ft_bitmap_assure_buffer() 184 for ( i = 0; i < bitmap->rows; i++ ) in ft_bitmap_assure_buffer() 193 for ( i = 0; i < bitmap->rows; i++ ) in ft_bitmap_assure_buffer() 292 p = bitmap->buffer + pitch * ( bitmap->rows - 1 ); in FT_Bitmap_Embolden() 296 for ( y = 0; y < bitmap->rows ; y++ ) in FT_Bitmap_Embolden() 366 bitmap->rows += ystr; in FT_Bitmap_Embolden() 402 old_size = target->rows * target->pitch; in FT_Bitmap_Convert() [all …]
|
/external/chromium/chrome/browser/ |
D | plugin_exceptions_table_model_unittest.cc | 165 RemoveRowsTableModel::Rows rows; in TEST_F() local 166 rows.insert(1); in TEST_F() 167 table_model_->RemoveRows(rows); in TEST_F() 179 RemoveRowsTableModel::Rows rows; in TEST_F() local 180 rows.insert(0); in TEST_F() 181 table_model_->RemoveRows(rows); in TEST_F() 197 rows.clear(); in TEST_F() 198 rows.insert(0); in TEST_F() 199 rows.insert(2); in TEST_F() 200 table_model_->RemoveRows(rows); in TEST_F()
|
/external/libvpx/vp8/common/ |
D | debugmodes.c | 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) in vp8_print_modes_and_motion_vectors() argument 28 for (mb_row = 0; mb_row < rows; mb_row++) in vp8_print_modes_and_motion_vectors() 47 for (mb_row = 0; mb_row < rows; mb_row++) in vp8_print_modes_and_motion_vectors() 67 for (mb_row = 0; mb_row < rows; mb_row++) in vp8_print_modes_and_motion_vectors() 89 for (b_row = 0; b_row < 4 * rows; b_row++) in vp8_print_modes_and_motion_vectors() 115 for (mb_row = 0; mb_row < rows; mb_row++) in vp8_print_modes_and_motion_vectors() 137 for (b_row = 0; b_row < 4 * rows; b_row++) in vp8_print_modes_and_motion_vectors()
|
/external/opencv/cvaux/src/ |
D | cvtrifocal.cpp | 107 for( i=0;i<matrix->rows;i++ ) in fprintMatrix() 144 if( normPoints->rows != 2 || normPoints->rows != points->rows ) in icvNormalizePoints() 149 if(cameraMatr->rows != 3 || cameraMatr->cols != 3) in icvNormalizePoints() 207 if( points1->rows != 2 || points2->rows != 2 || points3->rows != 2 ) in icvComputeProjectMatrices6Points() 213 !(projMatr1->rows == 3 && projMatr2->rows == 3 && projMatr3->rows == 3) && in icvComputeProjectMatrices6Points() 214 !(projMatr1->rows == 9 && projMatr2->rows == 9 && projMatr3->rows == 9) ) in icvComputeProjectMatrices6Points() 322 maxSol = projMatrs[0]->rows / 3; in icvComputeProjectMatrices6Points() 384 if( currSol < points4D->rows / 4 ) in icvComputeProjectMatrices6Points() 476 numRows = srcMatr->rows; in icvSelectColsByNumbers() 479 if( numRows != dstMatr->rows ) in icvSelectColsByNumbers() [all …]
|
/external/opencv/ml/src/ |
D | ml_inner_functions.cpp | 127 int dim = A->rows; in cvChol() 161 int amount = sample->rows; in cvRandMVNormal() 221 int amount = sample->rows; in cvRandGaussMixture() 344 CV_ASSERT (center->rows == 1); in cvRandRoundUni() 348 size = desired_matrix->rows; in cvRandRoundUni() 377 int rows, cols; in cvCompleteSymm() local 384 rows = matrix->rows; in cvCompleteSymm() 394 for( i = 1; i < rows; i++ ) in cvCompleteSymm() 402 for( i = 0; i < rows-1; i++, dst += step ) in cvCompleteSymm() 414 for( i = 1; i < rows; i++ ) in cvCompleteSymm() [all …]
|
/external/opencv/cxcore/include/ |
D | cxcore.hpp | 214 CvMatrix( int rows, int cols, int type ) in CvMatrix() argument 215 { matrix = cvCreateMat( rows, cols, type ); } in CvMatrix() 217 CvMatrix( int rows, int cols, int type, CvMat* hdr, in CvMatrix() argument 219 { matrix = cvInitMatHeader( hdr, rows, cols, type, data, step ); } in CvMatrix() 221 CvMatrix( int rows, int cols, int type, CvMemStorage* storage, bool alloc_data=true ); 223 CvMatrix( int rows, int cols, int type, void* data, int step=CV_AUTOSTEP ) in CvMatrix() argument 224 { matrix = cvCreateMatHeader( rows, cols, type ); in CvMatrix() 260 void create( int rows, int cols, int type ) in create() argument 263 matrix->rows != rows || matrix->cols != cols || in create() 265 set( cvCreateMat( rows, cols, type ), false ); in create() [all …]
|
/external/webkit/Source/WebCore/platform/graphics/haiku/ |
D | ImageBufferHaiku.cpp | 110 unsigned rows = m_size.height(); in platformTransformColorSpace() local 112 for (unsigned y = 0; y < rows; y++) { in platformTransformColorSpace() 131 unsigned rows, unsigned columns) in convertFromData() argument 133 for (unsigned y = 0; y < rows; y++) { in convertFromData() 152 unsigned rows, unsigned columns, in convertFromInternalData() argument 157 for (unsigned y = 0; y < rows; y++) { in convertFromInternalData() 175 rows, columns); in convertFromInternalData() 181 unsigned rows, unsigned columns, in convertToInternalData() argument 186 for (unsigned y = 0; y < rows; y++) { in convertToInternalData() 211 rows, columns); in convertToInternalData() [all …]
|
/external/clang/tools/scan-build/ |
D | sorttable.js | 47 the.appendChild(table.rows[0]); 53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows 60 for (var i=0; i<table.rows.length; i++) { 61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) { 62 sortbottomrows[sortbottomrows.length] = table.rows[i]; 78 headrow = table.tHead.rows[0].cells; 146 rows = this.sorttable_tbody.rows; 147 for (var j=0; j<rows.length; j++) { 148 row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]]; 169 for (var i=0; i<table.tBodies[0].rows.length; i++) { [all …]
|