HomeSort by relevance Sort by last modified time
    Searched full:holes (Results 1 - 25 of 383) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/e2fsprogs/tests/f_holedir/
name 1 directory with holes and illegal blocks
  /external/e2fsprogs/tests/f_holedir2/
name 1 directories with holes and zero i_size
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeOverlayTest.java 43 private void checkSubtract(Rectangle rectangle, List<Rectangle> holes) {
44 Collection<Rectangle> result = IncludeOverlay.subtractRectangles(rectangle, holes);
47 // are within one of the holes then they are not in the result list and vice versa
54 for (Rectangle hole : holes) {
70 + " and holes=" + holes + " where inHole=inResult="
  /external/v8/test/mjsunit/
array-shift.js 28 // Check that shifting array of holes keeps it as array of holes
35 // Now check the case with array of holes and some elements on prototype.
57 // ... but keeps the rest as holes:
73 // Now check the case with array of holes and some elements on prototype
98 // ... but keeps the rest as holes:
array-unshift.js 28 // Check that unshifting array of holes keeps the original array
29 // as array of holes
41 // filling the holes with elements from the prototype
80 // Now check the case with array of holes and some elements on prototype.
102 // ... but keeps the rest as holes:
119 // filling the holes with elements from the prototype
157 // Now check the case with array of holes and some elements on prototype.
181 // ... but keeps the rest as holes:
array-iteration.js 61 // Respect holes.
105 // Respect holes.
144 // Respect holes.
183 // Respect holes.
218 // Respect holes.
array-slice.js 28 // Check that slicing array of holes keeps it as array of holes
129 // Now check the case with array of holes and some elements on prototype.
168 // ... but keeps the rest as holes:
176 // Now check the case with array of holes and some elements on prototype.
211 // ... but keeps the rest as holes:
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeOverlay.java 59 // to leave holes in the mask.
94 * Given a Rectangle, remove holes from it (specified as a collection of Rectangles) such
98 * @param holes the holes to subtract from the rectangle
99 * @return a list of sub rectangles that remain after subtracting out the given list of holes
103 Rectangle rectangle, Collection<Rectangle> holes) {
107 for (Rectangle hole : holes) {
  /external/chromium_org/chrome/browser/resources/chromeos/first_run/
first_run.js 64 // Mask element describing transparent "holes" in background.
67 // Pattern used for creating rectangular holes.
70 // Pattern used for creating round holes.
107 // At first we hide holes (job 1) and current step (job 2) simultaneously,
163 * Removes all holes previously added by |addHole|.
164 * @param {function=} opt_onHolesRemoved Called after all holes have been
169 var holes = Array.prototype.slice.call(
171 var holesLeft = holes.length;
177 holes.forEach(function(hole) {
  /external/chromium_org/v8/test/mjsunit/regress/
regress-crbug-162085.js 29 // array with holes.
38 // Ensure the double array growstub initializes the array with holes.
59 // Ensure the double array growstub initializes the array with holes.
regress-2433.js 29 // with holes.
  /external/chromium_org/third_party/WebKit/ManualTests/
match-marker-rects.html 22 and &ldquo;123&rdquo;. The white &ldquo;holes&rdquo; in the Find overlay
  /external/chromium_org/v8/test/mjsunit/
array-unshift.js 28 // Check that unshifting array of holes keeps the original array
29 // as array of holes
41 // filling the holes with elements from the prototype
80 // Now check the case with array of holes and some elements on prototype.
102 // ... but keeps the rest as holes:
119 // filling the holes with elements from the prototype
157 // Now check the case with array of holes and some elements on prototype.
181 // ... but keeps the rest as holes:
array-shift.js 28 // Check that shifting array of holes keeps it as array of holes
35 // Now check the case with array of holes and some elements on prototype.
57 // ... but keeps the rest as holes:
73 // Now check the case with array of holes and some elements on prototype
98 // ... but keeps the rest as holes:
array-iteration.js 61 // Respect holes.
105 // Respect holes.
144 // Respect holes.
183 // Respect holes.
218 // Respect holes.
array-slice.js 28 // Check that slicing array of holes keeps it as array of holes
129 // Now check the case with array of holes and some elements on prototype.
168 // ... but keeps the rest as holes:
176 // Now check the case with array of holes and some elements on prototype.
211 // ... but keeps the rest as holes:
dont-enum-array-holes.js 28 // Do not enum holes in arrays.
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_linkage.h 47 * the same for using that amount, with holes, or less slots but with less
48 * holes.
  /external/mesa3d/src/gallium/auxiliary/util/
u_linkage.h 47 * the same for using that amount, with holes, or less slots but with less
48 * holes.
  /external/valgrind/main/exp-sgcheck/tests/
stackerr.c 16 stack without holes in between, but not so for amd64. I don't
  /dalvik/vm/
IndirectRefTable.h 141 * "holes". We track the number of holes so that, when adding new elements,
144 * When the top-most entry is removed, any holes immediately below it are
158 * number of holes in the table onto the stack. Because of our 64K-entry
161 * bottom index and the count of holes below the bottom.
198 u4 numHoles:16; /* #of holes in entire table */
263 // TODO: want hole-filling stats (#of holes filled, total entries scanned)
331 * Return the #of entries in the entire table. This includes holes, and
  /development/ndk/platforms/android-3/arch-arm/include/asm/
memory.h 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
  /external/chromium_org/v8/test/webkit/
array-sort-sparse-expected.txt 24 This tests that arrays and array like objects containing holes are sorted correctly.
array-sort-sparse.js 25 "This tests that arrays and array like objects containing holes are sorted correctly."
new-array-double-with-holes.js 25 "Tests that if array allocation profiling causes a new_array to allocate double arrays, then the holes end up being correctly initialized."

Completed in 297 milliseconds

1 2 3 4 5 6 7 8 91011>>