| /external/chromium_org/third_party/libjpeg_turbo/ |
| jdmerge.c | 63 /* For 2:1 vertical sampling, we produce two output rows at a time.
72 JDIMENSION rows_to_go; /* counts rows remaining in image */
259 JDIMENSION num_rows; /* number of rows returned to caller */
268 /* Figure number of rows to return to caller. */
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
| loopfilter.h | 24 /* fraction of total macroblock rows to be used in fast filter level picking */
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vpx/ |
| vp8cx.h | 243 unsigned int rows; /**< Number of rows. */ member in struct:vpx_roi_map
263 unsigned int rows; /**< number of rows */ member in struct:vpx_active_map
|
| /external/chromium_org/third_party/mesa/src/src/mesa/state_tracker/ |
| st_atom_stipple.c | 49 * invert the pattern vertically and rotate the stipple rows according
|
| /external/chromium_org/third_party/polymer/components/core-layout-grid/ |
| core-layout-grid.html | 263 _position(elt.style, 'top', 'bottom', 'height', rows[top],
264 rows[bottom]);
279 rows = railize(rowCount, rowHeight);
290 rows.forEach(function(r) {
|
| /external/chromium_org/third_party/polymer/components-chromium/core-layout-grid/ |
| core-layout-grid-extracted.js | 241 _position(elt.style, 'top', 'bottom', 'height', rows[top],
242 rows[bottom]);
257 rows = railize(rowCount, rowHeight);
268 rows.forEach(function(r) {
|
| /external/chromium_org/third_party/polymer/components-chromium/paper-input/ |
| paper-input-extracted.js | 34 * rows tall. If the maximum size does not fit the value, the text
67 var bounded = this.maxRows > 0 || this.rows > 0;
100 if (this.multiline && !isNaN(parseInt(this.rows))) {
102 for (var i = 0; i < this.rows; i++) {
|
| /external/chromium_org/third_party/skia/src/images/ |
| SkScaledBitmapSampler.h | 60 // rows can come in any order. If the row is not part of the output
|
| /external/chromium_org/third_party/sqlite/src/ext/rtree/ |
| rtree_perf.tcl | 13 puts "Generating $NROW rows of data..."
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| analyze3.test | 80 # affinities when estimating the number of rows scanned by the "use
100 } {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (x>? AND x<?) (~100 rows)}}
103 } {0 0 0 {SCAN TABLE t1 (~111 rows)}}
149 } {0 0 0 {SEARCH TABLE t2 USING INDEX i2 (x>? AND x<?) (~200 rows)}}
152 } {0 0 0 {SCAN TABLE t2 (~111 rows)}}
196 } {0 0 0 {SEARCH TABLE t3 USING INDEX i3 (x>? AND x<?) (~100 rows)}}
199 } {0 0 0 {SCAN TABLE t3 (~111 rows)}}
251 } {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (b>? AND b<?) (~30000 rows)}}
254 } {0 0 0 {SCAN TABLE t1 (~500000 rows)}}
|
| e_select2.test | 27 # consists of N rows of M named columns of values each, where each value has a
32 # * A list of data rows. Each row is itself a list, where each element is
74 # The script must return a boolean value - true if the combination of rows
82 # exist rows in the left-hand dataset that have no corresponding rows in
120 set rows [list]
126 lappend rows $r
130 return [list $cols $rows]
373 # as a boolean expression. All rows for which the expression evaluates
|
| eval.test | 47 # Verify that subsequent rows come out as NULL.
|
| /external/chromium_org/tools/telemetry/telemetry/results/ |
| csv_output_formatter.py | 28 """Output the header rows.
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedSelfAdjointEigenSolver.h | 166 eigen_assert(matA.cols()==matA.rows() && matB.rows()==matA.rows() && matB.cols()==matB.rows());
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR_MKL.h | 51 lapack_int m = mat.rows(); \
|
| /external/eigen/test/ |
| determinant.cpp | 20 Index size = m.rows();
|
| /external/eigen/test/eigen2/ |
| eigen2_determinant.cpp | 19 int size = m.rows();
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| RandomSetter.h | 101 * \param OuterPacketBits defines the number of rows (or columns) manage by a single map object
110 * SparseMatrix<double> m(rows,cols);
123 * use multiple hash_map, each representing 2^OuterPacketBits columns or rows according to the storage order.
125 * per rows/columns.
|
| /external/harfbuzz_ng/util/ |
| helper-cairo-ansi.cc | 62 /* We don't have rows to spare on the terminal window...
|
| /external/icu/icu4c/source/common/ |
| ucnv_io.cpp | 1103 TempRow *rows; member in struct:TempAliasTable
1137 TempRow rows[STACK_ROW_CAPACITY]; local
[all...] |
| /external/junit/src/org/junit/rules/ |
| ErrorCollector.java | 17 * first problem is found (for example, to collect _all_ the incorrect rows in a
|
| /external/libvpx/libvpx/test/ |
| vp9_subtract_test.cc | 20 typedef void (*subtract_fn_t)(int rows, int cols,
|
| /external/libvpx/libvpx/vp8/common/ |
| loopfilter.h | 24 /* fraction of total macroblock rows to be used in fast filter level picking */
|
| /external/libvpx/libvpx/vpx/ |
| vp8cx.h | 228 unsigned int rows; /**< Number of rows. */ member in struct:vpx_roi_map
248 unsigned int rows; /**< number of rows */ member in struct:vpx_active_map
|
| /external/libvterm/src/ |
| state.c | 61 state->rows = vt->rows;
106 else if(state->pos.row < state->rows-1)
554 for(pos.row = 0; pos.row < state->rows; pos.row++)
951 rect.start_row = state->pos.row + 1; rect.end_row = state->rows;
970 rect.start_row = 0; rect.end_row = state->rows;
1264 if(state->scrollregion_top == 0 && state->scrollregion_bottom == state->rows)
[all...] |
