| /external/webkit/JavaScriptCore/tests/mozilla/js1_3/inherit/ |
| proto_7.js | 48 var testcases = new Array();
57 this.projects = projs || new Array();
|
| proto_8.js | 46 var testcases = new Array();
55 this.projects = projs || new Array();
|
| /external/webkit/SunSpider/tests/sunspider-0.9/ |
| 3d-morph.js | 43 var a = Array()
|
| string-validate-input.js | 1 letters = new Array("a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z");
2 numbers = new Array(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26);
3 colors = new Array("FF","CC","99","66","33","00");
|
| 3d-cube.js | 5 var Q = new Array();
6 var MTrans = new Array(); // transformation matrix
7 var MQube = new Array(); // position information of qube
8 var I = new Array(); // entity matrix
71 var Cross = new Array();
79 var A = new Array(); var B = new Array();
109 var Vect = new Array();
116 var Vect = new Array();
188 var CurN = new Array();
[all...] |
| crypto-aes.js | 6 * takes byte-array 'input' (16 bytes)
7 * 2D byte-array key schedule 'w' (Nr+1 x Nb bytes)
11 * returns byte-array encrypted value (16 bytes)
17 var state = [[],[],[],[]]; // initialise 4xNb byte-array 'state' with input [§3.4]
33 var output = new Array(4*Nb); // convert state to 1-d array before returning [§3.4]
48 var t = new Array(4);
59 var a = new Array(4); // 'a' is a copy of the current column from 's'
60 var b = new Array(4); // 'b' is a?{02} in GF(2^8)
83 function KeyExpansion(key) { // generate Key Schedule (byte-array Nr+1 x Nb) from Key [§5.2
[all...] |
| crypto-sha1.js | 38 * Calculate the SHA-1 of an array of big-endian words, and a bit length
46 var w = Array(80);
80 return Array(a, b, c, d, e);
113 var ipad = Array(16), opad = Array(16);
144 * Convert an 8-bit or 16-bit string to an array of big-endian words
149 var bin = Array();
157 * Convert an array of big-endian words to a string
169 * Convert an array of big-endian words to a hex string.
184 * Convert an array of big-endian words to a base-64 strin
[all...] |
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| 3d-morph.js | 43 var a = Array()
|
| string-validate-input.js | 1 letters = new Array("a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z");
2 numbers = new Array(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26);
3 colors = new Array("FF","CC","99","66","33","00");
|
| 3d-cube.js | 5 var Q = new Array();
6 var MTrans = new Array(); // transformation matrix
7 var MQube = new Array(); // position information of qube
8 var I = new Array(); // entity matrix
71 var Cross = new Array();
79 var A = new Array(); var B = new Array();
109 var Vect = new Array();
116 var Vect = new Array();
188 var CurN = new Array();
[all...] |
| crypto-aes.js | 6 * takes byte-array 'input' (16 bytes)
7 * 2D byte-array key schedule 'w' (Nr+1 x Nb bytes)
11 * returns byte-array encrypted value (16 bytes)
17 var state = [[],[],[],[]]; // initialise 4xNb byte-array 'state' with input [§3.4]
33 var output = new Array(4*Nb); // convert state to 1-d array before returning [§3.4]
48 var t = new Array(4);
59 var a = new Array(4); // 'a' is a copy of the current column from 's'
60 var b = new Array(4); // 'b' is a?{02} in GF(2^8)
83 function KeyExpansion(key) { // generate Key Schedule (byte-array Nr+1 x Nb) from Key [§5.2
[all...] |
| crypto-sha1.js | 38 * Calculate the SHA-1 of an array of big-endian words, and a bit length
46 var w = Array(80);
80 return Array(a, b, c, d, e);
113 var ipad = Array(16), opad = Array(16);
144 * Convert an 8-bit or 16-bit string to an array of big-endian words
149 var bin = Array();
157 * Convert an array of big-endian words to a string
169 * Convert an array of big-endian words to a hex string.
184 * Convert an array of big-endian words to a base-64 strin
[all...] |
| /external/webkit/WebCore/bindings/v8/custom/ |
| V8MessageEventCustom.cpp | 54 v8::Local<v8::Array> portArray = v8::Array::New(ports->size());
|
| /external/webkit/WebCore/inspector/front-end/ |
| InjectedScriptAccess.js | 52 var allArgs = Array.prototype.slice.call(arguments);
54 var argsString = JSON.stringify(Array.prototype.slice.call(allArgs, 0, allArgs.length - 1));
|
| /external/webkit/WebCore/page/ |
| Console.idl | 35 readonly attribute [CustomGetter] Array profiles;
|
| /frameworks/base/core/java/com/android/internal/util/ |
| ArrayUtils.java | 19 import java.lang.reflect.Array;
24 // and the array size eats another 4 bytes
77 * @param array1 the first byte array
78 * @param array2 the second byte array
98 * Returns an empty array of the specified type. The intent is that
99 * it will return the same empty array every time to avoid reallocation,
111 cache = Array.newInstance(kind, 0);
121 * Checks that value is present as at least one of the elements of the array.
122 * @param array the array to check i
[all...] |
| /external/webkit/WebCore/bindings/v8/ |
| V8Collection.h | 103 // Get an array containing the names of indexed properties of HTMLSelectElement and HTMLFormElement.
104 template<class Collection> static v8::Handle<v8::Array> nodeCollectionIndexedPropertyEnumerator(const v8::AccessorInfo& info)
109 v8::Handle<v8::Array> properties = v8::Array::New(length);
118 // Get an array containing the names of indexed properties in a collection.
119 template<class Collection> static v8::Handle<v8::Array> collectionIndexedPropertyEnumerator(const v8::AccessorInfo& info)
124 v8::Handle<v8::Array> properties = v8::Array::New(length);
|
| /external/v8/test/mjsunit/ |
| array-iteration.js | 28 // Tests for non-standard array iteration functions.
32 // <http://developer.mozilla.org/en/docs/Core_JavaScript_1.5_Reference:Global_Objects:Array>
37 // Array.prototype.filter
50 // Modify original array.
52 assertArrayEquals([42,42], a.filter(function(n, index, array) { array[index] = 43; return 42 == n; }));
55 // Only loop through initial part of array eventhough elements are
58 assertArrayEquals([], a.filter(function(n, index, array) { array.push(n+1); return n == 2; }));
62 a = new Array(20)
[all...] |
| array-functions-prototype.js | 28 // This file contains a number of tests of array functions and their
39 // Set elements on the array prototype.
40 Array.prototype[0] = 'zero';
41 Array.prototype[1] = 'one';
42 Array.prototype[2] = 'two';
60 var array = ['zero', , 'two'];
62 assertEquals('zero', array.shift());
63 assertEquals('zero', Array.prototype.shift.call(nonArray));
66 assertEquals(2, array.length);
68 assertHasOwnProperties(array, 2)
[all...] |
| sparse-array-reverse.js | 39 // Simple test of reverse on sparse array.
44 Array.prototype[30] = 'B'; // Should be hidden by a[30].
52 delete Array.prototype[30];
59 // CONG pseudo random number generator. Used for fuzzing the sparse array
70 // Fuzzing test of reverse on sparse array.
78 // Make sure we test both array-backed and hash-table backed
81 a = new Array(size);
83 a = new Array();
98 Array.prototype[pos] = letter;
114 Array.prototype[pos] = letter
[all...] |
| array-functions-prototype-misc.js | 61 return new Array(length);
63 the_prototype = Array.prototype;
64 push_function = function(array, elt) {
65 return array.push(elt);
67 concat_function = function(array, other) {
68 return array.concat(other);
70 slice_function = function(array, start, len) {
71 return array.slice(start, len);
73 splice_function = function(array, start, len) {
74 return array.splice(start, len)
[all...] |
| array-concat.js | 34 var a = new Array(pos);
54 Array.prototype["123"] = 'baz';
66 Array.prototype["123"] = undefined;
72 Array.prototype[123] = 'baz';
78 // Non-numeric properties on the prototype or the array shouldn't get
80 Array.prototype.moe = 'joe';
91 Array.prototype.moe = undefined;
113 assertEquals(9, holey.length); // hole in embedded array is ignored
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 15.4.4.5-1.js | 24 ECMA Section: Array.prototype.sort(comparefn)
29 The elements of this array are sorted. The sort is not necessarily stable.
49 function for the elements of this array, then for all nonnegative
88 properties will exist or not at the end of the array when the sort is concluded.
90 Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
102 var TITLE = "Array.prototype.sort(comparefn)";
106 var testcases = new Array();
124 var S = new Array();
127 // array is empty.
128 S[item++] = "var A = new Array()";
[all...] |
| 15.4.4.5-2.js | 24 ECMA Section: Array.prototype.sort(comparefn)
30 The elements of this array are sorted. The sort is not necessarily stable.
50 function for the elements of this array, then for all nonnegative
89 properties will exist or not at the end of the array when the sort is concluded.
91 Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
103 var TITLE = "Array.prototype.sort(comparefn)";
107 var testcases = new Array();
125 var S = new Array();
128 // array is empty.
129 S[item++] = "var A = new Array()";
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/String/ |
| 15.5.1.js | 50 var array = new Array();
53 array[item++] = new TestCase( SECTION, "String('string primitive')", "string primitive", String('string primitive') );
54 array[item++] = new TestCase( SECTION, "String(void 0)", "undefined", String( void 0) );
55 array[item++] = new TestCase( SECTION, "String(null)", "null", String( null ) );
56 array[item++] = new TestCase( SECTION, "String(true)", "true", String( true) );
57 array[item++] = new TestCase( SECTION, "String(false)", "false", String( false ) );
58 array[item++] = new TestCase( SECTION, "String(Boolean(true))", "true", String(Boolean(true)) );
59 array[item++] = new TestCase( SECTION, "String(Boolean(false))", "false", String(Boolean(false)) );
60 array[item++] = new TestCase( SECTION, "String(Boolean())", "false", String(Boolean(false)) )
[all...] |
