| /external/chromium_org/chrome/browser/history/android/ |
| urls_sql_handler_unittest.cc | 52 // Insert a row only has URL to verify the visit count and last visit time
55 HistoryAndBookmarkRow row; local
56 row.set_raw_url("http://google.com");
57 row.set_url(GURL("http://google.com"));
59 ASSERT_TRUE(urls_sql_handler_.Insert(&row));
61 ASSERT_TRUE(history_db_.GetURLRow(row.url_id(), &url_row));
62 EXPECT_EQ(row.url(), url_row.url());
66 // The new row's id was set in url_row correctly.
67 EXPECT_EQ(row.url_id(), url_row.id());
70 // Insert a row with last visit time to verify the visit count is set to 1 b
73 HistoryAndBookmarkRow row; local
91 HistoryAndBookmarkRow row; local
110 HistoryAndBookmarkRow row; local
131 HistoryAndBookmarkRow row; local
148 HistoryAndBookmarkRow row; local
167 HistoryAndBookmarkRow row; local
200 HistoryAndBookmarkRow row; local
239 HistoryAndBookmarkRow row; local
269 HistoryAndBookmarkRow row; local
294 HistoryAndBookmarkRow row; local
322 HistoryAndBookmarkRow row; local
[all...] |
| visit_sql_handler_unittest.cc | 55 HistoryAndBookmarkRow row; local
56 row.set_raw_url("http://google.com");
57 row.set_url(GURL("http://google.com"));
59 ASSERT_TRUE(urls_sql_handler_.Insert(&row));
60 ASSERT_TRUE(visit_sql_handler_.Insert(&row));
63 ASSERT_TRUE(history_db_.GetURLRow(row.url_id(), &url_row));
67 ASSERT_TRUE(history_db_.GetVisitsForURL(row.url_id(), &visits));
73 HistoryAndBookmarkRow row; local
74 row.set_raw_url("http://google.com");
75 row.set_url(GURL("http://google.com"))
92 HistoryAndBookmarkRow row; local
112 HistoryAndBookmarkRow row; local
132 HistoryAndBookmarkRow row; local
157 HistoryAndBookmarkRow row; local
190 HistoryAndBookmarkRow row; local
223 HistoryAndBookmarkRow row; local
255 HistoryAndBookmarkRow row; local
282 HistoryAndBookmarkRow row; local
[all...] |
| urls_sql_handler.cc | 30 bool UrlsSQLHandler::Insert(HistoryAndBookmarkRow* row) {
31 URLRow url_row(row->url());
33 URLID id = history_db_->GetRowForURL(row->url(), &url_row);
36 return false; // We already has this row.
39 if (row->is_value_set_explicitly(HistoryAndBookmarkRow::TITLE))
40 url_row.set_title(row->title());
42 if (row->is_value_set_explicitly(HistoryAndBookmarkRow::LAST_VISIT_TIME))
43 url_row.set_last_visit(row->last_visit_time());
45 if (row->is_value_set_explicitly(HistoryAndBookmarkRow::VISIT_COUNT))
46 url_row.set_visit_count(row->visit_count())
[all...] |
| android_urls_sql_handler.cc | 28 bool AndroidURLsSQLHandler::Update(const HistoryAndBookmarkRow& row,
30 DCHECK(row.is_value_set_explicitly(HistoryAndBookmarkRow::URL_ID));
31 DCHECK(row.is_value_set_explicitly(HistoryAndBookmarkRow::RAW_URL));
39 return history_db_->UpdateAndroidURLRow(android_url_row.id, row.raw_url(),
40 row.url_id());
43 bool AndroidURLsSQLHandler::Insert(HistoryAndBookmarkRow* row) {
44 AndroidURLID new_id = history_db_->AddAndroidURLRow(row->raw_url(),
45 row->url_id());
46 row->set_id(new_id);
|
| bookmark_model_sql_handler_unittest.cc | 80 HistoryAndBookmarkRow row; local
81 row.set_raw_url("http://bookmark.com");
82 row.set_url(GURL("http://bookmark.com"));
83 row.set_title(UTF8ToUTF16("Bookmark Title"));
84 row.set_is_bookmark(true);
87 ASSERT_TRUE(handler.Insert(&row));
90 bookmark_model_->GetNodesByURL(row.url(), &nodes);
92 EXPECT_EQ(row.title(), nodes[0]->GetTitle());
99 HistoryAndBookmarkRow row; local
100 row.set_raw_url("http://bookmark.com")
127 HistoryAndBookmarkRow row; local
211 HistoryAndBookmarkRow row; local
[all...] |
| /external/eigen/doc/snippets/ |
| MatrixBase_setOnes.cpp | 2 m.row(1).setOnes();
|
| MatrixBase_setZero.cpp | 2 m.row(1).setZero();
|
| MatrixBase_row.cpp | 2 m.row(1) = Vector3d(4,5,6);
|
| MatrixBase_eval.cpp | 5 cout << "Now we want to copy a column into a row." << endl;
6 cout << "If we do m.col(1) = m.row(0), then m becomes:" << endl;
7 m.col(1) = m.row(0);
9 cout << "Now let us instead do m.col(1) = m.row(0).eval(). Then m becomes" << endl;
11 m.col(1) = m.row(0).eval();
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrRectanizer.cpp | 44 struct Row {
53 Row fRows[16];
67 void initRow(Row* row, int rowHeight) {
68 row->fLoc.set(0, fNextStripY);
69 row->fRowHeight = rowHeight;
83 We use bsearch, but there may be more than one row with the same height,
92 Row* row = &fRows[HeightToRowIndex(height)]; local
93 SkASSERT(row->fRowHeight == 0 || row->fRowHeight == height)
[all...] |
| GrRectanizer_fifo.cpp | 38 struct Row {
47 Row fRows[16];
61 void initRow(Row* row, int rowHeight) {
62 row->fLoc.set(0, fNextStripY);
63 row->fRowHeight = rowHeight;
77 We use bsearch, but there may be more than one row with the same height,
86 Row* row = &fRows[HeightToRowIndex(height)]; local
87 SkASSERT(row->fRowHeight == 0 || row->fRowHeight == height)
[all...] |
| /external/skia/src/gpu/ |
| GrRectanizer.cpp | 44 struct Row {
53 Row fRows[16];
67 void initRow(Row* row, int rowHeight) {
68 row->fLoc.set(0, fNextStripY);
69 row->fRowHeight = rowHeight;
83 We use bsearch, but there may be more than one row with the same height,
92 Row* row = &fRows[HeightToRowIndex(height)]; local
93 SkASSERT(row->fRowHeight == 0 || row->fRowHeight == height)
[all...] |
| GrRectanizer_fifo.cpp | 38 struct Row {
47 Row fRows[16];
61 void initRow(Row* row, int rowHeight) {
62 row->fLoc.set(0, fNextStripY);
63 row->fRowHeight = rowHeight;
77 We use bsearch, but there may be more than one row with the same height,
86 Row* row = &fRows[HeightToRowIndex(height)]; local
87 SkASSERT(row->fRowHeight == 0 || row->fRowHeight == height)
[all...] |
| /external/chromium_org/content/browser/resources/accessibility/ |
| accessibility.js | 28 var row = element.parentElement;
30 while (row.lastChild != element)
31 row.removeChild(row.lastChild);
33 row.appendChild(document.createTextNode(' | '));
34 row.appendChild(createShowAccessibilityTreeElement(data, row, false));
71 var row = document.createElement('div');
72 row.className = 'row';
[all...] |
| /external/clang/test/SemaCXX/ |
| constexpr-nqueens.cpp | 13 constexpr Board addQueen(int Row, int Col) {
14 return Board(State | ((uint64_t)Row << (Col * 4)));
19 constexpr bool ok(int Row, int Col) {
20 return okRecurse(Row, Col, 0);
22 constexpr bool okRecurse(int Row, int Col, int CheckCol) {
24 getQueenRow(CheckCol) == Row ? false :
25 getQueenRow(CheckCol) == Row + (Col - CheckCol) ? false :
26 getQueenRow(CheckCol) == Row + (CheckCol - Col) ? false :
27 okRecurse(Row, Col, CheckCol + 1);
29 constexpr bool at(int Row, int Col)
[all...] |
| /frameworks/base/core/tests/coretests/src/android/widget/focus/ |
| FocusChangeWithInterestingRectHintTest.java | 37 * when taking focus to best select the internal row to show as selected.
73 for (int row = 0; row < numRows; row++) {
75 if ((row % 2) == 0) {
76 assertEquals("row " + row + ": should be at left column",
77 row, mLeftColumn.getSelectedRow());
80 assertTrue("row " + row + ": should be at middle column"
[all...] |
| /frameworks/base/core/java/android/text/ |
| PackedIntVector.java | 55 * Returns the value at the specified row and column.
57 * @param row the index of the row to return.
62 * @throws IndexOutOfBoundsException if the row is out of range
63 * (row < 0 || row >= size()) or the column is out of range
66 public int getValue(int row, int column) {
69 if (((row | column) < 0) || (row >= size()) || (column >= columns)) {
70 throw new IndexOutOfBoundsException(row + ", " + column)
[all...] |
| /external/eigen/test/ |
| schur_real.cpp | 22 for(int row = 2; row < size; ++row) {
23 for(int col = 0; col < row - 1; ++col) {
24 VERIFY(T(row,col) == Scalar(0));
30 for(int row = 1; row < size; ++row) {
31 if (T(row,row-1) != Scalar(0))
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/sqlite3/test/ |
| factory.py | 31 def dict_factory(cursor, row):
34 d[col[0]] = row[idx]
74 row = cur.fetchone()
75 self.assertTrue(isinstance(row,
77 "row is not instance of dict")
88 self.con.row_factory = lambda cur, row: list(row)
89 row = self.con.execute("select 1, 2").fetchone()
90 self.assertTrue(isinstance(row,
92 "row is not instance of list"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/sqlite3/test/ |
| factory.py | 31 def dict_factory(cursor, row):
34 d[col[0]] = row[idx]
74 row = cur.fetchone()
75 self.assertTrue(isinstance(row,
77 "row is not instance of dict")
88 self.con.row_factory = lambda cur, row: list(row)
89 row = self.con.execute("select 1, 2").fetchone()
90 self.assertTrue(isinstance(row,
92 "row is not instance of list"
[all...] |
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_table.cc | 24 const predictors::AutocompleteActionPredictorTable::Row& row,
26 DCHECK(base::IsValidGUID(row.id));
27 statement->BindString(0, row.id);
28 statement->BindString16(1, row.user_text.substr(0, kMaxDataLength));
29 statement->BindString(2, row.url.spec().substr(0, kMaxDataLength));
30 statement->BindInt(3, row.number_of_hits);
31 statement->BindInt(4, row.number_of_misses);
36 predictors::AutocompleteActionPredictorTable::Row* row) {
[all...] |
| autocomplete_action_predictor_table.h | 37 struct Row {
44 Row();
47 Row(const Id& id,
53 Row(const Row& row);
62 typedef std::vector<Row> Rows;
65 void GetRow(const Row::Id& id, Row* row);
[all...] |
| /external/chromium-trace/trace-viewer/src/tracing/analysis/ |
| analysis_results.js | 53 appendTableCell_: function(table, row, cellnum, text) {
54 var td = this.appendElement_(row, 'td', text);
59 appendTableCell: function(table, row, text) {
60 return this.appendTableCell_(table, row, row.children.length, text);
63 appendTableCellWithTooltip_: function(table, row, cellnum, text, tooltip) {
65 var td = this.appendElement_(row, 'td');
72 this.appendTableCell_(table, row, cellnum, text);
89 * Creates and appends a row to |table| with a left-aligned |label]
102 * Creates and appends a row to |table| with a left-aligned |label
[all...] |
| /external/eigen/bench/btl/generic_bench/init/ |
| init_matrix.hh | 28 BTL_DONT_INLINE void init_row(Vector & X, int size, int row){
33 X[j]=typename Vector::value_type(init_function(row,j));
45 for (int row=0; row<A.size() ; row++){
46 init_row<init_function>(A[row],size,row);
53 for (int row=0; row<A.size() ; row++
[all...] |
| /external/ceres-solver/internal/ceres/ |
| visibility_test.cc | 60 // Row 1
63 CompressedRow& row = bs.rows.back(); local
64 row.block.size = 2;
65 row.block.position = 0;
66 row.cells.push_back(Cell(0, 0));
67 row.cells.push_back(Cell(5, 0));
70 // Row 2
73 CompressedRow& row = bs.rows.back(); local
74 row.block.size = 2;
75 row.block.position = 2
83 CompressedRow& row = bs.rows.back(); local
93 CompressedRow& row = bs.rows.back(); local
143 CompressedRow& row = bs.rows.back(); local
152 CompressedRow& row = bs.rows.back(); local
161 CompressedRow& row = bs.rows.back(); local
170 CompressedRow& row = bs.rows.back(); local
[all...] |
