| /external/ceres-solver/internal/ceres/ |
| block_structure.cc | 37 bool CellLessThan(const Cell& lhs, const Cell& rhs) {
61 const CellProto &cell = row.cells(j); local
62 block_structure->rows[i].cells[j].block_id = cell.block_id();
63 block_structure->rows[i].cells[j].position = cell.position();
83 CellProto *cell = row->add_cells(); local
84 cell->set_block_id(block_structure.rows[i].cells[j].block_id);
85 cell->set_position(block_structure.rows[i].cells[j].position);
|
| block_random_access_dense_matrix_test.cc | 57 CellInfo* cell = local
60 EXPECT_TRUE(cell != NULL);
80 // Fill the cell (i,j) with (i + 1) * (j + 1)
87 CellInfo* cell = m.GetCell( local
89 MatrixRef(cell->values, row_stride, col_stride).block(
|
| implicit_schur_complement.cc | 153 const Cell& cell = block_diagonal_structure->rows[r].cells[0]; local
154 MatrixRef m(block_diagonal->mutable_values() + cell.position,
|
| block_jacobian_writer.cc | 193 Cell& cell = row->cells[k]; local
194 cell.block_id = parameter_block->index();
195 cell.position = jacobian_layout_[i][k];
|
| block_random_access_sparse_matrix_test.cc | 75 CellInfo* cell = m.GetCell(row_block_id, col_block_id, local
78 EXPECT_TRUE(cell != NULL);
85 MatrixRef(cell->values, row_stride, col_stride).block(
|
| partitioned_matrix_view.cc | 63 const vector<Cell>& cells = bs->rows[r].cells;
97 // by the first cell in each row block.
100 const Cell& cell = bs->rows[r].cells[0]; local
103 const int col_block_id = cell.block_id;
109 ConstMatrixRef m(row_values + cell.position,
128 const vector<Cell>& cells = bs->rows[r].cells;
149 // by the first cell in each row block.
151 const Cell& cell = bs->rows[r].cells[0] local
224 Cell& cell = row.cells.back(); local
266 const Cell& cell = bs->rows[r].cells[0]; local
[all...] |
| /external/webkit/Source/JavaScriptCore/heap/ |
| MarkedBlock.cpp | 74 JSCell* cell = reinterpret_cast<JSCell*>(&atoms()[i]); local
76 if (cell->structure() && cell->structure() != dummyMarkableCellStructure && !cell->isZombie()) {
77 const ClassInfo* info = cell->classInfo();
78 cell->~JSCell();
79 new (cell) JSZombie(*m_heap->globalData(), info, m_heap->globalData()->zombieStructure.get());
83 cell->~JSCell();
84 new (cell) JSCell(*m_heap->globalData(), dummyMarkableCellStructure);
|
| MarkStack.cpp | 57 inline void MarkStack::markChildren(JSCell* cell)
59 ASSERT(Heap::isMarked(cell));
60 if (cell->structure()->typeInfo().type() < CompoundType) {
61 cell->JSCell::markChildren(*this);
65 if (!cell->structure()->typeInfo().overridesMarkChildren()) {
66 ASSERT(cell->isObject());
68 asObject(cell)->markChildrenDirect(*this);
72 cell->markChildren(*this);
78 if (cell->vptr() == m_jsArrayVPtr) {
79 asArray(cell)->markChildrenDirect(*this)
104 JSCell* cell; local
[all...] |
| HandleHeap.cpp | 77 JSCell* cell = node->slot()->asCell(); local
78 if (Heap::isMarked(cell))
99 JSCell* cell = node->slot()->asCell(); local
100 if (Heap::isMarked(cell))
161 JSCell* cell = value.asCell();
162 if (!cell || !cell->structure())
166 if (cell->isZombie())
|
| /external/guava/guava/src/com/google/common/collect/ |
| SingletonImmutableTable.java | 29 * An implementation of {@link ImmutableTable} that holds a single cell.
45 SingletonImmutableTable(Cell<R, C, V> cell) {
46 this(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
49 @Override public ImmutableSet<Cell<R, C, V>> cellSet() {
125 Cell<?, ?, ?> thatCell = that.cellSet().iterator().next();
|
| StandardTable.java | 179 for (Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) {
180 put(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
269 * <p>Each cell is an immutable snapshot of a row key / column key / value
270 * mapping, taken at the time the cell is returned by a method call to the
273 @Override public Set<Cell<R, C, V>> cellSet() {
278 private class CellSet extends TableSet<Cell<R, C, V>> {
279 @Override public Iterator<Cell<R, C, V>> iterator()
289 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) obj; local
298 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) obj; local
[all...] |
| ImmutableTable.java | 51 /** Returns an immutable table containing a single cell. */
84 Cell<? extends R, ? extends C, ? extends V> onlyCell
89 ImmutableSet.Builder<Cell<R, C, V>> cellSetBuilder
91 for (Cell<? extends R, ? extends C, ? extends V> cell :
94 * Must cast to be able to create a Cell<R, C, V> rather than a
95 * Cell<? extends R, ? extends C, ? extends V>
97 cellSetBuilder.add(cellOf((R) cell.getRowKey(),
98 (C) cell.getColumnKey(), (V) cell.getValue()))
[all...] |
| ArrayTable.java | 70 * access the same cell of an {@code ArrayTable} concurrently and one of the
75 * to one cell and a thread that reads from another.
386 for (Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) {
387 put(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
466 public Set<Cell<R, C, V>> cellSet() {
471 private class CellSet extends AbstractSet<Cell<R, C, V>> {
473 @Override public Iterator<Cell<R, C, V>> iterator()
[all...] |
| Tables.java | 28 import com.google.common.collect.Table.Cell;
53 * Returns an immutable cell with the specified row key, column key, and
56 * <p>The returned cell is serializable.
58 * @param rowKey the row key to be associated with the returned cell
59 * @param columnKey the column key to be associated with the returned cell
60 * @param value the value to be associated with the returned cell
62 public static <R, C, V> Cell<R, C, V> immutableCell(
96 abstract static class AbstractCell<R, C, V> implements Cell<R, C, V> {
104 if (obj instanceof Cell) {
105 Cell<?, ?, ?> other = (Cell<?, ?, ?>) obj
305 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) obj; local
314 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) obj; local
494 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) obj; local
506 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) obj; local
[all...] |
| RegularImmutableTable.java | 43 private final ImmutableSet<Cell<R, C, V>> cellSet;
45 private RegularImmutableTable(ImmutableSet<Cell<R, C, V>> cellSet) {
49 private static final Function<Cell<Object, Object, Object>, Object>
51 new Function<Cell<Object, Object, Object>, Object>() {
52 @Override public Object apply(Cell<Object, Object, Object> from) {
58 private Function<Cell<R, C, V>, V> getValueFunction() {
85 @Override public final ImmutableSet<Cell<R, C, V>> cellSet() {
90 List<Cell<R, C, V>> cells,
103 Comparator<Cell<R, C, V>> comparator = new Comparator<Cell<R, C, V>>()
[all...] |
| /external/skia/bench/ |
| TableBench.cpp | 25 // This trio of drawRects is then repeat for the next cell.
53 SkRect cell = SkRect::MakeLTRB(col * kCellWidth, local
57 canvas->drawRect(cell, cellPaint);
|
| /external/webkit/Source/WebCore/html/ |
| HTMLTableRowElement.cpp | 130 RefPtr<HTMLTableCellElement> cell = HTMLTableCellElement::create(tdTag, document()); local
132 appendChild(cell, ec);
139 insertBefore(cell, n, ec);
141 return cell.release();
151 RefPtr<Node> cell = children->item(index); local
152 HTMLElement::removeChild(cell.get(), ec);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TableCollectionTest.java | 27 import com.google.common.collect.Table.Cell;
416 @Override public SampleElements<Cell<String, Integer, Character>>
418 return new SampleElements<Cell<String, Integer, Character>>(
425 @Override public Set<Cell<String, Integer, Character>> create(
430 Cell<String, Integer, Character> cell
431 = (Cell<String, Integer, Character>) element;
432 columnKeys.add(cell.getColumnKey());
438 Cell<String, Integer, Character> cell
679 Cell<String, Integer, Character> cell local
[all...] |
| /external/webkit/Source/WebCore/accessibility/ |
| AccessibilityARIAGridRow.cpp | 133 AccessibilityObject* cell = rowChildren[i].get(); local
134 if (cell->ariaRoleAttribute() == RowHeaderRole)
135 return cell;
|
| AccessibilityTableColumn.cpp | 97 AccessibilityObject* cell = rowChildren[i].get(); local
98 if (cell->ariaRoleAttribute() == ColumnHeaderRole)
99 return cell;
136 RenderTableCell* cell = 0;
143 // we've reached a cell that doesn't even overlap our column
155 cell = testCell;
158 if (!cell)
161 return m_parentTable->axObjectCache()->getOrCreate(cell);
187 AccessibilityTableCell* cell = m_parentTable->cellForColumnAndRow(m_columnIndex, i); local
188 if (!cell)
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderTableRow.cpp | 100 // If beforeChild is inside an anonymous cell, insert into the cell.
106 RenderTableCell* cell = new (renderArena()) RenderTableCell(document() /* anonymous object */); local
110 cell->setStyle(newStyle.release());
111 addChild(cell, beforeChild);
112 cell->addChild(child);
116 // If the next renderer is actually wrapped in an anonymous table cell, we need to go up and find that.
120 RenderTableCell* cell = toRenderTableCell(child); local
124 section()->addCell(cell, this);
127 RenderBox::addChild(cell, beforeChild)
144 RenderTableCell* cell = toRenderTableCell(child); local
220 RenderTableCell* cell = toRenderTableCell(child); local
[all...] |
| /external/clang/test/CodeGenCXX/ |
| empty-classes.cpp | 61 FreeCell cell; member in union:PR8796::ThingOrCell
|
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| HTMLTable.java | 87 private static class Cell extends IElement.Factory.ElementImpl
97 Cell (Tag tag)
110 final ICell cell = new Cell (m_th ? Tag.TH : Tag.TD); local
111 add (cell);
113 return cell;
|
| /external/valgrind/main/memcheck/tests/ |
| leak-pool.c | 9 struct cell struct
11 struct cell *next;
92 struct cell *cells_static[N];
97 struct cell *cells_local[N];
101 struct cell **cells = static_roots ? cells_static : cells_local;
114 cells[i] = allocate_from_pool(p, sizeof(struct cell));
119 p->buf+(10 * sizeof(struct cell)),
120 20 * sizeof(struct cell) + 2);
|
| /external/iproute2/tc/ |
| q_cbq.c | 32 fprintf(stderr, " [ prio NUMBER ] [ cell BYTES ] [ ewma LOG ]\n");
41 fprintf(stderr, " [ cell BYTES ] [ ewma LOG ]\n");
83 } else if (matches(*argv, "cell") == 0) {
84 unsigned cell; local
87 if (get_size(&cell, *argv)) {
88 explain1("cell");
92 if ((1<<i) == cell)
95 fprintf(stderr, "cell must be 2^n\n");
262 } else if (matches(*argv, "cell") == 0) {
263 unsigned cell; local
[all...] |
