| /libcore/luni/src/test/java/tests/support/ |
| MockCallback.java | 24 public void columns(String cols[]) {
26 for (int i = 0; i <= cols.length; i++) {
27 System.out.println("<TD>" + cols[i] + "</TD>");
32 public boolean newrow(String cols[]) {
34 for (int i = 0; i <= cols.length; i++) {
35 System.out.println("<TD>" + cols[i] + "</TD>");
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 116 Matrix(unsigned rows, unsigned cols) :
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) :
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
124 std::fill(data, data + (rows * cols), initVal);
129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols])
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/wpa_gui/ |
| scanresults.ui.h | 60 QStringList cols = QStringList::split(QChar('\t'), *it, true); local
62 bssid = cols.count() > 0 ? cols[0] : "";
63 freq = cols.count() > 1 ? cols[1] : "";
64 signal = cols.count() > 2 ? cols[2] : "";
65 flags = cols.count() > 3 ? cols[3] : "";
66 ssid = cols.count() > 4 ? cols[4] : ""
[all...] |
| /external/skia/include/utils/ |
| SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) {
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,
|
| SkBoundaryPatch.h | 36 bool evalPatch(SkPoint verts[], int rows, int cols);
|
| /external/skia/src/utils/ |
| 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)) {
[all...] |
| SkBoundaryPatch.cpp | 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) {
45 if (rows < 2 || cols < 2) {
50 const SkScalar invC = SkScalarInvert(SkIntToScalar(cols - 1));
52 for (int y = 0; y < cols; y++) {
|
| /external/qemu/distrib/sdl-1.2.12/src/video/ |
| SDL_yuv_mmx.c | 83 int rows, int cols, int mod )
88 unsigned char* y = lum +cols*rows; // Pointer to the end
91 row2 = (Uint32 *)out+cols+mod; // start of second row
92 mod = (mod+cols+mod)*4; // increment for row1 in byte
125 // L2=lum+cols
223 "addl %4,%2\n" // lum += cols
234 "r"(row1),"r"(cols),"r"(row2),"m"(x),"m"(y),"m"(mod),
244 int rows, int cols, int mod )
249 unsigned char* y = lum +cols*rows; /* Pointer to the end */
252 row2 = (Uint16 *)out+cols+mod; /* start of second row *
[all...] |
| SDL_yuv_sw.c | 110 int rows, int cols, int mod );
114 int rows, int cols, int mod );
128 int rows, int cols, int mod );
132 int rows, int cols, int mod );
138 int rows, int cols, int mod )
147 int cols_2 = cols / 2;
150 row2 = row1 + cols + mod;
151 lum2 = lum + cols;
153 mod += cols + mod;
198 lum += cols;
[all...] |
| /external/valgrind/main/drd/tests/ |
| matinv.c | 36 int cols; member in struct:gj_threadinfo
56 static elem_t* new_matrix(const int rows, const int cols)
59 assert(cols > 0);
60 return malloc(rows * cols * sizeof(elem_t));
70 static void init_matrix(elem_t* const a, const int rows, const int cols)
77 a[i * cols + j] = 1.0 / (1 + abs(i-j));
84 const elem_t* const a, const int rows, const int cols)
90 for (j = 0; j < cols; j++)
92 printf("%g ", a[i * cols + j]);
175 const int cols = p->cols local
[all...] |
| omp_matinv.c | 44 static elem_t* new_matrix(const int rows, const int cols)
47 assert(cols > 0);
48 return malloc(rows * cols * sizeof(elem_t));
58 static void init_matrix(elem_t* const a, const int rows, const int cols)
65 a[i * cols + j] = 1.0 / (1 + abs(i-j));
72 const elem_t* const a, const int rows, const int cols)
78 for (j = 0; j < cols; j++)
80 printf("%g ", a[i * cols + j]);
158 static void gj(elem_t* const a, const int rows, const int cols)
169 if (a[k * cols + i] > a[j * cols + i]
[all...] |
| /external/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/linux-tools-perf/util/ui/ |
| progress.c | 15 int cols; local
19 newtGetScreenSize(&cols, NULL);
20 cols -= 4;
21 newtCenteredWindow(cols, 1, title);
25 self->scale = newtScale(0, 0, cols, total);
|
| /external/opencv/cvaux/src/ |
| cvvideo.cpp | 64 if( frame->cols != even->cols || frame->cols != odd->cols ||
|
| cvbgfg_codebook.cpp | 105 roi.width = image->cols;
109 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols &&
112 roi.x + roi.width <= image->cols &&
115 if( image->cols != model->size.width || image->rows != model->size.height )
120 int bufSz = image->cols*image->rows*sizeof(model->cbmap[0]);
123 model->size = cvSize(image->cols, image->rows);
142 CvBGCodeBookElem** cb = model->cbmap + image->cols*(y + roi.y) + roi.x;
241 image->cols == model->size.width && image->rows == model->size.height &&
246 roi.width = image->cols;
250 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols &
[all...] |
| /external/replicaisland/src/com/replica/replicaisland/ |
| TiledWorld.java | 35 public TiledWorld(int cols, int rows) {
37 mTilesArray = new int[cols][rows];
39 mColCount = cols;
41 for (int x = 0; x < cols; x++) {
|
| /system/core/liblinenoise/ |
| linenoise.c | 187 static void refreshLine(int fd, const char *prompt, char *buf, size_t len, size_t pos, size_t cols) {
191 while((plen+pos) >= cols) {
196 while (plen+len > cols) {
218 size_t cols = getColumns(); local
254 refreshLine(fd,prompt,buf,len,pos,cols);
263 refreshLine(fd,prompt,buf,len,pos,cols);
284 refreshLine(fd,prompt,buf,len,pos,cols);
291 refreshLine(fd,prompt,buf,len,pos,cols);
313 refreshLine(fd,prompt,buf,len,pos,cols);
324 if (plen+len < cols) {
[all...] |
| /external/opencv/cv/src/ |
| cvkdtree.cpp | 90 assert(d->cols == tr->dims());
93 assert(results->cols == k);
94 assert(dist->cols == k);
120 int rn = results->rows * results->cols;
146 (&tmp[0], &tmp[0] + tmp.size(), mat->cols,
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
216 if (desc->cols != dims)
218 if (results->rows != desc->rows && results->cols != k)
220 if (dist->rows != desc->rows && dist->cols != k
[all...] |
| cvadapthresh.cpp | 53 int i, j, rows, cols; local
67 cols = src->cols;
72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 ));
92 for( j = 0; j < cols; j++ )
|
| cvtemplmatch.cpp | 103 if( img->cols < templ->cols || img->rows < templ->rows )
108 corr->cols > img->cols + templ->cols - 1 )
112 blocksize.width = cvRound(templ->cols*block_scale);
113 blocksize.width = MAX( blocksize.width, min_block_size - templ->cols + 1 );
114 blocksize.width = MIN( blocksize.width, corr->cols );
119 dftsize.width = cvGetOptimalDFTSize(blocksize.width + templ->cols - 1);
127 blocksize.width = dftsize.width - templ->cols + 1
[all...] |
| /external/skia/src/images/ |
| bmpdecoderhelper.cpp | 41 int cols = 0; local
56 cols = GetInt();
78 if (cols < 0 || cols > 256) {
82 if (cols == 0 && bpp_ <= 8) {
83 cols = 1 << bpp_;
85 if (bpp_ <= 8 || cols > 0) {
90 if (cols > 0) {
91 if (pos_ + (cols * colLen) > len_) {
94 for (int i = 0; i < cols; ++i)
[all...] |
| /external/opencv/ml/src/ |
| mlann_mlp.cpp | 180 for( i = 1; i < layer_sizes->cols; i++ )
198 if( i < layer_sizes->cols - 1 )
223 _layer_sizes->cols != 1 && _layer_sizes->rows != 1 ||
230 l_count = _layer_sizes->rows + _layer_sizes->cols - 1;
286 if( _inputs->cols != layer_sizes->data.i[0] )
290 if( _outputs->cols != layer_sizes->data.i[layer_sizes->cols - 1] )
305 l_count = layer_sizes->cols;
313 cvInitMatHeader( layer_out, dn, layer_in->cols, CV_64F, buf );
321 int cols = layer_sizes->data.i[j] local
343 int i, j, cols = _src->cols; local
371 int i, j, cols = _src->cols; local
399 int i, j, n = sums->rows, cols = sums->cols; local
479 int i, j, n = _xf->rows, cols = _xf->cols; local
[all...] |
| ml_inner_functions.cpp | 160 int dim = sample->cols;
220 int dim = sample->cols;
277 int dim = data ? data->cols : 0;
345 CV_ASSERT (center->cols == desired_matrix->cols);
347 dim = desired_matrix->cols;
377 int rows, cols; local
385 cols = matrix->cols;
405 for( j = i+1; j < cols; j++, src += step
[all...] |
| /external/libvpx/vp8/common/ppc/ |
| systemdependent.c | 29 int cols,
33 extern void (*vp8_mbpost_proc_down)(unsigned char *dst, int pitch, int rows, int cols, int flimit);
34 extern void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols, int flimit);
35 extern void (*vp8_mbpost_proc_across_ip)(unsigned char *src, int pitch, int rows, int cols, int flimit);
36 extern void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit);
45 int cols,
|
| /external/libvpx/vpx/ |
| vp8cx.h | 192 unsigned int cols; /**< number of cols */ member in struct:vpx_roi_map
209 unsigned int cols; /**< number of cols */ member in struct:vpx_active_map
|
