/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
IncludeOverlayTest.java | 54 for (Rectangle hole : holes) { 55 if (hole.contains(x, y)) {
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
IncludeOverlay.java | 95 * that the result is a list of rectangles that cover everything that is not a hole. 107 for (Rectangle hole : holes) { 110 if (hole.intersects(r)) { 111 // Clip the hole to fit the rectangle bounds 112 Rectangle h = hole.intersection(r);
|
/external/v8/test/mjsunit/regress/ |
regress-1213575.js | 29 // to pass 'the hole' to a defined setter.
|
/external/v8/benchmarks/ |
earley-boyer.js | 367 (peephole (hole 2 "parseInt(" x "/" y ")"))) 586 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")"))) 615 (peephole (hole 2 p ".car = " val))) 622 (peephole (hole 2 p ".cdr = " val))) 1189 (peephole (hole 2 c1 ".val === " c2 ".val"))) 1194 (peephole (hole 2 c1 ".val < " c2 ".val"))) 1199 (peephole (hole 2 c1 ".val > " c2 ".val"))) 1204 (peephole (hole 2 c1 ".val <= " c2 ".val"))) 1209 (peephole (hole 2 c1 ".val >= " c2 ".val"))) 1214 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()")) [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-earley-boyer.js | 361 (peephole (hole 2 "parseInt(" x "/" y ")"))) 580 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")"))) 609 (peephole (hole 2 p ".car = " val))) 616 (peephole (hole 2 p ".cdr = " val))) 1183 (peephole (hole 2 c1 ".val === " c2 ".val"))) 1188 (peephole (hole 2 c1 ".val < " c2 ".val"))) 1193 (peephole (hole 2 c1 ".val > " c2 ".val"))) 1198 (peephole (hole 2 c1 ".val <= " c2 ".val"))) 1203 (peephole (hole 2 c1 ".val >= " c2 ".val"))) 1208 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()")) [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-earley-boyer.js | 361 (peephole (hole 2 "parseInt(" x "/" y ")"))) 580 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")"))) 609 (peephole (hole 2 p ".car = " val))) 616 (peephole (hole 2 p ".cdr = " val))) 1183 (peephole (hole 2 c1 ".val === " c2 ".val"))) 1188 (peephole (hole 2 c1 ".val < " c2 ".val"))) 1193 (peephole (hole 2 c1 ".val > " c2 ".val"))) 1198 (peephole (hole 2 c1 ".val <= " c2 ".val"))) 1203 (peephole (hole 2 c1 ".val >= " c2 ".val"))) 1208 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()")) [all...] |
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-earley-boyer.js | 361 (peephole (hole 2 "parseInt(" x "/" y ")"))) 580 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")"))) 609 (peephole (hole 2 p ".car = " val))) 616 (peephole (hole 2 p ".cdr = " val))) 1183 (peephole (hole 2 c1 ".val === " c2 ".val"))) 1188 (peephole (hole 2 c1 ".val < " c2 ".val"))) 1193 (peephole (hole 2 c1 ".val > " c2 ".val"))) 1198 (peephole (hole 2 c1 ".val <= " c2 ".val"))) 1203 (peephole (hole 2 c1 ".val >= " c2 ".val"))) 1208 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()")) [all...] |
/external/v8/test/mjsunit/ |
array-splice.js | 260 // Second hole (at index 3) of array turns into 265 // ... but array[3] and array[7] is actually a hole: 308 // Second hole (at index 3) of array turns into 313 // ... but array[3] and array[7] is actually a hole:
|
array-elements-from-array-prototype-chain.js | 57 assertEquals(undefined, a.shift(), 'hole should be returned as undefined') 148 // a hole at a0[7] 176 // reifying at7 into a0[8] and keeping a hole at a0[7].
|
array-elements-from-array-prototype.js | 57 assertEquals(undefined, a.shift(), 'hole should be returned as undefined') 148 // a hole at a0[7] 176 // reifying at7 into a0[8] and keeping a hole at a0[7].
|
array-elements-from-object-prototype.js | 57 assertEquals(undefined, a.shift(), 'hole should be returned as undefined') 148 // a hole at a0[7] 176 // reifying at7 into a0[8] and keeping a hole at a0[7].
|
array-sort.js | 281 // expected (inherited) object: [undef1,...undefdepth,hole,1,...,depth,0,hole] 284 // expected result: [0,1,...,depth,undef1,...,undefdepth,undef,hole]
|
unbox-double-arrays.js | 220 // Test the hole for the default runtime implementation. 228 // Test the keyed load IC implementation when the value is the hole. 252 // Make sure Crankshaft code handles the hole correctly (bailout)
|
keyed-call-generic.js | 113 testException([zero, one, /* hole */ ], [0, 1, 2], [false, false, true]);
|
elements-transition.js | 63 // Set the element to an integer but leave a hole at length-7.
|
array-concat.js | 187 assertEquals(9, holey.length); // hole in embedded array is ignored
|
object-define-property.js | 1080 // Regression test: We should never observe the hole value.
|
/external/genext2fs/ |
genext2fs.c | 971 // if hole!=0, create a hole in the file 973 walk_bw(filesystem *fs, uint32 nod, blockwalker *bw, int32 *create, uint32 hole) 995 *bkref = hole ? 0 : alloc_blk(fs,nod); 1004 *bkref = hole ? 0 : alloc_blk(fs,nod); 1021 *bkref = hole ? 0 : alloc_blk(fs,nod); 1032 *bkref = hole ? 0 : alloc_blk(fs,nod); 1055 *bkref = hole ? 0 : alloc_blk(fs,nod); 1067 *bkref = hole ? 0 : alloc_blk(fs,nod); 1085 *bkref = hole ? 0 : alloc_blk(fs,nod) [all...] |
/external/v8/src/ |
elements.cc | 152 // marked with the hole. 194 // marked with the hole. 246 // marked with the hole. 711 // one adjacent hole to the value being deleted. 712 Object* hole = heap->the_hole_value(); local 716 ((key > 0 && backing_store->get(key - 1) == hole) || 717 (key + 1 < length && backing_store->get(key + 1) == hole))) { 720 if (backing_store->get(i) != hole) ++num_used; [all...] |
array.js | 938 // Fill in hole or undefined. 948 // Fill in the undefineds and the holes. There may be a hole where 996 // chain that has become exposed by sort moving a hole to its position. [all...] |
/external/iproute2/doc/ |
api-ip6-flowlabels.tex | 62 There is a hole in specs: some hop-by-hop options can be 102 hole in \verb|sockaddr_in6| in any case. Now it has no justification. 115 is followed by attempts to patch the hole and more mistakes...
|
ip-cref.tex | [all...] |
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
Antlr.Runtime.Tools.pas | 784 // gap refers to the hole that needs filling-in by shifting items down. 789 // at the index. If the index hits a hole, then we're done. 791 // If our load factor was exactly 1, we'll need to hit this hole
|
/external/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
markdown.php | [all...] |
/external/chromium/net/base/ |
effective_tld_names.cc | [all...] |