/external/clang/test/CodeGen/ |
H A D | 2007-11-29-ArraySizeFromInitializer.c | 3 int array[] = {1, 2, 3, 4, 5}; variable
|
H A D | 2003-07-22-ArrayAccessTypeSafety.c | 4 void test(int* array, long long N) { argument 5 array[N] = N[array] = 33;
|
H A D | 2004-03-09-LargeArrayInitializers.c | 9 const int array[] = { local 31 return array[x];
|
/external/chromium_org/v8/test/webkit/ |
H A D | array-reset-large-index.js | 28 var array = []; variable 29 array[10001] = 0; 30 array[10001] = 5; 31 array[10002] = "a"; 32 array[10002] = "b"; 34 shouldBe('array[10001]', '5'); 35 shouldBe('array[10002]', '"b"');
|
H A D | array-sort-small-sparse-array-with-large-length.js | 25 "Tests that we can quickly sort a small sparse array that has a large length." 28 var array = []; variable 29 array[10000000] = 42; 30 array.sort(); 32 for (var s in array) { 33 debug("array[" + s + "] = " + array[s]); 36 result += array[s]; 39 shouldBe("array.length", "10000001"); 40 shouldBe("array[ [all...] |
H A D | dfg-holy-put-by-val-interferes-with-get-array-length.js | 28 function foo(array) { 29 var x = array.length; 30 array[1] = 42; 31 return [x, array.length];
|
H A D | dfg-intrinsic-side-effect-assignment-osr-exit.js | 28 function foo(array) { 29 var x = array.pop(); 35 var array = []; 37 array.x = 42; 38 array.push("blah"); 41 array.push(2); 44 array.push("bleh"); 47 shouldBe("foo(array)", expected);
|
/external/libcxx/test/containers/sequences/array/array.zero/ |
H A D | tested_elsewhere.pass.cpp | 10 // <array> 12 // support for zero-sized array 14 #include <array>
|
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-98773.js | 28 // Calling Array.sort on an external array is not supposed to crash. 30 var array = new Int16Array(23); 31 array[7] = 7; array[9] = 9; 32 assertEquals(23, array.length); 33 assertEquals(7, array[7]); 34 assertEquals(9, array[9]); 36 Array.prototype.sort.call(array); 37 assertEquals(23, array.length); 38 assertEquals(7, array[2 [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
H A D | util_array.h | 34 struct array { struct 41 static INLINE struct array *array_create(VGint datatype_size) 43 struct array *array = CALLOC_STRUCT(array); local 44 array->datatype_size = datatype_size; 46 array->size = DEFAULT_ARRAY_SIZE; 47 array->data = malloc(array->size * array 55 struct array *array = CALLOC_STRUCT(array); local 64 array_destroy(struct array *array) argument 71 array_resize(struct array *array, int num) argument 83 array_append_data(struct array *array, const void *data, int num_elements) argument 97 array_change_data(struct array *array, const void *data, int start_idx, int num_elements) argument 107 array_remove_element(struct array *array, int idx) argument 117 array_reset(struct array *array) argument [all...] |
/external/mesa3d/src/gallium/state_trackers/vega/ |
H A D | util_array.h | 34 struct array { struct 41 static INLINE struct array *array_create(VGint datatype_size) 43 struct array *array = CALLOC_STRUCT(array); local 44 array->datatype_size = datatype_size; 46 array->size = DEFAULT_ARRAY_SIZE; 47 array->data = malloc(array->size * array 55 struct array *array = CALLOC_STRUCT(array); local 64 array_destroy(struct array *array) argument 71 array_resize(struct array *array, int num) argument 83 array_append_data(struct array *array, const void *data, int num_elements) argument 97 array_change_data(struct array *array, const void *data, int start_idx, int num_elements) argument 107 array_remove_element(struct array *array, int idx) argument 117 array_reset(struct array *array) argument [all...] |
/external/chromium_org/v8/test/mjsunit/ |
H A D | array-shift.js | 28 // Check that shifting array of holes keeps it as array of holes 30 var array = new Array(10); 31 array.shift(); 32 assertFalse(0 in array); 35 // Now check the case with array of holes and some elements on prototype. 38 var array = new Array(len); 42 assertEquals(len, array.length); 43 for (var i = 0; i < array.length; i++) { 44 assertEquals(array[ [all...] |
H A D | array-push8.js | 7 function push_wrapper(array, value) { 8 array.push(value); 10 function pop_wrapper(array) { 11 return array.pop(); 16 var array = [2, 2]; variable 17 Object.freeze(array); 19 try { push_wrapper(array, 1); } catch (e) {} 20 assertEquals(2, array.length); 21 try { push_wrapper(array, 1); } catch (e) {} 22 assertEquals(2, array [all...] |
H A D | 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); 40 assertFalse(3 in array, " [all...] |
H A D | array-push3.js | 7 var array = []; variable 9 function push(array, value) { 10 array.push(value); 13 push(array, 0); 14 push(array, 1); 15 push(array, 2); 17 push(array, 3); 25 push(array, 4); 27 assertEquals(5, array.length); 28 assertEquals(100, array[ [all...] |
H A D | array-push9.js | 7 var array = []; variable 9 function push(array, value) { 10 array.push(value); 13 push(array, 0); 14 push(array, 1); 15 push(array, 2); 17 push(array, 3); 25 push(array, 4); 27 assertEquals(5, array.length); 28 assertEquals(100, array[ [all...] |
H A D | array-unshift.js | 28 // Check that unshifting array of holes keeps the original array 29 // as array of holes 31 var array = new Array(10); 32 assertEquals(13, array.unshift('1st', '2ns', '3rd')); 33 assertTrue(0 in array); 34 assertTrue(1 in array); 35 assertTrue(2 in array); 36 assertFalse(3 in array); 45 var array [all...] |
H A D | array-push2.js | 5 var array = []; variable 13 array[0] = 10; 14 assertEquals(0, array.length); 16 assertEquals("get 10", array[0]); 18 array.push(100); 19 assertEquals(1, array.length); 21 assertEquals("get 110", array[0]);
|
H A D | array-push4.js | 17 array = []; 18 array.__proto__ = my_array_proto; 20 array[0] = 10; 21 assertEquals(0, array.length); 23 assertEquals("get 10", array[0]); 25 Array.prototype.push.call(array, 100); 26 assertEquals(1, array.length); 28 assertEquals("get 110", array[0]); 30 array = []; 31 array [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | 2005-02-13-BadDynamicInit.cpp | 5 unsigned array[1]; member in struct:Data 9 Data shared_null = { shared_null.array };
|
/external/clang/test/SemaCXX/ |
H A D | parentheses.cpp | 5 bool test(Foo f, int *array) argument 7 return false && false || array[f.get()]; // expected-warning {{'&&' within '||'}} expected-note {{parentheses}}
|
/external/stlport/test/unit/ |
H A D | bnegate_test.cpp | 32 int array [4] = { 4, 9, 7, 1 }; local 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>())); 35 CPPUNIT_ASSERT(array[0]==1); 36 CPPUNIT_ASSERT(array[1]==4); 37 CPPUNIT_ASSERT(array[2]==7); 38 CPPUNIT_ASSERT(array[3]==9); 42 int array [4] = { 4, 9, 7, 1 }; local 43 sort(array, array [all...] |
H A D | greater_test.cpp | 33 int array[4] = { 3, 1, 4, 2 }; local 34 sort(array, array + 4, greater<int>() ); 36 CPPUNIT_ASSERT(array[0]==4); 37 CPPUNIT_ASSERT(array[1]==3); 38 CPPUNIT_ASSERT(array[2]==2); 39 CPPUNIT_ASSERT(array[3]==1); 43 int array [4] = { 3, 1, 4, 2 }; local 44 sort(array, array [all...] |
H A D | less_test.cpp | 33 int array [4] = { 3, 1, 4, 2 }; local 34 sort(array, array + 4, less<int>()); 36 CPPUNIT_ASSERT(array[0]==1); 37 CPPUNIT_ASSERT(array[1]==2); 38 CPPUNIT_ASSERT(array[2]==3); 39 CPPUNIT_ASSERT(array[3]==4); 43 int array [4] = { 3, 1, 4, 2 }; local 44 sort(array, array [all...] |
/external/clang/test/Sema/ |
H A D | warn-char-subscripts.c | 4 int array[1] = { 0 }; local 6 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} 10 int array[1] = { 0 }; local 12 int val = subscript[array]; // expected-warning{{array subscript is of type 'char'}} 16 int *array = 0; local 18 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}} 22 int *array local 29 int *array = 0; local 34 int array[1] = { 0 }; local 40 int array[1] = { 0 }; local 47 int array[1] = { 0 }; local 54 int array[1] = { 0 }; local 61 int array[1] = { 0 }; local [all...] |