Home
last modified time | relevance | path

Searched refs:array1 (Results 1 – 25 of 79) sorted by relevance

1234

/external/chromium_org/v8/test/webkit/
Ddfg-get-by-val-clobber-expected.txt29 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 1
31 PASS doAccesses(array1, array1, i % 4, 0, i) is 0
32 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 2
34 PASS doAccesses(array1, array1, i % 4, 0, i) is 2
35 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 3
37 PASS doAccesses(array1, array1, i % 4, 0, i) is 3
38 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 4
40 PASS doAccesses(array1, array1, i % 4, 0, i) is 4
41 PASS doAccesses(array1, array2, i % 4, (i + 1) % 4, i) is 1
43 PASS doAccesses(array1, array1, i % 4, 0, i) is 4
[all …]
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]);
Ddfg-get-by-val-clobber.js34 var array1 = [1, 2, 3, 4]; variable
50 array1[0] = 1;
/external/clang/test/Sema/
Dself-comparison.c49 int array1[2]; in array_comparisons() local
55 return array1 == array1; // expected-warning{{self-comparison always evaluates to true}} in array_comparisons()
56 return array1 != array1; // expected-warning{{self-comparison always evaluates to false}} in array_comparisons()
57 return array1 < array1; // expected-warning{{self-comparison always evaluates to false}} in array_comparisons()
58 return array1 <= array1; // expected-warning{{self-comparison always evaluates to true}} in array_comparisons()
59 return array1 > array1; // expected-warning{{self-comparison always evaluates to false}} in array_comparisons()
60 return array1 >= array1; // expected-warning{{self-comparison always evaluates to true}} in array_comparisons()
65 return array1 == array2; // expected-warning{{array comparison always evaluates to false}} in array_comparisons()
66 return array1 != array2; // expected-warning{{array comparison always evaluates to true}} in array_comparisons()
71 return array1 < array2; // expected-warning{{array comparison always evaluates to a constant}} in array_comparisons()
[all …]
/external/eigen/test/eigen2/
Deigen2_map.cpp19 Scalar* array1 = ei_aligned_new<Scalar>(size); in map_class_vector() local
24 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size); in map_class_vector()
25 Map<VectorType>(array2, size) = Map<VectorType>(array1, size); in map_class_vector()
26 …Map<VectorType>(array3unaligned, size) = Map<VectorType>((const Scalar*)array1, size); // test non… in map_class_vector()
27 VectorType ma1 = Map<VectorType>(array1, size); in map_class_vector()
33 ei_aligned_delete(array1, size); in map_class_vector()
45 Scalar* array1 = ei_aligned_new<Scalar>(size); in map_class_matrix() local
46 for(int i = 0; i < size; i++) array1[i] = Scalar(1); in map_class_matrix()
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols); in map_class_matrix()
53 …Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test … in map_class_matrix()
[all …]
/external/eigen/test/
Dmapped_matrix.cpp24 Scalar* array1 = internal::aligned_new<Scalar>(size); in map_class_vector() local
29 Map<VectorType, Aligned>(array1, size) = VectorType::Random(size); in map_class_vector()
30 Map<VectorType, Aligned>(array2, size) = Map<VectorType,Aligned>(array1, size); in map_class_vector()
31 Map<VectorType>(array3unaligned, size) = Map<VectorType>(array1, size); in map_class_vector()
32 VectorType ma1 = Map<VectorType, Aligned>(array1, size); in map_class_vector()
42 internal::aligned_delete(array1, size); in map_class_vector()
55 Scalar* array1 = internal::aligned_new<Scalar>(size); in map_class_matrix() local
56 for(int i = 0; i < size; i++) array1[i] = Scalar(1); in map_class_matrix()
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols); in map_class_matrix()
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols); in map_class_matrix()
[all …]
/external/stlport/test/unit/
Dinsert_test.cpp33 char const* array1 [] = { "laurie", "jennifer", "leisa" }; in insert1() local
36 deque<char const*> names(array1, array1 + 3); in insert1()
49 copy(array1, array1 + 3, itd); in insert1()
57 char const* array1 [] = { "laurie", "jennifer", "leisa" }; in insert2() local
60 deque<char const*> names(array1, array1 + 3); in insert2()
Dlist_test.cpp57 int array1 [] = { 9, 16, 36 }; in list1() local
60 list<int> l1(array1, array1 + 3); in list1()
97 int array1 [] = { 1, 16 }; in list2() local
100 list<int> l1(array1, array1 + 2); in list2()
150 int array1 [] = { 1, 3, 6, 7 }; in list4() local
153 list<int> l1(array1, array1 + 4); in list4()
Dset_test.cpp77 int array1 [] = { 1, 3, 6, 7 }; in set2() local
78 s.insert(array1, array1 + 4); in set2()
125 int array1 [] = { 1, 3, 6, 7 }; in bounds() local
126 set<int> s(array1, array1 + sizeof(array1) / sizeof(array1[0])); in bounds()
/external/chromium_org/chrome/browser/resources/print_preview/
Dprint_preview_utils.js30 function areArraysEqual(array1, array2) { argument
31 if (array1.length != array2.length)
33 for (var i = 0; i < array1.length; i++)
34 if (array1[i] !== array2[i])
45 function areRangesEqual(array1, array2) { argument
46 if (array1.length != array2.length)
48 for (var i = 0; i < array1.length; i++)
49 if (array1[i].from != array2[i].from ||
50 array1[i].to != array2[i].to) {
/external/proguard/src/proguard/util/
DArrayUtil.java38 public static boolean equal(byte[] array1, byte[] array2, int size) in equal() argument
42 if (array1[index] != array2[index]) in equal()
59 public static boolean equal(short[] array1, short[] array2, int size) in equal() argument
63 if (array1[index] != array2[index]) in equal()
80 public static boolean equal(int[] array1, int[] array2, int size) in equal() argument
84 if (array1[index] != array2[index]) in equal()
101 public static boolean equal(Object[] array1, Object[] array2, int size) in equal() argument
105 if (!array1[index].equals(array2[index])) in equal()
202 public static int compare(byte[] array1, int size1, in compare() argument
209 if (array1[index] < array2[index]) in compare()
[all …]
/external/chromium_org/v8/test/mjsunit/regress/
Dregress-swapelements.js37 var array1 = new Array(size); variable
41 array1.splice(0, 1);
48 array1[i] = new Item(i);
49 array1[i].toString = myToString;
51 array1.sort();
Dregress-crbug-263276.js30 var array1 = []; variable
31 array1.foo = true;
40 bad(array1);
41 bad(array1);
Dregress-353004.js9 var array1 = new Uint8Array(buffer1, {valueOf : function() { variable
14 assertEquals(0, array1.length);
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/testing/
Dassert_additions.js53 function assertEqualStringArrays(array1, array2) { argument
55 if (array1.length != array2.length) {
58 for (var i = 0; i < Math.min(array1.length, array2.length); i++) {
59 if (array1[i].trim() != array2[i].trim()) {
64 throw new Error('Expected ' + JSON.stringify(array1) +
/external/lldb/test/lang/objc/foundation/
Dmain.m105 …NSArray *array1 = [NSArray arrayWithObjects: @"array1 object1", @"array1 object2", @"array1 object…
106 NSArray *array2 = [NSArray arrayWithObjects: array1, @"array2 object2", @"array2 object3", nil];
109 // expression [array1 count]
110 // expression array1.count
115 obj = [array1 objectAtIndex: 0]; // Break here for NSArray tests
116 obj = [array1 objectAtIndex: 1];
117 obj = [array1 objectAtIndex: 2];
/external/chromium_org/v8/test/mjsunit/
Dkeyed-load-dictionary-stub.js17 var array1 = generate_dictionary_array(); variable
18 get_accessor(array1, 1);
19 get_accessor(array1, 2);
/external/eigen/doc/
DQuickReference.dox396 array1 * array2 array1 / array2 array1 *= array2 array1 /= array2
397 array1 + scalar array1 - scalar array1 += scalar array1 -= scalar
400 array1 < array2 array1 > array2 array1 < scalar array1 > scalar
401 array1 <= array2 array1 >= array2 array1 <= scalar array1 >= scalar
402 array1 == array2 array1 != array2 array1 == scalar array1 != scalar
405 array1.min(array2)
406 array1.max(array2)
407 array1.abs2()
408 array1.abs() abs(array1)
409 array1.sqrt() sqrt(array1)
[all …]
/external/clang/test/SemaCXX/
Dwarn-self-comparisons.cpp4 void f(int (&array1)[2], int (&array2)[2]) { in f()
5 if (array1 == array2) { } // no warning in f()
/external/clang/test/Lexer/
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 characte… variable
/external/guava/guava-tests/test/com/google/common/collect/
DObjectArraysTest.java153 private void doTestToArrayImpl2(List<Integer> list, Integer[] array1, in doTestToArrayImpl2() argument
155 Integer[] starting = Platform.clone(array1); in doTestToArrayImpl2()
156 Integer[] array2 = Platform.clone(array1); in doTestToArrayImpl2()
157 Object[] reference = list.toArray(array1); in doTestToArrayImpl2()
167 assertTrue(Arrays.equals(expectedArray1, array1)); in doTestToArrayImpl2()
/external/clang/test/SemaOpenCL/
Dshifts.cl12 // CHECK: %array1 = alloca [256 x i8]
13 char array1[((int)1)<<(-24)];
/external/clang/test/CXX/temp/temp.decls/temp.class.spec/
Dp6.cpp21 int array1[X0<int>::Inner0<int*>::value == 1? 1 : -1]; variable
75 int array1[Outer<int>::Inner<int, float>::value? -1 : 1]; variable
/external/llvm/test/CodeGen/PowerPC/
Danon_aggr.ll51 define i8* @func2({ i64, i8* } %array1, %tarray* byval %array2) {
53 %array1_ptr = extractvalue {i64, i8* } %array1, 1
96 define i8* @func3({ i64, i8* }* byval %array1, %tarray* byval %array2) {
98 %tmp1 = getelementptr inbounds { i64, i8* }* %array1, i32 0, i32 1
146 { i64, i8* } %array1, %tarray* byval %array2) {
148 %array1_ptr = extractvalue {i64, i8* } %array1, 1
/external/llvm/test/CodeGen/SystemZ/
Dframe-11.ll19 %array1 = alloca i8, i32 %count1
20 store volatile i8 0, i8 *%array1

1234