/external/clang/test/CodeGen/ |
2007-11-29-ArraySizeFromInitializer.c | 3 int array[] = {1, 2, 3, 4, 5}; variable
|
debug-info-block-out-return.c | 21 typedef struct { int array[12]; } BigStruct_t; member in struct:__anon8131
|
2004-03-09-LargeArrayInitializers.c | 9 const int array[] = { local 31 return array[x];
|
/external/eigen/doc/snippets/ |
Map_general_stride.cpp | 1 int array[24]; variable 2 for(int i = 0; i < 24; ++i) array[i] = i; 4 (array, 3, 3, Stride<Dynamic,2>(8, 2))
|
Map_inner_stride.cpp | 1 int array[12]; variable 2 for(int i = 0; i < 12; ++i) array[i] = i; 4 (array, 6) // the inner stride has already been passed as template parameter
|
Map_outer_stride.cpp | 1 int array[12]; variable 2 for(int i = 0; i < 12; ++i) array[i] = i; 3 cout << Map<MatrixXi, 0, OuterStride<> >(array, 3, 3, OuterStride<>(4)) << endl;
|
Map_simple.cpp | 1 int array[9]; variable 2 for(int i = 0; i < 9; ++i) array[i] = i; 3 cout << Map<Matrix3i>(array) << endl;
|
Tutorial_Map_rowmajor.cpp | 1 int array[8]; variable 2 for(int i = 0; i < 8; ++i) array[i] = i; 3 cout << "Column-major:\n" << Map<Matrix<int,2,4> >(array) << endl; 4 cout << "Row-major:\n" << Map<Matrix<int,2,4,RowMajor> >(array) << endl; 6 Map<Matrix<int,2,4>, Unaligned, Stride<1,4> >(array) << endl;
|
/external/v8/test/mjsunit/regress/ |
regress-crbug-569534.js | 5 var array = [,0.5]; variable 6 array.length = 0; 7 for (var i in array) {}
|
regress-smi-only-concat.js | 30 // This tests that concatenating a fast smi-only array and a fast object array 31 // results in a fast object array. 34 var array = fast_array.concat(fast_array); variable 37 assertTrue(%HasFastObjectElements(array));
|
/external/v8/test/webkit/ |
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"');
|
sort-with-side-effecting-comparisons.js | 25 "Checks that sorting an array with a side-effecting comparison function doesn't trigger assertions." 28 var array = []; variable 31 array.push(i); 33 array.sort(function(a, b) { 34 array.shift();
|
sparse-array.js | 25 'This tests some sparse array operations.' 28 var array = [ ]; variable 30 array[50000] = 100; 32 shouldBe('array[0]', 'undefined'); 33 shouldBe('array[49999]', 'undefined'); 34 shouldBe('array[50000]', '100'); 35 shouldBe('array[50001]', 'undefined'); 36 array[0]++; 37 shouldBe('array[0]', 'NaN'); 38 shouldBe('array[49999]', 'undefined') [all...] |
array-index-immediate-types.js | 25 "This test checks the behaviour of indexing an Array with immediate types." 28 var array = ["Zero", "One"]; variable 30 shouldBe("array[0]", '"Zero"'); 31 shouldBe("array[null]", "undefined"); 32 shouldBe("array[undefined]", "undefined"); 33 shouldBe("array[true]", "undefined"); 34 shouldBe("array[false]", "undefined"); 36 function putSelf(array, index) 39 array[index] = index;
|
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[0]", "42") [all...] |
dfg-ensure-array-storage-on-string.js | 25 "Checks that trying to arrayify a string to have array storage doesn't crash." 28 function foo(array) { 30 for (var i = 0; i < array.length; ++i) 31 result += array[i]; 35 var array = [1, 2, 3]; variable 37 shouldBe("foo(array)", "6"); 39 array = [1, , 3]; 40 array.__defineGetter__(1, function() { return 6; }); 42 shouldBe("foo(array)", "10");
|
dfg-ensure-array-storage-on-window.js | 25 "Tests that passing the global object to an array access that will arrayify to ArrayWithArrayStorage doesn't break things." 28 function foo(array) { 30 for (var i = 0; i < array.length; ++i) 31 result += array[i]; 35 var array = [1, 2, 3]; variable 37 shouldBe("foo(array)", "6"); 39 array = [1, , 3]; 40 array.__defineGetter__(1, function() { return 6; }); 42 shouldBe("foo(array)", "10");
|
dfg-ensure-contiguous-on-string.js | 28 function foo(array) { 30 for (var i = 0; i < array.length; ++i) 31 result += array[i]; 35 var array = [1, 2, 3]; variable 37 shouldBe("foo(array)", "6"); 39 array = [1, false, 3]; 41 shouldBe("foo(array)", "4");
|
dfg-force-exit-then-sparse-conditional-constant-prop-in-loop.js | 42 var array = [54, 5432, 1234, 54, 1235, 64, 75, 532, 64, 2]; variable 45 shouldBe("foo(array)", "8746");
|
/external/v8/test/mjsunit/ |
array-push2.js | 5 var array = []; variable 8 Object.defineProperty(Array.prototype, "0", { 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]);
|
/art/test/559-checker-rtp-ifnotnull/src/ |
Main.java | 38 int[] array = null; local 40 if (array == null) { 41 array = new int[5]; 44 array = new int[10]; 46 array[i] = i; 49 array.hashCode();
|
/art/test/562-no-intermediate/src/ |
Main.java | 22 array[index] += Math.cos(42); 26 static double[] array = new double[2]; field in class:Main
|
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
p15.cpp | 9 int array[3]; local 12 (void)[&array] () -> void {};
|
/external/clang/test/CodeGenCXX/ |
2005-02-13-BadDynamicInit.cpp | 5 unsigned array[1]; member in struct:Data 9 Data shared_null = { shared_null.array };
|
/external/clang/test/Sema/ |
invalid-cast.cpp | 6 T array; member in struct:X 10 return x0.array[17];
|