| /external/v8/test/mjsunit/compiler/ |
| short-circuit.js | 59 // An array literal in value/test context.
60 assertEquals(0, function () { return [0,1] || new Array(x,1) }()[0]);
62 // An array literal in test/value context.
63 assertEquals(x, function () { return [0,1] && new Array(x,1) }()[0]);
|
| /external/v8/test/mjsunit/ |
| debug-stepin-builtin-callback.js | 125 // Array.forEach calls a callback function, which by itself uses
126 // Array.forEach with another callback function.
|
| function-names.js | 36 // Array.prototype functions.
42 TestFunctionNames(Array.prototype, arrayPrototypeFunctions);
|
| get-own-property-descriptor.js | 39 var a = new Array();
101 var objWithProto = new Array();
|
| keyed-ic.js | 63 // Array length accessor.
70 var a = new Array(10);
|
| md5.js | 129 return Array(a, b, c, d);
163 var bin = Array();
|
| string-add.js | 182 var a = Array(21);
183 var b = Array(21);
|
| /external/v8/test/mjsunit/es6/ |
| computed-property-names.js | 38 // Array indexes first.
118 // Array indexes first.
304 var array = [
313 assertEquals(42, array[0]);
314 assertEquals(43, array[2]);
315 assertEquals('A', array[1].a);
316 assertEquals('B', array[1].b);
317 assertEquals('C', array[1].c);
318 assertEquals('D', array[1].d);
337 array:
[all...] |
| typedarray-every.js | 18 function CheckTypedArrayIsNeutered(array) {
19 assertEquals(0, array.byteLength);
20 assertEquals(0, array.byteOffset);
21 assertEquals(0, array.length);
43 result = a.every(function (n, index, array) { return n == index && n < this.value; }, o);
52 // Modify the original array.
54 result = a.every(function (n, index, array) {
55 array[index] = n + 1; count++; return true;
84 // Neutering the buffer backing the typed array mid-way should
85 // still make .forEach() finish, and the array should keep bein
[all...] |
| typedarray-foreach.js | 18 function CheckTypedArrayIsNeutered(array) {
19 assertEquals(0, array.byteLength);
20 assertEquals(0, array.byteOffset);
21 assertEquals(0, array.length);
38 a.forEach(function (n, index, array) { result.push(this.value); }, o);
41 // Modify the original array.
43 a.forEach(function (n, index, array) { array[index] = n + 1; count++ });
76 a.forEach(function (n, index, array) {
78 array[index] = n + 1
[all...] |
| /external/v8/test/mjsunit/harmony/ |
| reflect-apply.js | 71 assertEquals(i, Reflect.apply(returnLengthStrict, this, new Array(i)));
72 assertEquals(i, Reflect.apply(returnLengthSloppy, this, new Array(i)));
|
| reflect-get-own-property-descriptor.js | 41 var a = new Array();
103 var objWithProto = new Array();
|
| /external/v8/test/mjsunit/regress/ |
| regress-2346.js | 41 var a = new Array();
103 var objWithProto = new Array();
|
| regress-453481.js | 63 return Array(__v_3, __v_13, __v_4, __v_19);
89 var __v_4 = Array();
|
| /external/v8/test/webkit/ |
| array-holes.js | 26 function isHole(array, index)
28 if (index >= array.length)
31 Array.prototype[index] = "room";
32 var isHole = array[index] == "room";
33 delete Array.prototype[index];
37 function showHoles(array)
40 for (i = 0; i < array.length; ++i) {
43 if (isHole(array, i))
46 string += array[i];
|
| array-reduceRight.js | 28 function toObject(array) {
30 for (var i in array)
31 o[i] = array[i];
32 o.length = array.length;
33 o.reduceRight = Array.prototype.reduceRight;
36 function toUnorderedObject(array) {
39 for (var i in array)
42 o[props[i]] = array[props[i]];
43 o.length = array.length;
44 o.reduceRight = Array.prototype.reduceRight
[all...] |
| /frameworks/base/core/java/android/text/ |
| SpannableStringInternal.java | 24 import java.lang.reflect.Array;
321 ret = (Object[]) Array.newInstance(kind, spanCount - i + 1);
350 ret = (Object[]) Array.newInstance(kind, 1);
358 Object[] nret = (Object[]) Array.newInstance(kind, count);
|
| /libcore/luni/src/test/java/libcore/java/lang/ |
| ClassCastExceptionTest.java | 20 import java.lang.reflect.Array;
|
| /libcore/ojluni/src/main/java/java/sql/ |
| PreparedStatement.java | 109 * a <code>ARRAY</code>, <code>BLOB</code>, <code>CLOB</code>,
240 * Sets the designated parameter to the given Java array of bytes. The driver converts
403 * a <code>ARRAY</code>, <code>BLOB</code>, <code>CLOB</code>,
434 * or <code>Array</code>, the driver should pass it to the database as a
573 * Sets the designated parameter to the given <code>java.sql.Array</code> object.
574 * The driver converts this to an SQL <code>ARRAY</code> value when it
578 * @param x an <code>Array</code> object that maps an SQL <code>ARRAY</code> value
585 void setArray (int parameterIndex, Array x) throws SQLException;
[all...] |
| ResultSet.java | 368 * a <code>byte</code> array in the Java programming language.
654 * a <code>byte</code> array in the Java programming language.
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| AbstractCollection.java | 115 * <p>This implementation returns an array containing all the elements
117 * consecutive elements of the array, starting with index {@code 0}.
118 * The length of the returned array is equal to the number of elements
135 // Estimate size of array; be prepared to see more or fewer elements
149 * <p>This implementation returns an array containing all the elements
151 * consecutive elements of the array, starting with index {@code 0}.
153 * fit into the specified array, then the elements are returned in a
154 * newly allocated array with length equal to the number of elements
174 // Estimate size of array; be prepared to see more or fewer elements
177 (T[])java.lang.reflect.Array
[all...] |
| /ndk/sources/host-tools/nawk-20071023/ |
| run.c | 211 Cell **args; /* pointer to array of arguments after execute */
254 i, NN(y->nval), y->fval, isarr(y) ? "(array)" : NN(y->sval), y->tval) );
451 Cell *array(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */ function
461 FATAL("out of memory in array");
468 if (!adjbuf(&buf, &bufsz, strlen(buf)+strlen(s)+nsub+1, recsize, 0, "array"))
476 dprintf( ("making %s into an array\n", NN(x->nval)) );
483 z = setsymtab(buf, "", 0.0, STR|NUM, (Array *) x->sval);
538 ap = execute(a[1]); /* array name */
540 dprintf( ("making %s into an array\n", ap->nval) );
561 k = lookup(buf, (Array *) ap->sval)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/multiprocessing/dummy/ |
| __init__.py | 48 import array namespace
128 def Array(typecode, sequence, lock=True):
129 return array.array(typecode, sequence)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/multiprocessing/dummy/ |
| __init__.py | 48 import array namespace
128 def Array(typecode, sequence, lock=True):
129 return array.array(typecode, sequence)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/multiprocessing/dummy/ |
| __init__.py | 48 import array namespace
128 def Array(typecode, sequence, lock=True):
129 return array.array(typecode, sequence)
|
