/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/chromium_org/v8/test/mjsunit/regress/ |
regress-crbug-263276.js | 30 var array1 = []; variable 31 array1.foo = true; 40 bad(array1); 41 bad(array1);
|
/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;
|
/external/clang/test/PCH/Inputs/ |
arc.h | 24 typedef int array1[sizeof((BRIDGE CFTypeRef)CreateSomething())]; typedef
|
/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);
|
/external/clang/test/CXX/basic/basic.scope/basic.scope.pdecl/ |
p9.cpp | 14 int array1[X1<>::value? 1 : -1]; variable
|
/external/clang/test/Sema/ |
vector-ops.c | 20 int array1[v2ua]; // expected-error{{size of array has non-integer type 'v2u' (vector of 2 'unsigned int' values)}} local
|
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...] |
/external/clang/test/SemaCXX/ |
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/SemaTemplate/ |
temp_class_order.cpp | 24 int array1[X1<int*, float*>::value == 1? 1 : -1]; variable
|
instantiate-declref-ice.cpp | 21 int array1[X0<int>::value == sizeof(int)? 1 : -1]; variable
|
instantiate-enum.cpp | 11 int array1[adder<long, 3, 4>::value == 7? 1 : -1]; variable
|
ext-vector-type.cpp | 91 int array1[X0<int4>::value == 1? 1 : -1]; member in namespace:Deduction
|
instantiate-expr-5.cpp | 33 int array1[__builtin_offsetof(AnonymousUnion<T>, f) == 0? 1 : -1]; local
|
/art/compiler/utils/ |
dedupe_set_test.cc | 44 SwapVector<uint8_t>* array1; local 52 array1 = deduplicator.Add(self, test1); 53 ASSERT_NE(array1, nullptr); 54 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin())); 65 ASSERT_EQ(array2, array1);
|
/external/clang/test/CXX/temp/temp.decls/temp.class.spec/temp.class.order/ |
p2.cpp | 16 int array1[X<0, 1, int>::value == 1? 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/CXX/temp/temp.fct.spec/temp.deduct/ |
sfinae-1.cpp | 17 int array1[is_class<int>::value? -1 : 1]; variable
|
/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/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
|
/external/clang/test/Parser/ |
ms-if-exists.cpp | 54 int array1[] = { local
|
/external/eigen/test/ |
mapped_matrix.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...] |