/external/chromium/chrome/browser/search_engines/ |
template_url_model_unittest.cc | 813 details.row = history::URLRow(GURL(data[i].url)); 835 details.row = history::URLRow(GURL(data[i].url)); 883 history::URLRow row; member in struct:QueryHistoryCallbackImpl [all...] |
/external/dropbear/ |
sshpty.c | 343 pty_change_window_size(int ptyfd, int row, int col, 348 w.ws_row = row;
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
Transform.h | 135 /** shortcut for m_matrix(row,col); 137 inline Scalar operator() (int row, int col) const { return m_matrix(row,col); } 138 /** shortcut for m_matrix(row,col); 140 inline Scalar& operator() (int row, int col) { return m_matrix(row,col); } 223 res.matrix().row(Dim) = t.matrix().row(Dim); 693 * last row is not guaranteed to be [0 ... 0 1] 694 * - Affine is the default, the last row is assumed to be [0 ... 0 1 [all...] |
/external/eigen/Eigen/src/Geometry/ |
Translation.h | 118 res.matrix().row(Dim).setZero(); 199 res.matrix().row(Dim).setZero();
|
/external/eigen/blas/ |
chbmv.f | 55 * column, with the leading diagonal of the matrix in row 57 * position 2 in row k, and so on. The top left k by k triangle 73 * column, with the leading diagonal of the matrix in row 1 of 75 * row 2, and so on. The bottom right k by k triangle of the
|
ctbmv.f | 73 * column, with the leading diagonal of the matrix in row 75 * position 2 in row k, and so on. The top left k by k triangle 91 * column, with the leading diagonal of the matrix in row 1 of 93 * row 2, and so on. The bottom right k by k triangle of the
|
dsbmv.f | 55 * column, with the leading diagonal of the matrix in row 57 * position 2 in row k, and so on. The top left k by k triangle 73 * column, with the leading diagonal of the matrix in row 1 of 75 * row 2, and so on. The bottom right k by k triangle of the
|
dtbmv.f | 73 * column, with the leading diagonal of the matrix in row 75 * position 2 in row k, and so on. The top left k by k triangle 91 * column, with the leading diagonal of the matrix in row 1 of 93 * row 2, and so on. The bottom right k by k triangle of the
|
ssbmv.f | 55 * column, with the leading diagonal of the matrix in row 57 * position 2 in row k, and so on. The top left k by k triangle 73 * column, with the leading diagonal of the matrix in row 1 of 75 * row 2, and so on. The bottom right k by k triangle of the
|
stbmv.f | 73 * column, with the leading diagonal of the matrix in row 75 * position 2 in row k, and so on. The top left k by k triangle 91 * column, with the leading diagonal of the matrix in row 1 of 93 * row 2, and so on. The bottom right k by k triangle of the
|
zhbmv.f | 55 * column, with the leading diagonal of the matrix in row 57 * position 2 in row k, and so on. The top left k by k triangle 73 * column, with the leading diagonal of the matrix in row 1 of 75 * row 2, and so on. The bottom right k by k triangle of the
|
ztbmv.f | 73 * column, with the leading diagonal of the matrix in row 75 * position 2 in row k, and so on. The top left k by k triangle 91 * column, with the leading diagonal of the matrix in row 1 of 93 * row 2, and so on. The bottom right k by k triangle of the
|
/external/eigen/test/eigen2/ |
product.h | 116 res.row(i) = m1.row(i) * m2.transpose();
|
/external/eigen/test/ |
geo_homogeneous.cpp | 45 hm0.row(Size-1).setRandom(); 90 pts2.row(Size).setRandom();
|
permutationmatrices.cpp | 93 lm.row(i).swap(lm.row(j));
|
/external/guava/guava/src/com/google/common/collect/ |
Tables.java | 53 * Returns an immutable cell with the specified row key, column key, and 58 * @param rowKey the row key to be associated with the returned cell 123 * Creates a transposed view of a given table that flips its row and column 156 return original.row(columnKey); 216 public Map<R, V> row(C rowKey) { method in class:Tables.TransposeTable 328 * the table iteration order. However, the table's {@code row()} method 337 * supported. Null row keys, columns keys, and values are not supported. 339 * <p>Lookups by row key are often faster than lookups by column key, because 341 * {@code column(columnKey).get(rowKey)} still runs quickly, since the row key 343 * an iteration across all row keys occurs 463 @Override public Map<C, V2> row(R rowKey) { method in class:Tables.TransformedTable [all...] |
/external/libvpx/libvpx/vp8/common/x86/ |
postproc_mmx.asm | 54 ; this copies the last row down into the border 8 rows 60 movq mm1, QWORD ptr[rdi] ; first row 71 ; this copies the first row up into the border 8 rows 73 movq mm1, QWORD ptr[rdi] ; first row
|
/external/libvpx/libvpx/vp8/encoder/ |
denoising.c | 223 mv_row = x->best_sse_mv.as_mv.row; 281 mv_row = x->best_sse_mv.as_mv.row;
|
/external/linux-tools-perf/util/ui/browsers/ |
top.c | 30 static void perf_top_browser__write(struct ui_browser *browser, void *entry, int row) 34 bool current_entry = ui_browser__is_current_entry(browser, row);
|
/external/openssh/ |
sshpty.c | 194 pty_change_window_size(int ptyfd, u_int row, u_int col, 200 w.ws_row = row;
|
/external/replicaisland/src/com/replica/replicaisland/ |
TiledVertexGrid.java | 210 final int row = tileY * indexesPerRow; local 211 tileMap.drawStrip(gl, true, row + startOffset, count);
|
/external/skia/legacy/include/utils/ |
SkMatrix44.h | 130 SkMScalar get(int row, int col) const; 131 void set(int row, int col, const SkMScalar& value);
|
/external/skia/legacy/src/images/ |
SkImageDecoder_libgif.cpp | 64 // through fStartYPtr until a valid row is found. This is so that images 286 uint8_t* row = scanline + iter.currY() * rowBytes; local 287 if (DGifGetLine(gif, row, innerWidth) == GIF_ERROR) {
|
bmpdecoderhelper.cpp | 272 int row = 0; local 274 for (int h = height_ - 1; h >= 0; h--, row++) {
|
/external/skia/src/images/ |
bmpdecoderhelper.cpp | 272 int row = 0; local 274 for (int h = height_ - 1; h >= 0; h--, row++) {
|