use of uk.ac.sussex.gdsc.test.junit5.RandomSeed in project GDSC-SMLM by aherbert.
the class FactorialTest method testFactorialDouble.
/**
* Test the factorial of a fractional number against Commons Math gamma(1+n).
*/
@SeededTest
void testFactorialDouble(RandomSeed seed) {
final UniformRandomProvider rng = RngUtils.create(seed.getSeed());
final DoubleDoubleBiPredicate tol = TestHelper.doublesAreClose(5e-15).or(TestHelper.doublesEqual());
for (int i = 0; i < 100; i++) {
final double n = rng.nextDouble() * 180;
final double expected = n < 1.5 ? 1 / (1 + Gamma.invGamma1pm1(n)) : Gamma.gamma(1 + n);
TestAssertions.assertTest(expected, Factorial.value(n), tol, () -> Double.toString(n));
}
}
use of uk.ac.sussex.gdsc.test.junit5.RandomSeed in project GDSC-SMLM by aherbert.
the class FastLogTest method canTestDoubleSpeedLog1P.
@SpeedTag
@SeededTest
void canTestDoubleSpeedLog1P(RandomSeed seed) {
// No assertions, this is just a report
Assumptions.assumeTrue(logger.isLoggable(Level.INFO));
Assumptions.assumeTrue(TestSettings.allow(TestComplexity.MEDIUM));
final UniformRandomProvider rng = RngUtils.create(seed.getSeed());
final double[] x = new double[1000000];
for (int i = 0; i < x.length; i++) {
x[i] = nextUniformDouble(rng);
}
final MathLog fl = new MathLog();
final TimingService ts = new TimingService(5);
// ts.execute(new DoubleTimingTask(new TestLog(fl), 0, x));
ts.execute(new DoubleTimingTask(new Test1PLog(fl), 0, x));
ts.execute(new DoubleTimingTask(new TestLog1P(fl), 0, x));
ts.execute(new DoubleTimingTask(new TestLog1PApache(fl), 0, x));
// ts.execute(new DoubleTimingTask(new TestLog(fl), 0, x));
ts.execute(new DoubleTimingTask(new Test1PLog(fl), 0, x));
ts.execute(new DoubleTimingTask(new TestLog1P(fl), 0, x));
ts.execute(new DoubleTimingTask(new TestLog1PApache(fl), 0, x));
final int size = ts.getSize();
ts.repeat(size);
logger.info(ts.getReport(size));
}
use of uk.ac.sussex.gdsc.test.junit5.RandomSeed in project GDSC-SMLM by aherbert.
the class FastLogTest method canTestDoubleErrorRange.
@SeededTest
void canTestDoubleErrorRange(RandomSeed seed) {
Assumptions.assumeTrue(logger.isLoggable(Level.INFO));
Assumptions.assumeTrue(TestSettings.allow(TestComplexity.HIGH));
final UniformRandomProvider rng = RngUtils.create(seed.getSeed());
final LocalList<TestFastLog> test = new LocalList<>();
final int n = 13;
test.add(new TestFastLog(IcsiFastLog.create(n, DataType.DOUBLE)));
test.add(new TestFastLog(new FFastLog(n)));
test.add(new TestFastLog(new DFastLog(n)));
test.add(new TestFastLog(new TurboLog(n)));
// Full range in blocks.
// Only when the number is around 1 or min value are there significant errors
final double[] d = new double[10000000];
final double[] logD = null;
// All
// testDoubleErrorRange(test, n, d, logD, 0, 255, 0);
// Only a problem around min value and x==1
// testDoubleErrorRange(rng, test, n, d, logD, 0, 2, 0);
testDoubleErrorRange(rng, test, n, d, logD, 1021, 1026, 0);
testDoubleErrorRange(rng, test, n, d, logD, 2045, 2047, 0);
}
use of uk.ac.sussex.gdsc.test.junit5.RandomSeed in project GDSC-SMLM by aherbert.
the class FastLogTest method canTestDoubleErrorLog1P.
@SeededTest
void canTestDoubleErrorLog1P(RandomSeed seed) {
Assumptions.assumeTrue(logger.isLoggable(Level.INFO));
Assumptions.assumeTrue(TestSettings.allow(TestComplexity.HIGH));
// All float values is a lot so we do a representative set
final UniformRandomProvider rng = RngUtils.create(seed.getSeed());
final double lower = Double.MIN_VALUE;
final double upper = Double.MAX_VALUE;
final double[] d = new double[100000];
final double[] logD = new double[d.length];
for (int i = 0; i < d.length; i++) {
final double v = nextUniformDouble(rng);
d[i] = v;
logD[i] = Math.log1p(v);
}
runCanTestDoubleError(new Test1PLog(new MathLog()), d, logD);
runCanTestDoubleError(new TestLog1P(new MathLog()), d, logD);
}
use of uk.ac.sussex.gdsc.test.junit5.RandomSeed in project GDSC-SMLM by aherbert.
the class FastLogTest method canTestFloatSpeed.
@SpeedTag
@SeededTest
void canTestFloatSpeed(RandomSeed seed) {
// No assertions, this is just a report
Assumptions.assumeTrue(logger.isLoggable(Level.INFO));
Assumptions.assumeTrue(TestSettings.allow(TestComplexity.MEDIUM));
final UniformRandomProvider rng = RngUtils.create(seed.getSeed());
final float[] x = new float[1000000];
for (int i = 0; i < x.length; i++) {
x[i] = nextUniformFloat(rng);
}
final TimingService ts = new TimingService(5);
ts.execute(new FloatTimingTask(new TestLog(new MathLog()), 0, x));
ts.execute(new FloatTimingTask(new TestLog(new FastMathLog()), 0, x));
for (final int q : new int[] { 11 }) {
final int n = 23 - q;
final IcsiFastLog fl = IcsiFastLog.create(n, DataType.FLOAT);
ts.execute(new FloatTimingTask(new TestLog(fl), q, x));
ts.execute(new FloatTimingTask(new TestFastLog(fl), q, x));
final FFastLog ff = new FFastLog(n);
ts.execute(new FloatTimingTask(new TestLog(ff), q, x));
ts.execute(new FloatTimingTask(new TestFastLog(ff), q, x));
final DFastLog df = new DFastLog(n);
ts.execute(new FloatTimingTask(new TestLog(df), q, x));
ts.execute(new FloatTimingTask(new TestFastLog(df), q, x));
final TurboLog tf = new TurboLog(n);
ts.execute(new FloatTimingTask(new TestLog(tf), q, x));
ts.execute(new FloatTimingTask(new TestFastLog(tf), q, x));
// TurboLog2 tf2 = new TurboLog2(n);
// ts.execute(new FloatTimingTask(new TestLog(tf2), q, x));
// ts.execute(new FloatTimingTask(new TestFastLog(tf2), q, x));
// For the same precision we can reduce n
final TurboLog2 tf3 = new TurboLog2(n - 1);
ts.execute(new FloatTimingTask(new TestLog(tf3), q + 1, x));
ts.execute(new FloatTimingTask(new TestFastLog(tf3), q + 1, x));
}
final int size = ts.getSize();
ts.repeat(size);
logger.info(ts.getReport(size));
}
Aggregations