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

1 2

  /external/webkit/Source/WebCore/html/
HTMLTableRowElement.cpp 123 RefPtr<HTMLCollection> children = cells();
146 RefPtr<HTMLCollection> children = cells();
157 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
80 for (int c = 0; c < cells.size(); ++c) {
81 const int col_block_size = bs->cols[cells[c].block_id].size;
82 ConstMatrixRef m(row_values + cells[c].position,
86 MatrixRef(blocks_[cells[c].block_id],
96 // MatrixRef(blocks_[cells[c].block_id],
block_structure.h 76 vector<Cell> cells; member in struct:ceres::internal::CompressedList
visibility.cc 56 const vector<Cell>& cells = block_structure.rows[i].cells; local
57 int block_id = cells[0].block_id;
63 for (int j = 1; j < cells.size(); ++j) {
64 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;
121 const vector<Cell>& cells = block_structure_->rows[i].cells; local
122 for (int j = 0; j < cells.size(); ++j) {
123 int col_block_id = cells[j].block_id;
127 MatrixRef m(values_.get() + cells[j].position,
142 const vector<Cell>& cells = block_structure_->rows[i].cells local
160 const vector<Cell>& cells = block_structure_->rows[i].cells; local
177 const vector<Cell>& cells = block_structure_->rows[i].cells; local
199 const vector<Cell>& cells = block_structure_->rows[i].cells; local
222 const vector<Cell>& cells = block_structure_->rows[i].cells; local
267 const vector<Cell>& cells = block_structure_->rows[i].cells; local
    [all...]
partitioned_matrix_view.cc 63 const vector<Cell>& cells = bs->rows[r].cells; local
64 if (cells[0].block_id < num_col_blocks_a) {
100 const Cell& cell = bs->rows[r].cells[0];
120 // multiply by all the cells except the first one which is of type
122 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
128 const vector<Cell>& cells = bs->rows[r].cells; local
129 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) {
131 const int col_block_id = cells[c].block_id
180 const vector<Cell>& cells = bs->rows[r].cells; local
296 const vector<Cell>& cells = bs->rows[r].cells; local
    [all...]
  /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));
  /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/webkit/Source/WebCore/accessibility/
AccessibilityTable.cpp 119 // cells have borders, or use attributes like headers, abbr, scope or axis
137 // check enough of the cells to find if the table matches our criteria
140 // 2) at least half of cells have borders (or)
141 // 3) at least half of cells have different bg colors than the table, and there is cell spacing
198 // if we've found 10 "good" cells, we don't need to keep searching
223 // if there is less than two valid cells, it's not a data table
227 // half of the cells had borders, it's a data table
422 void AccessibilityTable::cells(AccessibilityObject::AccessibilityChildrenVector& cells) function in class:WebCore::AccessibilityTable
432 cells.append(rowChildren)
    [all...]
  /external/webkit/Source/WebCore/rendering/
RenderTableSection.h 57 Vector<RenderTableCell*, 1> cells; member in struct:WebCore::RenderTableSection::CellStruct
65 return hasCells() ? cells[cells.size() - 1] : 0;
70 return hasCells() ? cells[cells.size() - 1] : 0;
73 bool hasCells() const { return cells.size() > 0; }
RenderTableSection.cpp 206 // we ignore height settings on rowspan cells
250 c.cells.append(cell);
251 // If cells overlap then we take the slow path for painting.
252 if (c.cells.size() > 1)
609 // do, but it will clip the cells that spill out of the table section. In
612 // time only). We may also not be handling row-spanning cells correctly.
742 // Now that our height has been determined, add in overflow from cells.
785 const BorderValue& cb = current.primaryCell()->style()->borderBefore(); // FIXME: Make this work with perpendicular and flipped cells.
836 const BorderValue& cb = current.primaryCell()->style()->borderAfter(); // FIXME: Make this work with perpendicular and flipped cells.
1139 Vector<RenderTableCell*> cells; local
    [all...]
  /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 438 final int cells = ActionMenuView.measureChildForCells(v, local
440 cellsRemaining -= cells;
441 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) {
  /packages/apps/Phone/src/com/android/phone/
PhoneInterfaceManager.java 675 ArrayList<NeighboringCellInfo> cells = null; local
678 cells = (ArrayList<NeighboringCellInfo>) sendRequest(
683 return cells;
  /external/freetype/src/smooth/
ftgrays.c 342 PCell cells; member in struct:gray_TWorker_
400 /* Initialize the cells table. */
410 ras.cells = NULL;
493 cell = ras.cells + ras.num_cells++;
538 /* All cells that are on the left of the clipping region go to the */
594 /* Render a scanline as one or more cells. */
632 /* 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...]
  /external/webkit/Source/WebCore/bindings/objc/
PublicDOMInterfaces.h 866 @property(readonly, retain) DOMHTMLCollection *cells; variable
    [all...]
  /external/v8/src/
mark-compact.cc 1982 MarkBit::CellType* cells = p->markbits()->cells(); local
2911 MarkBit::CellType* cells = p->markbits()->cells(); local
3075 MarkBit::CellType* cells = p->markbits()->cells(); local
    [all...]
spaces.h 166 // Bitmap is a sequence of cells each containing fixed number of bits.
206 INLINE(MarkBit::CellType* cells()) { function in class:v8::internal::Bitmap
220 MarkBit::CellType* cell = this->cells() + (index >> kBitsPerCellLog2);
279 printer.Print(i, cells()[i]);
287 if (cells()[i] != 0) return false;
    [all...]
  /frameworks/opt/telephony/src/java/com/android/internal/telephony/
RIL.java 2543 ArrayList<NeighboringCellInfo> cells; local
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/
performanceui.jar 

Completed in 1247 milliseconds

1 2