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
|
/*
* Copyright (C) 2009 Google Inc.
*
* 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 examples;
import com.google.caliper.Param;
import com.google.caliper.Runner;
import com.google.caliper.SimpleBenchmark;
import java.util.Arrays;
import java.util.Random;
/**
* Measures sorting on different distributions of integers.
*/
public class ArraySortBenchmark extends SimpleBenchmark {
@Param({"10", "100", "1000", "10000"}) private int length;
@Param private Distribution distribution;
private int[] values;
private int[] copy;
@Override protected void setUp() throws Exception {
values = distribution.create(length);
copy = new int[length];
}
public void timeSort(int reps) {
for (int i = 0; i < reps; i++) {
System.arraycopy(values, 0, copy, 0, values.length);
Arrays.sort(copy);
}
}
public enum Distribution {
SAWTOOTH {
@Override
int[] create(int length) {
int[] result = new int[length];
for (int i = 0; i < length; i += 5) {
result[i] = 0;
result[i + 1] = 1;
result[i + 2] = 2;
result[i + 3] = 3;
result[i + 4] = 4;
}
return result;
}
},
INCREASING {
@Override
int[] create(int length) {
int[] result = new int[length];
for (int i = 0; i < length; i++) {
result[i] = i;
}
return result;
}
},
DECREASING {
@Override
int[] create(int length) {
int[] result = new int[length];
for (int i = 0; i < length; i++) {
result[i] = length - i;
}
return result;
}
},
RANDOM {
@Override
int[] create(int length) {
Random random = new Random();
int[] result = new int[length];
for (int i = 0; i < length; i++) {
result[i] = random.nextInt();
}
return result;
}
};
abstract int[] create(int length);
}
public static void main(String[] args) throws Exception {
Runner.main(ArraySortBenchmark.class, args);
}
}
|
