| /external/eigen/test/ |
| nomalloc.cpp | 59 m2.col(0).noalias() -= m1 * m1.row(0).adjoint();
60 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint();
62 m2.row(0).noalias() = m1.row(0) * m1;
63 m2.row(0).noalias() -= m1.row(0) * m1.adjoint();
64 m2.row(0).noalias() -= m1.col(0).adjoint() * m1;
65 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint();
70 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint();
71 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint()
[all...] |
| /external/chromium_org/ui/webui/resources/css/ |
| tree.css | 11 .tree-item > .tree-row {
44 .tree-item[expanded] > .tree-row > .expand-icon {
50 .tree-row .expand-icon {
54 .tree-row[may-have-children] .expand-icon {
58 .tree-row[has-children=false] .expand-icon {
62 .tree-row:hover {
69 WebKit has a bug with attribute selectors so we apply selected to the tree row
75 .tree-row[selected] {
80 .tree-row[selected] {
86 .tree-row[selected]:hover
[all...] |
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/keyboard/layout/expected/ |
| ExpectedKeyboardBuilder.java | 26 * An expected keyboard is an array of rows, and a row consists of an array of {@link ExpectedKey}s.
27 * Each row may have different number of {@link ExpectedKey}s. While building an expected keyboard,
28 * an {@link ExpectedKey} can be specified by a row number and a column number, both numbers starts
90 for (int row = 1; row <= rowCount; row++) {
91 ExpectedKey[] keys = getRowAt(row);
101 setRowAt(row, keys);
133 * Set the row with specified keys.
134 * @param row the row number to set keys
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrRectanizer_pow2.h | 15 // of two can have, at most, one active row/shelf. Once a row/shelf for
17 // to a new row.
43 struct Row {
46 // but it is used to signal if there exists an open row of this height
54 Row fRows[kMaxExponent]; // 0-th entry will be unused
70 void initRow(Row* row, int rowHeight) {
71 row->fLoc.set(0, fNextStripY);
72 row->fRowHeight = rowHeight
[all...] |
| /external/chromium_org/tools/perf/utils/results_viewer/src/ |
| results_viewer.js | 38 rows.forEach(function (row, index, array) {
39 if (row.trim().length == 0) {
44 var columns = row.split(',');
|
| /external/skia/src/gpu/ |
| GrRectanizer_pow2.h | 15 // of two can have, at most, one active row/shelf. Once a row/shelf for
17 // to a new row.
43 struct Row {
46 // but it is used to signal if there exists an open row of this height
54 Row fRows[kMaxExponent]; // 0-th entry will be unused
70 void initRow(Row* row, int rowHeight) {
71 row->fLoc.set(0, fNextStripY);
72 row->fRowHeight = rowHeight
[all...] |
| /frameworks/base/packages/Keyguard/src/com/android/keyguard/ |
| DisappearAnimationUtils.java | 42 protected long calculateDelay(int row, int col) {
43 return (long) ((row * 60 + col * (Math.pow(row, 0.4) + 0.4) * 10) * mDelayScale);
|
| /frameworks/opt/colorpicker/src/com/android/colorpicker/ |
| ColorPickerPalette.java | 32 * row (and the padding between the squares) is determined by the user.
74 TableRow row = new TableRow(getContext()); local
77 row.setLayoutParams(params);
78 return row;
95 TableRow row = createTableRow(); local
102 addSwatchToRow(row, colorSwatch, rowNumber);
106 addView(row);
107 row = createTableRow();
113 // Create blank views to fill the row if the last row has not been filled
[all...] |
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| StaggeredGrid.java | 24 * for each individual child. The algorithm ensures that each row will be kept
39 * <li>Only one row (e.g., a single row listview)</li>
58 * Create the object at a given row.
60 public abstract void createItem(int index, int row, boolean append);
64 * Location of an item in the grid. For now it only saves row index but
69 * The index of the row for this Location.
71 public final int row; field in class:StaggeredGrid.Location
74 * Create a Location with the given row index.
76 public Location(int row) {
[all...] |
| /libcore/xml/src/main/java/org/xmlpull/v1/ |
| XmlPullParserException.java | 13 protected int row = -1; field in class:XmlPullParserException
29 public XmlPullParserException(String s, int row, int column) {
31 this.row = row;
42 this.row = parser.getLineNumber();
50 public int getLineNumber() { return row; }
|
| /packages/apps/Calendar/src/com/android/calendar/agenda/ |
| AgendaByDayAdapter.java | 105 RowInfo row = mRowInfo.get(i); local
106 if (row != null && row.mType == TYPE_DAY)
138 RowInfo row = mRowInfo.get(position); local
139 if (row.mType == TYPE_DAY) {
140 return row;
142 return mAgendaAdapter.getItem(row.mPosition);
151 RowInfo row = mRowInfo.get(position); local
152 if (row.mType == TYPE_DAY) {
155 return mAgendaAdapter.getItemId(row.mPosition)
183 RowInfo row = mRowInfo.get(position); local
533 RowInfo row = mRowInfo.get(index); local
600 RowInfo row = mRowInfo.get(headerPos); local
622 RowInfo row = mRowInfo.get(index); local
640 RowInfo row = mRowInfo.get(position); local
655 RowInfo row = mRowInfo.get(listPos); local
679 RowInfo row = mRowInfo.get(position); local
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/model/ |
| ProfilesTableModel.java | 39 public Object getValueAt(int row, int column) {
43 return NAMES[row];
47 return formatter.format(profiles[row]) + "";
|
| /external/ceres-solver/internal/ceres/ |
| small_blas.h | 164 for (int row = 0; row < NUM_ROW_C; ++row) {
168 tmp += A[row * NUM_COL_A + k] * B[k * NUM_COL_B + col];
171 const int index = (row + start_row_c) * col_stride_c + start_col_c + col;
224 for (int row = 0; row < NUM_ROW_C; ++row) {
228 tmp += A[k * NUM_COL_A + row] * B[k * NUM_COL_B + col];
231 const int index = (row + start_row_c) * col_stride_c + start_col_c + col
[all...] |
| schur_eliminator_impl.h | 97 // and build the row/column block structure of the reduced linear
106 // Iterate over the row blocks of A, and detect the chunks. The
124 // Add to the chunk until the first block in the row is
125 // different than the one in the first row for the chunk.
127 const CompressedRow& row = bs->rows[r + chunk.size]; local
128 if (row.cells.front().block_id != chunk_block_id) {
132 // Iterate over the blocks in the row, ignoring the first
134 for (int c = 1; c < row.cells.size(); ++c) {
135 const Cell& cell = row.cells[c];
213 // buffer_ contains the non-zero blocks in the row correspondin
331 const CompressedRow& row = bs->rows[chunk.start + j]; local
387 const CompressedRow& row = bs->rows[row_block_counter + j]; local
454 const CompressedRow& row = bs->rows[row_block_counter + j]; local
564 const CompressedRow& row = bs->rows[row_block_counter]; local
600 const CompressedRow& row = bs->rows[row_block_index]; local
653 const CompressedRow& row = bs->rows[row_block_index]; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| webSocketFrameView.css | 31 .websocket-frame-view-row-outcoming {
35 .websocket-frame-view-row-opcode {
40 .websocket-frame-view-row-error {
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkFilterProc.h | 51 inline SkFilterProc SkGetBilinearFilterProc22RowProc(const SkFilterProc* row,
54 SkASSERT(row);
56 return row[x << 30 >> 30];
85 inline SkFilter32Proc SkGetFilter32Proc22RowProc(const SkFilter32Proc* row,
88 SkASSERT(row);
90 return row[x << 30 >> 30];
|
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| HTMLTable.java | 56 final Row row = new Row (true); local
57 add (row);
59 return row;
64 final Row row = new Row (false); local
65 add (row);
67 return row;
[all...] |
| /external/skia/src/core/ |
| SkFilterProc.h | 51 inline SkFilterProc SkGetBilinearFilterProc22RowProc(const SkFilterProc* row,
54 SkASSERT(row);
56 return row[x << 30 >> 30];
85 inline SkFilter32Proc SkGetFilter32Proc22RowProc(const SkFilter32Proc* row,
88 SkASSERT(row);
90 return row[x << 30 >> 30];
|
| /external/chromium_org/chrome/browser/history/android/ |
| sql_handler.cc | 25 bool SQLHandler::HasColumnIn(const HistoryAndBookmarkRow& row) {
28 if (row.is_value_set_explicitly(*i))
|
| visit_sql_handler.h | 25 virtual bool Update(const HistoryAndBookmarkRow& row,
27 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
31 // Add a row in visit table with the given |url_id| and |visit_time|.
34 // Add the given |visit_count| rows for |url_id|. The visit time of each row
|
| /external/chromium_org/chrome/browser/history/ |
| history_backend_android.cc | 12 const HistoryAndBookmarkRow& row) {
15 id = android_provider_backend_->InsertHistoryAndBookmark(row);
33 const HistoryAndBookmarkRow& row,
39 row, selection, selection_args, &count);
92 SearchTermID HistoryBackend::InsertSearchTerm(const SearchRow& row) {
95 id = android_provider_backend_->InsertSearchTerm(row);
100 const SearchRow& row,
106 row, selection, selection_args, &count);
|
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| waterfall_view.css | 37 .waterfall-view-information-row {
68 .waterfall-view-table-row {
72 .waterfall-view-row {
77 .waterfall-view-row * {
118 .waterfall-view-row .http-stream-request {
122 .waterfall-view-row .http-stream-request-bound-to-job {
126 .waterfall-view-row .http-transaction-read-headers {
130 .waterfall-view-row .url-request {
134 .waterfall-view-row .http-stream-job {
138 .waterfall-view-row .proxy-service
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| FontSize.cpp | 140 int row = rowFromMediumFontSizeInRange(settings, quirksMode, fixedPitchFontType, mediumSize); local
141 if (row >= 0) {
143 return quirksMode ? quirksFontSizeTable[row][col] : strictFontSizeTable[row][col];
172 int row = rowFromMediumFontSizeInRange(settings, quirksMode, fixedPitchFontType, mediumSize); local
173 if (row >= 0)
174 return findNearestLegacyFontSize<int>(pixelFontSize, quirksMode ? quirksFontSizeTable[row] : strictFontSizeTable[row], 1);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderTableSection.h | 82 void addCell(RenderTableCell*, RenderTableRow* row);
117 typedef WillBeHeapVector<CellStruct> Row;
129 Row row; member in struct:blink::FINAL::RowStruct
174 CellStruct& cellAt(unsigned row, unsigned col) { return m_grid[row].row[col]; }
175 const CellStruct& cellAt(unsigned row, unsigned col) const { return m_grid[row].row[col];
[all...] |
| /external/eigen/Eigen/src/Core/ |
| ForceAlignedAccess.h | 49 inline const CoeffReturnType coeff(Index row, Index col) const
51 return m_expression.coeff(row, col);
54 inline Scalar& coeffRef(Index row, Index col)
56 return m_expression.const_cast_derived().coeffRef(row, col);
70 inline const PacketScalar packet(Index row, Index col) const
72 return m_expression.template packet<Aligned>(row, col);
76 inline void writePacket(Index row, Index col, const PacketScalar& x)
78 m_expression.const_cast_derived().template writePacket<Aligned>(row, col, x);
|
