-
Notifications
You must be signed in to change notification settings - Fork 271
/
Perf.HashCode.cs
150 lines (140 loc) · 3.74 KB
/
Perf.HashCode.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
// 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 System.Tests
{
[BenchmarkCategory(Categories.Libraries)]
public class Perf_HashCode
{
[Benchmark]
public int Add()
{
var hc = new HashCode();
for (int j = 0; j < 100; j++)
{
hc.Add(j); hc.Add(j); hc.Add(j);
hc.Add(j); hc.Add(j); hc.Add(j);
hc.Add(j); hc.Add(j); hc.Add(j);
}
return hc.ToHashCode();
}
[Benchmark]
public int Combine_1()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result);
}
return result;
}
[Benchmark]
public int Combine_2()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result);
}
return result;
}
[Benchmark]
public int Combine_3()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result,
i + result);
}
return result;
}
[Benchmark]
public int Combine_4()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result,
i + result,
i + result);
}
return result;
}
[Benchmark]
public int Combine_5()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result,
i + result,
i + result,
i + result);
}
return result;
}
[Benchmark]
public int Combine_6()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result,
i + result,
i + result,
i + result,
i + result);
}
return result;
}
[Benchmark]
public int Combine_7()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result,
i + result,
i + result,
i + result,
i + result,
i + result);
}
return result;
}
[Benchmark]
public int Combine_8()
{
int result = 0;
for (int i = 0; i < 10000; i++)
{
result = HashCode.Combine(
i + result,
i + result,
i + result,
i + result,
i + result,
i + result,
i + result,
i + result);
}
return result;
}
}
}