/external/chromium_org/third_party/WebKit/Source/core/html/ |
HTMLTableRowElement.cpp | 118 RefPtrWillBeRawPtr<HTMLCollection> children = cells(); 135 RefPtrWillBeRawPtr<HTMLCollection> children = cells(); 147 PassRefPtrWillBeRawPtr<HTMLCollection> HTMLTableRowElement::cells() function in class:blink::HTMLTableRowElement
|
/external/ceres-solver/internal/ceres/ |
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],
|
block_structure.h | 74 vector<Cell> cells; member in struct:ceres::internal::CompressedList
|
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;
|
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...] |
/external/chromium_org/third_party/WebKit/Source/core/paint/ |
TableSectionPainter.cpp | 50 // This comparison is used only when we have overflowing cells as we have an unsorted array to sort. We thus need 89 // Draw the dirty cells in the order that they appear. 104 // The overflowing cells should be scarce to avoid adding a lot of cells to the HashSet. 111 // To make sure we properly paint invalidate the section, we paint invalidated all the overflowing cells that we collected. 112 Vector<RenderTableCell*> cells; local 113 copyToVector(overflowingCells, cells); 125 for (unsigned i = 0; i < current.cells.size(); ++i) { 126 if (overflowingCells.contains(current.cells[i])) 129 if (current.cells[i]->rowSpan() > 1 || current.cells[i]->colSpan() > 1) [all...] |
/external/chromium_org/ui/views/examples/ |
table_example.cc | 114 const char* const cells[5][4] = { local 121 return ASCIIToUTF16(cells[row % 5][column_id]);
|
/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 */
|
/external/chromium_org/net/disk_cache/blockfile/ |
index_table_v3.h | 45 // another place, and that would invalidate any pointers to individual cells in 114 std::vector<EntryCell> cells; member in struct:disk_cache::EntrySet 122 // An index iterator is used to get a group of cells that share the same 130 CellList cells; member in struct:disk_cache::IndexIterator 131 int timestamp; // The current low resolution timestamp for |cells|. 199 // of cells will share the same timestamp (see IndexIterator). 220 // does not return the cells matching the initial iterator's timestamp, 221 // but rather cells after (or before, depending on the iterator's |forward|
|
disk_format_v3.h | 21 // number of buckets. Each bucket stores up to four cells (each cell represents 22 // a possibl entry). The index bitmap tracks the state of individual cells. 190 IndexCell cells[kCellsPerBucket]; member in struct:disk_cache::IndexBucket
|
/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/guava/guava/src/com/google/common/collect/ |
ImmutableTable.java | 133 * <p>By default, the order in which cells are added to the builder determines 149 private final List<Cell<R, C, V>> cells = Lists.newArrayList(); field in class:ImmutableTable.Builder 182 cells.add(cellOf(rowKey, columnKey, value)); 199 cells.add(immutableCell); 227 int size = cells.size(); 233 Iterables.getOnlyElement(cells)); 236 cells, rowComparator, columnComparator);
|
/external/libvorbis/vq/ |
vqgen.c | 40 divide the training set up into cells representing roughly equal 98 FILE *cells; local 100 cells=fopen(buff,"w"); 144 fprintf(cells,"%g\n",spacings[i]); 145 fclose(cells); 350 FILE *cells; local 351 sprintf(buff,"cells%d.m",v->it); 352 cells=fopen(buff,"w"); 432 cells in a codebook to be roughly some minimum size (as with 494 fprintf(cells,"%g %g\n%g %g\n\n" [all...] |
/external/opencv/cvaux/src/ |
cvdpstereo.cpp | 105 #define CELL(d,x) cells[(d)+(x)*dispH] 109 _CvDPCell* cells = (_CvDPCell*)cvAlloc(sizeof(_CvDPCell)*imgW*MAX(dispH,(imgH+1)/2)); local 111 int* reliabilities = (int*)cells; 196 _CvDPCell* _cell = cells + x*dispH; 471 cvFree( &cells );
|
/external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
AXTable.cpp | 147 RefPtrWillBeRawPtr<HTMLCollection> cells = rowElement->cells(); 148 for (unsigned cellIndex = 0; cellIndex < cells->length(); ++cellIndex) { 149 if (elementHasAriaRole(cells->item(cellIndex))) 167 // cells have borders, or use attributes like headers, abbr, scope or axis 190 // check enough of the cells to find if the table matches our criteria 193 // 2) at least half of cells have borders (or) 194 // 3) at least half of cells have different bg colors than the table, and there is cell spacing 244 // If the empty-cells style is set, we'll call it a data table. 254 // cells have a bottom border, for example 471 void AXTable::cells(AXObject::AccessibilityChildrenVector& cells) function in class:blink::AXTable [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
RenderTableSection.h | 95 WillBeHeapVector<RawPtrWillBeMember<RenderTableCell>, 1> cells; member in struct:blink::FINAL::CellStruct 106 return hasCells() ? cells[cells.size() - 1].get() : 0; 111 return hasCells() ? cells[cells.size() - 1].get() : 0; 114 bool hasCells() const { return cells.size() > 0; } 310 // This HashSet holds the overflowing cells for faster painting. 311 // If we have more than gMaxAllowedOverflowingCellRatio * total cells, it will be empty 318 // This map holds the collapsed border values for cells with collapsed borders. 319 // It is held at RenderTableSection level to spare memory consumption by table cells [all...] |
RenderTableSection.cpp | 56 // We ignore height settings on rowspan cells. 83 visitor->trace(cells); 138 // Preventively invalidate our cells as we may be re-inserted into 261 c.cells.append(cell); 262 // If cells overlap then we take the slow path for painting. 263 if (c.cells.size() > 1) 286 if (rowSpanCell.cells.isEmpty()) 289 if (rowSpanCell.cells[0]->rowSpan() == 1) 470 // Sorting bigger height cell first if cells are at same index with same span because we will skip smaller 497 if (rowSpanCell.cells.size()) 1068 WillBeHeapVector<RawPtrWillBeMember<RenderTableCell>, 1>& cells = cellAt(r, c).cells; local [all...] |
/external/deqp/modules/gles2/functional/ |
es2fStencilTests.cpp | 312 // Compute cells: (x, y, w, h) 313 vector<IVec4> cells; local 318 cells.push_back(IVec4(x*cellWidth, y*cellHeight, cellWidth, cellHeight)); 320 DE_ASSERT(ops.size() <= cells.size()); 332 executeOps(context, cells[ndx], ops[ndx]); 351 executeOps(context, cells[ndx], ops[ndx]);
|
/external/deqp/modules/gles3/functional/ |
es3fStencilTests.cpp | 315 // Compute cells: (x, y, w, h) 316 vector<IVec4> cells; local 321 cells.push_back(IVec4(x*cellWidth, y*cellHeight, cellWidth, cellHeight)); 323 DE_ASSERT(ops.size() <= cells.size()); 335 executeOps(context, cells[ndx], ops[ndx]); 354 executeOps(context, cells[ndx], ops[ndx]);
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/ui/ |
ConfigTab.java | 82 // Cells management 296 Iterator cells = this.toolTips.keySet().iterator(); local 297 while (cells.hasNext()) { 298 ToolTip toolTip = (ToolTip) this.toolTips.get(cells.next());
|
/external/chromium_org/third_party/freetype/src/smooth/ |
ftgrays.c | 372 PCell cells; member in struct:gray_TWorker_ 430 /* Initialize the cells table. */ 440 ras.cells = NULL; 523 cell = ras.cells + ras.num_cells++; 568 /* All cells that are on the left of the clipping region go to the */ 624 /* Render a scanline as one or more cells. */ 662 /* ok, we'll have to render a run of adjacent cells on the same */ [all...] |
/external/freetype/src/smooth/ |
ftgrays.c | 417 PCell cells; member in struct:gray_TWorker_ 479 /* Initialize the cells table. */ 489 ras.cells = NULL; 572 cell = ras.cells + ras.num_cells++; 617 /* All cells that are on the left of the clipping region go to the */ 673 /* Render a scanline as one or more cells. */ 711 /* ok, we'll have to render a run of adjacent cells on the same */ [all...] |
/external/chromium_org/v8/src/heap/ |
mark-compact.cc | 1954 MarkBit::CellType* cells = p->markbits()->cells(); local [all...] |
spaces.h | 143 // Bitmap is a sequence of cells each containing fixed number of bits. 180 INLINE(MarkBit::CellType* cells()) { function in class:v8::internal::Bitmap 192 MarkBit::CellType* cell = this->cells() + (index >> kBitsPerCellLog2); 249 printer.Print(i, cells()[i]); 257 if (cells()[i] != 0) { [all...] |