| /external/v8/test/unittests/heap/ |
| bitmap-unittest.cc | 48 TEST_F(BitmapTest, Cells) {
50 bm->cells()[1] = kBlackCell;
61 bitmap()->cells()[last_cell_index] = kBlackCell;
78 bm->cells()[0] = kBlackCell;
85 bm->cells()[0] = kBlackCell;
86 bm->cells()[1] = kBlackCell;
87 bm->cells()[2] = kBlackCell;
89 EXPECT_EQ(bm->cells()[0], kWhiteCell);
90 EXPECT_EQ(bm->cells()[1], 0xAAAA0000);
91 EXPECT_EQ(bm->cells()[2], kBlackCell)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_sparse_matrix.cc | 67 const vector<Cell>& cells = block_structure_->rows[i].cells; local
68 for (int j = 0; j < cells.size(); ++j) {
69 int col_block_id = cells[j].block_id;
95 const vector<Cell>& cells = block_structure_->rows[i].cells; local
96 for (int j = 0; j < cells.size(); ++j) {
97 int col_block_id = cells[j].block_id;
101 values_.get() + cells[j].position, row_block_size, col_block_size,
115 const vector<Cell>& cells = block_structure_->rows[i].cells local
133 const vector<Cell>& cells = block_structure_->rows[i].cells; local
150 const vector<Cell>& cells = block_structure_->rows[i].cells; local
172 const vector<Cell>& cells = block_structure_->rows[i].cells; local
195 const vector<Cell>& cells = block_structure_->rows[i].cells; local
225 const vector<Cell>& cells = block_structure_->rows[i].cells; local
[all...] |
| partitioned_matrix_view_impl.h | 64 const vector<Cell>& cells = bs->rows[r].cells; local
65 if (cells[0].block_id < num_col_blocks_e_) {
106 const Cell& cell = bs->rows[r].cells[0];
126 // multiply by all the cells except the first one which is of type
128 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
134 const vector<Cell>& cells = bs->rows[r].cells; local
135 for (int c = 1; c < cells.size(); ++c) {
136 const int col_block_id = cells[c].block_id
149 const vector<Cell>& cells = bs->rows[r].cells; local
200 const vector<Cell>& cells = bs->rows[r].cells; local
215 const vector<Cell>& cells = bs->rows[r].cells; local
342 const vector<Cell>& cells = bs->rows[r].cells; local
361 const vector<Cell>& cells = bs->rows[r].cells; local
[all...] |
| detect_structure.cc | 54 if (row.cells.front().block_id >= num_eliminate_blocks) {
57 const int e_block_id = row.cells.front().block_id;
81 if (row.cells.size() > 1) {
82 const int f_block_id = row.cells[1].block_id;
86 for (int c = 1; c < row.cells.size(); ++c) {
87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) {
90 << bs.cols[row.cells[c].block_id].size;
|
| block_jacobi_preconditioner.cc | 78 const vector<Cell>& cells = bs->rows[r].cells; local
79 for (int c = 0; c < cells.size(); ++c) {
80 const int col_block_size = bs->cols[cells[c].block_id].size;
81 ConstMatrixRef m(values + cells[c].position,
85 MatrixRef(blocks_[cells[c].block_id],
95 // MatrixRef(blocks_[cells[c].block_id],
|
| visibility_test.cc | 69 row.cells.push_back(Cell(0, 0));
70 row.cells.push_back(Cell(5, 0));
79 row.cells.push_back(Cell(0, 1));
80 row.cells.push_back(Cell(3, 1));
89 row.cells.push_back(Cell(1, 2));
90 row.cells.push_back(Cell(2, 2));
99 row.cells.push_back(Cell(1, 3));
100 row.cells.push_back(Cell(4, 3));
149 row.cells.push_back(Cell(0, 0));
158 row.cells.push_back(Cell(0, 1))
[all...] |
| visibility.cc | 63 const vector<Cell>& cells = block_structure.rows[i].cells; local
64 int block_id = cells[0].block_id;
70 for (int j = 1; j < cells.size(); ++j) {
71 int camera_block_id = cells[j].block_id - num_eliminate_blocks;
|
| schur_eliminator_impl.h | 112 const int chunk_block_id = bs->rows[r].cells.front().block_id;
128 if (row.cells.front().block_id != chunk_block_id) {
134 for (int c = 1; c < row.cells.size(); ++c) {
135 const Cell& cell = row.cells[c];
231 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
313 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
332 const Cell& e_cell = row.cells.front();
341 for (int c = 1; c < row.cells.size(); ++c) {
342 const int f_block_id = row.cells[c].block_id;
347 values + row.cells[c].position, row.block.size, f_block_size
[all...] |
| linear_least_squares_problems.cc | 315 row.cells.push_back(Cell(0, 0));
316 row.cells.push_back(Cell(2, 1));
328 row.cells.push_back(Cell(0, 2));
329 row.cells.push_back(Cell(3, 3));
341 row.cells.push_back(Cell(1, 4));
342 row.cells.push_back(Cell(4, 5));
354 row.cells.push_back(Cell(1, 6));
355 row.cells.push_back(Cell(2, 7));
367 row.cells.push_back(Cell(1, 8));
368 row.cells.push_back(Cell(2, 9))
[all...] |
| block_jacobian_writer.cc | 165 // Construct the cells in each row.
186 row->cells.resize(num_active_parameter_blocks);
193 Cell& cell = row->cells[k];
203 sort(row->cells.begin(), row->cells.end(), CellLessThan);
|
| block_structure.h | 74 vector<Cell> cells; member in struct:ceres::internal::CompressedList
|
| /external/autotest/frontend/client/src/autotest/common/spreadsheet/ |
| SpreadsheetSelectionManager.java | 20 public void onCellsSelected(List<CellInfo> cells);
21 public void onCellsDeselected(List<CellInfo> cells);
59 List<CellInfo> cells = getSelectedCells(); local
60 for (CellInfo cell : cells) {
63 notifyDeselected(cells);
80 private void notifyDeselected(List<CellInfo> cells) {
82 listener.onCellsDeselected(cells);
|
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| Striped64.java | 37 * In part because Cells are relatively large, we avoid creating
47 * resizing the table, as well as populating slots with new Cells.
81 * expanded mask. We do not try to detect or remove such cells,
83 * contention levels will recur, so the cells will eventually be
124 * Table of cells. When non-null, size is a power of 2.
126 transient volatile Cell[] cells; field in class:Striped64
135 * Spinlock (locked via CAS) used when resizing and/or creating Cells.
182 * creating new Cells, and/or contention. See above for
203 if ((as = cells) != null && (n = as.length) > 0) {
210 if ((rs = cells) != null &
[all...] |
| LongAdder.java | 58 if ((as = cells) != null || !casBase(b = base, b + x)) {
91 Cell[] as = cells;
109 Cell[] as = cells;
129 Cell[] as = cells;
|
| DoubleAccumulator.java | 75 if ((as = cells) != null ||
101 Cell[] as = cells;
121 Cell[] as = cells;
141 Cell[] as = cells;
|
| DoubleAdder.java | 62 if ((as = cells) != null ||
89 Cell[] as = cells;
107 Cell[] as = cells;
127 Cell[] as = cells;
|
| LongAccumulator.java | 77 if ((as = cells) != null ||
99 Cell[] as = cells;
118 Cell[] as = cells;
138 Cell[] as = cells;
|
| /external/guava/guava/src/com/google/common/cache/ |
| Striped64.java | 40 * In part because Cells are relatively large, we avoid creating
50 * resizing the table, as well as populating slots with new Cells.
81 * expanded mask. We do not try to detect or remove such cells,
83 * contention levels will recur, so the cells will eventually be
128 * Table of cells. When non-null, size is a power of 2.
130 transient volatile Cell[] cells; field in class:Striped64
139 * Spinlock (locked via CAS) used when resizing and/or creating Cells.
176 * creating new Cells, and/or contention. See above for
197 if ((as = cells) != null && (n = as.length) > 0) {
205 if ((rs = cells) != null &
[all...] |
| LongAdder.java | 71 if ((as = cells) != null || !casBase(b = base, b + x)) {
106 Cell[] as = cells;
141 Cell[] as = cells;
206 cells = null;
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 54 Cell cells[1]; // variable len member in struct:__sanitizer::AddrHashMap::AddBucket
62 Cell cells[kBucketSize]; member in struct:__sanitizer::AddrHashMap::Bucket
173 // Check the embed cells.
175 Cell *c = &b->cells[i];
183 // Check the add cells with read lock.
188 Cell *c = &add->cells[i];
201 // Embed cells.
204 Cell *c = &b->cells[i];
216 // Add cells.
220 Cell *c = &add->cells[i]
[all...] |
| /external/opencv3/modules/viz/src/vtk/ |
| vtkOBJWriter.cpp | 131 vtkCellArray *cells = input->GetVerts(); local
132 for (cells->InitTraversal(); cells->GetNextCell(npts, index); )
145 vtkCellArray *cells = input->GetLines(); local
146 for (cells->InitTraversal(); cells->GetNextCell(npts, index); )
166 vtkCellArray *cells = input->GetPolys(); local
167 for (cells->InitTraversal(); cells->GetNextCell(npts, index); )
195 vtkCellArray *cells = input->GetStrips() local
[all...] |
| /frameworks/rs/api/ |
| rs_allocation_data.spec | 20 The functions below can be used to get and set the cells that comprise
23 <li>Individual cells are accessed using the rsGetElementAt* and
25 <li>Multiple cells can be copied using the rsAllocationCopy* and
31 or set cells. Think of them as rsGetCellAt and and rsSetCellAt.
37 arg: rs_allocation dstAlloc, "Allocation to copy cells into."
40 arg: uint32_t count, "Number of cells to be copied."
44 summary: Copy consecutive cells between allocations
46 Copies the specified number of cells from one allocation to another.
66 arg: rs_allocation dstAlloc, "Allocation to copy cells into."
78 summary: Copy a rectangular region of cells between allocation
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableTable.java | 29 * cells.
111 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);
173 // use a dense table if more than half of the cells have value
[all...] |
| /external/opencv3/samples/cpp/tutorial_code/viz/ |
| creating_widgets.cpp | 65 vtkSmartPointer<vtkCellArray> cells = vtkSmartPointer<vtkCellArray>::New(); local
66 cells->InsertNextCell(triangle);
73 polyData->SetPolys(cells);
|
| /external/iproute2/tc/ |
| tc_core.c | 70 * The align to ATM cells is used for determining the (ATM) SAR
81 int linksize, cells; local
82 cells = size / ATM_CELL_PAYLOAD;
84 cells++;
86 linksize = cells * ATM_CELL_SIZE; /* Use full cell size to add ATM tax */
|
