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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
// 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.
//
// Integration by Simpson's rule adapted from Conte and de Boor
using Microsoft.Xunit.Performance;
using System;
using System.Runtime.CompilerServices;
using Xunit;
[assembly: OptimizeForBenchmarks]
namespace Benchstone.BenchF
{
public static class Simpsn
{
#if DEBUG
public const int Iterations = 1;
#else
public const int Iterations = 90000;
#endif
[MethodImpl(MethodImplOptions.NoInlining)]
private static bool Bench()
{
double a, b, x, s, c, h, hov2, half, t1;
int idbg, n, nm1;
s = 0;
idbg = 0;
if (idbg != 0)
{
System.Console.WriteLine("simpsons rule\n");
}
for (int j = 1; j <= Iterations; j++)
{
a = 0;
b = 1;
c = 4;
n = 100;
h = (b - a) / n;
hov2 = h / System.Math.Sqrt(c);
s = 0;
t1 = a + hov2;
half = F(t1);
nm1 = n - 1;
for (int i = 1; i <= nm1; i++)
{
x = a + i * h;
s = s + F(x);
t1 = x + hov2;
half = half + F(t1);
s = (h / 6) * (F(a) + 4 * half + 2 * s + F(b));
if (idbg != 0)
{
System.Console.WriteLine(" integral from a = {0} to b = {1} for n = {2} is {3}\n", a, b, n, s);
}
}
}
return true;
}
private static double F(double x)
{
return (System.Math.Exp((-(x)) * 2));
}
[Benchmark]
public static void Test()
{
foreach (var iteration in Benchmark.Iterations)
{
using (iteration.StartMeasurement())
{
Bench();
}
}
}
private static bool TestBase()
{
bool result = Bench();
return result;
}
public static int Main()
{
bool result = TestBase();
return (result ? 100 : -1);
}
}
}
|
