HomeSort by relevance Sort by last modified time
    Searched full:rows (Results 851 - 875 of 3134) sorted by null

<<31323334353637383940>>

  /developers/samples/android/content/contacts/BasicContactables/Application/src/main/java/com/example/android/basiccontactables/
ContactablesLoaderCallbacks.java 66 // Sort results such that rows for the same contact stay together.
73 selection, // selection - Which rows to return (condition rows must match)
  /development/samples/ApiDemos/src/com/example/android/apis/view/
InternalSelectionView.java 31 * A view that has a known number of selectable rows, and maintains a notion of which
32 * row is selected. The rows take up the
34 * the rows.
  /development/samples/browseable/BasicContactables/src/com.example.android.basiccontactables/
ContactablesLoaderCallbacks.java 66 // Sort results such that rows for the same contact stay together.
73 selection, // selection - Which rows to return (condition rows must match)
  /external/ceres-solver/internal/ceres/
block_jacobi_preconditioner.cc 76 for (int r = 0; r < bs->rows.size(); ++r) {
77 const int row_block_size = bs->rows[r].block.size;
78 const vector<Cell>& cells = bs->rows[r].cells;
compressed_col_sparse_matrix_utils.cc 61 // block. Within each column, the inner loop iterates over the rows,
78 // For rows all but the first row in the last row block,
80 // be skipped like the rows in other row blocks too.
  /external/chromium_org/chrome/browser/extensions/api/braille_display_private/
brlapi_connection.cc 171 unsigned int columns, rows; local
173 handle_.get(), &columns, &rows) < 0) {
177 *size = columns * rows;
  /external/chromium_org/content/browser/resources/media/
stats_table.js 97 table.rows[0].cells[0].textContent = 'Statistics ' + report.id;
100 table.rows[1].innerHTML = '<td colspan=2></td>';
102 table.rows[1].cells[0], GetSsrcFromReport(report));
  /external/chromium_org/native_client_sdk/src/examples/tutorial/debugging/
index.html 76 <textarea id="log" rows="10" cols="60" readonly="readonly"></textarea>
79 <textarea id="json" rows="10" cols="60" readonly="readonly"></textarea>
85 <textarea id="trace" rows="10" cols="130" readonly="readonly"></textarea>
  /external/chromium_org/third_party/angle/extensions/
ANGLE_pack_reverse_row_order.txt 46 in which image rows are written into a pack destination. This
100 written. When PACK_REVERSE_ROW_ORDER_ANGLE is TRUE the order of the rows
112 When PACK_REVERSE_ROW_ORDER_ANGLE is TRUE the order of rows within
  /external/chromium_org/third_party/libvpx/source/libvpx/third_party/libyuv/source/
