@Test
public void notEnoughUniquePoints_strict() {
int DOF = 20;
List<double[]> points = TestStandardKMeans_F64.createPoints(DOF,30,true);
for (int i = 1; i < points.size(); i += 2) {
System.arraycopy(points.get(i-1),0,points.get(i),0,DOF);
}
List<double[]> seeds = TestStandardKMeans_F64.createPoints(DOF,20,false);
InitializeKMeans_F64 alg = createAlg();
alg.init(DOF,0xBEEF);
alg.selectSeeds(points, seeds);
int hits[] = new int[15];
for( double[] a : seeds ) {
int match = findMatch( a , points )/2;
hits[match]++;
}
for (int i = 0; i < hits.length; i++) {
assertTrue(hits[i] > 0);
}
}