@Override public double compare(final float[] h1, final float[] h2) { TFloatHashSet union = new TFloatHashSet(h1); union.addAll(h2); TFloatHashSet intersection = new TFloatHashSet(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 float[] h1, final float[] h2) { TFloatHashSet union = new TFloatHashSet(h1); union.addAll(h2); TFloatHashSet intersection = new TFloatHashSet(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 SparseFloatArray h1, final SparseFloatArray h2) { float[] h1v = h1.values(); float[] h2v = h2.values(); TFloatHashSet union = new TFloatHashSet(h1v); union.addAll(h2v); if (h1v.length != h1.length || h2v.length != h2.length) union.add((float)0); TFloatHashSet intersection = new TFloatHashSet(h1v); intersection.retainAll(h2v); if (h1v.length != h1.length && h2v.length != h2.length) union.add((float)0); return 1.0 - (((double)intersection.size()) / (double)union.size()); } },
@Override public double compare(final SparseFloatArray h1, final SparseFloatArray h2) { float[] h1v = h1.values(); float[] h2v = h2.values(); TFloatHashSet union = new TFloatHashSet(h1v); union.addAll(h2v); if (h1v.length != h1.length || h2v.length != h2.length) union.add((float)0); TFloatHashSet intersection = new TFloatHashSet(h1v); intersection.retainAll(h2v); if (h1v.length != h1.length && h2v.length != h2.length) union.add((float)0); return 1.0 - (((double)intersection.size()) / (double)union.size()); } },