/prebuilts/go/darwin-x86/test/bench/shootout/ |
meteor-contest.c | 41 /* The board is a 50 cell hexagonal pattern. For . . . . . 107 * 12 rotations. However, not all 12 rotations will fit on every cell, so 111 * I'm also going to record the next possible open cell for each piece and 129 /* Returns the new cell index from the specified cell in the 131 * starting cell and direction have been checked by the 134 char shift(char cell, char dir) { 137 return cell + 1; 139 if((cell / 5) % 2) 140 return cell + 7 368 char rotation, cell[5]; local [all...] |
meteor-contest.go | 53 /* The board is a 50 cell hexagonal pattern. For . . . . . 120 * 12 rotations. However, not all 12 rotations will fit on every cell, so 124 * I'm also going to record the next possible open cell for each piece and 139 /* Returns the new cell index from the specified cell in the 141 * starting cell and direction have been checked by the 144 func shift(cell, dir int8) int8 { 147 return cell + 1 149 if ((cell / 5) % 2) != 0 { 150 return cell + [all...] |
/prebuilts/go/linux-x86/test/bench/shootout/ |
meteor-contest.c | 41 /* The board is a 50 cell hexagonal pattern. For . . . . . 107 * 12 rotations. However, not all 12 rotations will fit on every cell, so 111 * I'm also going to record the next possible open cell for each piece and 129 /* Returns the new cell index from the specified cell in the 131 * starting cell and direction have been checked by the 134 char shift(char cell, char dir) { 137 return cell + 1; 139 if((cell / 5) % 2) 140 return cell + 7 368 char rotation, cell[5]; local [all...] |
meteor-contest.go | 53 /* The board is a 50 cell hexagonal pattern. For . . . . . 120 * 12 rotations. However, not all 12 rotations will fit on every cell, so 124 * I'm also going to record the next possible open cell for each piece and 139 /* Returns the new cell index from the specified cell in the 141 * starting cell and direction have been checked by the 144 func shift(cell, dir int8) int8 { 147 return cell + 1 149 if ((cell / 5) % 2) != 0 { 150 return cell + [all...] |
/external/autotest/frontend/client/src/autotest/common/spreadsheet/ |
SpreadsheetSelectionManager.java | 30 public void toggleSelected(CellInfo cell) { 31 if (selectedCells.contains(cell)) { 32 deselectCell(cell); 33 notifyDeselected(Utils.wrapObjectWithList(cell)); 35 selectCell(cell); 36 notifySelected(Utils.wrapObjectWithList(cell)); 40 private void selectCell(CellInfo cell) { 41 selectedCells.add(cell); 42 spreadsheet.setHighlighted(cell, true); 45 private void deselectCell(CellInfo cell) { [all...] |
/external/gemmlowp/internal/ |
pack_neon.h | 173 typedef typename KernelSideFormat::Cell CellFormat; 214 for (int cell = 0; cell < kCells; cell++) { 216 src_lines_intertwined_4x[2 * cell + outer].val[inner]); 220 for (int cell = 0; cell < kCells; cell++) { 222 src_lines_intertwined_4x[2 * cell + outer].val[inner]); 233 for (int cell = 0; cell < kCells; cell++) [all...] |
kernel_neon.h | 78 // A 2x4 cell of Rhs is stored in 16bit in d0--d1 (q0). 112 // Load 1 Rhs cell of size 2x4 302 // stored in diagonal-major order like this for the first 4x4 cell: 309 // and likewise for the 2nd cell (16--31) and 3rd cell (32--47) 412 // A 2x4 cell of Rhs is stored in 8bit in d0. 449 /* Load 1 Rhs cell of size 2x4 */ \ 732 // Load 1 Rhs cell of size 2x8 [all...] |
/external/autotest/frontend/client/src/autotest/common/table/ |
TableRenderer.java | 15 private static final String NONCLICKABLE_CLASS = "spreadsheet-cell-nonclickable"; 31 for (CellInfo cell : row) { 32 if (cell == null && renderNull) { 34 } else if (cell != null) { 36 if (cell.cssClass != null) { 37 tdAttributes += attributeString("class", cell.cssClass); 39 if (cell.rowSpan > 1) { 40 tdAttributes += attributeString("rowspan", Integer.toString(cell.rowSpan)); 42 if (cell.colSpan > 1) { 43 tdAttributes += attributeString("colspan", Integer.toString(cell.colSpan)) [all...] |
TableClickWidget.java | 14 private int cell; field in class:TableClickWidget 21 int row, int cell) { 24 this.cell = cell; 40 return cell;
|
/packages/apps/Launcher3/ |
print_db.py | 70 def print_intent(out, id, i, cell): 71 if cell: 73 cgi.escape(cell, True) 77 def print_icon(out, id, i, cell): 78 if cell: 82 f.write(cell) 85 def print_icon_type(out, id, i, cell): 86 if cell == 0: 87 out.write("Application (%d)" % cell) 88 elif cell == 1 213 cell = row[i] variable [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/ctypes/test/ |
test_incomplete.py | 12 lpcell = POINTER("cell") 13 class cell(Structure): class in function:MyTestCase.test_incomplete_example 17 SetPointerType(lpcell, cell) 19 c1 = cell() 21 c2 = cell() 37 del _pointer_type_cache[cell]
|
/prebuilts/gdb/linux-x86/lib/python2.7/ctypes/test/ |
test_incomplete.py | 12 lpcell = POINTER("cell") 13 class cell(Structure): class in function:MyTestCase.test_incomplete_example 17 SetPointerType(lpcell, cell) 19 c1 = cell() 21 c2 = cell() 37 del _pointer_type_cache[cell]
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_incomplete.py | 12 lpcell = POINTER("cell") 13 class cell(Structure): class in function:MyTestCase.test_incomplete_example 17 SetPointerType(lpcell, cell) 19 c1 = cell() 21 c2 = cell() 37 del _pointer_type_cache[cell]
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_incomplete.py | 12 lpcell = POINTER("cell") 13 class cell(Structure): class in function:MyTestCase.test_incomplete_example 17 SetPointerType(lpcell, cell) 19 c1 = cell() 21 c2 = cell() 37 del _pointer_type_cache[cell]
|
/packages/apps/Launcher2/ |
print_db.py | 50 def print_intent(out, id, i, cell): 51 if cell: 53 cgi.escape(cell, True) 57 def print_icon(out, id, i, cell): 58 if cell: 62 f.write(cell) 65 def print_cell(out, id, i, cell): 66 if not cell is None: 67 out.write(cgi.escape(str(cell))) 74 def render_cell_info(out, cell, occupied) 158 cell = row[i] variable [all...] |
/external/valgrind/memcheck/tests/ |
leak-pool.c | 9 struct cell struct 11 struct cell *next; 92 struct cell *cells_static[N]; 97 struct cell *cells_local[N]; 101 struct cell **cells = static_roots ? cells_static : cells_local; 114 cells[i] = allocate_from_pool(p, sizeof(struct cell)); 119 p->buf+(10 * sizeof(struct cell)), 120 20 * sizeof(struct cell) + 2);
|
/prebuilts/gdb/darwin-x86/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
Table_Suite.py | 18 class cell(aetools.ComponentItem): class in inherits:aetools.ComponentItem 19 """cell - A cell """ 22 """formula - the formula of the cell """ 26 """protection - Indicates whether value or formula in the cell can be changed """ 30 cells = cell 53 cell._superclassnames = [] 54 cell._privpropdict = { 58 cell._privelemdict = { 87 'ccel' : cell, [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
Table_Suite.py | 18 class cell(aetools.ComponentItem): class in inherits:aetools.ComponentItem 19 """cell - A cell """ 22 """formula - the formula of the cell """ 26 """protection - Indicates whether value or formula in the cell can be changed """ 30 cells = cell 53 cell._superclassnames = [] 54 cell._privpropdict = { 58 cell._privelemdict = { 87 'ccel' : cell, [all...] |
/external/opencv3/modules/videostab/src/ |
outlier_rejection.cpp | 91 grid_.assign(ncells.area(), Cell()); 100 // process each cell 112 // estimate translation model at the current cell using RANSAC 114 const Cell &cell = grid_[ci]; local 120 if (!cell.empty()) 124 idx = cell[static_cast<unsigned>(rng) % cell.size()]; 129 for (size_t i = 0; i < cell.size(); ++i) 131 x1 = points0_[cell[i]].x + dx [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/autotest/client/cros/cellular/ |
forward_8960_screen | 53 <div>8960 in test cell <strong>%(cell)s</strong></div> 66 [cell] = sys.argv[1:] 68 print 'Usage: %s [cell-name]' % sys.argv[0] 75 c = labconfig.Configuration(['--cell=%s' % (cell)]) 77 basestation_ip = c.cell['basestations'][0]['bs_addresses'][0] 78 bastion_ip = c.cell['perfserver']['address'] 102 'cell': cell}) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/isl/ |
vertices.h | 33 isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell); 34 __isl_give isl_basic_set *isl_cell_get_domain(__isl_keep isl_cell *cell); 35 int isl_cell_foreach_vertex(__isl_keep isl_cell *cell, 37 void isl_cell_free(__isl_take isl_cell *cell); 40 int (*fn)(__isl_take isl_cell *cell, void *user), void *user);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/isl/ |
vertices.h | 33 isl_ctx *isl_cell_get_ctx(__isl_keep isl_cell *cell); 34 __isl_give isl_basic_set *isl_cell_get_domain(__isl_keep isl_cell *cell); 35 int isl_cell_foreach_vertex(__isl_keep isl_cell *cell, 37 void isl_cell_free(__isl_take isl_cell *cell); 40 int (*fn)(__isl_take isl_cell *cell, void *user), void *user);
|
/external/jemalloc/src/ |
ckh.c | 49 * Search bucket for key and return the cell number if found; SIZE_T_MAX 55 ckhc_t *cell; local 59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; 60 if (cell->key != NULL && ckh->keycomp(key, cell->key)) 68 * Search table for key and return cell number if found; SIZE_T_MAX otherwise. 73 size_t hashes[2], bucket, cell; local 81 cell = ckh_bucket_search(ckh, bucket, key); 82 if (cell != SIZE_T_MAX) 83 return (cell); 95 ckhc_t *cell; local 128 ckhc_t *cell; local 486 size_t cell; local 517 size_t cell; local [all...] |
/external/opencv3/modules/ts/misc/ |
table_formatter.py | 117 cell = row.cells[i] 120 cell.line = None 121 self.measureCell(cell) 122 colspan = int(self.getValue("colspan", cell)) 123 rowspan = int(self.getValue("rowspan", cell)) 128 cell.colspan = colspan 132 elif columns[i].minwidth < cell.width: 133 columns[i].minwidth = cell.width 139 cell.rowspan = rowspan 144 elif row.minheight < cell.height [all...] |