Home
last modified time | relevance | path

Searched refs:cells (Results 1 – 25 of 111) sorted by relevance

12345

/external/ceres-solver/internal/ceres/
Dblock_sparse_matrix.cc67 const vector<Cell>& cells = block_structure_->rows[i].cells; in BlockSparseMatrix() local
68 for (int j = 0; j < cells.size(); ++j) { in BlockSparseMatrix()
69 int col_block_id = cells[j].block_id; in BlockSparseMatrix()
95 const vector<Cell>& cells = block_structure_->rows[i].cells; in RightMultiply() local
96 for (int j = 0; j < cells.size(); ++j) { in RightMultiply()
97 int col_block_id = cells[j].block_id; in RightMultiply()
101 values_.get() + cells[j].position, row_block_size, col_block_size, in RightMultiply()
115 const vector<Cell>& cells = block_structure_->rows[i].cells; in LeftMultiply() local
116 for (int j = 0; j < cells.size(); ++j) { in LeftMultiply()
117 int col_block_id = cells[j].block_id; in LeftMultiply()
[all …]
Dpartitioned_matrix_view.cc64 const vector<Cell>& cells = bs->rows[r].cells; in PartitionedMatrixView() local
65 if (cells[0].block_id < num_col_blocks_a) { in PartitionedMatrixView()
101 const Cell& cell = bs->rows[r].cells[0]; in RightMultiplyE()
126 const vector<Cell>& cells = bs->rows[r].cells; in RightMultiplyF() local
127 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) { in RightMultiplyF()
128 const int col_block_id = cells[c].block_id; in RightMultiplyF()
132 values + cells[c].position, row_block_size, col_block_size, in RightMultiplyF()
146 const Cell& cell = bs->rows[r].cells[0]; in LeftMultiplyE()
171 const vector<Cell>& cells = bs->rows[r].cells; in LeftMultiplyF() local
172 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) { in LeftMultiplyF()
[all …]
Dschur_eliminator_impl.h109 const int chunk_block_id = bs->rows[r].cells.front().block_id; in Init()
125 if (row.cells.front().block_id != chunk_block_id) { in Init()
131 for (int c = 1; c < row.cells.size(); ++c) { in Init()
132 const Cell& cell = row.cells[c]; in Init()
228 const int e_block_id = bs->rows[chunk.start].cells.front().block_id; in Eliminate()
310 const int e_block_id = bs->rows[chunk.start].cells.front().block_id; in BackSubstitute()
329 const Cell& e_cell = row.cells.front(); in BackSubstitute()
338 for (int c = 1; c < row.cells.size(); ++c) { in BackSubstitute()
339 const int f_block_id = row.cells[c].block_id; in BackSubstitute()
344 values + row.cells[c].position, row.block.size, f_block_size, in BackSubstitute()
[all …]
Dvisibility_test.cc66 row.cells.push_back(Cell(0, 0)); in TEST()
67 row.cells.push_back(Cell(5, 0)); in TEST()
76 row.cells.push_back(Cell(0, 1)); in TEST()
77 row.cells.push_back(Cell(3, 1)); in TEST()
86 row.cells.push_back(Cell(1, 2)); in TEST()
87 row.cells.push_back(Cell(2, 2)); in TEST()
96 row.cells.push_back(Cell(1, 3)); in TEST()
97 row.cells.push_back(Cell(4, 3)); in TEST()
146 row.cells.push_back(Cell(0, 0)); in TEST()
155 row.cells.push_back(Cell(0, 1)); in TEST()
[all …]
Ddetect_structure.cc54 if (row.cells.front().block_id >= num_eliminate_blocks) { in DetectStructure()
57 const int e_block_id = row.cells.front().block_id; in DetectStructure()
81 if (row.cells.size() > 1) { in DetectStructure()
82 const int f_block_id = row.cells[1].block_id; in DetectStructure()
86 for (int c = 1; c < row.cells.size(); ++c) { in DetectStructure()
87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) { in DetectStructure()
90 << bs.cols[row.cells[c].block_id].size; in DetectStructure()
Dlinear_least_squares_problems.cc315 row.cells.push_back(Cell(0, 0)); in LinearLeastSquaresProblem2()
316 row.cells.push_back(Cell(2, 1)); in LinearLeastSquaresProblem2()
328 row.cells.push_back(Cell(0, 2)); in LinearLeastSquaresProblem2()
329 row.cells.push_back(Cell(3, 3)); in LinearLeastSquaresProblem2()
341 row.cells.push_back(Cell(1, 4)); in LinearLeastSquaresProblem2()
342 row.cells.push_back(Cell(4, 5)); in LinearLeastSquaresProblem2()
354 row.cells.push_back(Cell(1, 6)); in LinearLeastSquaresProblem2()
355 row.cells.push_back(Cell(2, 7)); in LinearLeastSquaresProblem2()
367 row.cells.push_back(Cell(1, 8)); in LinearLeastSquaresProblem2()
368 row.cells.push_back(Cell(2, 9)); in LinearLeastSquaresProblem2()
[all …]
Dblock_jacobi_preconditioner.cc78 const vector<Cell>& cells = bs->rows[r].cells; in UpdateImpl() local
79 for (int c = 0; c < cells.size(); ++c) { in UpdateImpl()
80 const int col_block_size = bs->cols[cells[c].block_id].size; in UpdateImpl()
81 ConstMatrixRef m(values + cells[c].position, in UpdateImpl()
85 MatrixRef(blocks_[cells[c].block_id], in UpdateImpl()
Dschur_complement_solver.cc194 int e_block_id = bs->rows[r].cells.front().block_id; in InitStorage()
204 if (row.cells.front().block_id != e_block_id) { in InitStorage()
210 for (int c = 1; c < row.cells.size(); ++c) { in InitStorage()
211 const Cell& cell = row.cells[c]; in InitStorage()
229 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in InitStorage()
230 for (int i = 0; i < row.cells.size(); ++i) { in InitStorage()
231 int r_block1_id = row.cells[i].block_id - num_eliminate_blocks; in InitStorage()
232 for (int j = 0; j < row.cells.size(); ++j) { in InitStorage()
233 int r_block2_id = row.cells[j].block_id - num_eliminate_blocks; in InitStorage()
Dvisibility.cc60 const vector<Cell>& cells = block_structure.rows[i].cells; in ComputeVisibility() local
61 int block_id = cells[0].block_id; in ComputeVisibility()
67 for (int j = 1; j < cells.size(); ++j) { in ComputeVisibility()
68 int camera_block_id = cells[j].block_id - num_eliminate_blocks; in ComputeVisibility()
Dvisibility_based_preconditioner.cc253 int e_block_id = bs.rows[r].cells.front().block_id; in ComputeBlockPairsInPreconditioner()
262 if (row.cells.front().block_id != e_block_id) { in ComputeBlockPairsInPreconditioner()
269 for (int c = 1; c < row.cells.size(); ++c) { in ComputeBlockPairsInPreconditioner()
270 const Cell& cell = row.cells[c]; in ComputeBlockPairsInPreconditioner()
293 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in ComputeBlockPairsInPreconditioner()
294 for (int i = 0; i < row.cells.size(); ++i) { in ComputeBlockPairsInPreconditioner()
295 const int block1 = row.cells[i].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
296 for (int j = 0; j < row.cells.size(); ++j) { in ComputeBlockPairsInPreconditioner()
297 const int block2 = row.cells[j].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
Dblock_jacobian_writer.cc186 row->cells.resize(num_active_parameter_blocks); in CreateJacobian()
193 Cell& cell = row->cells[k]; in CreateJacobian()
203 sort(row->cells.begin(), row->cells.end(), CellLessThan); in CreateJacobian()
/external/chromium_org/chrome/browser/resources/net_internals/
Dcros_log_visualizer_view.js155 var cells = row.childNodes;
157 cells[0].className = LOG_CELL_LEVEL_CLASSNAME;
158 var levelTag = addNodeWithText(cells[0], 'p', entry.level);
162 cells[1].className = LOG_CELL_TIME_CLASSNAME;
163 cells[1].textContent = entry.getTime();
166 cells[2].className = LOG_CELL_PNAME_CLASSNAME;
167 this.marker.getHighlightedEntry(entry, 'processName', cells[2]);
170 cells[3].className = LOG_CELL_PID_CLASSNAME;
171 this.marker.getHighlightedEntry(entry, 'processID', cells[3]);
174 cells[4].className = LOG_CELL_DESCRIPTION_CLASSNAME;
[all …]
Dlogs_view.js91 var cells = [];
94 cells.push(rowCell);
98 cells[0].className = LOG_CELL_TEXT_CLASSNAME;
99 cells[0].textContent = logKey;
102 cells[2].className = LOG_CELL_TEXT_CLASSNAME;
107 cells[2].appendChild(logDiv);
118 cells[1].appendChild(expandButton);
119 cells[1].className = LOG_TABLE_BUTTON_COLUMN_CLASSNAME;
/external/chromium_org/chrome/common/extensions/docs/server2/
Dsubversion_file_system.py53 cells = row.getElementsByTagName('td')
64 if len(cells) == 2 and _InnerText(cells[0]) == 'Directory revision:':
65 links = cells[1].getElementsByTagName('a')
69 ' elements, instead %s' % _InnerText(cells[1]))
81 if len(cells) != 5:
83 name_element, version_element, _, __, ___ = cells
/external/chromium/chrome/browser/resources/shared/js/cr/ui/table/
Dtable_list.js41 var cells = this.querySelectorAll('.table-row-cell');
42 if (cells.length % cm.size != 0) {
46 var rowsCount = cells.length / cm.size;
50 cells[row * cm.size + i].style.width = cm.getWidth(i) + '%';
/external/chromium_org/third_party/WebKit/Source/core/rendering/
DRenderTableSection.cpp243 c.cells.append(cell); in addCell()
245 if (c.cells.size() > 1) in addCell()
268 if (rowSpanCell.cells.isEmpty()) in rowHasOnlySpanningCells()
271 if (rowSpanCell.cells[0]->rowSpan() == 1) in rowHasOnlySpanningCells()
434 if (rowSpanCell.cells.size()) { in isHeightNeededForRowHavingOnlySpanningCells()
435 RenderTableCell* cell = rowSpanCell.cells[0]; in isHeightNeededForRowHavingOnlySpanningCells()
467 if (rowSpanCell.cells.size() && rowSpanCell.cells[0]->rowSpan() > 1) in calcRowHeightHavingOnlySpanningCells()
468 …rowHeight = max(rowHeight, rowSpanCell.cells[0]->logicalHeightForRowSizing() / rowSpanCell.cells[0… in calcRowHeightHavingOnlySpanningCells()
651 for (unsigned i = 0; i < current.cells.size(); i++) { in calcRowLogicalHeight()
652 cell = current.cells[i]; in calcRowLogicalHeight()
[all …]
DRenderTableSection.h89 Vector<RenderTableCell*, 1> cells; member
99 return hasCells() ? cells[cells.size() - 1] : 0; in primaryCell()
104 return hasCells() ? cells[cells.size() - 1] : 0; in primaryCell()
107 bool hasCells() const { return cells.size() > 0; } in hasCells()
/external/guava/guava/src/com/google/common/collect/
DImmutableTable.java149 private final List<Cell<R, C, V>> cells = Lists.newArrayList(); field in ImmutableTable.Builder
182 cells.add(cellOf(rowKey, columnKey, value)); in put()
199 cells.add(immutableCell); in put()
227 int size = cells.size(); in build()
233 Iterables.getOnlyElement(cells)); in build()
236 cells, rowComparator, columnComparator); in build()
/external/iproute2/tc/
Dtc_core.c81 int linksize, cells; in tc_align_to_atm() local
82 cells = size / ATM_CELL_PAYLOAD; in tc_align_to_atm()
84 cells++; in tc_align_to_atm()
86 linksize = cells * ATM_CELL_SIZE; /* Use full cell size to add ATM tax */ in tc_align_to_atm()
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/benchmark/
Doptions.js78 var cells = document.getElementsByTagName(TDTAG);
87 for (i = 0; i < cells.length; i++) {
88 if (cells[i].style.display == NONE_DISPLAY) {
89 cells[i].style.display = CELL_DISPLAY;
97 var cells = document.getElementsByTagName(TDTAG);
106 for (i = 0; i < cells.length; i++) {
107 if (cells[i].style.display == CELL_DISPLAY) {
108 cells[i].style.display = NONE_DISPLAY;
125 var cells = document.getElementsByTagName(TDTAG);
132 for (i = 0; i < cells.length; i++) {
[all …]
/external/chromium_org/content/browser/resources/media/
Dstats_table.js96 table.rows[0].cells[0].textContent = 'Statistics ' + report.id;
101 table.rows[1].cells[0], GetSsrcFromReport(report));
141 trElement.cells[1].textContent = value;
/external/chromium_org/chrome/browser/resources/
Dabout_stats.js173 var x = a.cells[cnum].innerText;
174 var y = b.cells[cnum].innerText;
180 var x = parseFloat(a.cells[cnum].innerText);
181 var y = parseFloat(b.cells[cnum].innerText);
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/imageinfo/
Dinfo.js13 function renderCells(cells, data) { argument
14 for (var i = 0; i < cells.length; i++) {
15 var cell = cells[i];
/external/chromium_org/third_party/WebKit/Source/core/html/
DHTMLTableRowElement.cpp117 RefPtr<HTMLCollection> children = cells(); in insertCell()
140 RefPtr<HTMLCollection> children = cells(); in deleteCell()
152 PassRefPtr<HTMLCollection> HTMLTableRowElement::cells() in cells() function in WebCore::HTMLTableRowElement
/external/chromium_org/chrome/browser/extensions/api/braille_display_private/
Dbraille_controller_stub.cc21 virtual void WriteDots(const std::string& cells) OVERRIDE;
59 void BrailleControllerImpl::WriteDots(const std::string& cells) { in WriteDots() argument

12345