@Override public double compare(final byte[] h1, final byte[] h2) { TByteHashSet union = new TByteHashSet(h1); union.addAll(h2); TByteHashSet intersection = new TByteHashSet(h1); intersection.retainAll(h2.clone()); //retainAll sorts the input, so we need to make a copy return 1.0 - (((double)intersection.size()) / (double)union.size()); } },
@Override public double compare(final byte[] h1, final byte[] h2) { TByteHashSet union = new TByteHashSet(h1); union.addAll(h2); TByteHashSet intersection = new TByteHashSet(h1); intersection.retainAll(h2.clone()); //retainAll sorts the input, so we need to make a copy return 1.0 - (((double)intersection.size()) / (double)union.size()); } },
@Override public double compare(final SparseByteArray h1, final SparseByteArray h2) { byte[] h1v = h1.values(); byte[] h2v = h2.values(); TByteHashSet union = new TByteHashSet(h1v); union.addAll(h2v); if (h1v.length != h1.length || h2v.length != h2.length) union.add((byte)0); TByteHashSet intersection = new TByteHashSet(h1v); intersection.retainAll(h2v); if (h1v.length != h1.length && h2v.length != h2.length) union.add((byte)0); return 1.0 - (((double)intersection.size()) / (double)union.size()); } },
@Override public double compare(final SparseByteArray h1, final SparseByteArray h2) { byte[] h1v = h1.values(); byte[] h2v = h2.values(); TByteHashSet union = new TByteHashSet(h1v); union.addAll(h2v); if (h1v.length != h1.length || h2v.length != h2.length) union.add((byte)0); TByteHashSet intersection = new TByteHashSet(h1v); intersection.retainAll(h2v); if (h1v.length != h1.length && h2v.length != h2.length) union.add((byte)0); return 1.0 - (((double)intersection.size()) / (double)union.size()); } },