test.js

var t = require("./index");

function calculate(num){

    var m = 25,
        // a - 1 should be divisible by m's prime factors
        a = 11,
        // c and m should be co-prime
        c = 17;
    // Setting the seed
    var z = 3;
    var rand = function() {
        // define the recurrence relationship
        z = (a * z + c) % m;
        // return an integer
        // Could return a float in (0, 1) by dividing by m
        return z;
    };

    for(i = 0; i < num; i++) {
        var tick = new t.Tick("calc");
        tick.start();
        rand();
        tick.stop();
    }

    var timer = t.timers.calc;

    console.log("Calculated pi with an accuracy of 9999999 in " + timer.duration()/1000 + "ms\n"
        + "Times per calculation:\n"
        + " average: " + timer.parse(timer.mean()) + "\n"
        + " median: " + timer.parse(timer.median()) + "\n"
        + " min: " + timer.parse(timer.min()) + "\n"
        + " max: " + timer.parse(timer.max()) + "\n"
        + " duration: " + timer.parse(timer.duration()) + "\n"
        + " count: " + timer.count());
}

calculate(999999);