-
Notifications
You must be signed in to change notification settings - Fork 297
Expand file tree
/
Copy pathMDMidpoint.cs
More file actions
71 lines (62 loc) · 1.67 KB
/
MDMidpoint.cs
File metadata and controls
71 lines (62 loc) · 1.67 KB
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
// 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 BenchmarkDotNet.Attributes;
using MicroBenchmarks;
namespace Benchstone.MDBenchI
{
[BenchmarkCategory(Categories.Runtime, Categories.Benchstones, Categories.JIT, Categories.MDBenchI)]
public class MDMidpoint
{
public const int Iterations = 70000;
static int Inner(ref int x, ref int y, ref int z) {
int mid;
if (x < y) {
if (y < z) {
mid = y;
}
else {
if (x < z) {
mid = z;
}
else {
mid = x;
}
}
}
else {
if (x < z) {
mid = x;
}
else {
if (y < z) {
mid = z;
}
else {
mid = y;
}
}
}
return (mid);
}
[Benchmark(Description = nameof(MDMidpoint))]
public bool Test() {
int[,] a = new int[2001, 4];
int[] mid = new int[2001];
int j = 99999;
for (int i = 1; i <= 2000; i++) {
a[i,1] = j & 32767;
a[i,2] = (j + 11111) & 32767;
a[i,3] = (j + 22222) & 32767;
j = j + 33333;
}
for (int k = 1; k <= Iterations; k++) {
for (int l = 1; l <= 2000; l++) {
mid[l] = Inner(ref a[l,1], ref a[l,2], ref a[l,3]);
}
}
return (mid[2000] == 17018);
}
}
}