Intersection { public static double distance(double[] v1,double[] v2){ Asserts.assertEqualLength(v1, v2); Asserts.assertGreaterOrEqualThanValue(v1, 0); Asserts.assertGreaterOrEqualThanValue(v2, 0); Asserts.assertHasAllZeros(v1); Asserts.assertHasAllZeros(v2); double sumNum = 0; double sumV1 = 0; double sumV2 = 0; for(int i=0;i<v1.length;i++){ sumNum += CommonStats.min(v1[i], v2[i]); sumV1 += v1[i]; sumV2 += v2[i]; } return 1 - (sumNum/CommonStats.min(sumV1, sumV2)); }  static double distance(double[] v1,double[] v2);  }
@Test public void test1(){ double[] v1 = new double[]{8,3,7}; double[] v2 = new double[]{9,8,4}; double res = Intersection.distance(v1, v2); Asserts.assertEquals(res, 0.16666666666667); }
@Test public void test2(){ double[] v1 = new double[]{8,32,7,0,45}; double[] v2 = new double[]{97,78,41,4,78}; double res = Intersection.distance(v1, v2); Asserts.assertEquals(res, 0); }
@Test public void test3(){ double[] v1 = new double[]{248.124,321.574,788.14,0.001,459.298}; double[] v2 = new double[]{97.145,78.658,417.0004,4.02,7865.3594}; double res = Intersection.distance(v1, v2); Asserts.assertEquals(res, 0.42101096395043); }