| /external/v8/test/mjsunit/regress/ |
| regress-1131.js | 29 Array.prototype.sort.call(nonArray);
|
| regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0]
32 Array.prototype.sort.call(nonArray);
|
| /external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
| concat-jquery-mootools-prototype.js | 55 // HANDLE: $(html) -> $(array)
108 // Get the whole matched element set as a clean array
112 // Return a 'clean' array
113 Array.prototype.slice.call( this ) :
119 // Take an array of elements and push it onto the stack
140 // the specified array of elements (destroying the stack in the process)
143 // Resetting the length to 0, then using the native Array push
144 // is a super-fast way to populate an object with array-like properties
146 Array.prototype.push.apply( this, elems );
152 // (You can seed the arguments with an array of args, but this i
[all...] |
| jquery-1.3.2.js | 55 // HANDLE: $(html) -> $(array)
108 // Get the whole matched element set as a clean array
112 // Return a 'clean' array
113 Array.prototype.slice.call( this ) :
119 // Take an array of elements and push it onto the stack
140 // the specified array of elements (destroying the stack in the process)
143 // Resetting the length to 0, then using the native Array push
144 // is a super-fast way to populate an object with array-like properties
146 Array.prototype.push.apply( this, elems );
152 // (You can seed the arguments with an array of args, but this i
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_3/inherit/ |
| proto_12.js | 45 var testcases = new Array();
60 this.projects = projs || new Array();
81 this.projects = projs || new Array();
101 var les = new Engineer( "Morris, Les", new Array("JavaScript"), "indy" );
115 Array.prototype.getClass = Object.prototype.toString;
119 "[object Array]",
|
| proto_9.js | 48 var testcases = new Array();
55 this.projects = new Array();
77 Array.prototype.getClass = Object.prototype.toString;
93 "[object Array]",
|
| /libcore/luni/src/test/java/libcore/java/lang/reflect/ |
| OldAndroidArrayTest.java | 19 import java.lang.reflect.Array;
23 * Test java.lang.reflect.Array methods.
28 Object intArray = Array.newInstance(Integer.TYPE, 2);
30 int[] array = (int[]) intArray; local
31 array[0] = 5;
32 Array.setInt(intArray, 1, 6);
34 assertEquals(5, Array.getInt(intArray, 0));
35 assertEquals(6, array[1]);
38 array[2] = 27;
44 assertEquals(2, array.length)
61 String[] array = (String[]) strArray; local
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-03-12-ArrayInitialization.c | 4 specified for an array.
17 struct Test Array[10] = { { 2, 12.0 }, { 3, 24.0 } };
|
| /external/easymock/src/org/easymock/internal/ |
| ArgumentToString.java | 18 import java.lang.reflect.Array;
40 for (int i = 0; i < Array.getLength(value); i++) {
44 appendArgument(Array.get(value, i), buffer);
|
| /external/v8/test/mjsunit/ |
| apply.js | 39 assertTrue(this === f0.apply(this, new Array(1)), "2b");
40 assertTrue(this === f0.apply(this, new Array(2)), "2c");
41 assertTrue(this === f0.apply(this, new Array(4242)), "2d");
44 assertTrue(this === f0.apply(null, new Array(1)), "3b");
45 assertTrue(this === f0.apply(null, new Array(2)), "3c");
46 assertTrue(this === f0.apply(this, new Array(4242)), "3d");
49 assertTrue(this === f0.apply(void 0, new Array(1)), "4b");
50 assertTrue(this === f0.apply(void 0, new Array(2)), "4c");
55 assertTrue(void 0 === f1.apply(this, new Array(1)), "5b");
56 assertTrue(void 0 === f1.apply(this, new Array(2)), "5c")
[all...] |
| array-splice.js | 28 // Check that splicing array of holes keeps it as array of holes
31 var array = new Array(10);
32 var spliced = array.splice(1, 1, 'one', 'two');
36 assertEquals(11, array.length);
37 assertFalse(0 in array, "0 in array");
38 assertTrue(1 in array);
39 assertTrue(2 in array);
[all...] |
| obj-construct.js | 34 function Array() {
|
| 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-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...] |
| undeletable-functions.js | 34 var array; variable
36 array = [
40 CheckJSCSemantics(Array.prototype, array, "Array prototype");
42 var old_Array_prototype = Array.prototype;
45 Array.prototype = new_Array_prototype;
46 assertEquals(old_Array_prototype, Array.prototype);
49 array = [
60 CheckJSCSemantics(Date.prototype, array, "Date prototype")
[all...] |
| /libcore/luni/src/main/java/java/sql/ |
| Array.java | 23 * A Java representation of the SQL {@code ARRAY} type.
25 public interface Array {
28 * Retrieves the contents of the SQL {@code ARRAY} value as a Java array
31 * @return A Java array containing the elements of this Array
38 * Returns part of the SQL {@code ARRAY} associated with this array,
40 * successive elements of the SQL array.
43 * the start position in the array where the values ar
[all...] |
| /external/webkit/Source/WebCore/bridge/jsc/ |
| BridgeJSC.cpp | 45 Array::Array(PassRefPtr<RootObject> rootObject)
51 Array::~Array()
|
| /dalvik/tests/045-reflect-array/src/ |
| Main.java | 5 import java.lang.reflect.Array;
8 * Test java.lang.reflect.Array.
23 intArray = Array.newInstance(Integer.TYPE, 2);
25 int[] array = (int[]) intArray; local
26 array[0] = 5;
27 Array.setInt(intArray, 1, 6);
29 if (Array.getInt(intArray, 0) != 5)
31 if (array[1] != 6)
34 array[2] = 27;
39 if (array.length != Array.getLength(intArray) |
64 String[] array = (String[]) strArray; local
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| string-tagcloud.js | 40 Array.prototype.toJSONString = function (w) {
41 var a = [], // The array holding the partial texts.
100 var a = [], // The array holding the partial texts.
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| string-tagcloud.js | 40 Array.prototype.toJSONString = function (w) {
41 var a = [], // The array holding the partial texts.
100 var a = [], // The array holding the partial texts.
[all...] |
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p6.cpp | 42 template<class T> class Array { /* ... */ };
44 template<class T> void sort(Array<T>& v) { /* ... */ }
48 void f(Array<String>& v) {
52 // sort(Array<T>&), T is String
55 template<> void sort<String>(Array<String>& v); // // expected-error{{after instantiation}}
56 template<> void sort<>(Array<char*>& v); // OK: sort<char*> not yet used
|
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p2.cpp | 4 template<class T> class Array { void mf() { } };
6 template class Array<char>;
7 template void Array<int>::mf();
8 template<class T> void sort(Array<T>& v) { /* ... */ }
9 template void sort(Array<char>&);
|
| p6.cpp | 3 template<class T> class Array { /* ... */ };
4 template<class T> void sort(Array<T>& v) { }
6 // instantiate sort(Array<int>&) - template-argument deduced
7 template void sort<>(Array<int>&);
9 template void sort(Array<long>&);
|
| /external/llvm/lib/CodeGen/ |
| RegAllocBase.h | 71 // Array of LiveIntervalUnions indexed by physical register.
74 LiveIntervalUnion *Array;
76 LiveUnionArray(): NumRegs(0), Array(0) {}
87 return Array[PhysReg];
|
