Searched refs:array1 (Results 1 - 25 of 74) sorted by relevance

123

/external/clang/test/SemaCXX/
H A Dwarn-self-comparisons.cpp4 void f(int (&array1)[2], int (&array2)[2]) { argument
5 if (array1 == array2) { } // no warning
H A Dnon-empty-class-size-zero.cpp6 int array1[0]; member in struct:X
H A Dc99-variable-length-array-cxx11.cpp21 int array1[N]; // expected-warning{{variable length arrays are a C99 feature}} local
/external/clang/test/Lexer/
H A Dutf8-char-literal.cpp5 int array1['\xF1' != u'\xf1'? 1 : -1]; variable
6 int array1['ñ' != u'\xf1'? 1 : -1]; // expected-error {{character too large for enclosing character literal type}} variable
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-swapelements.js37 var array1 = new Array(size);
41 array1.splice(0, 1);
48 array1[i] = new Item(i);
49 array1[i].toString = myToString;
51 array1.sort();
H A Dregress-crbug-263276.js30 var array1 = []; variable
31 array1.foo = true;
40 bad(array1);
41 bad(array1);
H A Dregress-353004.js9 var array1 = new Uint8Array(buffer1, {valueOf : function() {
14 assertEquals(0, array1.length);
/external/clang/test/Sema/
H A Dself-comparison.c49 int array1[2]; local
55 return array1 == array1; // expected-warning{{self-comparison always evaluates to true}}
56 return array1 != array1; // expected-warning{{self-comparison always evaluates to false}}
57 return array1 < array1; // expected-warning{{self-comparison always evaluates to false}}
58 return array1 <= array1; // expected-warning{{self-comparison always evaluates to true}}
59 return array1 > array
[all...]
H A Dvector-ops.c20 int array1[v2ua]; // expected-error{{size of array has non-integer type 'v2u' (vector of 2 'unsigned int' values)}} local
/external/chromium_org/v8/test/mjsunit/
H A Dkeyed-load-dictionary-stub.js17 var array1 = generate_dictionary_array();
18 get_accessor(array1, 1);
19 get_accessor(array1, 2);
/external/stlport/test/unit/
H A Dinsert_test.cpp33 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
36 deque<char const*> names(array1, array1 + 3);
49 copy(array1, array1 + 3, itd);
57 char const* array1 [] = { "laurie", "jennifer", "leisa" }; local
60 deque<char const*> names(array1, array1 + 3);
/external/chromium_org/v8/test/webkit/
H A Ddfg-get-by-val-clobber.js34 var array1 = [1, 2, 3, 4]; variable
39 shouldBe("doAccesses(array1, array2, i % 4, (i + 1) % 4, i)", "" + ((i % 4) + 1));
47 shouldBe("doAccesses(array1, array1, i % 4, 0, i)", "" + ((i % 4) == 0 ? i : (i % 4) + 1));
50 array1[0] = 1;
H A Ddfg-inline-arguments-use-from-uninlined-code.js41 var array1 = bar(a,b,c);
44 for (var i = 0; i < array1.length; ++i)
45 result.push(array1[i]);
/external/chromium_org/chrome/browser/resources/print_preview/
H A Dprint_preview_utils.js26 * @param {Array.<{from: number, to: number}>} array1 The first array.
30 function areArraysEqual(array1, array2) {
31 if (array1.length != array2.length)
33 for (var i = 0; i < array1.length; i++)
34 if (array1[i] !== array2[i])
41 * @param {Array} array1 The first array.
45 function areRangesEqual(array1, array2) {
46 if (array1.length != array2.length)
48 for (var i = 0; i < array1.length; i++)
49 if (array1[
[all...]
/external/eigen/test/eigen2/
H A Deigen2_map.cpp19 Scalar* array1 = ei_aligned_new<Scalar>(size); local
24 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size);
25 Map<VectorType>(array2, size) = Map<VectorType>(array1, size);
26 Map<VectorType>(array3unaligned, size) = Map<VectorType>((const Scalar*)array1, size); // test non-const-correctness support in eigen2
27 VectorType ma1 = Map<VectorType>(array1, size);
33 ei_aligned_delete(array1, size);
45 Scalar* array1 = ei_aligned_new<Scalar>(size); local
46 for(int i = 0; i < size; i++) array1[i] = Scalar(1);
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, row
73 Scalar* array1 = ei_aligned_new<Scalar>(size); local
[all...]
/external/eigen/test/
H A Dmapped_matrix.cpp24 Scalar* array1 = internal::aligned_new<Scalar>(size); local
29 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size);
30 Map<VectorType, Aligned>(array2, size) = Map<VectorType,Aligned>(array1, size);
31 Map<VectorType>(array3unaligned, size) = Map<VectorType>(array1, size);
32 VectorType ma1 = Map<VectorType, Aligned>(array1, size);
42 internal::aligned_delete(array1, size);
55 Scalar* array1 = internal::aligned_new<Scalar>(size); local
56 for(int i = 0; i < size; i++) array1[i] = Scalar(1);
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, row
84 Scalar* array1 = internal::aligned_new<Scalar>(size); local
[all...]
/external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/
H A Dp9.cpp14 int array1[X1<>::value? 1 : -1]; variable
/external/clang/test/PCH/Inputs/
H A Darc.h24 typedef int array1[sizeof((BRIDGE CFTypeRef)CreateSomething())]; typedef
/external/clang/test/CXX/temp/temp.decls/temp.friend/
H A Dp4.cpp21 int array1[sizeof(X2<float>)]; // expected-note{{instantiation of}} variable
/external/clang/test/SemaTemplate/
H A Dinstantiate-enum.cpp11 int array1[adder<long, 3, 4>::value == 7? 1 : -1]; variable
H A Dinstantiate-declref-ice.cpp21 int array1[X0<int>::value == sizeof(int)? 1 : -1]; variable
H A Dtemp_class_order.cpp24 int array1[X1<int*, float*>::value == 1? 1 : -1]; variable
/external/proguard/src/proguard/util/
H A DArrayUtil.java33 * @param array1 the first array.
38 public static boolean equal(byte[] array1, byte[] array2, int size) argument
42 if (array1[index] != array2[index])
54 * @param array1 the first array.
59 public static boolean equal(short[] array1, short[] array2, int size) argument
63 if (array1[index] != array2[index])
75 * @param array1 the first array.
80 public static boolean equal(int[] array1, int[] array2, int size) argument
84 if (array1[index] != array2[index])
96 * @param array1 th
101 equal(Object[] array1, Object[] array2, int size) argument
202 compare(byte[] array1, int size1, byte[] array2, int size2) argument
236 compare(short[] array1, int size1, short[] array2, int size2) argument
270 compare(int[] array1, int size1, int[] array2, int size2) argument
304 compare(Comparable[] array1, int size1, Comparable[] array2, int size2) argument
[all...]
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/
H A Dsfinae-1.cpp17 int array1[is_class<int>::value? -1 : 1]; variable
/external/clang/test/CXX/temp/temp.decls/temp.class.spec/
H A Dp6.cpp21 int array1[X0<int>::Inner0<int*>::value == 1? 1 : -1]; variable
75 int array1[Outer<int>::Inner<int, float>::value? -1 : 1]; member in namespace:rdar8651930

Completed in 656 milliseconds

123