HomeSort by relevance Sort by last modified time
    Searched defs:cells (Results 1 - 25 of 164) sorted by null

1 2 3 4 5 6 7

  /packages/apps/Launcher3/src/com/android/launcher3/util/
GridOccupancy.java 15 public final boolean[][] cells; field in class:GridOccupancy
20 cells = new boolean[countX][countY];
35 boolean available = !cells[x][y];
39 available = available && !cells[i][j];
56 dest.cells[i][j] = cells[i][j];
69 if (cells[i][j]) {
81 cells[x][y] = value;
  /external/python/cpython2/Lib/plat-mac/lib-scriptpackages/StdSuites/
Table_Suite.py 30 cells = cell variable
  /prebuilts/gdb/darwin-x86/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/
Table_Suite.py 30 cells = cell variable
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/
Table_Suite.py 30 cells = cell variable
  /external/autotest/frontend/client/src/autotest/common/spreadsheet/
SpreadsheetSelectionManager.java 20 public void onCellsSelected(List<CellInfo> cells);
21 public void onCellsDeselected(List<CellInfo> cells);
59 List<CellInfo> cells = getSelectedCells(); local
60 for (CellInfo cell : cells) {
63 notifyDeselected(cells);
80 private void notifyDeselected(List<CellInfo> cells) {
82 listener.onCellsDeselected(cells);
  /external/iproute2/tc/
tc_core.c 71 * The align to ATM cells is used for determining the (ATM) SAR
82 int linksize, cells; local
84 cells = size / ATM_CELL_PAYLOAD;
86 cells++;
88 linksize = cells * ATM_CELL_SIZE; /* Use full cell size to add ATM tax */
  /external/valgrind/memcheck/tests/
leak-pool.c 101 struct cell **cells = static_roots ? cells_static : cells_local; local
114 cells[i] = allocate_from_pool(p, sizeof(struct cell));
  /frameworks/support/slices/view/src/main/java/androidx/slice/widget/
GridRowView.java 190 ArrayList<GridContent.CellContent> cells = gc.getGridContent(); local
192 for (int i = 0; i < cells.size(); i++) {
195 addSeeMoreCount(cells.size() - MAX_CELLS);
199 addCell(cells.get(i), i, Math.min(cells.size(), MAX_CELLS));
  /external/tensorflow/tensorflow/python/keras/_impl/keras/layers/
recurrent_test.py 58 cells = [MinimalRNNCell(8, 5), variable in class:RNNTest.test_minimal_rnn_cell_non_layer.MinimalRNNCell
61 layer = keras.layers.RNN(cells)
96 cells = [MinimalRNNCell(8, 5), variable in class:RNNTest.test_minimal_rnn_cell_non_layer_multiple_states.MinimalRNNCell
99 layer = keras.layers.RNN(cells)
160 cells = [MinimalRNNCell(8), variable in class:RNNTest.test_minimal_rnn_cell_layer.MinimalRNNCell
163 layer = keras.layers.RNN(cells)
267 cells = [keras.layers.recurrent.GRUCell(8), variable in class:RNNTest.test_rnn_cell_with_constants_layer.RNNCellWithConstants
270 layer = keras.layers.recurrent.RNN(cells)
385 cells = [keras.layers.LSTMCell(1),
387 layer = keras.layers.RNN(cells)
    [all...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_addrhashmap.h 54 Cell cells[1]; // variable len member in struct:__sanitizer::AddrHashMap::AddBucket
62 Cell cells[kBucketSize]; member in struct:__sanitizer::AddrHashMap::Bucket
173 // Check the embed cells.
175 Cell *c = &b->cells[i];
183 // Check the add cells with read lock.
188 Cell *c = &add->cells[i];
201 // Embed cells.
204 Cell *c = &b->cells[i];
216 // Add cells.
220 Cell *c = &add->cells[i]
    [all...]
  /external/guava/guava/src/com/google/common/cache/
Striped64.java 40 * In part because Cells are relatively large, we avoid creating
50 * resizing the table, as well as populating slots with new Cells.
81 * expanded mask. We do not try to detect or remove such cells,
83 * contention levels will recur, so the cells will eventually be
128 * Table of cells. When non-null, size is a power of 2.
130 transient volatile Cell[] cells; field in class:Striped64
139 * Spinlock (locked via CAS) used when resizing and/or creating Cells.
176 * creating new Cells, and/or contention. See above for
197 if ((as = cells) != null && (n = as.length) > 0) {
205 if ((rs = cells) != null &
    [all...]
  /external/guava/guava/src/com/google/common/collect/
ImmutableTable.java 142 * <p>By default, the order in which cells are added to the builder determines
158 private final List<Cell<R, C, V>> cells = Lists.newArrayList(); field in class:ImmutableTable.Builder
191 cells.add(cellOf(rowKey, columnKey, value));
208 cells.add(immutableCell);
236 int size = cells.size();
242 Iterables.getOnlyElement(cells));
245 cells, rowComparator, columnComparator);
  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_timedwait/
stress2.c 205 } cells[NSCENAR * SCALABILITY_FACTOR]; variable in typeref:struct:celldata
550 cells[i + j * NSCENAR].cid = cid;
554 pthread_cond_init(&(cells[i + j * NSCENAR].cnd),
562 pthread_mutex_init(&(cells[i + j * NSCENAR].mtx),
570 pthread_barrier_init(&(cells[i + j * NSCENAR].bar),
617 ret = pthread_create(&mngrs[i], &ta, cellmanager, &(cells[i]));
634 /* join the manager threads and destroy the cells */
641 canceled += cells[i].canceled;
642 cancelfailed += cells[i].cancelfailed;
643 cnttotal += cells[i].cnttotal
    [all...]
  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_wait/
stress.c 205 } cells[NSCENAR * SCALABILITY_FACTOR]; variable in typeref:struct:celldata
550 cells[i + j * NSCENAR].cid = cid;
554 pthread_cond_init(&(cells[i + j * NSCENAR].cnd),
562 pthread_mutex_init(&(cells[i + j * NSCENAR].mtx),
570 pthread_barrier_init(&(cells[i + j * NSCENAR].bar),
617 ret = pthread_create(&mngrs[i], &ta, cellmanager, &(cells[i]));
634 /* join the manager threads and destroy the cells */
641 canceled += cells[i].canceled;
642 cancelfailed += cells[i].cancelfailed;
643 cnttotal += cells[i].cnttotal
    [all...]
stress2.c 205 } cells[NSCENAR * SCALABILITY_FACTOR]; variable in typeref:struct:celldata
550 cells[i + j * NSCENAR].cid = cid;
554 pthread_cond_init(&(cells[i + j * NSCENAR].cnd),
562 pthread_mutex_init(&(cells[i + j * NSCENAR].mtx),
570 pthread_barrier_init(&(cells[i + j * NSCENAR].bar),
617 ret = pthread_create(&mngrs[i], &ta, cellmanager, &(cells[i]));
634 /* join the manager threads and destroy the cells */
641 canceled += cells[i].canceled;
642 cancelfailed += cells[i].cancelfailed;
643 cnttotal += cells[i].cnttotal
    [all...]
  /external/opencv/cvaux/src/
cvdpstereo.cpp 107 #define CELL(d,x) cells[(d)+(x)*dispH]
111 _CvDPCell* cells = (_CvDPCell*)cvAlloc(sizeof(_CvDPCell)*imgW*MAX(dispH,(imgH+1)/2)); local
113 int* reliabilities = (int*)cells;
198 _CvDPCell* _cell = cells + x*dispH;
473 cvFree( &cells );
  /external/v8/src/heap/
marking.h 49 // Bitmap is a sequence of cells each containing fixed number of bits.
89 INLINE(MarkBit::CellType* cells()) { function in class:v8::internal::Bitmap
101 MarkBit::CellType* cell = this->cells() + (index >> kBitsPerCellLog2);
106 for (int i = 0; i < CellsCount(); i++) cells()[i] = 0;
120 cells()[start_cell_index] |= ~(start_index_mask - 1);
121 // Then fill all in between cells with 1s.
123 cells()[i] = ~0u;
126 cells()[end_cell_index] |= (end_index_mask - 1);
128 cells()[start_cell_index] |= end_index_mask - start_index_mask;
143 cells()[start_cell_index] &= (start_index_mask - 1)
    [all...]
slot-set.h 151 // All cells between start_cell and end_cell are cleared.
280 base::AtomicValue<uint32_t>* cells = bucket[bucket_index].Value(); local
281 if (cells != nullptr) {
282 uint32_t cell = cells[cell_index].Value();
283 if (cell) cells[cell_index].SetBits(0, mask);
  /libcore/ojluni/src/main/java/java/util/concurrent/atomic/
Striped64.java 66 * In part because Cells are relatively large, we avoid creating
76 * resizing the table, as well as populating slots with new Cells.
110 * expanded mask. We do not try to detect or remove such cells,
112 * contention levels will recur, so the cells will eventually be
153 * Table of cells. When non-null, size is a power of 2.
155 transient volatile Cell[] cells; field in class:Striped64
164 * Spinlock (locked via CAS) used when resizing and/or creating Cells.
211 * creating new Cells, and/or contention. See above for
232 if ((as = cells) != null && (n = as.length) > 0) {
239 if ((rs = cells) != null &
    [all...]
  /external/deqp/modules/gles2/functional/
es2fStencilTests.cpp 312 // Compute cells: (x, y, w, h)
313 vector<IVec4> cells; local
318 cells.push_back(IVec4(x*cellWidth, y*cellHeight, cellWidth, cellHeight));
320 DE_ASSERT(ops.size() <= cells.size());
332 executeOps(context, cells[ndx], ops[ndx]);
351 executeOps(context, cells[ndx], ops[ndx]);
  /external/deqp/modules/gles3/functional/
es3fStencilTests.cpp 315 // Compute cells: (x, y, w, h)
316 vector<IVec4> cells; local
321 cells.push_back(IVec4(x*cellWidth, y*cellHeight, cellWidth, cellHeight));
323 DE_ASSERT(ops.size() <= cells.size());
335 executeOps(context, cells[ndx], ops[ndx]);
354 executeOps(context, cells[ndx], ops[ndx]);
  /external/libnl/lib/route/
tc.c 642 * The align to ATM cells is used for determining the (ATM) SAR
653 int linksize, cells; local
654 cells = size / ATM_CELL_PAYLOAD;
656 cells++;
658 linksize = cells * ATM_CELL_SIZE; /* Use full cell size to add ATM tax */
  /external/pdfium/third_party/agg23/
agg_rasterizer_scanline_aa.h 335 const cell_aa* const* cells = m_outline.scanline_cells(m_cur_y); local
338 const cell_aa* cur_cell = *cells;
344 cur_cell = *++cells;
  /system/chre/chre_api/include/chre_api/chre/
wwan.h 397 //! The number of valid entries in cells[]
407 //! about serving and neighbor cells
408 const struct chreWwanCellInfo *cells; member in struct:chreWwanCellInfoResult
  /system/chre/chre_api/legacy/v1_1/chre/
wwan.h 397 //! The number of valid entries in cells[]
407 //! about serving and neighbor cells
408 const struct chreWwanCellInfo *cells; member in struct:chreWwanCellInfoResult

Completed in 491 milliseconds

1 2 3 4 5 6 7