Home
last modified time | relevance | path

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

123456

/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_impl.h64 const vector<Cell>& cells = bs->rows[r].cells; in PartitionedMatrixView() local
65 if (cells[0].block_id < num_col_blocks_e_) { in PartitionedMatrixView()
106 const Cell& cell = bs->rows[r].cells[0]; in RightMultiplyE()
134 const vector<Cell>& cells = bs->rows[r].cells; in RightMultiplyF() local
135 for (int c = 1; c < cells.size(); ++c) { in RightMultiplyF()
136 const int col_block_id = cells[c].block_id; in RightMultiplyF()
140 values + cells[c].position, row_block_size, col_block_size, in RightMultiplyF()
149 const vector<Cell>& cells = bs->rows[r].cells; in RightMultiplyF() local
150 for (int c = 0; c < cells.size(); ++c) { in RightMultiplyF()
151 const int col_block_id = cells[c].block_id; in RightMultiplyF()
[all …]
Dschur_eliminator_impl.h112 const int chunk_block_id = bs->rows[r].cells.front().block_id; in Init()
128 if (row.cells.front().block_id != chunk_block_id) { in Init()
134 for (int c = 1; c < row.cells.size(); ++c) { in Init()
135 const Cell& cell = row.cells[c]; in Init()
231 const int e_block_id = bs->rows[chunk.start].cells.front().block_id; in Eliminate()
313 const int e_block_id = bs->rows[chunk.start].cells.front().block_id; in BackSubstitute()
332 const Cell& e_cell = row.cells.front(); in BackSubstitute()
341 for (int c = 1; c < row.cells.size(); ++c) { in BackSubstitute()
342 const int f_block_id = row.cells[c].block_id; in BackSubstitute()
347 values + row.cells[c].position, row.block.size, f_block_size, in BackSubstitute()
[all …]
Dvisibility_test.cc69 row.cells.push_back(Cell(0, 0)); in TEST()
70 row.cells.push_back(Cell(5, 0)); in TEST()
79 row.cells.push_back(Cell(0, 1)); in TEST()
80 row.cells.push_back(Cell(3, 1)); in TEST()
89 row.cells.push_back(Cell(1, 2)); in TEST()
90 row.cells.push_back(Cell(2, 2)); in TEST()
99 row.cells.push_back(Cell(1, 3)); in TEST()
100 row.cells.push_back(Cell(4, 3)); in TEST()
149 row.cells.push_back(Cell(0, 0)); in TEST()
158 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()
Dvisibility.cc63 const vector<Cell>& cells = block_structure.rows[i].cells; in ComputeVisibility() local
64 int block_id = cells[0].block_id; in ComputeVisibility()
70 for (int j = 1; j < cells.size(); ++j) { in ComputeVisibility()
71 int camera_block_id = cells[j].block_id - num_eliminate_blocks; in ComputeVisibility()
Dschur_complement_solver.cc200 int e_block_id = bs->rows[r].cells.front().block_id; in InitStorage()
210 if (row.cells.front().block_id != e_block_id) { in InitStorage()
216 for (int c = 1; c < row.cells.size(); ++c) { in InitStorage()
217 const Cell& cell = row.cells[c]; in InitStorage()
235 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in InitStorage()
236 for (int i = 0; i < row.cells.size(); ++i) { in InitStorage()
237 int r_block1_id = row.cells[i].block_id - num_eliminate_blocks; in InitStorage()
238 for (int j = 0; j < row.cells.size(); ++j) { in InitStorage()
239 int r_block2_id = row.cells[j].block_id - num_eliminate_blocks; in InitStorage()
Dvisibility_based_preconditioner.cc271 int e_block_id = bs.rows[r].cells.front().block_id; in ComputeBlockPairsInPreconditioner()
280 if (row.cells.front().block_id != e_block_id) { in ComputeBlockPairsInPreconditioner()
287 for (int c = 1; c < row.cells.size(); ++c) { in ComputeBlockPairsInPreconditioner()
288 const Cell& cell = row.cells[c]; in ComputeBlockPairsInPreconditioner()
311 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks); in ComputeBlockPairsInPreconditioner()
312 for (int i = 0; i < row.cells.size(); ++i) { in ComputeBlockPairsInPreconditioner()
313 const int block1 = row.cells[i].block_id - num_eliminate_blocks; in ComputeBlockPairsInPreconditioner()
314 for (int j = 0; j < row.cells.size(); ++j) { in ComputeBlockPairsInPreconditioner()
315 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/net/disk_cache/blockfile/
Dindex_table_v3_unittest.cc294 ASSERT_EQ(1u, found_entries.cells.size()); in TEST()
295 EXPECT_TRUE(found_entries.cells[0].IsValid()); in TEST()
296 EXPECT_EQ(hash, found_entries.cells[0].hash()); in TEST()
297 EXPECT_EQ(addr.value(), found_entries.cells[0].GetAddress().value()); in TEST()
317 EXPECT_EQ(0u, found_entries.cells.size()); in TEST()
319 ASSERT_EQ(1u, found_entries.cells.size()); in TEST()
320 EXPECT_TRUE(found_entries.cells[0].IsValid()); in TEST()
321 EXPECT_EQ(hash, found_entries.cells[0].hash()); in TEST()
322 EXPECT_EQ(addr.value(), found_entries.cells[0].GetAddress().value()); in TEST()
350 ASSERT_EQ(6u, found_entries.cells.size()); in TEST()
[all …]
/external/chromium_org/third_party/WebKit/Source/core/paint/
DTableSectionPainter.cpp112 Vector<RenderTableCell*> cells; in paintObject() local
113 copyToVector(overflowingCells, cells); in paintObject()
125 for (unsigned i = 0; i < current.cells.size(); ++i) { in paintObject()
126 if (overflowingCells.contains(current.cells[i])) in paintObject()
129 if (current.cells[i]->rowSpan() > 1 || current.cells[i]->colSpan() > 1) { in paintObject()
130 if (!spanningCells.add(current.cells[i]).isNewEntry) in paintObject()
134 cells.append(current.cells[i]); in paintObject()
141 std::stable_sort(cells.begin(), cells.end(), compareCellPositions); in paintObject()
143 std::sort(cells.begin(), cells.end(), compareCellPositionsWithOverflowingCells); in paintObject()
146 for (unsigned i = cells.size(); i > 0; --i) { in paintObject()
[all …]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/
Dexpanding_braille_translator.js117 function chunkTranslated(chunk, cells, textToBraille, brailleToText) { argument
118 chunk.cells = cells;
128 function(accum, chunk) { return accum + chunk.cells.byteLength}, 0);
129 var cells = new Uint8Array(totalCells);
139 cells.set(new Uint8Array(chunk.cells), cellPos);
142 cellPos += chunk.cells.byteLength;
144 callback(cells.buffer, textToBraille, brailleToText);
293 return function(cells, textToBraille, brailleToText) { argument
300 callback(cells || new ArrayBuffer(0),
Dbraille_display_manager.js226 goog.bind(function(cells, textToBraille, brailleToText) { argument
238 var extCells = new ArrayBuffer(cells.byteLength + 1);
240 extCellsView.set(new Uint8Array(cells));
242 cells = extCells;
243 translatedStartIndex = cells.byteLength - 1;
251 translatedEndIndex = cells.byteLength;
255 this.writeCursor_(cells, translatedStartIndex, translatedEndIndex);
262 this.translatedContent_ = cells;
Dbraille_input_handler_test.unitjs224 * Mapping from braille cells to Unicode characters.
237 * Mapping of braille cells to the corresponding word in Grade 2 US English
261 var cells = entry[0];
263 if (cells[0] === '^') {
265 cells = cells.substring(1);
267 if (cells[cells.length - 1] === '$') {
269 cells = cells.substring(0, cells.length - 1);
271 result[0] = cellsToArray(cells);
282 * @param {!ArrayBuffer} cells Cells to be translated.
285 FakeTranslator.prototype.backTranslate = function(cells, callback) {
[all …]
/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/compiler-rt/lib/sanitizer_common/
Dsanitizer_addrhashmap.h54 Cell cells[1]; // variable len member
62 Cell cells[kBucketSize]; member
175 Cell *c = &b->cells[i]; in acquire()
188 Cell *c = &add->cells[i]; in acquire()
204 Cell *c = &b->cells[i]; in acquire()
220 Cell *c = &add->cells[i]; in acquire()
244 Cell *c = &b->cells[i]; in acquire()
258 add->cap = (kInitSize - sizeof(*add)) / sizeof(add->cells[0]) + 1; in acquire()
264 uptr oldsize = sizeof(*add) + (add->cap - 1) * sizeof(add->cells[0]); in acquire()
268 add1->cap = (newsize - sizeof(*add)) / sizeof(add->cells[0]) + 1; in acquire()
[all …]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/liblouis_nacl/
Dliblouis_test.extjs62 'Hello!', function(cells, textToBraille, brailleToText) {
63 assertEqualsUint8Array([0x53, 0x11, 0x07, 0x07, 0x15, 0x2e], cells);
73 var cells = new Uint8Array([0x53, 0x11, 0x07, 0x07, 0x15, 0x2e]);
74 translator.backTranslate(cells.buffer, function(text) {
85 'München', function(cells, textToBraille, brailleToText) {
86 assertEqualsUint8Array([0x0d, 0x33, 0x1d, 0x39, 0x09], cells);
96 var cells = new Uint8Array([0xb3]);
97 translator.backTranslate(cells.buffer, function(text) {
106 var cells = new Uint8Array();
107 translator.backTranslate(cells.buffer, function(text) {
Dliblouis.js284 var cells = null;
288 cells = cvox.LibLouis.Translator.decodeHexString_(reply['cells']);
300 callback(cells, textToBraille, brailleToText);
311 function(cells, callback) { argument
312 if (cells.byteLength == 0) {
320 'cells': cvox.LibLouis.Translator.encodeHexString_(cells) property
/external/chromium_org/chrome/common/extensions/docs/server2/
Dsubversion_file_system.py54 cells = row.getElementsByTagName('td')
65 if len(cells) == 2 and _InnerText(cells[0]) == 'Directory revision:':
66 links = cells[1].getElementsByTagName('a')
70 ' elements, instead %s' % _InnerText(cells[1]))
82 if len(cells) != 5:
84 name_element, version_element, _, __, ___ = cells
/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/third_party/WebKit/Source/core/rendering/
DRenderTableSection.h95 WillBeHeapVector<RawPtrWillBeMember<RenderTableCell>, 1> cells;
106 return hasCells() ? cells[cells.size() - 1].get() : 0; in primaryCell()
111 return hasCells() ? cells[cells.size() - 1].get() : 0; in primaryCell()
114 bool hasCells() const { return cells.size() > 0; } in hasCells()

123456