@Test
public void testSquareRoot() {
final double DELTA = 1e-15;
a = 0;
double result = calculator.squareRoot(a);
Assert.assertEquals(Math.sqrt(a), result, DELTA);
a = 1;
result = calculator.squareRoot(a);
Assert.assertEquals(Math.sqrt(a), result, DELTA);
a = 25;
result = calculator.squareRoot(a);
Assert.assertEquals(Math.sqrt(a), result, DELTA);
a = 1544646;
result = calculator.squareRoot(a);
Assert.assertEquals(Math.sqrt(a), result, DELTA);
}
@Test
public void testDistanceEuclidienne3() throws DataFormatException {
List<Double> variables = new LinkedList<Double>();
for (double d : p.getVariables()) variables.add(d + 1);
InfinitePoint Point = new InfinitePoint(variables);
assertTrue(
p.distanceEuclidienne(Point) - Math.sqrt(Point.getDimension())
< InfinitePoint.getEpsilon());
}
@Test
public void test() {
Frame frame = null;
try {
Futures fs = new Futures();
Random random = new Random();
Vec[] vecs = new Vec[1];
AppendableVec vec = new AppendableVec(Vec.newKey(), Vec.T_NUM);
for (int i = 0; i < 2; i++) {
NewChunk chunk = new NewChunk(vec, i);
for (int r = 0; r < 1000; r++) chunk.addNum(random.nextInt(1000));
chunk.close(i, fs);
}
vecs[0] = vec.layout_and_close(fs);
fs.blockForPending();
frame = new Frame(Key.<Frame>make(), null, vecs);
// Make sure we test the multi-chunk case
vecs = frame.vecs();
assert vecs[0].nChunks() > 1;
long rows = frame.numRows();
Vec v = vecs[0];
double min = Double.POSITIVE_INFINITY, max = Double.NEGATIVE_INFINITY, mean = 0, sigma = 0;
for (int r = 0; r < rows; r++) {
double d = v.at(r);
if (d < min) min = d;
if (d > max) max = d;
mean += d;
}
mean /= rows;
for (int r = 0; r < rows; r++) {
double d = v.at(r);
sigma += (d - mean) * (d - mean);
}
sigma = Math.sqrt(sigma / (rows - 1));
double epsilon = 1e-9;
assertEquals(max, v.max(), epsilon);
assertEquals(min, v.min(), epsilon);
assertEquals(mean, v.mean(), epsilon);
assertEquals(sigma, v.sigma(), epsilon);
} finally {
if (frame != null) frame.delete();
}
}