HomeSort by relevance Sort by last modified time
    Searched refs:row (Results 751 - 775 of 1110) sorted by null

<<31323334353637383940>>

  /external/icu4c/common/
rbbitblb.cpp 808 for (n=0; n<fDStates->size(); n++) { // For each state s (row in the state table)
1121 RBBIStateTableRow *row = (RBBIStateTableRow *)(table->fTableData + state*table->fRowLen); local
    [all...]
  /external/icu4c/i18n/
translit.cpp 1505 int32_t row, maxRows; local
    [all...]
  /external/quake/quake/src/QW/client/
gl_vidnt.c 1869 int lnummodes, i, j, k, column, row, dup, dupmode; local
    [all...]
screen.c 737 int row, col; local
742 row = num>>4;
744 source = draw_chars + (row<<10) + (col<<3);
gl_draw.c 284 int row, col; local
289 row = num>>4;
291 source = draw_chars + (row<<10) + (col<<3);
499 int row, col; local
510 row = num>>4;
513 frow = row*0.0625;
    [all...]
  /external/quake/quake/src/WinQuake/
gl_vidnt.cpp 1869 int lnummodes, i, j, k, column, row, dup, dupmode; local
    [all...]
  /external/tinyxml/
tinyxml.h 104 void Clear() { row = col = -1; }
106 int row; // 0 based. member in struct:TiXmlCursor
181 The row and column are 1-based. (That is the first row and first column is
183 a row and column value.
185 Generally, the row and column value will be set when the TiXmlDocument::Load(),
193 There is a minor performance cost to computing the row and column. Computation
198 int Row() const { return location.row + 1; }
199 int Column() const { return location.col + 1; } ///< See Row()
    [all...]
  /external/webkit/Tools/Scripts/webkitpy/layout_tests/
rebaseline_chromium_webkit_tests.py 739 row = self.HTML_TD_NOLINK % self._get_baseline_result_type(suffix)
740 row += self.HTML_TD_NOLINK % platform
741 row += links
742 _log.debug(' html row: %s', row)
744 rows.append(self.HTML_TR % row)
    [all...]
  /external/eigen/Eigen/src/Core/products/
GeneralMatrixMatrix.h 19 /* Specialization for a row-major destination matrix => simple transposition of the product */
217 void operator() (Index row, Index rows, Index col=0, Index cols=-1, GemmParallelInfo<Index>* info=0) const
223 /*(const Scalar*)*/&m_lhs.coeffRef(row,0), m_lhs.outerStride(),
225 (Scalar*)&(m_dest.coeffRef(row,col)), m_dest.outerStride(),
  /external/eigen/bench/
sparse_setter.cpp 309 //compute number of non-zero entries per row of A coo_tocsr
316 //cumsum the nnz per row to get Bp[]
326 int row = Aij[n].x(); local
327 int dest = Bp[row];
332 Bp[row]++;
  /external/libvpx/libvpx/third_party/libyuv/source/
scale.c 17 #include "third_party/libyuv/source/row.h"
82 "add %1, %0 \n" // change the stride to row 2 pointer
84 "vld1.u8 {q0,q1}, [%0]! \n" // load row 1 and post increment
85 "vld1.u8 {q2,q3}, [%1]! \n" // load row 2 and post increment
86 "vpaddl.u8 q0, q0 \n" // row 1 add adjacent
88 "vpadal.u8 q0, q2 \n" // row 2 add adjacent, add row 1 to row 2
    [all...]
  /external/libyuv/files/source/
scale.cc 19 #include "libyuv/row.h"
889 // first row
904 lea eax, [eax + edx] // advance to next row
929 // Bilinear row filtering combines 16x2 -> 16x1. SSE2 version.
1024 // Bilinear row filtering combines 16x2 -> 16x1. SSSE3 version.
    [all...]
  /external/opencv/cvaux/src/
cv3dtracker.cpp 198 // reverse points in each row
201 CvPoint2D32f *row = &points[j*etalon_size.width]; local
203 std::swap(row[i], row[etalon_size.width-i-1]);
495 // Compute the determinant of the 3x3 matrix represented by 3 row vectors.
cvhmm.cpp 317 int row = 0;
332 //assign states to first row of superstate
338 obs_info->state[row * obs_info->obs_x + 2 * k] = i;
339 obs_info->state[row * obs_info->obs_x + 2 * k + 1] = j + index;
345 for( m = row; m < ss_bound[i]; m++ )
348 &(obs_info->state[row * obs_info->obs_x * 2]), obs_info->obs_x * 2 * sizeof(int) );
351 row = ss_bound[i];
    [all...]
  /hardware/broadcom/wlan/bcmdhd/dhdutil/
dhdu.c 431 int letter, col, row, pad; local
452 row = col = 0;
456 strcat(buf+row*80, cmd->name);
457 pad = 18 * (col + 1) - strlen(buf+row*80);
461 strcat(buf+row*80, " ");
462 row++;
463 if (row == nrows) {
464 col++; row = 0;
469 for (row = 0; row < nrows; row++
    [all...]
  /packages/apps/Email/src/com/android/email/provider/
ContentCache.java 43 * Usage examples; id is a String representation of a row id (_id), as it might be retrieved from
59 * 1. Lock the row in the cache: cache.lock(id);
60 * 2. Delete/update the row(s): db.delete(...);
63 * A specific row in a cache: affectedCache.invalidate(rowId)
64 * 4. Unlock the row in the cache: cache.unlock(id);
66 * To update a single row from a table that uses cached data:
67 * 1. Lock the row in the cache: cache.lock(id);
68 * 2. Update the row: db.update(...);
69 * 3. Unlock the row in the cache, passing in the new values: cache.unlock(id, values);
440 * Get a CacheToken for a row as specified by its id (_id column
550 Object[] row = new Object[projection.length]; local
    [all...]
  /external/doclava/res/assets/templates/assets/
doclava-developer-core.css 533 .show-row {
534 display: table-row;
536 .hide-row {
  /external/skia/legacy/src/images/
SkImageDecoder_libpng.cpp 383 uint8_t* row = base; local
385 uint8_t* bmRow = row;
387 row += rb;
762 uint8_t* row = base; local
764 uint8_t* bmRow = row;
766 row += rb;
    [all...]
  /cts/tests/tests/database/src/android/database/cts/
CursorWindowTest.java 40 for (ArrayList<Integer> row : list) {
41 cursor.addRow(row);
139 // Though allocate a row, but the column number is still 0, so can't putString.
340 fail("Row number is smaller than startPosition, will cause a IllegalStateException.");
  /cts/tests/tests/provider/src/android/provider/cts/
MediaStore_Images_ThumbnailsTest.java 49 for (Uri row : mRowsAdded) {
51 mContentResolver.delete(row, null, null);
  /development/samples/TicTacToeLib/src/com/example/android/tictactoe/library/
GameView.java 193 /** Sets winning mark on specified column or row (0..2) or diagonal (0..1). */
194 public void setFinished(int col, int row, int diagonal) {
196 mWinRow = row;
  /external/ceres-solver/internal/ceres/
dogleg_strategy.cc 681 jacobian->RightMultiply(tmp.data(), Jb.row(0).data());
683 jacobian->RightMultiply(tmp.data(), Jb.row(1).data());
  /external/chromium/chrome/browser/resources/net_internals/
proxyview.js 65 // Add a table row for each bad proxy entry.
  /external/chromium/net/spdy/
spdy_framer_test.cc 24 for (const unsigned char* row = data; length > 0;
25 row += kColumns, length -= kColumns) {
26 for (const unsigned char *p = row; p < row + 4; ++p) {
27 if (p < row + length) {
40 for (const unsigned char *p = row; p < row + 4 && p < row + length; ++p)
    [all...]
  /external/eigen/Eigen/src/LU/
Inverse.h 134 result.row(0) = cofactors_col0 * invdet;
232 result /= (matrix.col(0).cwiseProduct(result.row(0).transpose())).sum();

Completed in 596 milliseconds

<<31323334353637383940>>