Home
last modified time | relevance | path

Searched refs:arr2 (Results 1 – 25 of 119) sorted by relevance

12345

/third_party/mindspore/tests/ut/cpp/dataset/
Dcyclic_array_test.cc56 CyclicArray<int> arr2 = arr; in TEST_F() local
57 EXPECT_EQ(arr2.capacity(), arr.capacity()); in TEST_F()
58 EXPECT_EQ(arr2.size(), arr.size()); in TEST_F()
59 auto last = arr2.end(); in TEST_F()
60 auto first = arr2.begin(); in TEST_F()
62 EXPECT_EQ(arr2[i], arr[i]); in TEST_F()
108 CyclicArray<int> arr2(sz); in TEST_F() local
113 std::iota(arr2.begin(), arr2.end() + sz, val); in TEST_F()
114 EXPECT_EQ(*arr2.begin(), val); in TEST_F()
117 std::shuffle(arr2.begin(), arr2.end(), g); in TEST_F()
[all …]
/third_party/jerryscript/tests/jerry/
Darray-prototype-concat.js25 var arr2 = [obj, "Cherry", "Grape"]; variable
34 var new_array = arr1.concat(arr2, obj, 1);
47 var arr2 = [4,5,6,7,8]; variable
52 var result = arr1.concat(arr2, arr3, arr4);
61 var arr2 = []; variable
62 arr2.length = 3;
63 assert(arr1.concat(arr2).length === arr1.length + arr2.length);
81 arr2 = [];
83 Object.defineProperty(arr2, '0', { 'get' : function () {throw new ReferenceError ("foo"); } });
86 arr1.concat(arr2, arr3);
/third_party/typescript/tests/baselines/reference/
DforIn.js13 var arr2 = []; variable
14 for (j in arr2) { // ok
15 var x3 = arr2[j];
16 var y3 = arr2[j];
34 var arr2 = []; variable
35 for (j in arr2) { // ok
36 var x3 = arr2[j];
37 var y3 = arr2[j];
DforIn.types40 var arr2 = [];
41 >arr2 : any[]
44 for (j in arr2) { // ok
46 >arr2 : any[]
48 var x3 = arr2[j];
50 >arr2[j] : any
51 >arr2 : any[]
54 var y3 = arr2[j];
56 >arr2[j] : any
57 >arr2 : any[]
DforIn.symbols35 var arr2 = [];
36 >arr2 : Symbol(arr2, Decl(forIn.ts, 11, 3))
38 for (j in arr2) { // ok
40 >arr2 : Symbol(arr2, Decl(forIn.ts, 11, 3))
42 var x3 = arr2[j];
44 >arr2 : Symbol(arr2, Decl(forIn.ts, 11, 3))
47 var y3 = arr2[j];
49 >arr2 : Symbol(arr2, Decl(forIn.ts, 11, 3))
DarrayIndexWithArrayFails.symbols5 declare const arr2: number[];
6 >arr2 : Symbol(arr2, Decl(arrayIndexWithArrayFails.ts, 1, 13))
8 const j = arr2[arr1[0]]; // should error
10 >arr2 : Symbol(arr2, Decl(arrayIndexWithArrayFails.ts, 1, 13))
DunionOfClassCalls.js22 const arr2: string[] = []; variable
48 arr2.map((a: string, index: number) => {
52 arr2.reduce((acc: string[], a: string, index: number) => {
56 arr2.forEach((a: string, index: number) => {
89 var arr2 = []; variable
109 arr2.map(function (a, index) {
112 arr2.reduce(function (acc, a, index) {
115 arr2.forEach(function (a, index) {
DarrayIndexWithArrayFails.types5 declare const arr2: number[];
6 >arr2 : number[]
8 const j = arr2[arr1[0]]; // should error
10 >arr2[arr1[0]] : any
11 >arr2 : number[]
DunionOfClassCalls.symbols53 const arr2: string[] = [];
54 >arr2 : Symbol(arr2, Decl(unionOfClassCalls.ts, 20, 5))
129 arr2.map((a: string, index: number) => {
130 >arr2.map : Symbol(Array.map, Decl(lib.es5.d.ts, --, --))
131 >arr2 : Symbol(arr2, Decl(unionOfClassCalls.ts, 20, 5))
141 arr2.reduce((acc: string[], a: string, index: number) => {
142 >arr2.reduce : Symbol(Array.reduce, Decl(lib.es5.d.ts, --, --), Decl(lib.es5.d.ts, --, --), Decl(li…
143 >arr2 : Symbol(arr2, Decl(unionOfClassCalls.ts, 20, 5))
152 arr2.forEach((a: string, index: number) => {
153 >arr2.forEach : Symbol(Array.forEach, Decl(lib.es5.d.ts, --, --))
[all …]
DarrayIndexWithArrayFails.js3 declare const arr2: number[];
4 const j = arr2[arr1[0]]; // should error
7 var j = arr2[arr1[0]]; // should error
DforIn.errors.txt19 var arr2 = [];
20 for (j in arr2) { // ok
21 var x3 = arr2[j];
22 var y3 = arr2[j];
DunionOfClassCalls.types47 const arr2: string[] = [];
48 >arr2 : string[]
140 arr2.map((a: string, index: number) => {
141 >arr2.map((a: string, index: number) => { return index}) : number[]
142 >arr2.map : <U>(callbackfn: (value: string, index: number, array: string[]) => U, thisArg?: any) =>…
143 >arr2 : string[]
154 arr2.reduce((acc: string[], a: string, index: number) => {
155 >arr2.reduce((acc: string[], a: string, index: number) => { return []}, []) : never[]
156 >arr2.reduce : { (callbackfn: (previousValue: string, currentValue: string, currentIndex: number, a…
157 >arr2 : string[]
[all …]
DinvalidMultipleVariableDeclarations.js50 var arr2 = [new D<string>()]; variable
51 var arr2 = new Array<D<number>>();
116 var arr2 = [new D()]; variable
117 var arr2 = new Array(); variable
/third_party/node/test/parallel/
Dtest-primordials-apply.js19 const arr2 = ArrayOfApply(arr1); constant
21 assert.deepStrictEqual(arr2, arr1);
22 assert.notStrictEqual(arr2, arr1);
38 const arr2 = [4, 5, 6]; variable
40 const expected = [...arr1, ...arr2];
42 assert.strictEqual(ArrayPrototypePushApply(arr1, arr2), expected.length);
48 const arr2 = [4, 5, 6]; variable
50 const expected = [...arr2, ...arr1];
52 assert.strictEqual(ArrayPrototypeUnshiftApply(arr1, arr2), expected.length);
Dtest-buffer-sharedarraybuffer.js8 const arr2 = new Uint16Array(12); constant
9 arr2[0] = 5000;
12 arr2[1] = 4000;
15 const ar_buf = Buffer.from(arr2.buffer);
20 arr2[1] = 6000;
/third_party/boost/libs/fusion/example/performance/
Dinner_product.cpp85 boost::array<int, N> arr2; in time_for_std_inner_product() local
87 std::generate(arr2.begin(), arr2.end(), rand); in time_for_std_inner_product()
93 i = std::inner_product(arr1.begin(), arr1.end(), arr2.begin(), 0); in time_for_std_inner_product()
107 i = std::inner_product(arr1.begin(), arr1.end(), arr2.begin(), 0); in time_for_std_inner_product()
128 boost::array<int, N> arr2; in time_for_fusion_inner_product() local
130 std::generate(arr2.begin(), arr2.end(), rand); in time_for_fusion_inner_product()
137 boost::fusion::transform(arr1, arr2, poly_mult()), 0, poly_add()); in time_for_fusion_inner_product()
152 boost::fusion::transform(arr1, arr2, poly_mult()), 0, poly_add()); in time_for_fusion_inner_product()
Dinner_product2.cpp85 boost::array<int, N> arr2; in time_for_std_inner_product() local
87 std::generate(arr2.begin(), arr2.end(), rand); in time_for_std_inner_product()
93 i = std::inner_product(arr1.begin(), arr1.end(), arr2.begin(), 0); in time_for_std_inner_product()
107 i = std::inner_product(arr1.begin(), arr1.end(), arr2.begin(), 0); in time_for_std_inner_product()
146 boost::array<int, N> arr2; in time_for_fusion_inner_product2() local
148 std::generate(arr2.begin(), arr2.end(), rand); in time_for_fusion_inner_product2()
155 boost::fusion::zip(arr1, arr2), 0, poly_combine()); in time_for_fusion_inner_product2()
172 boost::fusion::zip(arr1, arr2), 0, poly_combine()); in time_for_fusion_inner_product2()
Daccumulate.cpp171 boost::array<int, N> arr2;
173 std::generate(arr2.begin(), arr2.end(), rand);
179 i = std::inner_product(arr1.begin(), arr1.end(), arr2.begin(), 0);
193 i = std::inner_product(arr1.begin(), arr1.end(), arr2.begin(), 0);
214 boost::array<int, N> arr2;
216 std::generate(arr2.begin(), arr2.end(), rand);
223 boost::fusion::transform(arr1, arr2, poly_mult()), 0, poly_add());
238 boost::fusion::transform(arr1, arr2, poly_mult()), 0, poly_add());
275 boost::array<int, N> arr2;
277 std::generate(arr2.begin(), arr2.end(), rand);
[all …]
/third_party/vk-gl-cts/framework/delibs/decpp/
DdePoolArray.cpp90 PoolArray<int> arr2(&pool); in intArrayTest() local
91 arr2.resize(1500); in intArrayTest()
92 arr2.reserve(2000); in intArrayTest()
94 arr2[i] = i; in intArrayTest()
96 arr2.pushBack(i); in intArrayTest()
98 DE_TEST_ASSERT(arr2.size() == 5000); in intArrayTest()
101 int val = arr2[i]; in intArrayTest()
170 PoolArray<int, 32> arr2(&pool); in alignedIntArrayTest() local
171 arr2.resize(1500); in alignedIntArrayTest()
172 arr2.reserve(2000); in alignedIntArrayTest()
[all …]
/third_party/jerryscript/tests/jerry/es2015/
Darray-spread.js62 var arr2 = [3, 4, 5]; variable
66 assertArrayEqual ([...arr1, ...arr2], [0, 1, 2, 3 ,4, 5]);
67 assertArrayEqual ([...arr2, ...arr1], [3 ,4, 5, 0, 1, 2]);
68 assertArrayEqual ([...arr1, 9, 9, 9, ...arr2], [0, 1, 2, 9, 9, 9, 3 ,4, 5]);
69 assertArrayEqual ([...arr1, ...[...arr2]], [0, 1, 2, 3 ,4, 5]);
70 assertArrayEqual (["0" , "1", ...arr1, ...[...arr2]], ["0", "1", 0, 1, 2, 3 ,4, 5]);
/third_party/typescript/tests/cases/compiler/
DforIn.ts12 var arr2 = []; variable
13 for (j in arr2) { // ok
14 var x3 = arr2[j];
15 var y3 = arr2[j];
DunionOfClassCalls.ts22 const arr2: string[] = []; property in Test
48 arr2.map((a: string, index: number) => {
52 arr2.reduce((acc: string[], a: string, index: number) => {
56 arr2.forEach((a: string, index: number) => {
/third_party/glslang/Test/
Dspv.specConstArrayCheck.vert9 uint arr2[b];
11 o = arr2[1];
13 o = arr2[6];
/third_party/boost/libs/test/test/test-organization-ts/datasets-test/
Darray-test.cpp27 double const arr2[] = {7.4,3.2}; in BOOST_AUTO_TEST_CASE() local
28 BOOST_TEST( data::make( arr2 ).size() == 2 ); in BOOST_AUTO_TEST_CASE()
74 double const arr2[] = {7.4,3.2}; in BOOST_AUTO_TEST_CASE() local
76 dataset_array_double_type res2 = data::make( arr2 ); in BOOST_AUTO_TEST_CASE()
Dmono-join-test.cpp34 int arr2[] = {7,19}; in BOOST_AUTO_TEST_CASE() local
35 BOOST_TEST( (data::make( arr1 ) + data::make( arr2 )).size() == 4 ); in BOOST_AUTO_TEST_CASE()
39 …BOOST_TEST( (data::make( std::vector<int>(2) ) + data::make( 1 ) + data::make( arr2 ) + data::make… in BOOST_AUTO_TEST_CASE()
46 …ta::make( std::vector<int>(arr1,arr1+2) ) + data::make( 5 ) + data::make( arr2 ) + data::make( 37 … in BOOST_AUTO_TEST_CASE()
57 …::make( std::vector<int>(arr1,arr1+2) ) + (data::make( 5 ) + (data::make( arr2 ) + data::make( 37 … in BOOST_AUTO_TEST_CASE()
68 …::make( std::vector<int>(arr1,arr1+2) ) + data::make( 5 )) + (data::make( arr2 ) + data::make( 37 … in BOOST_AUTO_TEST_CASE()

12345