Searched defs:cells (Results 1 - 16 of 16) sorted by relevance

/external/valgrind/main/memcheck/tests/
H A Dleak-pool.c101 struct cell **cells = static_roots ? cells_static : cells_local; local
114 cells[i] = allocate_from_pool(p, sizeof(struct cell));
/external/webkit/Source/WebCore/html/
H A DHTMLTableRowElement.cpp123 RefPtr<HTMLCollection> children = cells();
146 RefPtr<HTMLCollection> children = cells();
157 PassRefPtr<HTMLCollection> HTMLTableRowElement::cells() function in class:WebCore::HTMLTableRowElement
/external/guava/guava/src/com/google/common/collect/
H A DImmutableTable.java133 * <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);
H A DRegularImmutableTable.java37 * cells.
90 List<Cell<R, C, V>> cells,
93 checkNotNull(cells);
115 Collections.sort(cells, comparator);
117 return forCellsInternal(cells, rowComparator, columnComparator);
121 Iterable<Cell<R, C, V>> cells) {
122 return forCellsInternal(cells, null, null);
130 forCellsInternal(Iterable<Cell<R, C, V>> cells, argument
136 for (Cell<R, C, V> cell : cells) {
156 // use a dense table if more than half of the cells hav
89 forCells( List<Cell<R, C, V>> cells, @Nullable final Comparator<? super R> rowComparator, @Nullable final Comparator<? super C> columnComparator) argument
120 forCells( Iterable<Cell<R, C, V>> cells) argument
[all...]
/external/iproute2/tc/
H A Dtc_core.c70 * 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/opencv/cvaux/src/
H A Dcvdpstereo.cpp105 #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/
H A DAccessibilityTable.cpp119 // 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) argument
432 cells
[all...]
/external/webkit/Source/WebCore/rendering/
H A DRenderTableSection.h57 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; }
H A DRenderTableSection.cpp206 // 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.
890 const BorderValue& cb = current.primaryCell()->style()->borderStart(); // FIXME: Make this work with perpendicular and flipped cells
1139 Vector<RenderTableCell*> cells; local
[all...]
/external/libvorbis/vq/
H A Dvqgen.c40 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,"
[all...]
/external/freetype/src/smooth/
H A Dftgrays.c342 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 */
1801 ras.cells = (PCell)( (char*)ras.buffer + cell_start );
1802 if ( ras.cells >= cells_max )
1805 ras.max_cells = cells_max - ras.cells;
[all...]
/external/qemu/
H A Dconsole.c171 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[y
[all...]
/external/webkit/Source/WebCore/bindings/objc/
H A DPublicDOMInterfaces.h866 @property(readonly, retain) DOMHTMLCollection *cells; variable
/external/v8/src/
H A Dmark-compact.cc1982 MarkBit::CellType* cells = p->markbits()->cells(); local
2003 const MarkBit::CellType current_cell = cells[cell_index];
2006 const MarkBit::CellType next_cell = cells[cell_index + 1];
2015 MarkBit markbit(&cells[cell_index], 1 << offset, false);
2312 // There is no write barrier on cells so we have to scan them now at the end
2911 MarkBit::CellType* cells = p->markbits()->cells(); local
2933 if (cells[cell_index] == 0) continue;
2935 int live_objects = MarkWordToObjectStarts(cells[cell_inde
3075 MarkBit::CellType* cells = p->markbits()->cells(); local
[all...]
H A Dspaces.h166 // 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;
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/
H A Dperformanceui.jarMETA-INF/MANIFEST.MF .project about.html plugin.xml build.properties images/FAIL ...

Completed in 544 milliseconds