convert_argb.cc 72 // Coalesce rows.
134 // Coalesce rows.
214 // Coalesce rows.
271 // Coalesce rows.
321 // Coalesce rows.
442 // Coalesce rows.
492 // Coalesce rows.
542 // Coalesce rows.
592 // Coalesce rows.
642 // Coalesce rows
    [all...]
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/arm/neon/
vp9_idct4x4_add_neon.asm 28 ; similar. We first transform the rows. This is done by transposing
30 ; transposed rows) and then transpose the results (so that it goes back
73 ; do the transform on transposed rows
  /external/chromium_org/third_party/libyuv/source/
convert_argb.cc 72 // Coalesce rows.
134 // Coalesce rows.
214 // Coalesce rows.
271 // Coalesce rows.
321 // Coalesce rows.
442 // Coalesce rows.
492 // Coalesce rows.
542 // Coalesce rows.
592 // Coalesce rows.
642 // Coalesce rows
    [all...]
  /external/chromium_org/third_party/polymer/components-chromium/core-input/
core-input.html 98 <textarea id="input" value="{{inputValue}}" rows="{{rows}}" fit?="{{rows === &apos;fit&apos;}}" disabled?="{{disabled}}" placeholder="{{placeholder}}" autofocus?="{{autofocus}}" required?="{{required}}" readonly?="{{readonly}}" aria-label="{{label || placeholder}}" aria-invalid="{{invalid}}" on-change="{{inputChangeAction}}" on-focus="{{inputFocusAction}}" on-blur="{{inputBlurAction}}"></textarea>
  /external/chromium_org/third_party/skia/src/utils/
SkPatchGrid.h 90 SkPatchGrid(int rows = 0, int cols = 0, VertexType flags = kNone_VertexType,
114 * Resets the grid of patches to contain rows and cols of patches.
116 void reset(int rows, int cols, VertexType flags, SkXfermode* xMode);
  /external/chromium_org/third_party/sqlite/src/test/
progress.test 76 # This figures out how many opcodes it takes to copy 5 extra rows into t1.
88 # opcodes to copy 5 rows. That way, when we try to copy 6 rows, we know
recover.test 14 # through corrupt rows and pages.
36 # SQLite will fill the earlier rows with the default.
41 # recover sees NULL for those rows.
  /external/chromium_org/ui/app_list/cocoa/
apps_collection_view_drag_manager.mm 49 rows:(size_t)rows
54 rows_ = rows;
  /external/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h 56 res.nrow = mat.rows();;
127 res.nrow = mat.rows();
195 inline Index rows() const { return m_cholmodFactor->n; } function in class:Eigen::CholmodBase
228 eigen_assert(rows()==b.rows()
229 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
242 eigen_assert(rows()==b.rows()
243 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
298 eigen_assert(size==b.rows());
    [all...]
  /external/eigen/Eigen/src/Core/
DiagonalProduct.h 55 eigen_assert(diagonal.diagonal().size() == (ProductOrder == OnTheLeft ? matrix.rows() : matrix.cols()));
58 EIGEN_STRONG_INLINE Index rows() const { return m_matrix.rows(); } function in class:Eigen::DiagonalProduct
  /external/eigen/Eigen/src/Eigenvalues/
RealSchur.h 104 : m_matT(matrix.rows(),matrix.cols()),
105 m_matU(matrix.rows(),matrix.cols()),
106 m_workspaceVector(matrix.rows()),
107 m_hess(matrix.rows()),
248 eigen_assert(matrix.cols() == matrix.rows());
251 maxIters = m_maxIterationsPerRow * matrix.rows();
271 maxIters = m_maxIterationsPerRow * matrixH.rows();
276 // Rows 0,...,il-1 are decoupled from the rest because m_matT(il,il-1) is zero.
277 // Rows il,...,iu is the part we are working on (the active window).
278 // Rows iu+1,...,end are already brought in triangular form
    [all...]
  /external/eigen/Eigen/src/SparseCore/
SparseDiagonalProduct.h 90 eigen_assert(lhs.cols() == rhs.rows() && "invalid sparse matrix * diagonal matrix product");
93 EIGEN_STRONG_INLINE Index rows() const { return m_lhs.rows(); } function in class:Eigen::SparseDiagonalProduct
SparseProduct.h 124 EIGEN_STRONG_INLINE Index rows() const { return m_lhs.rows(); } function in class:Eigen::SparseSparseProduct
133 eigen_assert(m_lhs.cols() == m_rhs.rows());
  /external/libhevc/common/arm/
ihevc_weighted_pred_neon_intr.c 135 /* Used i4_tmp1_t & i4_tmp1_t to process 2 rows at a time. */
136 /* height has also been unrolled, hence 2 rows will processed at a time */
282 /* Used i4_tmp1_t & i4_tmp1_t to process 2 rows at a time. */
283 /* height has also been unrolled, hence 2 rows will processed at a time */
436 /* Used i4_tmp1_t & i4_tmp1_t to process 2 rows at a time. */
437 /* height has also been unrolled, hence 2 rows will processed at a time */
622 /* Used i4_tmp1_t & i4_tmp1_t to process 2 rows at a time. */
623 /* height has also been unrolled, hence 2 rows will processed at a time */
771 /* Used i4_tmp1_t & i4_tmp1_t to process 2 rows at a time. */
772 /* height has also been unrolled, hence 2 rows will processed at a time *
    [all...]
  /external/libhevc/common/
ihevc_itrans_recon_16x16.c 128 if((zero_rows & 0xFFF0) == 0xFFF0) /* First 4 rows of input are non-zero */
193 if((zero_rows_2nd_stage & 0xFFF0) == 0xFFF0) /* First 4 rows of output of 1st stage are non-zero */
239 else if((zero_rows_2nd_stage & 0xFF00) == 0xFF00) /* First 4 rows of output of 1st stage are non-zero */
291 else /* All rows of output of 1st stage are non-zero */
369 else if((zero_rows & 0xFF00) == 0xFF00) /* First 8 rows of input are non-zero */
440 if((zero_rows_2nd_stage & 0xFFF0) == 0xFFF0) /* First 4 rows of output of 1st stage are non-zero */
486 else if((zero_rows_2nd_stage & 0xFF00) == 0xFF00) /* First 4 rows of output of 1st stage are non-zero */
538 else /* All rows of output of 1st stage are non-zero */
616 else /* All rows of input are non-zero */
711 if((zero_rows_2nd_stage & 0xFFF0) == 0xFFF0) /* First 4 rows of output of 1st stage are non-zero *
    [all...]
  /external/libvpx/libvpx/vp9/common/arm/neon/
vp9_idct4x4_add_neon.asm 28 ; similar. We first transform the rows. This is done by transposing
30 ; transposed rows) and then transpose the results (so that it goes back
73 ; do the transform on transposed rows

Completed in 525 milliseconds

<<31323334353637383940>>