java.util.hashset_我应该转储java.util.HashSet以支持CompactHashSet...

让我们开始一个小基准游戏.

基准测试基于原始文章的基准测试,但使用现代工具.

package tests;

import com.carrotsearch.hppc.ObjectOpenHashSet;

import com.carrotsearch.hppc.cursors.ObjectCursor;

import com.google.common.collect.GuavaCompactHashSet;

import net.ontopia.utils.CompactHashSet;

import net.openhft.koloboke.collect.set.hash.HashObjSet;

import net.openhft.koloboke.collect.set.hash.HashObjSets;

import org.openjdk.jmh.annotations.*;

import java.util.Arrays;

import java.util.HashSet;

import java.util.Set;

import java.util.concurrent.TimeUnit;

import java.util.function.Consumer;

import static java.util.Arrays.stream;

import static org.openjdk.jol.info.GraphLayout.parseInstance;

@BenchmarkMode(Mode.AverageTime)

@OutputTimeUnit(TimeUnit.NANOSECONDS)

@OperationsPerInvocation(TestHashSet.TIMES)

@Threads(1)

@Fork(1)

@State(Scope.Thread)

public class TestHashSet {

public static final int TIMES = 1000000;

private static final int MAX = 5000000;

private static long ELEMENTS_SIZE;

static Long[] add = new Long[TIMES], lookup = new Long[TIMES], remove = new Long[TIMES];

static {

for (int ix = 0; ix < TIMES; ix++)

add[ix] = new Long(Math.round(Math.random() * MAX));

ELEMENTS_SIZE = stream(add).distinct().count() * parseInstance(add[0]).totalSize();

for (int ix = 0; ix < TIMES; ix++)

lookup[ix] = new Long(Math.round(Math.random() * MAX));

for (int ix = 0; ix < TIMES; ix++)

remove[ix] = new Long(Math.round(Math.random() * MAX));

}

@Benchmark

public int hashSet() {

Set set = new HashSet();

for (Long o : add) {

set.add(o);

}

int r = 0;

for (Long o : lookup) {

r ^= set.contains(o) ? 1 : 0;

}

for (Long o : set) {

r += o.intValue();

}

for (Long o : remove) {

set.remove(o);

}

return r + set.size();

}

@Benchmark

public int compactHashSet() {

Set set = new CompactHashSet();

for (Long o : add) {

set.add(o);

}

int r = 0;

for (Long o : lookup) {

r ^= set.contains(o) ? 1 : 0;

}

for (Long o : set) {

r += o.intValue();

}

for (Long o : remove) {

set.remove(o);

}

return r + set.size();

}

@Benchmark

public int hppcSet() {

ObjectOpenHashSet set = new ObjectOpenHashSet();

for (Long o : add) {

set.add(o);

}

int r = 0;

for (Long o : lookup) {

r ^= set.contains(o) ? 1 : 0;

}

for (ObjectCursor cur : set) {

r += cur.value.intValue();

}

for (Long o : remove) {

set.remove(o);

}

return r + set.size();

}

@Benchmark

public int kolobokeSet() {

Set set = HashObjSets.newMutableSet();

for (Long o : add) {

set.add(o);

}

int r = 0;

for (Long o : lookup) {

r ^= set.contains(o) ? 1 : 0;

}

for (Long o : set) {

r += o.intValue();

}

for (Long o : remove) {

set.remove(o);

}

return r + set.size();

}

@Benchmark

public int guavaCompactHashSet() {

// fair comparison -- growing table

Set set = new GuavaCompactHashSet<>(10);

for (Long o : add) {

set.add(o);

}

int r = 0;

for (Long o : lookup) {

r ^= set.contains(o) ? 1 : 0;

}

for (Long o : set) {

r += o.intValue();

}

for (Long o : remove) {

set.remove(o);

}

return r + set.size();

}

public static void main(String[] argv) {

HashSet hashSet = new HashSet();

test("HashSet", hashSet, hashSet::add);

CompactHashSet compactHashSet = new CompactHashSet();

test("CompactHashSet", compactHashSet, compactHashSet::add);

HashObjSet kolobokeSet = HashObjSets.newMutableSet();

test("KolobokeSet", kolobokeSet, kolobokeSet::add);

ObjectOpenHashSet hppcSet = new ObjectOpenHashSet();

test("HPPC set", hppcSet, hppcSet::add);

GuavaCompactHashSet guavaCompactHashSet = new GuavaCompactHashSet(10);

test("GuavaCompactHashSet", guavaCompactHashSet, guavaCompactHashSet::add);

}

public static void test(String name, Object set, Consumer setAdd) {

for (Long o : add) {

setAdd.accept(o);

}

System.out.printf("%s: %.1f bytes per element

", name,

((parseInstance(set).totalSize() - ELEMENTS_SIZE) * 1.0 / TIMES));

}

}

结果：

Set implementation Speed Memory footprint

Score Units +UCOops -UseCompressedOops

CompactHashSet 828 ns/op 8.4 16.8 bytes/elem

HashSet 676 ns/op 37.4 60.3 bytes/elem

HPPC Set 853 ns/op 10.5 18.9 bytes/elem

Koloboke Set 587 ns/op 8.4 16.8 bytes/elem

GuavaCompactHashSet 874 ns/op 25.9 37.4 bytes/elem

看起来CompactHashSet甚至比旧的好HashSet慢,尽管它使用的内存要少得多.