const assert = @import("debug.zig").assert;

pub const MT19937_32 = MersenneTwister(
    u32, 624, 397, 31,
    0x9908B0DF,
    11, 0xFFFFFFFF,
    7, 0x9D2C5680,
    15, 0xEFC60000,
    18, 1812433253);

pub const MT19937_64 = MersenneTwister(
    u64, 312, 156, 31,
    0xB5026F5AA96619E9,
    29, 0x5555555555555555,
    17, 0x71D67FFFEDA60000,
    37, 0xFFF7EEE000000000,
    43, 6364136223846793005);

/// Use `init` to initialize this state.
pub struct Rand {
    const Rng = if (@sizeof(usize) >= 8) MT19937_64 else MT19937_32;

    rng: Rng,

    /// Initialize random state with the given seed.
    pub fn init(seed: usize) -> Rand {
        var r: Rand = undefined;
        r.rng = Rng.init(seed);
        return r;
    }

    /// Get an integer with random bits.
    pub fn scalar(r: &Rand, inline T: type) -> T {
        if (T == usize) {
            return r.rng.get();
        } else {
            var result: [@sizeof(T)]u8 = undefined;
            r.fill_bytes(result);
            return ([]T)(result)[0];
        }
    }

    /// Fill `buf` with randomness.
    pub fn fill_bytes(r: &Rand, buf: []u8) {
        var bytes_left = buf.len;
        while (bytes_left >= @sizeof(usize)) {
            ([]usize)(buf[buf.len - bytes_left...])[0] = r.rng.get();
            bytes_left -= @sizeof(usize);
        }
        if (bytes_left > 0) {
            var rand_val_array : [@sizeof(usize)]u8 = undefined;
            ([]usize)(rand_val_array)[0] = r.rng.get();
            while (bytes_left > 0) {
                buf[buf.len - bytes_left] = rand_val_array[@sizeof(usize) - bytes_left];
                bytes_left -= 1;
            }
        }
    }

    /// Get a random unsigned integer with even distribution between `start`
    /// inclusive and `end` exclusive.
    // TODO support signed integers and then rename to "range"
    pub fn range_unsigned(r: &Rand, inline T: type, start: T, end: T) -> T {
        const range = end - start;
        const leftover = @max_value(T) % range;
        const upper_bound = @max_value(T) - leftover;
        var rand_val_array : [@sizeof(T)]u8 = undefined;

        while (true) {
            r.fill_bytes(rand_val_array);
            const rand_val = ([]T)(rand_val_array)[0];
            if (rand_val < upper_bound) {
                return start + (rand_val % range);
            }
        }
    }

    /// Get a floating point value in the range 0.0..1.0.
    pub fn float(r: &Rand, inline T: type) -> T {
        const int_type = @int_type(false, @sizeof(T) * 8);
        // TODO switch statement for constant values
        const precision = if (T == f32) {
            16777216
        } else if (T == f64) {
            9007199254740992
        } else {
            @compile_err("unknown floating point type" ++ @type_name(T))
        };
        return T(r.range_unsigned(int_type, 0, precision)) / T(precision);
    }
}

struct MersenneTwister(
    int: type, n: usize, m: usize, r: int,
    a: int,
    u: int, d: int,
    s: int, b: int,
    t: int, c: int,
    l: int, f: int)
{
    const Self = MersenneTwister(int, n, m, r, a, u, d, s, b, t, c, l, f);

    array: [n]int,
    index: usize,

    // TODO improve compile time eval code and then allow this function to be executed at compile time.
    #static_eval_enable(false)
    pub fn init(seed: int) -> Self {
        var mt: Self = undefined;
        mt.index = n;

        var prev_value = seed;
        mt.array[0] = prev_value;
        {var i: usize = 1; while (i < n; i += 1) {
            prev_value = int(i) +% f *% (prev_value ^ (prev_value >> (int.bit_count - 2)));
            mt.array[i] = prev_value;
        }};

        return mt;
    }

    pub fn get(mt: &Self) -> int {
        const mag01 = []int{0, a};
        const LM: int = (1 << r) - 1;
        const UM = ~LM;

        if (int.bit_count == 64) {
            assert(LM == 0x7fffffff);
            assert(UM == 0xffffffff80000000);
        } else if (int.bit_count == 32) {
            assert(LM == 0x7fffffff);
            assert(UM == 0x80000000);
        }

        if (mt.index >= n) {
            var i: usize = 0;

            while (i < n - m; i += 1) {
                const x = (mt.array[i] & UM) | (mt.array[i + 1] & LM);
                mt.array[i] = mt.array[i + m] ^ (x >> 1) ^ mag01[x & 0x1];
            }

            while (i < n - 1; i += 1) {
                const x = (mt.array[i] & UM) | (mt.array[i + 1] & LM);
                mt.array[i] = mt.array[i + m - n] ^ (x >> 1) ^ mag01[x & 0x1];

            }
            const x = (mt.array[i] & UM) | (mt.array[0] & LM);
            mt.array[i] = mt.array[m - 1] ^ (x >> 1) ^ mag01[x & 0x1];

            mt.index = 0;
        }

        var x = mt.array[mt.index];
        mt.index += 1;

        x ^= ((x >> u) & d);
        x ^= ((x <<% s) & b);
        x ^= ((x <<% t) & c);
        x ^= (x >> l);

        return x;
    }
}

#attribute("test")
fn test_float32() {
    var r = Rand.init(42);

    {var i: usize = 0; while (i < 1000; i += 1) {
        const val = r.float(f32);
        if (!(val >= 0.0)) unreachable{};
        if (!(val < 1.0)) unreachable{};
    }}
}