-
Notifications
You must be signed in to change notification settings - Fork 272
/
Array2.cs
79 lines (65 loc) · 2.06 KB
/
Array2.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
using System.Runtime.CompilerServices;
using BenchmarkDotNet.Attributes;
using MicroBenchmarks;
namespace Benchstone.BenchI
{
[BenchmarkCategory(Categories.Runtime, Categories.Benchstones, Categories.JIT, Categories.BenchI)]
public class Array2
{
public const int Iterations = 500000;
static T[][][] AllocArray<T>(int n1, int n2, int n3) {
T[][][] a = new T[n1][][];
for (int i = 0; i < n1; ++i) {
a[i] = new T[n2][];
for (int j = 0; j < n2; j++) {
a[i][j] = new T[n3];
}
}
return a;
}
static void Initialize(int[][][] s) {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
s[i][j][k] = (2 * i) - (3 * j) + (5 * k);
}
}
}
}
static bool VerifyCopy(int[][][] s, int[][][] d) {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
if (s[i][j][k] != d[i][j][k]) {
return false;
}
}
}
}
return true;
}
[MethodImpl(MethodImplOptions.NoInlining)]
static bool Bench(int loop) {
int[][][] s = AllocArray<int>(10, 10, 10);
int[][][] d = AllocArray<int>(10, 10, 10);
Initialize(s);
for (; loop != 0; loop--) {
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
d[i][j][k] = s[i][j][k];
}
}
}
}
bool result = VerifyCopy(s, d);
return result;
}
[Benchmark(Description = nameof(Array2))]
public bool Test() => Bench(Iterations);
}
}