HomeSort by relevance Sort by last modified time
    Searched refs:array1 (Results 1 - 25 of 108) sorted by null

1 2 3 4 5

  /external/clang/test/SemaCXX/
warn-self-comparisons.cpp 4 void f(int (&array1)[2], int (&array2)[2]) {
5 if (array1 == array2) { } // no warning
non-empty-class-size-zero.cpp 6 int array1[0]; member in struct:X
c99-variable-length-array-cxx11.cpp 21 int array1[N]; // expected-warning{{variable length arrays are a C99 feature}} local
  /external/clang/test/Lexer/
utf8-char-literal.cpp 5 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/clang/test/Sema/
self-comparison.c 49 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 > array1; // expected-warning{{self-comparison always evaluates to false}
    [all...]
vector-ops.c 20 int array1[v2ua]; // expected-error{{size of array has non-integer type 'v2u'}} local
  /external/stlport/test/unit/
insert_test.cpp 33 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);
  /ndk/tests/device/test-gnustl-full/unit/
insert_test.cpp 33 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);
  /ndk/tests/device/test-stlport/unit/
insert_test.cpp 33 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);
  /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/func/
KeyGeneratorThread.java 41 byte[] array1 = k.getEncoded();
45 for (int i = 0; i < array1.length; i++) {
46 if (array1[i] == array2[i]) {
50 if (matches > array1.length / 2) {
57 array1 = k.getEncoded();
62 for (int i = 0; i < array1.length; i++) {
63 if (array1[i] == array2[i]) {
  /external/eigen/test/eigen2/
eigen2_map.cpp 19 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, rows, cols); // test non-const-correctness support in eigen
73 Scalar* array1 = ei_aligned_new<Scalar>(size); local
    [all...]
  /external/eigen/test/
map.cpp 24 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, rows, cols)
84 Scalar* array1 = internal::aligned_new<Scalar>(size); local
    [all...]
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/
NameDistance.java 65 byte[] array1, array2;
69 array1 = bytes2;
72 array1 = bytes1;
75 int length1 = array1.length;
78 for (int i = 0; i < array1.length; i++) {
79 if (array1[i] != array2[i]) {
112 byte c1 = array1[i];
144 if (array1[i] != array2[j]) {
  /art/compiler/utils/
dedupe_set_test.cc 42 ByteArray* array1; local
49 array1 = deduplicator.Add(self, test1);
50 ASSERT_EQ(test1, *array1);
61 ASSERT_EQ(array2, array1);
  /external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/
p9.cpp 14 int array1[X1<>::value? 1 : -1]; variable
  /external/clang/test/PCH/Inputs/
arc.h 24 typedef int array1[sizeof((BRIDGE CFTypeRef)CreateSomething())]; typedef
  /external/clang/test/SemaTemplate/
instantiate-enum.cpp 11 int array1[adder<long, 3, 4>::value == 7? 1 : -1]; variable
instantiate-declref-ice.cpp 21 int array1[X0<int>::value == sizeof(int)? 1 : -1]; variable
  /libcore/luni/src/main/java/java/util/
Arrays.java     [all...]
  /external/clang/test/CXX/temp/temp.decls/temp.friend/
p4.cpp 21 int array1[sizeof(X2<float>)]; // expected-note{{instantiation of}} variable
  /external/clang/test/CXX/temp/temp.decls/temp.class.spec/
p6.cpp 21 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
  /frameworks/base/core/java/com/android/internal/util/
ArrayUtils.java 76 * @param array1 the first byte array
81 public static boolean equals(byte[] array1, byte[] array2, int length) {
86 if (array1 == array2) {
89 if (array1 == null || array2 == null || array1.length < length || array2.length < length) {
93 if (array1[i] != array2[i]) {
  /packages/apps/ContactsCommon/src/com/android/contacts/common/format/
FormatUtils.java 57 * Finds the earliest point in array1 at which the first part of array2 matches. For example,
60 public static int overlapPoint(char[] array1, char[] array2) {
61 if (array1 == null || array2 == null) {
64 int count1 = array1.length;
68 while (count1 > 0 && count2 > 0 && array1[count1 - 1] == array2[count2 - 1]) {
80 if (array1[i+j] != array2[j]) {
  /external/chromium_org/v8/test/mjsunit/regress/
regress-swapelements.js 37 var array1 = new Array(size);
41 array1.splice(0, 1);
48 array1[i] = new Item(i);
49 array1[i].toString = myToString;
51 array1.sort();
  /external/chromium_org/v8/test/webkit/
dfg-get-by-val-clobber.js 34 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;

Completed in 625 milliseconds

1 2 3 4 5