| /external/v8/tools/ |
| consarray.js | 40 this.tail_ = new ConsArray.Cell(null, null);
56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
85 * A cell object used for constructing a list in ConsArray.
89 ConsArray.Cell = function(data, next) {
|
| /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/opencv3/modules/videostab/include/opencv2/videostab/ |
| outlier_rejection.hpp | 92 typedef std::vector<int> Cell;
93 std::vector<Cell> grid_;
|
| /external/ceres-solver/internal/ceres/ |
| 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;
|
| /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/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...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Table.java | 115 * equal when their cell views, as returned by {@link #cellSet}, are equal.
122 * as the hash code of its cell view, as returned by {@link #cellSet}.
196 * returned set will update the underlying table, and vice versa. The cell set
202 Set<Cell<R, C, V>> cellSet();
264 interface Cell<R, C, V> {
266 * Returns the row key of this cell.
271 * Returns the column key of this cell.
276 * Returns the value of this cell.
281 * Compares the specified object with this cell for equality. Two cells are
288 * Returns the hash code of this cell
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/maps/tiled/ |
| TiledMapTileLayer.java | 30 private Cell[][] cells;
64 this.cells = new Cell[width][height];
69 * @return {@link Cell} at (x, y) */
70 public Cell getCell (int x, int y) {
76 /** Sets the {@link Cell} at the given coordinates.
80 * @param cell the {@link Cell} to set at the given coordinates. */
81 public void setCell (int x, int y, Cell cell) {
84 cells[x][y] = cell;
[all...] |
| /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/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/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...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSparseSDF.h | 55 struct Cell
62 Cell* next;
68 btAlignedObjectArray<Cell*> cells;
94 Cell* pc=cells[i];
98 Cell* pn=pc->next;
115 Cell*& root=cells[i];
116 Cell* pp=0;
117 Cell* pc=root;
120 Cell* pn=pc->next;
141 Cell*& root=cells[i]
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| 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...] |
| /ndk/sources/host-tools/nawk-20071023/ |
| 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...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| btSparseSdf3.java | 136 static public class Cell extends BulletBase {
139 protected Cell(final String className, long cPtr, boolean cMemoryOwn) {
144 /** Construct a new Cell, normally you should not need this constructor it's intended for low-level usage. */
145 public Cell(long cPtr, boolean cMemoryOwn) {
146 this("Cell", cPtr, cMemoryOwn);
157 public static long getCPtr(Cell obj) {
221 public void setNext(btSparseSdf3.Cell value) {
222 SoftbodyJNI.btSparseSdf3_Cell_next_set(swigCPtr, this, btSparseSdf3.Cell.getCPtr(value), value);
225 public btSparseSdf3.Cell getNext() {
227 return (cPtr == 0) ? null : new btSparseSdf3.Cell(cPtr, false)
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/scenes/scene2d/ui/ |
| Cell.java | 11 /** A cell for a {@link Table}.
13 public class Cell<T extends Actor> implements Poolable {
20 static private Cell defaults;
43 public Cell () {
51 /** Sets the actor in this cell and adds the actor to the cell's table. If null, removes any current actor. */
52 public <A extends Actor> Cell<A> setActor (A newActor) {
58 return (Cell<A>)this;
61 /** Removes the current actor for the cell, if any. */
62 public Cell<T> clearActor ()
[all...] |
| /external/bzip2/ |
| bzip2.c | [all...] |
| /external/clang/lib/CodeGen/ |
| TargetInfo.cpp | 65 llvm::Value *Cell =
67 Builder.CreateAlignedStore(Value, Cell, CharUnits::One());
[all...] |
| /frameworks/base/core/java/com/android/internal/widget/ |
| LockPatternView.java | 101 private final ArrayList<Cell> mPattern = new ArrayList<Cell>(9);
147 * Represents a cell in the 3 X 3 matrix of the unlock pattern view.
149 public static final class Cell {
154 private static final Cell[][] sCells = createCells();
156 private static Cell[][] createCells() {
157 Cell[][] res = new Cell[3][3];
160 res[i][j] = new Cell(i, j);
167 * @param row The row of the cell
674 final Cell cell = checkForNewHit(x, y); local
1058 final Cell cell = pattern.get(i); local
[all...] |
| /external/v8/src/ |
| factory.cc | 1572 Handle<PropertyCell> cell = NewPropertyCell(); local
2332 WeakCell* cell = WeakCell::cast(result); local
2341 Handle<WeakCell> cell = NewWeakCell(map); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| adomd.h | 28 typedef struct Cell Cell;
224 virtual HRESULT WINAPI get_Item(SAFEARRAY **idx,Cell **ppvObject) = 0;
248 HRESULT (WINAPI *get_Item)(ICellset *This,SAFEARRAY **idx,Cell **ppvObject);
289 HRESULT WINAPI ICellset_get_Item_Proxy(ICellset *This,SAFEARRAY **idx,Cell **ppvObject);
321 struct Cell : public IDispatch {
334 HRESULT (WINAPI *QueryInterface)(Cell *This,REFIID riid,void **ppvObject);
335 ULONG (WINAPI *AddRef)(Cell *This);
336 ULONG (WINAPI *Release)(Cell *This);
337 HRESULT (WINAPI *GetTypeInfoCount)(Cell *This,UINT *pctinfo)
[all...] |
| /external/clang/test/SemaCXX/ |
| warn-thread-safety-analysis.cpp | 1934 Cell<int> cell; local
3557 Cell<int> cell; local
3570 Cell<int> cell; local
3591 Cell<int> cell; local
3607 Cell<int> cell; local
[all...] |
| /external/emma/lib/ |
| emma.jar | |
| /external/libgdx/backends/gdx-backends-gwt/libs/ |
| gwt-user.jar | |
| /external/owasp/sanitizer/tools/emma/lib/ |
| emma.jar | |
