| /external/guava/guava/src/com/google/common/collect/ |
| D | RegularImmutableTable.java | 37 abstract Cell<R, C, V> getCell(int iterationIndex); in getCell()
40 final ImmutableSet<Cell<R, C, V>> createCellSet() { in createCellSet()
41 return isEmpty() ? ImmutableSet.<Cell<R, C, V>>of() : new CellSet(); in createCellSet()
44 private final class CellSet extends ImmutableSet<Cell<R, C, V>> {
51 public UnmodifiableIterator<Cell<R, C, V>> iterator() { in iterator()
56 ImmutableList<Cell<R, C, V>> createAsList() { in createAsList()
57 return new ImmutableAsList<Cell<R, C, V>>() { in createAsList()
59 public Cell<R, C, V> get(int index) { in createAsList()
64 ImmutableCollection<Cell<R, C, V>> delegateCollection() { in createAsList()
72 if (object instanceof Cell) { in contains()
[all …]
|
| D | AbstractTable.java | 101 for (Table.Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) { in putAll()
106 private transient Set<Cell<R, C, V>> cellSet;
109 public Set<Cell<R, C, V>> cellSet() { in cellSet()
110 Set<Cell<R, C, V>> result = cellSet; in cellSet()
114 Set<Cell<R, C, V>> createCellSet() { in createCellSet()
118 abstract Iterator<Table.Cell<R, C, V>> cellIterator(); in cellIterator()
120 class CellSet extends AbstractSet<Cell<R, C, V>> {
123 if (o instanceof Cell) { in contains()
124 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) o; in contains()
134 if (o instanceof Cell) { in remove()
[all …]
|
| D | ImmutableTable.java | 51 ImmutableList.<Cell<Object, Object, Object>>of(),
93 Cell<? extends R, ? extends C, ? extends V> onlyCell in copyOf()
98 ImmutableSet.Builder<Cell<R, C, V>> cellSetBuilder in copyOf()
100 for (Cell<? extends R, ? extends C, ? extends V> cell : in copyOf()
126 static <R, C, V> Cell<R, C, V> cellOf(R rowKey, C columnKey, V value) { in cellOf()
158 private final List<Cell<R, C, V>> cells = Lists.newArrayList();
201 Cell<? extends R, ? extends C, ? extends V> cell) { in put()
207 Cell<R, C, V> immutableCell = (Cell<R, C, V>) cell; in put()
224 for (Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) { in putAll()
252 @Override public ImmutableSet<Cell<R, C, V>> cellSet() { in cellSet()
[all …]
|
| D | Tables.java | 27 import com.google.common.collect.Table.Cell;
65 public static <R, C, V> Cell<R, C, V> immutableCell( in immutableCell()
99 abstract static class AbstractCell<R, C, V> implements Cell<R, C, V> {
107 if (obj instanceof Cell) { in equals()
108 Cell<?, ?, ?> other = (Cell<?, ?, ?>) obj; in equals()
239 private static final Function<Cell<?, ?, ?>, Cell<?, ?, ?>> TRANSPOSE_CELL =
240 new Function<Cell<?, ?, ?>, Cell<?, ?, ?>>() {
242 public Cell<?, ?, ?> apply(Cell<?, ?, ?> cell) {
250 Iterator<Cell<C, R, V>> cellIterator() { in cellIterator()
389 Function<Cell<R, C, V1>, Cell<R, C, V2>> cellFunction() { in cellFunction()
[all …]
|
| /external/guava/guava/src/com/google/common/cache/ |
| D | Striped64.java | 95 static final class Cell { class in Striped64
101 Cell(long x) { value = x; } in Cell() method in Striped64.Cell
107 private static final AtomicLongFieldUpdater<Cell> valueUpdater =
108 AtomicLongFieldUpdater.newUpdater(Cell.class, "value");
145 transient volatile Cell[] cells;
204 Cell[] as; Cell a; int n; long v; in retryUpdate()
208 Cell r = new Cell(x); // Optimistically create in retryUpdate()
212 Cell[] rs; int m, j; in retryUpdate()
240 Cell[] rs = new Cell[n << 1]; in retryUpdate()
258 Cell[] rs = new Cell[2]; in retryUpdate()
[all …]
|
| D | LongAdder.java | 70 Cell[] as; long b, v; HashCode hc; Cell a; int n; in add()
106 Cell[] as = cells; in sum()
110 Cell a = as[i]; in sum()
141 Cell[] as = cells; in sumThenReset()
146 Cell a = as[i]; in sumThenReset()
|
| /external/markdown/tests/extensions-x-tables/ |
| D | tables.txt | 6 Content Cell | Content Cell
7 Content Cell | Content Cell
11 | Content Cell | Content Cell |
12 | Content Cell | Content Cell |
|
| /external/markdown/docs/extensions/ |
| D | Tables.txt | 22 Content Cell | Content Cell
23 Content Cell | Content Cell
36 <td>Content Cell</td>
37 <td>Content Cell</td>
41 <td>Content Cell</td>
42 <td>Content Cell</td>
|
| /external/ceres-solver/internal/ceres/ |
| D | visibility_test.cc | 69 row.cells.push_back(Cell(0, 0)); in TEST()
70 row.cells.push_back(Cell(5, 0)); in TEST()
79 row.cells.push_back(Cell(0, 1)); in TEST()
80 row.cells.push_back(Cell(3, 1)); in TEST()
89 row.cells.push_back(Cell(1, 2)); in TEST()
90 row.cells.push_back(Cell(2, 2)); in TEST()
99 row.cells.push_back(Cell(1, 3)); in TEST()
100 row.cells.push_back(Cell(4, 3)); in TEST()
149 row.cells.push_back(Cell(0, 0)); in TEST()
158 row.cells.push_back(Cell(0, 1)); in TEST()
[all …]
|
| D | block_structure.h | 58 struct Cell { struct
59 Cell() : block_id(-1), position(-1) {} in Cell() argument
60 Cell(int block_id_, int position_) in Cell() argument
70 bool CellLessThan(const Cell& lhs, const Cell& rhs); argument
74 vector<Cell> cells;
|
| D | linear_least_squares_problems.cc | 315 row.cells.push_back(Cell(0, 0)); in LinearLeastSquaresProblem2()
316 row.cells.push_back(Cell(2, 1)); in LinearLeastSquaresProblem2()
328 row.cells.push_back(Cell(0, 2)); in LinearLeastSquaresProblem2()
329 row.cells.push_back(Cell(3, 3)); in LinearLeastSquaresProblem2()
341 row.cells.push_back(Cell(1, 4)); in LinearLeastSquaresProblem2()
342 row.cells.push_back(Cell(4, 5)); in LinearLeastSquaresProblem2()
354 row.cells.push_back(Cell(1, 6)); in LinearLeastSquaresProblem2()
355 row.cells.push_back(Cell(2, 7)); in LinearLeastSquaresProblem2()
367 row.cells.push_back(Cell(1, 8)); in LinearLeastSquaresProblem2()
368 row.cells.push_back(Cell(2, 9)); in LinearLeastSquaresProblem2()
[all …]
|
| D | partitioned_matrix_view_impl.h | 64 const vector<Cell>& cells = bs->rows[r].cells; in PartitionedMatrixView()
106 const Cell& cell = bs->rows[r].cells[0]; in RightMultiplyE()
134 const vector<Cell>& cells = bs->rows[r].cells; in RightMultiplyF()
149 const vector<Cell>& cells = bs->rows[r].cells; in RightMultiplyF()
172 const Cell& cell = bs->rows[r].cells[0]; in LeftMultiplyE()
200 const vector<Cell>& cells = bs->rows[r].cells; in LeftMultiplyF()
215 const vector<Cell>& cells = bs->rows[r].cells; in LeftMultiplyF()
257 row.cells.push_back(Cell()); in CreateBlockDiagonalMatrixLayout()
258 Cell& cell = row.cells.back(); in CreateBlockDiagonalMatrixLayout()
309 const Cell& cell = bs->rows[r].cells[0]; in UpdateBlockDiagonalEtE()
[all …]
|
| D | block_sparse_matrix.cc | 67 const vector<Cell>& cells = block_structure_->rows[i].cells; in BlockSparseMatrix()
95 const vector<Cell>& cells = block_structure_->rows[i].cells; in RightMultiply()
115 const vector<Cell>& cells = block_structure_->rows[i].cells; in LeftMultiply()
133 const vector<Cell>& cells = block_structure_->rows[i].cells; in SquaredColumnNorm()
150 const vector<Cell>& cells = block_structure_->rows[i].cells; in ScaleColumns()
172 const vector<Cell>& cells = block_structure_->rows[i].cells; in ToDenseMatrix()
195 const vector<Cell>& cells = block_structure_->rows[i].cells; in ToTripletSparseMatrix()
225 const vector<Cell>& cells = block_structure_->rows[i].cells; in ToTextFile()
|
| D | block_structure.cc | 36 bool CellLessThan(const Cell& lhs, const Cell& rhs) { in CellLessThan()
|
| /external/clang/test/Analysis/inlining/ |
| D | retain-count-self-init.m | 27 @interface Cell : ParentOfCell{ interface
34 @implementation Cell implementation
59 Cell *sharedCell1 = [[Cell alloc] init];
61 Cell *sharedCell2 = [[Cell alloc] initWithInt: 3];
63 Cell *sharedCell3 = [[Cell alloc] initWithIntGood: 3];
|
| D | assume-super-init-does-not-return-nil.m | 17 @interface Cell : NSObject { interface
24 @implementation Cell implementation
37 Cell *newCell = [[Cell alloc] init];
|
| D | RetainCountExamples.m | 42 @interface Cell : ParentOfCell{ interface
50 @implementation Cell implementation
58 Cell *sharedCell3 = [[Cell alloc] initWithInt: 3];
63 Cell *sharedCell4 = [[Cell alloc] initWithInt: 3]; // expected-warning {{leak}}
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | TablesTest.java | 21 import com.google.common.collect.Table.Cell;
37 Cell<String, Integer, Character> entry in testImmutableEntrySerialization()
43 Cell<String, Integer, Character> entry in testImmutableEntryToString()
47 Cell<String, Integer, Character> nullEntry in testImmutableEntryToString()
53 Cell<String, Integer, Character> entry in testEntryEquals()
66 Cell<String, Integer, Character> entry in testEntryEqualsNull()
|
| D | TableCollectionTest.java | 25 import com.google.common.collect.Table.Cell;
363 @Override public SampleElements<Cell<String, Integer, Character>> in suite()
365 return new SampleElements<Cell<String, Integer, Character>>( in suite()
372 @Override public Set<Cell<String, Integer, Character>> create( in suite()
377 Cell<String, Integer, Character> cell in suite()
378 = (Cell<String, Integer, Character>) element; in suite()
385 Cell<String, Integer, Character> cell in suite()
386 = (Cell<String, Integer, Character>) element; in suite()
439 public Set<Cell<String, Integer, Character>> create( in suite()
444 Cell<String, Integer, Character> cell in suite()
[all …]
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_addrhashmap.h | 46 struct Cell { struct
54 Cell cells[1]; // variable len argument
62 Cell cells[kBucketSize];
83 Cell *cell_;
175 Cell *c = &b->cells[i]; in acquire()
188 Cell *c = &add->cells[i]; in acquire()
204 Cell *c = &b->cells[i]; in acquire()
220 Cell *c = &add->cells[i]; in acquire()
244 Cell *c = &b->cells[i]; in acquire()
277 Cell *c = &add->cells[i]; in acquire()
[all …]
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| D | TablesTest.java | 20 import com.google.common.collect.Table.Cell;
34 Cell<String, Integer, Character> entry in testImmutableEntryToString()
38 Cell<String, Integer, Character> nullEntry in testImmutableEntryToString()
44 Cell<String, Integer, Character> entry in testEntryEquals()
57 Cell<String, Integer, Character> entry in testEntryEqualsNull()
|
| D | TableCollectionTest.java | 21 import com.google.common.collect.Table.Cell;
93 implements TestSetGenerator<Cell<String, Integer, Character>> {
95 public SampleElements<Cell<String, Integer, Character>> samples() { in samples()
96 return new SampleElements<Cell<String, Integer, Character>>( in samples()
105 public Set<Cell<String, Integer, Character>> create( in create()
110 Cell<String, Integer, Character> cell in create()
111 = (Cell<String, Integer, Character>) element; in create()
121 public Cell<String, Integer, Character>[] createArray(int length) { in createArray()
122 return (Cell<String, Integer, Character>[]) new Cell<?, ?, ?>[length]; in createArray()
126 public List<Cell<String, Integer, Character>> order( in order()
[all …]
|
| /external/v8/tools/ |
| D | consarray.js | 40 this.tail_ = new ConsArray.Cell(null, null);
56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
89 ConsArray.Cell = function(data, next) { class in ConsArray
|
| /external/emma/core/java12/com/vladium/emma/report/html/doc/ |
| D | HTMLTable.java | 87 private static class Cell extends IElement.Factory.ElementImpl class in HTMLTable
97 Cell (Tag tag) in Cell() method in HTMLTable.Cell
110 final ICell cell = new Cell (m_th ? Tag.TH : Tag.TD); in newCell()
|
| /external/v8/src/mips64/ |
| D | assembler-mips64-inl.h | 242 Handle<Cell> RelocInfo::target_cell_handle() { in target_cell_handle()
245 return Handle<Cell>(reinterpret_cast<Cell**>(address)); in target_cell_handle()
249 Cell* RelocInfo::target_cell() { in target_cell()
251 return Cell::FromValueAddress(Memory::Address_at(pc_)); in target_cell()
255 void RelocInfo::set_target_cell(Cell* cell, in set_target_cell()
259 Address address = cell->address() + Cell::kValueOffset; in set_target_cell()
|