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

1 2 3 4

  /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/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/Array/
general1.js 41 var array1 = []; variable
43 array1.push(123); //array1 = [123]
44 array1.push("dog"); //array1 = [123,dog]
45 array1.push(-99); //array1 = [123,dog,-99]
46 array1.push("cat"); //array1 = [123,dog,-99,cat]
47 testcases[count++] = new TestCase( SECTION, "array1.pop()", array1.pop(),'cat')
    [all...]
general2.js 42 array1 = new Array();
46 // this for loop populates array1 and array2 as follows:
47 // array1 = [0,1,2,3,4,....,size - 2,size - 1]
51 array1.push(i);
55 // the following for loop reverses the order of array1 so
57 for (i = array1.length; i > 0; i--)
59 array3 = array1.slice(1,i);
60 array1.splice(1,i-1);
61 array1 = array3.concat(array1);
    [all...]
  /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...]
constant-builtins-2.c 58 int array1[__builtin_strlen("ab\0cd")]; variable
59 int array2[(sizeof(array1)/sizeof(int)) == 2? 1 : -1];
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]) {
  /external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/
p9.cpp 14 int array1[X1<>::value? 1 : -1]; variable
  /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/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
instantiate-expr-5.cpp 33 int array1[__builtin_offsetof(AnonymousUnion<T>, f) == 0? 1 : -1]; local
  /libcore/luni/src/main/java/java/util/
Arrays.java     [all...]
  /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]) {

Completed in 331 milliseconds

1 2 3 4