HomeSort by relevance Sort by last modified time
    Searched full:cells (Results 126 - 150 of 574) sorted by null

1 2 3 4 56 7 8 91011>>

  /prebuilts/go/linux-x86/test/bench/shootout/
meteor-contest.c 46 * I will represent 0's as empty cells and 1's . . . . .
47 * as full cells. . . . . .
260 /* Returns the lowest index of the cells of a piece.
274 * Used to later reduce the amount of time searching for open cells in the
308 /* Fill the entire board going cell by cell. If any cells are "trapped"
331 * cells at the edges. There are only a handful of exceptions where the
332 * the board can be solved with the trapped cells. For example: piece 8 can
333 * trap 5 cells in the corner, but piece 3 can fit in those cells, or piece 0
450 * positive. One scenario is when 5 cells may be surrounded where piece
    [all...]
meteor-contest.go 58 * I will represent 0's as empty cells and 1's . . . . .
59 * as full cells. . . . . .
274 /* Returns the lowest index of the cells of a piece.
289 * Used to later reduce the amount of time searching for open cells in the
322 /* Fill the entire board going cell by cell. If any cells are "trapped"
351 * cells at the edges. There are only a handful of exceptions where the
352 * the board can be solved with the trapped cells. For example: piece 8 can
353 * trap 5 cells in the corner, but piece 3 can fit in those cells, or piece 0
472 * positive. One scenario is when 5 cells may be surrounded where piece
    [all...]
  /frameworks/base/graphics/java/android/graphics/
Atlas.java 183 * The tree of cells looks like this:
201 * the remaining space in two new empty cells. The split can occur
218 * The cells tree now looks like this:
228 * will visit the free cells until it finds one where a bitmap can
365 // Split the remaining free space into two new cells
385 // The order of the cells matters for efficient packing
  /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/
symbols.py 24 self.cells = {}
82 print >> sys.stderr, "\tcells: ", self.cells
94 if name in self.cells:
159 self.cells[name] = 1
164 self.cells[name] = 1
170 return self.cells.keys()
  /prebuilts/gdb/linux-x86/lib/python2.7/compiler/
symbols.py 24 self.cells = {}
82 print >> sys.stderr, "\tcells: ", self.cells
94 if name in self.cells:
159 self.cells[name] = 1
164 self.cells[name] = 1
170 return self.cells.keys()
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/
symbols.py 24 self.cells = {}
82 print >> sys.stderr, "\tcells: ", self.cells
94 if name in self.cells:
159 self.cells[name] = 1
164 self.cells[name] = 1
170 return self.cells.keys()
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/
symbols.py 24 self.cells = {}
82 print >> sys.stderr, "\tcells: ", self.cells
94 if name in self.cells:
159 self.cells[name] = 1
164 self.cells[name] = 1
170 return self.cells.keys()
  /external/autotest/client/cros/cellular/
labconfig_data.py 9 CELLS = {}
82 CELLS['cam'] = {
127 CELLS['mtv'] = {
  /external/chromium-trace/catapult/netlog_viewer/netlog_viewer/
table_printer.js 10 * addHeaderCell() can optionally be called to specify header cells for a
32 // Number of cells automatically added at the start of new rows.
38 * Sets the number of blank cells to add after each call to addRow.
  /external/clang/www/analyzer/scripts/
expandcollapse.js 12 // group: a number; cells of the same group belong to the same table row.
153 // Cell is collapsed - expand the row height to the cells original height.
158 // Update all cells (height and expanded/collapsed state) in a row according
  /external/opencv3/doc/py_tutorials/py_ml/py_knn/py_knn_opencv/
py_knn_opencv.markdown 29 # Now we split the image to 5000 cells, each 20x20 size
30 cells = [np.hsplit(row,100) for row in np.vsplit(gray,50)]
33 x = np.array(cells)
  /art/runtime/base/
bit_vector.cc 87 // ie. we are comparing all storage cells that could have difference, if both vectors have cells above our_highest_index,
148 // Update src_size to how many cells we actually care about: where the bit is + 1.
182 // Update union_with_size to how many cells we actually care about: where the bit is + 1.
  /development/samples/devbytes/animation/ListViewCellInsertion/src/com/example/android/insertingcells/
InsertionListView.java 189 /** Loops through all the current visible cells in the ListView and animates
222 * Loops through all the cells that were visible before the data set
263 /** Animates all the cells from their old position to their new position
291 * By overriding dispatchDraw, the BitmapDrawables of all the cells that were on the
  /external/chromium-trace/catapult/third_party/mapreduce/mapreduce/static/
base.css 75 empty-cells: show;
  /external/compiler-rt/test/msan/
fork.cc 52 // If any of the hash table cells are locked, this may deadlock.
  /external/icu/android_icu4j/src/main/java/android/icu/text/
BidiClassifier.java 26 * cells.</p>
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
BidiClassifier.java 25 * cells.</p>
  /external/opencv3/apps/traincascade/
HOGfeatures.h 39 cv::Rect rect[N_CELLS]; //cells
  /external/opencv3/doc/py_tutorials/py_imgproc/py_houghlines/
py_houghlines.markdown 42 in its corresponding \f$(\rho, \theta)\f$ cells. So now in accumulator, the cell (50,90) = 1 along with
43 some other cells.
45 Now take the second point on the line. Do the same as above. Increment the the values in the cells
48 each point, the cell (50,90) will be incremented or voted up, while other cells may or may not be
  /external/v8/test/mjsunit/regress/
regress-675.js 31 // property cells.
  /frameworks/base/core/java/android/net/
network-policy-restrictions.md 9 The cells define the network status when the app is on background.
  /frameworks/base/core/tests/coretests/src/android/widget/layout/table/
CellSpanTest.java 28 * setup to exercise tables in which cells use spanning.
VerticalGravityTest.java 30 * setup to exercise tables in which cells use vertical gravity.
  /external/gemmlowp/internal/
kernel_neon.h 79 // A 12x2 block of 3 4x2 cells Lhs is stored in 16bit in d2--d7
115 // Load 3 Lhs cells of size 4x2 each
120 // Expand Lhs/Rhs cells to 16 bit.
301 // This 12x4 block of global accumulators is laid out as 3 cells of size 4x4
408 // accumulators (3 cells of size 4x4 in diagonal-major order)
413 // A 12x2 block of 3 4x2 cells Lhs is stored in 8bit in d1--d3.
446 /* Load 3 Lhs cells of size 4x2 */ \
699 // A 2x8 block of 2 2x4 cells of Rhs is stored in 16bit in v0--v1.
700 // A 12x2 block of 3 4x2 cells Lhs is stored in 16bit in v2--v4.
736 // Load 3 Lhs cells of size 4x2 eac
    [all...]
  /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/
XYLegendWidget.java 157 // Calculate the number of cells needed to draw the Legend:
176 // Create an iterator specially created to draw the number of cells we calculated:

Completed in 2356 milliseconds

1 2 3 4 56 7 8 91011>>