HomeSort by relevance Sort by last modified time
    Searched defs:cells (Results 1 - 25 of 37) sorted by null

1 2

  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLTableRowElement.cpp 117 RefPtr<HTMLCollection> children = cells();
140 RefPtr<HTMLCollection> children = cells();
152 PassRefPtr<HTMLCollection> HTMLTableRowElement::cells() function in class:WebCore::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 76 vector<Cell> cells; member in struct:ceres::internal::CompressedList
visibility.cc 60 const vector<Cell>& cells = block_structure.rows[i].cells; local
61 int block_id = cells[0].block_id;
67 for (int j = 1; j < cells.size(); ++j) {
68 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.cc 64 const vector<Cell>& cells = bs->rows[r].cells; local
65 if (cells[0].block_id < num_col_blocks_a) {
101 const Cell& cell = bs->rows[r].cells[0];
118 // multiply by all the cells except the first one which is of type
120 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
126 const vector<Cell>& cells = bs->rows[r].cells; local
127 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) {
128 const int col_block_id = cells[c].block_id
171 const vector<Cell>& cells = bs->rows[r].cells; local
284 const vector<Cell>& cells = bs->rows[r].cells; local
    [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/valgrind/main/memcheck/tests/
leak-pool.c 101 struct cell **cells = static_roots ? cells_static : cells_local; local
114 cells[i] = allocate_from_pool(p, sizeof(struct cell));
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/
Table_Suite.py 30 cells = cell variable
  /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 128 // cells have borders, or use attributes like headers, abbr, scope or axis
151 // check enough of the cells to find if the table matches our criteria
154 // 2) at least half of cells have borders (or)
155 // 3) at least half of cells have different bg colors than the table, and there is cell spacing
205 // If the empty-cells style is set, we'll call it a data table.
215 // cells have a bottom border, for example.
232 // If we've found 10 "good" cells, we don't need to keep searching.
257 // if there is less than two valid cells, it's not a data table
261 // half of the cells had borders, it's a data table
432 void AXTable::cells(AXObject::AccessibilityChildrenVector& cells function in class:WebCore::AXTable
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderTableSection.h 89 Vector<RenderTableCell*, 1> cells; member in struct:WebCore::FINAL::CellStruct
99 return hasCells() ? cells[cells.size() - 1] : 0;
104 return hasCells() ? cells[cells.size() - 1] : 0;
107 bool hasCells() const { return cells.size() > 0; }
298 // This HashSet holds the overflowing cells for faster painting.
299 // If we have more than gMaxAllowedOverflowingCellRatio * total cells, it will be empty
306 // This map holds the collapsed border values for cells with collapsed borders.
307 // It is held at RenderTableSection level to spare memory consumption by table cells
    [all...]
RenderTableSection.cpp 61 // We ignore height settings on rowspan cells.
120 // Preventively invalidate our cells as we may be re-inserted into
243 c.cells.append(cell);
244 // If cells overlap then we take the slow path for painting.
245 if (c.cells.size() > 1)
268 if (rowSpanCell.cells.isEmpty())
271 if (rowSpanCell.cells[0]->rowSpan() == 1)
407 // Sorting bigger height cell first if cells are at same index with same span because we will skip smaller
434 if (rowSpanCell.cells.size()) {
435 RenderTableCell* cell = rowSpanCell.cells[0]
1006 Vector<RenderTableCell*, 1>& cells = cellAt(r, c).cells; local
1518 Vector<RenderTableCell*> cells; local
    [all...]
  /external/chromium_org/net/disk_cache/v3/
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.
133 IndexCell cells[4]; member in struct:disk_cache::IndexBucket
  /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());
  /frameworks/base/core/java/com/android/internal/view/menu/
ActionMenuPresenter.java 472 final int cells = ActionMenuView.measureChildForCells(v, local
474 cellsRemaining -= cells;
475 if (cells == 0) {
  /frameworks/support/v7/appcompat/src/android/support/v7/internal/view/menu/
ActionMenuPresenter.java 454 final int cells = ActionMenuView.measureChildForCells(v, local
456 cellsRemaining -= cells;
457 if (cells == 0) {
  /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 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/qemu/
console.c 171 TextCell *cells; member in struct:TextConsole
550 TextCell *cells, *c, *c1; local
561 cells = qemu_malloc(s->width * s->total_height * sizeof(TextCell));
563 c = &cells[y * s->width];
565 c1 = &s->cells[y * last_width];
576 qemu_free(s->cells);
577 s->cells = cells;
616 c = &s->cells[y1 * s->width + x];
645 c = &s->cells[y1 * s->width + x]
    [all...]
  /packages/services/Telephony/src/com/android/phone/
PhoneInterfaceManager.java 716 ArrayList<NeighboringCellInfo> cells = null; local
719 cells = (ArrayList<NeighboringCellInfo>) sendRequest(
724 return cells;
    [all...]
  /external/chromium_org/v8/src/
mark-compact.cc 1983 MarkBit::CellType* cells = p->markbits()->cells(); local
    [all...]

Completed in 2535 milliseconds

1 2