/
SortedCopyBenchmark.java
136 lines (121 loc) · 3.48 KB
/
SortedCopyBenchmark.java
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
/*
* Copyright (C) 2014 The Guava Authors
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License.
*/
package com.google.common.collect;
import static com.google.common.base.Preconditions.checkArgument;
import com.google.caliper.BeforeExperiment;
import com.google.caliper.Benchmark;
import com.google.caliper.Param;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;
/**
* Provides supporting data for performance notes in the documentation of {@link
* Ordering#sortedCopy} and {@link Ordering#immutableSortedCopy}, as well as for automated code
* suggestions.
*
*/
public class SortedCopyBenchmark {
@Param({"1", "10", "1000", "1000000"})
int size; // logarithmic triangular
@Param boolean mutable;
@Param InputOrder inputOrder;
enum InputOrder {
SORTED {
@Override
void arrange(List<Integer> list) {
Collections.sort(list);
}
},
ALMOST_SORTED {
@Override
void arrange(List<Integer> list) {
Collections.sort(list);
if (list.size() > 1) {
int i = (list.size() - 1) / 2;
Collections.swap(list, i, i + 1);
}
}
},
RANDOM {
@Override
void arrange(List<Integer> list) {}
};
abstract void arrange(List<Integer> list);
}
private ImmutableList<Integer> input;
@BeforeExperiment
void setUp() {
checkArgument(size > 0, "empty collection not supported");
Set<Integer> set = new LinkedHashSet<>(size);
Random random = new Random();
while (set.size() < size) {
set.add(random.nextInt());
}
List<Integer> list = new ArrayList<>(set);
inputOrder.arrange(list);
input = ImmutableList.copyOf(list);
}
@Benchmark
int collections(int reps) {
int dummy = 0;
// Yes, this could be done more elegantly
if (mutable) {
for (int i = 0; i < reps; i++) {
List<Integer> copy = new ArrayList<>(input);
Collections.sort(copy);
dummy += copy.get(0);
}
} else {
for (int i = 0; i < reps; i++) {
List<Integer> copy = new ArrayList<>(input);
Collections.sort(copy);
dummy += ImmutableList.copyOf(copy).get(0);
}
}
return dummy;
}
@Benchmark
int ordering(int reps) {
int dummy = 0;
if (mutable) {
for (int i = 0; i < reps; i++) {
dummy += ORDERING.sortedCopy(input).get(0);
}
} else {
for (int i = 0; i < reps; i++) {
dummy += ORDERING.immutableSortedCopy(input).get(0);
}
}
return dummy;
}
@Benchmark
int sortedSet(int reps) {
int dummy = 0;
if (mutable) {
for (int i = 0; i < reps; i++) {
dummy += new TreeSet<Integer>(input).first();
}
} else {
for (int i = 0; i < reps; i++) {
dummy += ImmutableSortedSet.copyOf(input).first();
}
}
return dummy;
}
private static final Ordering<Integer> ORDERING = Ordering.natural();
}