Created
October 20, 2014 20:59
-
-
Save mikeb01/4bdd095d01965d634330 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package org.openjdk.jmh.samples; | |
import org.openjdk.jmh.annotations.Benchmark; | |
import org.openjdk.jmh.annotations.Scope; | |
import org.openjdk.jmh.annotations.Setup; | |
import org.openjdk.jmh.annotations.State; | |
import org.openjdk.jmh.infra.Blackhole; | |
import org.openjdk.jmh.runner.Runner; | |
import org.openjdk.jmh.runner.options.Options; | |
import org.openjdk.jmh.runner.options.OptionsBuilder; | |
import java.util.ArrayList; | |
import java.util.List; | |
import java.util.Random; | |
@State(Scope.Benchmark) | |
public class SortedTest { | |
private static final int NO_OF_ITEMS = 5_000_000; | |
private List<Integer> arrayListValues = new ArrayList<>(NO_OF_ITEMS); | |
private Integer[] boxedValues = new Integer[NO_OF_ITEMS]; | |
private int[] primitiveValues = new int[NO_OF_ITEMS]; | |
private int[] unsortedOrder = new int[NO_OF_ITEMS]; | |
private int[] sortedOrder = new int[NO_OF_ITEMS]; | |
private Random r; | |
@Setup | |
public void setUp() { | |
r = new Random(); | |
for (int i = 0; i < NO_OF_ITEMS; i++) { | |
unsortedOrder[i] = i; | |
sortedOrder[i] = i; | |
int value = r.nextInt(); | |
arrayListValues.add(value); | |
primitiveValues[i] = value; | |
boxedValues[i] = new Integer(value); | |
} | |
shuffleArray(unsortedOrder); | |
} | |
@Benchmark | |
public void testSortedPrimitive(Blackhole bh) { | |
for (int i : sortedOrder) { | |
bh.consume(primitiveValues[i]); | |
} | |
} | |
@Benchmark | |
public void testSortedBoxed(Blackhole bh) { | |
for (int i : sortedOrder) { | |
bh.consume(boxedValues[i].intValue()); | |
} | |
} | |
@Benchmark | |
public void testSortedArrayList(Blackhole bh) { | |
for (int i : sortedOrder) { | |
bh.consume(arrayListValues.get(i).intValue()); | |
} | |
} | |
@Benchmark | |
public void testUnsortedPrimitive(Blackhole bh) { | |
for (int i : unsortedOrder) { | |
bh.consume(primitiveValues[i]); | |
} | |
} | |
@Benchmark | |
public void testUnsortedBoxed(Blackhole bh) { | |
for (int i : unsortedOrder) { | |
bh.consume(boxedValues[i].intValue()); | |
} | |
} | |
@Benchmark | |
public void testUnsortedArrayList(Blackhole bh) { | |
for (int i : unsortedOrder) { | |
bh.consume(arrayListValues.get(i).intValue()); | |
} | |
} | |
public static void main(String[] args) throws Throwable { | |
Options opt = new OptionsBuilder() | |
.include(SortedTest.class.getSimpleName()) | |
.warmupIterations(5) | |
.measurementIterations(20) | |
.threads(1) | |
.forks(3) | |
.build(); | |
new Runner(opt).run(); | |
} | |
static void shuffleArray(int[] ar) | |
{ | |
Random rnd = new Random(); | |
for (int i = ar.length - 1; i > 0; i--) | |
{ | |
int index = rnd.nextInt(i + 1); | |
// Simple swap | |
int a = ar[index]; | |
ar[index] = ar[i]; | |
ar[i] = a; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment