-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathIntersect.cs
67 lines (60 loc) · 1.66 KB
/
Intersect.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
using System.Linq;
using BenchmarkDotNet.Attributes;
namespace StructLinq.Benchmark
{
[MemoryDiagnoser]
public class Intersect
{
private const int Count = 10000;
private int[] array1;
private int[] array2;
public Intersect()
{
var size1 = Count / 2;
var size2 = Count - size1;
array1 = Enumerable.Range(0, size1).ToArray();
array2 = Enumerable.Range(size1 - 100, size2).ToArray();
}
[Benchmark(Baseline = true)]
public int Linq()
{
var sum = 0;
foreach (var i in array1.Intersect(array2))
{
sum += i;
}
return sum;
}
[Benchmark]
public int StructLinq()
{
var sum = 0;
foreach (var i in array1.ToStructEnumerable().Intersect(array2.ToStructEnumerable()))
{
sum += i;
}
return sum;
}
[Benchmark]
public int StructLinqZeroAlloc()
{
var sum = 0;
foreach (var i in array1.ToStructEnumerable().Intersect(array2.ToStructEnumerable(), x => x, x => x))
{
sum += i;
}
return sum;
}
[Benchmark]
public int StructLinqZeroAllocAndComparer()
{
var sum = 0;
var comparer = new DefaultStructEqualityComparer();
foreach (var i in array1.ToStructEnumerable().Intersect(array2.ToStructEnumerable(), comparer, x => x, x => x))
{
sum += i;
}
return sum;
}
}
}