Home
last modified time | relevance | path

Searched refs:array2 (Results 1 – 25 of 128) sorted by relevance

123456

/third_party/protobuf/js/experimental/runtime/kernel/
Dtyped_arrays_test.js34 const array2 = new Uint8Array(4); constant
35 array2[0] = 1;
36 expect(arrayBufferEqual(array1.buffer, array2.buffer)).toBe(true);
42 const array2 = new Uint8Array(4); constant
43 array2[0] = 2;
44 expect(arrayBufferEqual(array1.buffer, array2.buffer)).toBe(false);
57 const array2 = new Uint8Array(0); constant
58 expect(uint8ArrayEqual(array1, array2)).toBe(true);
81 const array2 = new Uint8Array(buffer2, 0, 3); constant
82 expect(uint8ArrayEqual(array1, array2)).toBe(true);
[all …]
Dtyped_arrays.js19 const array2 = new Uint8Array(buffer2);
21 return uint8ArrayEqual(array1, array2);
29 function uint8ArrayEqual(array1, array2) { argument
30 if (array1 === array2) {
34 if (array1.byteLength !== array2.byteLength) {
39 if (array1[i] !== array2[i]) {
/third_party/boost/libs/phoenix/test/algorithm/
Dtransformation1.cpp107 int array2[] = {1,2,3}; in transform_test() local
109 boost::phoenix::transform(arg1, arg2, arg3, std::plus<int>())(array, array2, array) == in transform_test()
269 int array2[2]; in remove_copy_test() local
270 BOOST_TEST(boost::phoenix::remove_copy(arg1, arg2, 2)(array, array2) == array2 + 2); in remove_copy_test()
271 BOOST_TEST(array2[0] == 1); in remove_copy_test()
272 BOOST_TEST(array2[1] == 3); in remove_copy_test()
282 int array2[2]; in remove_copy_if_test() local
283 BOOST_TEST(boost::phoenix::remove_copy_if(arg1, arg2, even())(array, array2) == array2 + 2); in remove_copy_if_test()
284 BOOST_TEST(array2[0] == 1); in remove_copy_if_test()
285 BOOST_TEST(array2[1] == 3); in remove_copy_if_test()
[all …]
Dquerying.cpp165 int array2[] = {1,2,3}; in equal_test() local
168 boost::phoenix::equal(arg1, arg2)(array, array2)); in equal_test()
173 boost::phoenix::equal(arg1, arg2, mod_2_comparison())(array, array2)); in equal_test()
201 int array2[] = {3,2,1}; in lower_bound_test() local
202 const std::set<int, std::greater<int> > test_set2(array2, array2 + 3); in lower_bound_test()
203 BOOST_TEST(boost::phoenix::lower_bound(arg1, 2, std::greater<int>())(array2) == in lower_bound_test()
204 array2 + 1); in lower_bound_test()
218 int array2[] = {3,2,1}; in upper_bound_test() local
219 const std::set<int, std::greater<int> > test_set2(array2, array2 + 3); in upper_bound_test()
220 BOOST_TEST(boost::phoenix::upper_bound(arg1, 2, std::greater<int>())(array2) == in upper_bound_test()
[all …]
Dtransformation3.cpp47 int array2[] = {2,3,4}; in merge_test() local
50 BOOST_TEST(merge(arg1, arg2, arg3)(array, array2, output) == output + 6); in merge_test()
73 int array2[] = {5,4,3,4,3,2}; in inplace_merge_test() local
74 boost::phoenix::inplace_merge(arg1, array2 + 3, std::greater<int>())(array2); in inplace_merge_test()
76 BOOST_TEST(std::equal(array2, array2 + 6, expected_result2)); in inplace_merge_test()
87 int array2[] = {2,3,4}; in set_union_test() local
89 BOOST_TEST(set_union(arg1, arg2, arg3)(array, array2, output) == output + 4); in set_union_test()
111 int array2[] = {2,3,4}; in set_intersection_test() local
113 BOOST_TEST(set_intersection(arg1, arg2, arg3)(array, array2, output) == output + 2); in set_intersection_test()
135 int array2[] = {2,3,4}; in set_difference_test() local
[all …]
Dtransformation2.cpp46 int array2[3]; in rotate_copy_test() local
47 rotate_copy(arg1, array + 1, arg2)(array, array2); in rotate_copy_test()
48 BOOST_TEST(array2[0] == 2); in rotate_copy_test()
49 BOOST_TEST(array2[1] == 3); in rotate_copy_test()
50 BOOST_TEST(array2[2] == 1); in rotate_copy_test()
170 int array2[2]; in partial_sort_copy_test() local
171 partial_sort_copy(arg1, arg2)(array, array2); in partial_sort_copy_test()
172 BOOST_TEST(array2[0] == 1); in partial_sort_copy_test()
173 BOOST_TEST(array2[1] == 2); in partial_sort_copy_test()
175 boost::phoenix::partial_sort_copy(arg1, arg2, std::greater<int>())(array, array2); in partial_sort_copy_test()
[all …]
Dquerying2.cpp25 int array2[] = {1,2}; in includes_test() local
26 BOOST_TEST(includes(arg1, arg2)(array, array2)); in includes_test()
28 BOOST_TEST(!includes(arg1, arg2)(rng, array2)); in includes_test()
64 int array2[] = {1,2,4}; in lexicographical_compare_test() local
66 BOOST_TEST(lexicographical_compare(arg1, arg2)(array, array2)); in lexicographical_compare_test()
67 BOOST_TEST(!lexicographical_compare(arg1, arg2)(array2, array)); in lexicographical_compare_test()
70 …OST_TEST(!boost::phoenix::lexicographical_compare(arg1, arg2, std::greater<int>())(array, array2)); in lexicographical_compare_test()
71 …BOOST_TEST(boost::phoenix::lexicographical_compare(arg1, arg2, std::greater<int>())(array2, array)… in lexicographical_compare_test()
/third_party/typescript/tests/baselines/reference/
DemitCompoundExponentiationAssignmentWithIndexingOnLHS1.types45 var array2 = [1, 2, 3]
46 >array2 : number[]
56 array2[++i2] **= array2[++i2] ** 2;
57 >array2[++i2] **= array2[++i2] ** 2 : number
58 >array2[++i2] : number
59 >array2 : number[]
62 >array2[++i2] ** 2 : number
63 >array2[++i2] : number
64 >array2 : number[]
DemitCompoundExponentiationAssignmentWithIndexingOnLHS1.symbols24 var array2 = [1, 2, 3]
25 >array2 : Symbol(array2, Decl(emitCompoundExponentiationAssignmentWithIndexingOnLHS1.ts, 8, 3))
30 array2[++i2] **= array2[++i2] ** 2;
31 >array2 : Symbol(array2, Decl(emitCompoundExponentiationAssignmentWithIndexingOnLHS1.ts, 8, 3))
33 >array2 : Symbol(array2, Decl(emitCompoundExponentiationAssignmentWithIndexingOnLHS1.ts, 8, 3))
DtypeInferenceWithTupleType.types32 function zip<T, U>(array1: T[], array2: U[]): [[T, U]] {
33 >zip : <T, U>(array1: T[], array2: U[]) => [[T, U]]
35 >array2 : U[]
37 if (array1.length != array2.length) {
38 >array1.length != array2.length : boolean
42 >array2.length : number
43 >array2 : U[]
70 zipResult.push([array1[i], array2[i]]);
71 >zipResult.push([array1[i], array2[i]]) : number
75 >[array1[i], array2[i]] : [T, U]
[all …]
DemitCompoundExponentiationAssignmentWithIndexingOnLHS1.js10 var array2 = [1, 2, 3] variable
12 array2[++i2] **= array2[++i2] ** 2;
26 var array2 = [1, 2, 3]; variable
28 (_g = array2)[_h = ++i2] = Math.pow(_g[_h], Math.pow(array2[++i2], 2));
DtypeInferenceWithTupleType.js10 function zip<T, U>(array1: T[], array2: U[]): [[T, U]] {
11 if (array1.length != array2.length) {
17 zipResult.push([array1[i], array2[i]]);
43 function zip(array1, array2) { argument
44 if (array1.length != array2.length) {
50 zipResult.push([array1[i], array2[i]]);
DtypeInferenceWithTupleType.symbols32 function zip<T, U>(array1: T[], array2: U[]): [[T, U]] {
38 >array2 : Symbol(array2, Decl(typeInferenceWithTupleType.ts, 8, 31))
43 if (array1.length != array2.length) {
47 >array2.length : Symbol(Array.length, Decl(lib.es5.d.ts, --, --))
48 >array2 : Symbol(array2, Decl(typeInferenceWithTupleType.ts, 8, 31))
72 zipResult.push([array1[i], array2[i]]);
78 >array2 : Symbol(array2, Decl(typeInferenceWithTupleType.ts, 8, 31))
/third_party/boost/libs/compute/test/
Dtest_valarray.cpp86 boost::compute::valarray<float> array2(data, 4); \
99 array1 op##= array2; \
106 array2 op##= array2; \
108 BOOST_CHECK_CLOSE(float(array2[0]), float(1.0f op 1.0f), 1e-4f); \
109 BOOST_CHECK_CLOSE(float(array2[1]), float(2.0f op 2.0f), 1e-4f); \
110 BOOST_CHECK_CLOSE(float(array2[2]), float(3.0f op 3.0f), 1e-4f); \
111 BOOST_CHECK_CLOSE(float(array2[3]), float(4.0f op 4.0f), 1e-4f); \
131 boost::compute::valarray<int> array2(data, 4); \
144 array1 op##= array2; \
151 array2 op##= array2; \
[all …]
/third_party/boost/libs/multi_array/test/
Dallocators.cpp125 type array2(array1); in main() local
127 test(array2, &sizes[0], strides, elements); in main()
128 BOOST_TEST(test(array1, array2)); in main()
132 type array2(sizes, state); in main() local
135 array2 = array1; in main()
137 test(array2, &sizes[0], strides, elements); in main()
138 BOOST_TEST(test(array1, array2)); in main()
145 other array2 = array1[1]; in main() local
146 other::value_type value = array2[0]; in main()
148 BOOST_TEST(test(array2[0], value)); in main()
/third_party/protobuf/objectivec/Tests/
DGPBArrayTests.m202 //% GPB##NAME##Array *array2 =
205 //% XCTAssertNotNil(array2);
222 //% XCTAssertNotEqualObjects(array1, array2);
224 //% XCTAssertNotEqualObjects(array2, array3);
228 //% [array2 release];
239 //% GPB##NAME##Array *array2 = [array copy];
240 //% XCTAssertNotNil(array2);
243 //% XCTAssertNotEqual(array, array2);
244 //% XCTAssertEqualObjects(array, array2);
245 //% [array2 release];
[all …]
/third_party/boost/libs/core/test/swap/
Darray_of_int.cpp25 int array2[array_size]; in main() local
28 std::copy(initial_array2, initial_array2 + array_size, array2); in main()
30 boost::swap(array1, array2); in main()
33 BOOST_CHECK(std::equal(array2, array2 + array_size, initial_array1)); in main()
Dswap_array_of_int.cpp25 int array2[array_size]; in main() local
28 std::copy(initial_array2, initial_array2 + array_size, array2); in main()
30 boost::swap(array1, array2); in main()
33 BOOST_CHECK(std::equal(array2, array2 + array_size, initial_array1)); in main()
Dswap_array_of_class.cpp47 swap_test_class array2[array_size]; in main() local
50 std::copy(initial_array2, initial_array2 + array_size, array2); in main()
53 boost::swap(array1, array2); in main()
56 BOOST_CHECK(std::equal(array2, array2 + array_size, initial_array1)); in main()
Darray_of_class.cpp47 swap_test_class array2[array_size]; in main() local
50 std::copy(initial_array2, initial_array2 + array_size, array2); in main()
53 boost::swap(array1, array2); in main()
56 BOOST_CHECK(std::equal(array2, array2 + array_size, initial_array1)); in main()
Darray_of_template.cpp57 swap_test_template<int> array2[array_size]; in main() local
60 std::copy(initial_array2, initial_array2 + array_size, array2); in main()
63 boost::swap(array1, array2); in main()
66 BOOST_CHECK(std::equal(array2, array2 + array_size, initial_array1)); in main()
Dswap_array_of_template.cpp57 swap_test_template<int> array2[array_size]; in main() local
60 std::copy(initial_array2, initial_array2 + array_size, array2); in main()
63 boost::swap(array1, array2); in main()
66 BOOST_CHECK(std::equal(array2, array2 + array_size, initial_array1)); in main()
/third_party/typescript/src/harness/
DharnessUtils.ts264 …export function assertDiagnosticsEquals(array1: readonly ts.Diagnostic[], array2: readonly ts.Diag…
265 if (array1 === array2) {
270 assert(array2, "array2");
272 assert.equal(array1.length, array2.length, "array1.length !== array2.length");
276 const d2 = array2[i];
313 const array2: ts.NodeArray<ts.Node> = (<any>node2)[childName]; constant
315 assertArrayStructuralEquals(array1, array2);
319 …function assertArrayStructuralEquals(array1: ts.NodeArray<ts.Node>, array2: ts.NodeArray<ts.Node>)…
320 if (array1 === array2) {
325 assert(array2, "array2");
[all …]
/third_party/cJSON/tests/unity/auto/
Dparse_output.rb90 array2 = test_name.split(' ')
91 @test_suite = array2[0].sub('TEST(', '')
93 test_name = array2[1].sub(')', '')
112 array2 = test_name.split(' ')
113 @test_suite = array2[0].sub('TEST(', '')
115 test_name = array2[1].sub(')', '')
/third_party/boost/libs/container_hash/test/
Dhash_built_in_array_test.cpp33 int array2[1] = {3}; in array_int_test() local
42 BOOST_TEST(hasher2(array2) in array_int_test()
43 == BOOST_HASH_TEST_NAMESPACE::hash_range(array2, array2 + length2)); in array_int_test()

123456