| /external/v8/src/ |
| circular-queue.h | 69 typedef AtomicWord Cell;
70 // Reserved values for the first cell of a record.
71 static const Cell kClear = 0; // Marks clean (processed) chunks.
72 static const Cell kEnd = -1; // Marks the end of the buffer.
76 Cell* enqueue_pos;
79 Cell* dequeue_chunk_pos;
80 Cell* dequeue_chunk_poll_pos;
81 Cell* dequeue_pos;
82 Cell* dequeue_end_pos;
85 INLINE(void WrapPositionIfNeeded(Cell** pos))
[all...] |
| circular-queue-inl.h | 46 SamplingCircularQueue::Cell** pos) {
|
| circular-queue.cc | 39 : record_size_(record_size_in_bytes / sizeof(Cell)),
42 chunk_size_(chunk_size_in_bytes_ / sizeof(Cell)),
48 buffer_(NewArray<Cell>(buffer_size_ + 1)) {
|
| /external/ceres-solver/internal/ceres/ |
| block_structure.cc | 36 bool CellLessThan(const Cell& lhs, const Cell& rhs) {
|
| block_structure.h | 60 struct Cell {
61 Cell() : block_id(-1), position(-1) {}
62 Cell(int block_id_, int position_)
67 // Where in the values array of the jacobian is this cell located.
71 // Order cell by their block_id;
72 bool CellLessThan(const Cell& lhs, const Cell& rhs);
76 vector<Cell> cells;
|
| visibility_test.cc | 66 row.cells.push_back(Cell(0, 0));
67 row.cells.push_back(Cell(5, 0));
76 row.cells.push_back(Cell(0, 1));
77 row.cells.push_back(Cell(3, 1));
86 row.cells.push_back(Cell(1, 2));
87 row.cells.push_back(Cell(2, 2));
96 row.cells.push_back(Cell(1, 3));
97 row.cells.push_back(Cell(4, 3));
146 row.cells.push_back(Cell(0, 0));
155 row.cells.push_back(Cell(0, 1))
[all...] |
| linear_least_squares_problems.cc | 315 row.cells.push_back(Cell(0, 0));
316 row.cells.push_back(Cell(2, 1));
328 row.cells.push_back(Cell(0, 2));
329 row.cells.push_back(Cell(3, 3));
341 row.cells.push_back(Cell(1, 4));
342 row.cells.push_back(Cell(4, 5));
354 row.cells.push_back(Cell(1, 6));
355 row.cells.push_back(Cell(2, 7));
367 row.cells.push_back(Cell(1, 8));
368 row.cells.push_back(Cell(2, 9))
[all...] |
| partitioned_matrix_view.cc | 64 const vector<Cell>& cells = bs->rows[r].cells;
98 // by the first cell in each row block.
101 const Cell& cell = bs->rows[r].cells[0]; local
104 const int col_block_id = cell.block_id;
108 values + cell.position, row_block_size, col_block_size,
126 const vector<Cell>& cells = bs->rows[r].cells;
143 // by the first cell in each row block.
146 const Cell& cell = bs->rows[r].cells[0] local
212 Cell& cell = row.cells.back(); local
253 const Cell& cell = bs->rows[r].cells[0]; local
[all...] |
| block_sparse_matrix.cc | 67 const vector<Cell>& cells = block_structure_->rows[i].cells;
95 const vector<Cell>& cells = block_structure_->rows[i].cells;
115 const vector<Cell>& cells = block_structure_->rows[i].cells;
133 const vector<Cell>& cells = block_structure_->rows[i].cells;
150 const vector<Cell>& cells = block_structure_->rows[i].cells;
172 const vector<Cell>& cells = block_structure_->rows[i].cells;
195 const vector<Cell>& cells = block_structure_->rows[i].cells;
225 const vector<Cell>& cells = block_structure_->rows[i].cells;
|
| /ndk/sources/host-tools/nawk-20071023/ |
| proto.h | 31 extern void setfname(Cell *);
89 extern Node *celltonode(Cell *, int);
94 extern void defn(Cell *, Node *, Node *);
97 extern Cell *(*proctab[])(Node **, int);
105 extern void freesymtab(Cell *);
106 extern void freeelem(Cell *, const char *);
107 extern Cell *setsymtab(const char *, const char *, double, unsigned int, Array *);
110 extern Cell *lookup(const char *, Array *);
111 extern double setfval(Cell *, double);
112 extern void funnyvar(Cell *, const char *)
[all...] |
| awk.h | 76 /* Cell: all information about a variable or constant */
78 typedef struct Cell {
85 struct Cell *cnext; /* ptr to next if chained */
86 } Cell;
91 Cell **tab; /* hash table pointers */
97 extern Cell *nrloc; /* NR */
98 extern Cell *fnrloc; /* FNR */
99 extern Cell *nfloc; /* NF */
100 extern Cell *rstartloc; /* RSTART */
101 extern Cell *rlengthloc; /* RLENGTH *
[all...] |
| tran.c | 54 Cell *fsloc; /* FS */
55 Cell *nrloc; /* NR */
56 Cell *nfloc; /* NF */
57 Cell *fnrloc; /* FNR */
60 Cell *rstartloc; /* RSTART */
61 Cell *rlengthloc; /* RLENGTH */
62 Cell *symtabloc; /* SYMTAB */
64 Cell *nullloc; /* a guaranteed empty cell */
66 Cell *literal0
[all...] |
| run.c | 42 void tempfree(Cell *p) {
44 WARNING("bad csub %d in Cell %d %s",
71 Cell *tmps; /* free temporary cells for execution */
73 static Cell truecell ={ OBOOL, BTRUE, 0, 0, 1.0, NUM };
74 Cell *True = &truecell;
75 static Cell falsecell ={ OBOOL, BFALSE, 0, 0, 0.0, NUM };
76 Cell *False = &falsecell;
77 static Cell breakcell ={ OJUMP, JBREAK, 0, 0, 0.0, NUM };
78 Cell *jbreak = &breakcell;
79 static Cell contcell ={ OJUMP, JCONT, 0, 0, 0.0, NUM }
[all...] |
| lib.c | 42 Cell **fldtab; /* pointers to Cells */
55 static Cell dollar0 = { OCELL, CFLD, NULL, "", 0.0, REC|STR|DONTFREE };
56 static Cell dollar1 = { OCELL, CFLD, NULL, "", 0.0, FLD|STR|DONTFREE };
62 || (fldtab = (Cell **) malloc((nfields+1) * sizeof(Cell *))) == NULL
63 || (fldtab[0] = (Cell *) malloc(sizeof(Cell))) == NULL )
77 fldtab[i] = (Cell *) malloc(sizeof (struct Cell));
225 Cell *x
[all...] |
| parse.c | 168 Node *celltonode(Cell *a, int b)
181 extern Cell *literal0;
187 Cell *cp;
190 cp = (Cell *) (p->narg[0]);
233 void defn(Cell *v, Node *vl, Node *st) /* turn on FCN bit in definition, */
263 if (strcmp(((Cell *)(p->narg[0]))->nval, s) == 0)
|
| /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/marisa-trie/lib/marisa/ |
| cell.h | 8 class Cell {
10 Cell() : louds_pos_(0), node_(0), key_id_(0), length_(0) {}
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| cell.h | 8 class Cell {
10 Cell() : louds_pos_(0), node_(0), key_id_(0), length_(0) {}
|
| /frameworks/base/graphics/java/android/graphics/ |
| Atlas.java | 174 * The algorithm starts with a single empty cell covering the entire
205 * After placing a bitmap in an empty cell, the algorithm splits
234 * fit. It will then split the now occupied cell and proceed onto
238 private final Cell mRoot = new Cell();
246 * A cell represents a sub-rectangle of the atlas. A cell is
250 private static class Cell {
257 Cell next;
261 return String.format("cell[x=%d y=%d width=%d height=%d", x, y, width, height)
281 Cell cell = mRoot.next; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| 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...] |
| 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...] |
| Table.java | 113 * equal when their cell views, as returned by {@link #cellSet}, are equal.
120 * as the hash code of its cell view, as returned by {@link #cellSet}.
194 * returned set will update the underlying table, and vice versa. The cell set
200 Set<Cell<R, C, V>> cellSet();
263 interface Cell<R, C, V> {
265 * Returns the row key of this cell.
270 * Returns the column key of this cell.
275 * Returns the value of this cell.
280 * Compares the specified object with this cell for equality. Two cells are
287 * Returns the hash code of this cell
[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 | 78 private ArrayList<Cell> mPattern = new ArrayList<Cell>(9);
132 * Represents a cell in the 3 X 3 matrix of the unlock pattern view.
134 public static class Cell {
139 static Cell[][] sCells = new Cell[3][3];
143 sCells[i][j] = new Cell(i, j);
149 * @param row The row of the cell.
150 * @param column The column of the cell.
152 private Cell(int row, int column)
516 final Cell cell = checkForNewHit(x, y); local
817 final Cell cell = pattern.get(i); local
[all...] |
