| /external/libtextclassifier/common/ |
| registry.h | 144 const Cell *old_cell = FindCell(key);
149 Cell *new_cell = new Cell(key, value, head_);
157 const Cell *cell = FindCell(key); local
158 if (cell == nullptr) {
161 return (cell == nullptr) ? nullptr : cell->value();
170 // Cell for the singly-linked list underlying this ComponentRegistry. Each
171 // cell contains a key, the value for that key, as well as a pointer to th
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| Striped64.java | 31 * Table entries are of class Cell; a variant of AtomicLong padded
62 * available, a new Cell is created. Otherwise, if the slot
78 * It is possible for a Cell to become unused when threads that
95 static final class Cell {
101 Cell(long x) { value = x; }
107 private static final AtomicLongFieldUpdater<Cell> valueUpdater =
108 AtomicLongFieldUpdater.newUpdater(Cell.class, "value");
130 transient volatile Cell[] cells;
168 * @param currentValue the current value (of either base or a cell)
196 Cell[] as; Cell a; int n; long v
[all...] |
| LongAdder.java | 70 Cell[] as; long b, v; int[] hc; Cell a; int n;
106 Cell[] as = cells;
110 Cell a = as[i];
141 Cell[] as = cells;
146 Cell a = as[i];
|
| /libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
| LongAdder.java | 86 Cell[] as; long b, v; int m; Cell a;
120 Cell[] as = cells;
123 for (Cell a : as)
138 Cell[] as = cells;
141 for (Cell a : as)
158 Cell[] as = cells;
162 for (Cell a : as) {
|
| Striped64.java | 57 * Table entries are of class Cell; a variant of AtomicLong padded
91 * available, a new Cell is created. Otherwise, if the slot
107 * It is possible for a Cell to become unused when threads that
123 static final class Cell {
125 Cell(long x) { value = x; }
142 (Cell.class.getDeclaredField("value"));
155 transient volatile Cell[] cells;
231 Cell[] as; Cell a; int n; long v;
234 if (cellsBusy == 0) { // Try to attach new Cell
[all...] |
| DoubleAccumulator.java | 103 Cell[] as; long b, v, r; int m; Cell a;
130 Cell[] as = cells;
133 for (Cell a : as)
150 Cell[] as = cells;
153 for (Cell a : as)
170 Cell[] as = cells;
174 for (Cell a : as) {
|
| DoubleAdder.java | 90 Cell[] as; long b, v; int m; Cell a;
118 Cell[] as = cells;
121 for (Cell a : as)
136 Cell[] as = cells;
139 for (Cell a : as)
156 Cell[] as = cells;
160 for (Cell a : as) {
|
| LongAccumulator.java | 105 Cell[] as; long b, v, r; int m; Cell a;
128 Cell[] as = cells;
131 for (Cell a : as)
147 Cell[] as = cells;
150 for (Cell a : as)
167 Cell[] as = cells;
171 for (Cell a : as) {
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| cons.h | 21 // have a "head" and a "tail" element. A cell's head element contains
23 // null) pointer to another cell.
32 // function, which will allocate a new cons cell. Notably, cons lists
58 class Cell;
62 // List represents a (possibly null) pointer to a cons cell.
64 using List = std::shared_ptr<const Cell<T>>;
69 return std::make_shared<Cell<T>>(head, std::move(tail));
72 // Cell represents an individual "cons cell" within a cons list.
74 class Cell {
[all...] |
| /external/gemmlowp/internal/ |
| kernel_reference.h | 40 Format::Lhs::kCells, Format::Lhs::Cell::kWidth,
41 Format::Lhs::Cell::kDepth,
42 CellOrderName(Format::Lhs::Cell::kOrder), Format::Rhs::kCells,
43 Format::Rhs::Cell::kDepth, Format::Rhs::Cell::kWidth,
44 CellOrderName(Format::Rhs::Cell::kOrder));
64 Format::Lhs::Cell::kWidth * Format::kDepth;
68 Format::Rhs::Cell::kWidth * Format::kDepth;
70 // Now we are inside one cell of the Lhs and inside one cell
[all...] |
| kernel.h | 95 // 3 cells, each cell having dimensions (width=3, depth=4), laid out in
122 // a cell (see explanation above).
126 // out in a cell. That is, a CellOrder together with actual dimensions.
144 typedef tCellFormat Cell;
146 static const int kWidth = kCells * Cell::kWidth;
147 static const int kDepth = Cell::kDepth;
163 static_assert(Lhs::Cell::kDepth == Rhs::Cell::kDepth, "");
164 static const int kDepth = Lhs::Cell::kDepth;
165 static const int kRows = Lhs::Cell::kWidth * Lhs::kCells
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableTable.java | 37 abstract Cell<R, C, V> getCell(int iterationIndex);
40 final ImmutableSet<Cell<R, C, V>> createCellSet() {
41 return isEmpty() ? ImmutableSet.<Cell<R, C, V>>of() : new CellSet();
44 private final class CellSet extends ImmutableSet<Cell<R, C, V>> {
51 public UnmodifiableIterator<Cell<R, C, V>> iterator() {
56 ImmutableList<Cell<R, C, V>> createAsList() {
57 return new ImmutableAsList<Cell<R, C, V>>() {
59 public Cell<R, C, V> get(int index) {
64 ImmutableCollection<Cell<R, C, V>> delegateCollection() {
72 if (object instanceof Cell) {
73 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) object; local
[all...] |
| AbstractTable.java | 101 for (Table.Cell<? extends R, ? extends C, ? extends V> cell : table.cellSet()) {
102 put(cell.getRowKey(), cell.getColumnKey(), cell.getValue());
106 private transient Set<Cell<R, C, V>> cellSet;
109 public Set<Cell<R, C, V>> cellSet() {
110 Set<Cell<R, C, V>> result = cellSet;
114 Set<Cell<R, C, V>> createCellSet() {
118 abstract Iterator<Table.Cell<R, C, V>> cellIterator()
124 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) o; local
135 Cell<?, ?, ?> cell = (Cell<?, ?, ?>) o; local
[all...] |
| ImmutableTable.java | 51 ImmutableList.<Cell<Object, Object, Object>>of(),
60 /** Returns an immutable table containing a single cell. */
93 Cell<? extends R, ? extends C, ? extends V> onlyCell
98 ImmutableSet.Builder<Cell<R, C, V>> cellSetBuilder
100 for (Cell<? extends R, ? extends C, ? extends V> cell :
103 * Must cast to be able to create a Cell<R, C, V> rather than a
104 * Cell<? extends R, ? extends C, ? extends V>
106 cellSetBuilder.add(cellOf((R) cell.getRowKey(),
107 (C) cell.getColumnKey(), (V) cell.getValue()))
[all...] |
| Tables.java | 27 import com.google.common.collect.Table.Cell;
56 * Returns an immutable cell with the specified row key, column key, and
59 * <p>The returned cell is serializable.
61 * @param rowKey the row key to be associated with the returned cell
62 * @param columnKey the column key to be associated with the returned cell
63 * @param value the value to be associated with the returned cell
65 public static <R, C, V> Cell<R, C, V> immutableCell(
99 abstract static class AbstractCell<R, C, V> implements Cell<R, C, V> {
107 if (obj instanceof Cell) {
108 Cell<?, ?, ?> other = (Cell<?, ?, ?>) obj
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TablesTest.java | 20 import com.google.common.collect.Table.Cell;
34 Cell<String, Integer, Character> entry
38 Cell<String, Integer, Character> nullEntry
44 Cell<String, Integer, Character> entry
57 Cell<String, Integer, Character> entry
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TablesTest.java | 21 import com.google.common.collect.Table.Cell;
37 Cell<String, Integer, Character> entry
43 Cell<String, Integer, Character> entry
47 Cell<String, Integer, Character> nullEntry
53 Cell<String, Integer, Character> entry
66 Cell<String, Integer, Character> entry
|
| /external/libchrome/base/trace_event/ |
| heap_profiler_allocation_register.h | 57 cells_(static_cast<Cell*>(
58 AllocateGuardedVirtualMemory(num_cells_ * sizeof(Cell)))),
65 FreeGuardedVirtualMemory(cells_, num_cells_ * sizeof(Cell));
70 Cell** p_cell = Lookup(key);
71 Cell* cell = *p_cell; local
72 if (cell) {
73 return {static_cast<KVIndex>(cell - cells_), false}; // not inserted
76 // Get a free cell and link it.
77 *p_cell = cell = GetFreeCell()
91 Cell* cell = &cells_[index]; local
106 Cell* cell = *Lookup(key); local
182 Cell* cell = free_list_; local
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/HiiDatabaseDxe/ |
| Font.c | 43 Insert a character cell information to the list specified by GlyphInfoList.
50 @param Cell Incoming character cell information.
52 @retval EFI_SUCCESS Cell information is added to the GlyphInfoList.
61 IN EFI_HII_GLYPH_INFO *Cell
66 ASSERT (Cell != NULL && GlyphInfoList != NULL);
74 // GlyphInfoList stores a list of default character cell information, each is
79 if (Cell->AdvanceX == 0) {
80 Cell->AdvanceX = Cell->Width;
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 46 struct Cell {
54 Cell cells[1]; // variable len
62 Cell cells[kBucketSize];
83 Cell *cell_;
175 Cell *c = &b->cells[i];
188 Cell *c = &add->cells[i];
204 Cell *c = &b->cells[i];
220 Cell *c = &add->cells[i];
242 // See if we have a free embed cell.
244 Cell *c = &b->cells[i]
[all...] |
| /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;
|
| /frameworks/base/core/java/com/android/internal/widget/ |
| LockPatternView.java | 102 private final ArrayList<Cell> mPattern = new ArrayList<Cell>(9);
152 * Represents a cell in the 3 X 3 matrix of the unlock pattern view.
154 public static final class Cell {
159 private static final Cell[][] sCells = createCells();
161 private static Cell[][] createCells() {
162 Cell[][] res = new Cell[3][3];
165 res[i][j] = new Cell(i, j);
172 * @param row The row of the cell
688 final Cell cell = checkForNewHit(x, y); local
1072 final Cell cell = pattern.get(i); local
[all...] |
| LockPatternChecker.java | 64 final List<LockPatternView.Cell> pattern,
70 private List<LockPatternView.Cell> patternCopy;
107 final List<LockPatternView.Cell> pattern,
112 private List<LockPatternView.Cell> patternCopy;
|
| /external/v8/src/ |
| compilation-cache.h | 88 Handle<Cell> literals);
123 Handle<Context> native_context, Handle<Cell> literals, int position);
178 Handle<Cell> literals);
184 Handle<SharedFunctionInfo> function_info, Handle<Cell> literals,
|
| /external/autotest/frontend/client/src/autotest/common/ui/ |
| RightClickTable.java | 43 public HTMLTable.Cell getCellForDomEvent(DomEvent<?> event) {
52 return new HTMLTable.Cell(position.row, position.column) {
|
