HomeSort by relevance Sort by last modified time
    Searched refs:row (Results 876 - 900 of 1524) sorted by null

<<31323334353637383940>>

  /external/chromium_org/chrome/browser/history/
expire_history_backend_unittest.cc 81 void EnsureURLInfoGone(const URLRow& row);
317 void ExpireHistoryTest::EnsureURLInfoGone(const URLRow& row) {
320 EXPECT_FALSE(main_db_->GetURLRow(row.id(), &temp_row));
324 main_db_->GetVisitsForURL(row.id(), &visits);
329 // EXPECT_FALSE(HasThumbnail(row.id()));
339 history::URLRow::URLRowHasURL(row.url())) != rows.end()) {
376 URLRow row(GURL("http://www.google.com/2"));
377 row.set_visit_count(1);
378 EXPECT_TRUE(main_db_->AddURL(row));
379 thumb_db_->AddIconMapping(row.url(), icon_id)
    [all...]
history_types.cc 375 bool RowQualifiesAsSignificant(const URLRow& row,
379 return (row.typed_count() >= kLowQualityMatchTypedLimit) ||
380 (row.visit_count() >= kLowQualityMatchVisitLimit) ||
381 (row.last_visit() >= real_threshold);
history_backend.cc 267 VisitRow row; local
268 if (!db_->GetRowForVisit(visit_id, &row))
270 if (row.segment_id)
271 return row.segment_id; // Found a visit in this change with a segment.
274 visit_id = row.referring_visit;
777 // Update of an existing row.
792 // Addition of a new row.
821 details->row = url_info;
863 NOTREACHED() << "Could not add row to DB";
944 URLRow row; local
1080 URLRow* row = &request->value.a; local
2844 URLRow row; local
    [all...]
  /external/chromium_org/chrome/browser/predictors/
resource_prefetch_predictor_unittest.cc 37 void PrintTo(const ResourceRow& row, ::std::ostream* os) {
38 *os << "[" << row.primary_key << "," << row.resource_url
39 << "," << row.resource_type << "," << row.number_of_hits
40 << "," << row.number_of_misses << "," << row.consecutive_misses
41 << "," << row.average_position << "," << row.score << "]";
    [all...]
  /external/chromium_org/chrome/browser/safe_browsing/
browser_feature_extractor.h 119 const history::URLRow* row,
  /external/chromium_org/media/base/
video_frame.cc 259 // Round up to align at least at a 16-byte boundary for each row.
277 // YV12 and YV16 is 1/2 of the stride of Y. For YV12, every row of bytes for
283 // the Y values of the final row, but assumes that the last row of U & V
440 for (int row = 0; row < rows(plane); ++row) {
442 reinterpret_cast<char*>(data(plane) + stride(plane) * row),
  /external/chromium_org/third_party/sqlite/src/contrib/
sqlitecon.tcl 139 scan [$w index insert] %d.%d row col
149 scan [$w index insert] %d.%d row col
159 scan [$w index insert] %d.%d row col
181 scan [$w index insert] %d.%d row col
182 $w mark set insert $row.$v(plength)
213 scan [$w index insert] %d.%d row col
214 set start $row.$v(plength)
423 scan [$w index insert] %d.%d row col
424 set start $row.$v(plength)
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 436 m_colSqNorms.tail(cols-k-1) -= m_qr.row(k).tail(cols-k-1).cwiseAbs2();
491 for(Index i = 0; i < nonzero_pivots; ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
492 for(Index i = nonzero_pivots; i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
  /external/eigen/test/
sparse_product.cpp 27 VERIFY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).transpose()*refMat2.col(c1).transpose());
28 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.row(r), refMat4=refMat2.col(c1)*refMat2.row(r));
  /external/eigen/unsupported/Eigen/src/SparseExtra/
BlockOfDynamicSparseMatrix.h 35 inline Index row() const { return IsRowMajor ? m_outer : this->index(); } function in class:Eigen::SparseInnerVectorSet::InnerIterator
  /external/libvpx/libvpx/vp8/encoder/
temporal_filter.c 168 best_ref_mv1_full.as_mv.row = best_ref_mv1.as_mv.row >>3;
289 mbd->block[0].bmi.mv.as_mv.row = 0;
327 mbd->block[0].bmi.mv.as_mv.row,
  /external/libvpx/libvpx/vp9/encoder/
vp9_temporal_filter.c 138 best_ref_mv1_full.as_mv.row = best_ref_mv1.as_mv.row >> 3;
248 mbd->mi_8x8[0]->bmi[0].as_mv[0].as_mv.row = 0;
282 mbd->mi_8x8[0]->bmi[0].as_mv[0].as_mv.row,
  /external/replicaisland/src/com/replica/replicaisland/
MainMenuActivity.java 140 final int row = prefs.getInt(PreferenceConstants.PREFERENCE_LEVEL_ROW, 0); local
143 if (row != 0 || index != 0) {
191 final int row = prefs.getInt(PreferenceConstants.PREFERENCE_LEVEL_ROW, 0); local
193 if (row != 0 || index != 0) {
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/
armVCM4P2_SetPredDir_s.s 27 ; * [in] pCoefBufRow pointer to the coefficient row buffer
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/
armVCM4P2_SetPredDir_s.s 27 ; * [in] pCoefBufRow pointer to the coefficient row buffer
  /packages/inputmethods/PinyinIME/src/com/android/inputmethod/pinyin/
SoftKeyboardView.java 412 for (int row = 0; row < rowNum; row++) {
413 KeyRow keyRow = mSoftKeyboard.getKeyRowForDisplay(row);
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/
cursesp.h 217 virtual void centertext(int row,const char* label);
218 // Put the label text centered in the specified row.
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/
cursesp.h 217 virtual void centertext(int row,const char* label);
218 // Put the label text centered in the specified row.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/
cursesp.h 217 virtual void centertext(int row,const char* label);
218 // Put the label text centered in the specified row.
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
cmd.py 368 # Try every row count from 1 upwards
375 for row in range(nrows):
376 i = row + nrows*col
391 for row in range(nrows):
394 i = row + nrows*col
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
cmd.py 368 # Try every row count from 1 upwards
375 for row in range(nrows):
376 i = row + nrows*col
391 for row in range(nrows):
394 i = row + nrows*col
  /external/opencv/ml/src/
mlsvm.cpp 457 // the size of Q matrix row headers
477 CvSVMKernelRow* row = rows + i1;
478 bool existed = row->data != 0;
483 CvSVMKernelRow* del_row = existed ? row : lru_list.prev;
487 // delete row from the LRU list
498 // insert row into the LRU list
499 row->data = data;
500 row->prev = &lru_list;
501 row->next = lru_list.next;
502 row->prev->next = row->next->prev = row
570 float* row = get_row_base( i, &existed ); local
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/
pprof     [all...]
  /external/chromium_org/chrome/browser/resources/task_manager/
main.js 191 var row = dm.item(i)[columnId];
192 if (!row)
195 for (var k = 0; k < row.length; k++) {
314 // Expands height of row when a process has some tasks.
321 // Sets custom row render function.
333 // Trys to reuse the cached row;
347 // Create new row.
431 listItem.className = 'table-row';
436 cell.className = 'table-row-cell';
447 // Specifies the height of the row. The height of each row i
    [all...]
  /external/eigen/Eigen/src/Geometry/
Transform.h 77 * where the last row is assumed to be [0 ... 0 1].
98 * Note that for a projective transformation the last row can be anything,
155 * that case the last matrix row can be ignored, and the product returns non
229 * If Mode==Affine, then the last row is set to [0 ... 0 1] */
359 /** shortcut for m_matrix(row,col);
361 inline Scalar operator() (Index row, Index col) const { return m_matrix(row,col); }
362 /** shortcut for m_matrix(row,col);
364 inline Scalar& operator() (Index row, Index col) { return m_matrix(row,col);
    [all...]

Completed in 1887 milliseconds

<<31323334353637383940>>