-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathEqualityBenchmark.cs
111 lines (88 loc) · 2.75 KB
/
EqualityBenchmark.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
using BenchmarkDotNet.Attributes;
using BenchmarkDotNet.Running;
using System;
using System.Collections.Generic;
using System.Linq;
namespace ConsoleDemo
{
class Program
{
static void Main()
{
var a = BenchmarkRunner.Run<EqualityBenchmark>();
}
}
[MemoryDiagnoser]
public class EqualityBenchmark
{
public int[] arr1;
public int[] arr2;
[GlobalSetup]
public void Setup()
{
arr1 = Enumerable.Range(0, 1_000).ToArray();
arr2 = Enumerable.Range(0, 1_000).ToArray();
}
public static bool LinqEquality<T>(T[] firstArray, T[] secondArray)
{
return firstArray.SequenceEqual(secondArray);
}
public static bool BitwiseEquality(int[] x, int[] y)
{
if (x == null && y == null)
return true;
if (x == null || y == null || x.Length != y.Length)
return false;
int diff = 0;
for (int i = 0; i < x.Length; i++)
{
diff |= x[i] ^ y[i];
}
return diff == 0;
}
public static bool EqComparerEquality<T>(T[] firstArray, T[] secondArray)
{
if (ReferenceEquals(firstArray, secondArray))
return true;
if ( firstArray == null || secondArray == null || firstArray.Length != secondArray.Length )
return false;
EqualityComparer<T> comparer = EqualityComparer<T>.Default;
for (int i = 0; i < firstArray.Length; i++)
{
if (!comparer.Equals(firstArray[i], secondArray[i]))
return false;
}
return true;
}
[Benchmark]
public void LinqArrEqual() // 948 ms
{
int conditionalCount = 0;
for (int i = 0; i < 100_000; i++)
{
if (LinqEquality(arr1, arr2))
conditionalCount++;
}
}
[Benchmark]
public void BitwiseArrEqual() // 77 ms
{
int conditionalCount = 0;
for (int i = 0; i < 100_000; i++)
{
if (BitwiseEquality(arr1, arr2))
conditionalCount++;
}
}
[Benchmark]
public void EqualityComparerCheck() // 243 ms
{
int conditionalCount = 0;
for (int i = 0; i < 100_000; i++)
{
if (EqComparerEquality(arr1, arr2))
conditionalCount++;
}
}
}
}