Searched refs:array (Results 26 - 50 of 2467) sorted by relevance

1234567891011>>

/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
H A Dstable_partition.pass.cpp43 P array[] = local
56 const unsigned size = sizeof(array)/sizeof(array[0]);
57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first());
58 assert(base(r) == array + 4);
59 assert(array[0] == P(1, 1));
60 assert(array[1] == P(1, 2));
61 assert(array[2] == P(3, 1));
62 assert(array[
72 P array[] = local
112 P array[] = local
141 P array[] = local
170 P array[] = local
199 P array[] = local
228 P array[] = local
257 P array[] = local
299 std::unique_ptr<int> array[size]; local
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Djson-stringifier-emptyhandle.js30 var array = [1,2,3];
32 Object.defineProperty(array, 4, {
36 JSON.stringify(array);
H A Dregress-91010.js31 var array = Array(N);
33 array[i] = i;
35 array.unshift('Kibo');
/external/chromium_org/v8/test/webkit/
H A Ddfg-dead-redundant-get-array-length.js25 "Tests that having a dead, and redundant, use of array.length doesn't cause compiler crashes."
28 function foo(array) {
29 var x = array.length; // This is dead. If it wasn't, it would be redundant with the one below.
30 return array.length;
H A Ddfg-ensure-non-array-array-storage-on-window.js25 "Tests that passing the global object to an array access that will arrayify to NonArrayWithArrayStorage doesn't break things."
28 function foo(array) {
30 for (var i = 0; i < array.length; ++i)
31 result += array[i];
35 function bar(array) {
36 array[1] = 42;
39 var array = {};
40 array.length = 3;
41 array[0] = 1;
42 array[
[all...]
H A Dsort-with-side-effecting-comparisons.js25 "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();
H A Dnew-array-double-with-holes.js25 "Tests that if array allocation profiling causes a new_array to allocate double arrays, then the holes end up being correctly initialized."
28 function foo(array, i) {
29 return array[i];
H A Ddfg-abs-backwards-propagation.js28 function foo(f, array, i) {
29 return f(array[i]);
37 var f, array, expected;
40 array = "[, 1.5]";
44 array = "[1.5]";
47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
H A Ddfg-ensure-array-storage-on-string.js25 "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");
H A Ddfg-ensure-array-storage-on-window.js25 "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");
H A Ddfg-max-backwards-propagation.js28 function foo(f, array, i) {
29 return f(array[i], 2.5);
37 var f, array, expected;
40 array = "[, 1.5]";
44 array = "[1.5]";
47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
H A Ddfg-min-backwards-propagation.js28 function foo(f, array, i) {
29 return f(array[i], 2.5);
37 var f, array, expected;
40 array = "[, 1.5]";
44 array = "[1.5]";
47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
/external/eigen/doc/snippets/
H A DMap_inner_stride.cpp1 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
H A DMap_outer_stride.cpp1 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;
H A DMap_simple.cpp1 int array[9]; variable
2 for(int i = 0; i < 9; ++i) array[i] = i;
3 cout << Map<Matrix3i>(array) << endl;
H A DMatrixBase_array.cpp2 v.array() += 3;
3 v.array() -= 2;
/external/stlport/test/unit/
H A Dbind_test.cpp55 int array [3] = { 1, 2, 3 }; local
56 int* p = remove_if((int*)array, (int*)array + 3, bind1st(less<int>(), 2));
58 CPPUNIT_ASSERT(p == &array[2]);
59 CPPUNIT_ASSERT(array[0] == 1);
60 CPPUNIT_ASSERT(array[1] == 2);
62 for_each((int*)array, (int*)array + 3, bind1st(pre_increment(), 1));
63 CPPUNIT_ASSERT(array[0] == 2);
64 CPPUNIT_ASSERT(array[
75 int array [3] = { 1, 2, 3 }; local
84 int array [3] = { 1, 2, 3 }; local
104 int array[3] = { 1, 2, 3 }; local
143 A array[3]; local
[all...]
H A Dfinsert_test.cpp33 char const* array [] = { "laurie", "jennifer", "leisa" }; local
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
38 CPPUNIT_ASSERT(names[0]==array[2]);
39 CPPUNIT_ASSERT(names[1]==array[1]);
40 CPPUNIT_ASSERT(names[2]==array[0]);
42 copy(array, array + 3, fit);
43 CPPUNIT_ASSERT(names[3]==array[2]);
44 CPPUNIT_ASSERT(names[4]==array[
50 char const* array [] = { "laurie", "jennifer", "leisa" }; local
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Darray-push5.js14 function push_wrapper_2(array, value) {
15 array.push(value);
17 array = [];
18 array.__proto__ = my_array_proto;
19 push_wrapper_2(array, 66);
20 assertEquals(1, array.length);
22 assertEquals(66, array[0]);
23 push_wrapper_2(array, 77);
24 assertEquals(2, array.length);
26 assertEquals(77, array[
[all...]
/external/clang/test/SemaCXX/
H A Dstatic-array-member.cpp4 static int array[]; member in struct:X0
10 int X0::array[sizeof(X0) * 2]; member in class:X0
14 static T array[]; member in struct:X1
18 T X1<T, N>::array[N]; member in class:X1
H A Dwarn-char-subscripts.cpp5 int array[1] = { 0 }; local
7 int val = array[subscript]; // expected-warning{{array subscript is of type 'char'}}
12 int array[1] = { 0 }; local
14 int val = subscript[array]; // expected-warning{{array subscript is of type 'char'}}
/external/chromium-trace/trace-viewer/src/base/
H A Dsorted_array_utils_test.js10 var ArrayOfIntervals = function(array) {
11 this.array = array;
17 this.array,
25 var array = new ArrayOfIntervals([
30 assertEquals(-1, array.findLowIndex(0));
31 assertEquals(0, array.findLowIndex(10));
32 assertEquals(0, array.findLowIndex(12));
33 assertEquals(0, array.findLowIndex(14.9));
37 assertEquals(2, array
[all...]
/external/chromium_org/third_party/icu/source/samples/layout/
H A Darraymem.h12 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0])
18 #define DELETE_ARRAY(array) free((void *) (array))
20 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])
/external/clang/test/Sema/
H A Dinvalid-cast.cpp6 T array; member in struct:X
10 return x0.array[17];
/external/icu/icu4c/source/samples/layout/
H A Darraymem.h12 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0])
18 #define DELETE_ARRAY(array) free((void *) (array))
20 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])

Completed in 7330 milliseconds

1234567891011>>