Home
last modified time | relevance | path

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

1234

/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()
/external/v8/test/unittests/heap/
Dbitmap-unittest.cc50 bm->cells()[1] = kBlackCell; in TEST_F()
61 bitmap()->cells()[last_cell_index] = kBlackCell; in TEST_F()
78 bm->cells()[0] = kBlackCell; in TEST_F()
85 bm->cells()[0] = kBlackCell; in TEST_F()
86 bm->cells()[1] = kBlackCell; in TEST_F()
87 bm->cells()[2] = kBlackCell; in TEST_F()
89 EXPECT_EQ(bm->cells()[0], kWhiteCell); in TEST_F()
90 EXPECT_EQ(bm->cells()[1], 0xAAAA0000); in TEST_F()
91 EXPECT_EQ(bm->cells()[2], kBlackCell); in TEST_F()
97 bm->cells()[0] = kBlackCell; in TEST_F()
[all …]
/external/llvm/test/CodeGen/ARM/
Dthumb2-size-reduction-internal-flags.ll6 %struct.cells = type { i32, i32, %struct.cells* }
16 define i32 @simulate(i32 %iterations, %struct.cells* nocapture %present, double %prob, i8* nocaptur…
35 %temp.1195 = phi %struct.cells* [ %5, %for.inc30 ], [ %present, %for.cond3.preheader ]
43 %temp.2188 = phi %struct.cells* [ %temp.1195, %for.cond6.preheader ], [ %5, %for.body8 ]
46 %f_free = getelementptr inbounds %struct.cells, %struct.cells* %temp.2188, i32 0, i32 0
49 %faulty = getelementptr inbounds %struct.cells, %struct.cells* %temp.2188, i32 0, i32 1
52 %next = getelementptr inbounds %struct.cells, %struct.cells* %temp.2188, i32 0, i32 2
53 %3 = load %struct.cells*, %struct.cells** %next, align 4, !tbaa !11
54 %f_free13 = getelementptr inbounds %struct.cells, %struct.cells* %3, i32 0, i32 0
66 %5 = load %struct.cells*, %struct.cells** %next, align 4, !tbaa !11
[all …]
/external/guava/guava/src/com/google/common/cache/
DStriped64.java130 transient volatile Cell[] cells; field in Striped64
197 if ((as = cells) != null && (n = as.length) > 0) { in retryUpdate()
205 if ((rs = cells) != null && in retryUpdate()
225 else if (n >= NCPU || cells != as) in retryUpdate()
231 if (cells == as) { // Expand table unless stale in retryUpdate()
234 cells = rs; in retryUpdate()
247 else if (busy == 0 && cells == as && casBusy()) { in retryUpdate()
250 if (cells == as) { in retryUpdate()
253 cells = rs; in retryUpdate()
271 Cell[] as = cells; in internalReset()
DLongAdder.java71 if ((as = cells) != null || !casBase(b = base, b + x)) { in add()
106 Cell[] as = cells; in sum()
141 Cell[] as = cells; in sumThenReset()
206 cells = null; in readObject()
/external/opencv3/modules/viz/src/vtk/
DvtkOBJWriter.cpp131 vtkCellArray *cells = input->GetVerts(); in WriteData() local
132 for (cells->InitTraversal(); cells->GetNextCell(npts, index); ) in WriteData()
145 vtkCellArray *cells = input->GetLines(); in WriteData() local
146 for (cells->InitTraversal(); cells->GetNextCell(npts, index); ) in WriteData()
166 vtkCellArray *cells = input->GetPolys(); in WriteData() local
167 for (cells->InitTraversal(); cells->GetNextCell(npts, index); ) in WriteData()
195 vtkCellArray *cells = input->GetStrips(); in WriteData() local
196 for (cells->InitTraversal(); cells->GetNextCell(npts, index); ) in WriteData()
/external/autotest/frontend/client/src/autotest/common/spreadsheet/
DSpreadsheetSelectionManager.java20 public void onCellsSelected(List<CellInfo> cells); in onCellsSelected() argument
21 public void onCellsDeselected(List<CellInfo> cells); in onCellsDeselected() argument
59 List<CellInfo> cells = getSelectedCells(); in clearSelection() local
60 for (CellInfo cell : cells) { in clearSelection()
63 notifyDeselected(cells); in clearSelection()
80 private void notifyDeselected(List<CellInfo> cells) { in notifyDeselected() argument
82 listener.onCellsDeselected(cells); in notifyDeselected()
DSpreadsheet.java272 private CellInfo getCellInfo(CellInfo[][] cells, int row, int column) { in getCellInfo() argument
273 if (cells[row][column] == null) { in getCellInfo()
274 cells[row][column] = new CellInfo(null, null, " "); in getCellInfo()
276 return cells[row][column]; in getCellInfo()
308 private void fillHeaderCells(CellInfo[][] cells, Header fields, List<Header> headerValues, in fillHeaderCells() argument
327 cells[headerIndex][fieldIndex] = cellInfo; in fillHeaderCells()
330 cells[fieldIndex][counter[fieldIndex]] = cellInfo; in fillHeaderCells()
529 CellInfo[][] cells; in handleEvent() local
531 cells = rowHeaderCells; in handleEvent()
535 cells = columnHeaderCells; in handleEvent()
[all …]
/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/guava/guava/src/com/google/common/collect/
DRegularImmutableTable.java111 List<Cell<R, C, V>> cells,
114 checkNotNull(cells);
134 Collections.sort(cells, comparator);
136 return forCellsInternal(cells, rowComparator, columnComparator);
140 Iterable<Cell<R, C, V>> cells) {
141 return forCellsInternal(cells, null, null);
149 forCellsInternal(Iterable<Cell<R, C, V>> cells,
154 ImmutableList<Cell<R, C, V>> cellList = ImmutableList.copyOf(cells);
DImmutableTable.java158 private final List<Cell<R, C, V>> cells = Lists.newArrayList(); field in ImmutableTable.Builder
191 cells.add(cellOf(rowKey, columnKey, value)); in put()
208 cells.add(immutableCell); in put()
236 int size = cells.size(); in build()
242 Iterables.getOnlyElement(cells)); in build()
245 cells, rowComparator, columnComparator); in build()
/external/opencv3/modules/ts/misc/
Dtable_formatter.py21 self.cells = [None] * colsNum
93 row.cells[col.index] = cl
116 for i in range(len(row.cells)):
117 cell = row.cells[i]
118 if row.cells[i] is None:
130 for j in range(i+1, min(len(row.cells), i + colspan)):
131 row.cells[j] = None
142 if len(self.rows[j].cells) > i:
143 self.rows[j].cells[i] = None
155 cell = self.rows[r].cells[c]
[all …]
/external/opencv3/samples/python2/
Ddigits.py46 cells = [np.hsplit(row, w//sx) for row in np.vsplit(img, h//sy)]
47 cells = np.array(cells)
49 cells = cells.reshape(-1, sy, sx)
50 return cells
/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/opencv3/samples/cpp/tutorial_code/viz/
Dcreating_widgets.cpp65 vtkSmartPointer<vtkCellArray> cells = vtkSmartPointer<vtkCellArray>::New(); in WTriangle() local
66 cells->InsertNextCell(triangle); in WTriangle()
73 polyData->SetPolys(cells); in WTriangle()
/external/deqp/doc/testspecs/GLES2/
Dfunctional.stencil.txt39 The viewport is divided into NxN cells, where each cell is assigned a target
41 two cells that target out-of-range stencil values. The amount of cells is scaled
42 based on available stencil bits. For example with 8b there are 6x6 cells.

1234