| /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...] |
| /external/ceres-solver/internal/ceres/ |
| block_structure.cc | 36 bool CellLessThan(const Cell& lhs, const Cell& rhs) {
|
| block_structure.h | 58 struct Cell {
59 Cell() : block_id(-1), position(-1) {}
60 Cell(int block_id_, int position_)
65 // Where in the values array of the jacobian is this cell located.
69 // Order cell by their block_id;
70 bool CellLessThan(const Cell& lhs, const Cell& rhs);
74 vector<Cell> cells;
|
| visibility_test.cc | 69 row.cells.push_back(Cell(0, 0));
70 row.cells.push_back(Cell(5, 0));
79 row.cells.push_back(Cell(0, 1));
80 row.cells.push_back(Cell(3, 1));
89 row.cells.push_back(Cell(1, 2));
90 row.cells.push_back(Cell(2, 2));
99 row.cells.push_back(Cell(1, 3));
100 row.cells.push_back(Cell(4, 3));
149 row.cells.push_back(Cell(0, 0));
158 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...] |
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| cons.h | 20 // have a "head" and a "tail" element. A cell's head element contains
22 // null) pointer to another cell.
31 // function, which will allocate a new cons cell. Notably, cons lists
57 class Cell;
61 // List represents a (possibly null) pointer to a cons cell.
63 using List = scoped_refptr<const Cell<T>>;
68 return List<T>(new const Cell<T>(head, tail));
71 // Cell represents an individual "cons cell" within a cons list.
73 class Cell : public base::RefCounted<Cell<T>>
[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];
|
| /external/gemmlowp/internal/ |
| 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;
157 static_assert(Lhs::Cell::kDepth == Rhs::Cell::kDepth, "");
158 static const int kDepth = Lhs::Cell::kDepth;
159 static const int kRows = Lhs::Cell::kWidth * Lhs::kCells
[all...] |
| 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 *
69 Format::Rhs::Cell::kWidth *
72 // Now we are inside one cell of the Lhs and inside one cell
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| LongAdder.java | 57 Cell[] as; long b, v; int m; Cell a;
91 Cell[] as = cells;
94 for (Cell a : as)
109 Cell[] as = cells;
112 for (Cell a : as)
129 Cell[] as = cells;
133 for (Cell a : as) {
|
| Striped64.java | 28 * 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
94 static final class Cell {
96 Cell(long x) { value = x; }
113 (Cell.class.getDeclaredField("value"));
126 transient volatile Cell[] cells;
202 Cell[] as; Cell a; int n; long v;
205 if (cellsBusy == 0) { // Try to attach new Cell
[all...] |
| DoubleAccumulator.java | 74 Cell[] as; long b, v, r; int m; Cell a;
101 Cell[] as = cells;
104 for (Cell a : as)
121 Cell[] as = cells;
124 for (Cell a : as)
141 Cell[] as = cells;
145 for (Cell a : as) {
|
| DoubleAdder.java | 61 Cell[] as; long b, v; int m; Cell a;
89 Cell[] as = cells;
92 for (Cell a : as)
107 Cell[] as = cells;
110 for (Cell a : as)
127 Cell[] as = cells;
131 for (Cell a : as) {
|
| LongAccumulator.java | 76 Cell[] as; long b, v, r; int m; Cell a;
99 Cell[] as = cells;
102 for (Cell a : as)
118 Cell[] as = cells;
121 for (Cell a : as)
138 Cell[] as = cells;
142 for (Cell a : as) {
|
| /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...] |
| /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
|
| /frameworks/base/graphics/java/android/graphics/ |
| Atlas.java | 169 * The algorithm starts with a single empty cell covering the entire
200 * After placing a bitmap in an empty cell, the algorithm splits
229 * fit. It will then split the now occupied cell and proceed onto
233 private final Cell mRoot = new Cell();
240 * A cell represents a sub-rectangle of the atlas. A cell is
244 private static class Cell {
251 Cell next;
255 return String.format("cell[x=%d y=%d width=%d height=%d", x, y, width, height)
274 Cell cell = mRoot.next; local
[all...] |
| /external/opencv3/modules/videostab/include/opencv2/videostab/ |
| outlier_rejection.hpp | 92 typedef std::vector<int> Cell;
93 std::vector<Cell> grid_;
|
