Home
last modified time | relevance | path

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

1234

/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/vk-gl-cts/android/cts/main/vk-master-2021-03-01/
Dfragment-shading-barycentric.txt33 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.float
34 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec2
35 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec3
36 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec4
37 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.double
38 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec2
39 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec3
40 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec4
41 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.int
42 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.ivec2
[all …]
/third_party/vk-gl-cts/android/cts/main/vk-master/
Dfragment-shading-barycentric.txt201 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.float
202 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec2
203 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec3
204 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec4
205 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.double
206 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec2
207 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec3
208 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec4
209 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.int
210 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.ivec2
[all …]
/third_party/vk-gl-cts/external/vulkancts/mustpass/main/vk-default/
Dfragment-shading-barycentric.txt201 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.float
202 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec2
203 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec3
204 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec4
205 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.double
206 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec2
207 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec3
208 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec4
209 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.int
210 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.ivec2
[all …]
/third_party/vk-gl-cts/android/cts/main/vk-master-2022-03-01/
Dfragment-shading-barycentric.txt201 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.float
202 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec2
203 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec3
204 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.vec4
205 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.double
206 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec2
207 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec3
208 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.dvec4
209 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.int
210 dEQP-VK.fragment_shading_barycentric.data.provoking_first.static.point_list.array2.ivec2
[all …]
/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[]
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.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))
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/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/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/unity/auto/
Dparse_output.rb173 array2 = test_name.split(' ')
175 test_suite = array2[0].sub('TEST(', '')
179 test_name = array2[1].sub(')', '')
196 array2 = test_name.split(' ')
198 test_suite = array2[0].sub('TEST(', '')
202 test_name = array2[1].sub(')', '')
/third_party/node/test/parallel/
Dtest-inspector-tracing-domain.js13 function compareIgnoringOrder(array1, array2) { argument
15 const test = set.size === array2.length && array2.every((el) => set.has(el));
16 assert.ok(test, `[${array1}] differs from [${array2}]`);
/third_party/typescript/tests/cases/conformance/es7/exponentiationOperator/
DemitCompoundExponentiationAssignmentWithIndexingOnLHS1.ts11 var array2 = [1, 2, 3] variable
13 array2[++i2] **= array2[++i2] ** 2;
/third_party/jerryscript/tests/jerry/
Darray-prototype-slice.js20 var array2 = array.slice("a", "3"); variable
34 assert (array2.length == 3);
35 assert (array2[0] == 54);
36 assert (array2[1] == undefined);
37 assert (array2[2] == "Lemon");
Dstring-prototype-localecompare.js34 var array2 = [3, 4]; variable
38 assert (String.prototype.localeCompare.call(array1, array2) === -1);
39 assert (String.prototype.localeCompare.call(array2, array1) === 1);
/third_party/node/test/pummel/
Dtest-crypto-timing-safe-equal-benchmarks.js82 function combinedStandardDeviation(array1, array2) { argument
84 const sum2 = Math.pow(standardDeviation(array2), 2) * (array2.length - 1);
85 return Math.sqrt((sum1 + sum2) / (array1.length + array2.length - 2));
/third_party/typescript/tests/cases/conformance/types/tuple/
DtypeInferenceWithTupleType.ts9 function zip<T, U>(array1: T[], array2: U[]): [[T, U]] {
10 if (array1.length != array2.length) {
16 zipResult.push([array1[i], array2[i]]);
/third_party/flutter/skia/tests/
DSkSLMemoryLayoutTest.cpp88 SkSL::Type array2(SkSL::String("float4[4]"), SkSL::Type::kArray_Kind, *context.fFloat4_Type, 4); in DEF_TEST() local
89 REPORTER_ASSERT(r, 64 == layout.size(array2)); in DEF_TEST()
90 REPORTER_ASSERT(r, 16 == layout.alignment(array2)); in DEF_TEST()
91 REPORTER_ASSERT(r, 16 == layout.stride(array2)); in DEF_TEST()
169 SkSL::Type array2(SkSL::String("float4[4]"), SkSL::Type::kArray_Kind, *context.fFloat4_Type, 4); in DEF_TEST() local
170 REPORTER_ASSERT(r, 64 == layout.size(array2)); in DEF_TEST()
171 REPORTER_ASSERT(r, 16 == layout.alignment(array2)); in DEF_TEST()
172 REPORTER_ASSERT(r, 16 == layout.stride(array2)); in DEF_TEST()
/third_party/jerryscript/tests/jerry/es2015/
Darray-of.js21 var array2 = Array.of(); variable
22 assert(array2.length === 0);
23 assert(array2[0] === undefined);
Dsymbol-isconcatspreadable.js72 var array2 = []; variable
73 Object.defineProperty(array2, '0', { 'get' : function () {throw new ReferenceError ("foo"); } });
76 array1.concat(array2);

1234