module Synthesizer.RandomKnuth (T, cons, ) where
import qualified System.Random as R
newtype T = Cons Int
deriving Int -> T -> ShowS
[T] -> ShowS
T -> String
(Int -> T -> ShowS) -> (T -> String) -> ([T] -> ShowS) -> Show T
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> T -> ShowS
showsPrec :: Int -> T -> ShowS
$cshow :: T -> String
show :: T -> String
$cshowList :: [T] -> ShowS
showList :: [T] -> ShowS
Show
{-# INLINE cons #-}
cons :: Int -> T
cons :: Int -> T
cons = Int -> T
Cons
{-# INLINE factor #-}
factor :: Int
factor :: Int
factor = Int
40692
{-# INLINE modulus #-}
modulus :: Int
modulus :: Int
modulus = Int
2147483399
{-# INLINE split #-}
split :: Int
split :: Int
split = Int -> Int
forall a. Enum a => a -> a
succ (Int -> Int) -> Int -> Int
forall a b. (a -> b) -> a -> b
$ Int -> Int -> Int
forall a. Integral a => a -> a -> a
div Int
modulus Int
factor
{-# INLINE splitRem #-}
splitRem :: Int
splitRem :: Int
splitRem = Int
split Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
factor Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
modulus
instance R.RandomGen T where
{-# INLINE next #-}
next :: T -> (Int, T)
next (Cons Int
s) =
let (Int
sHigh, Int
sLow) = Int -> Int -> (Int, Int)
forall a. Integral a => a -> a -> (a, a)
divMod Int
s Int
split
in (Int
s, Int -> T
Cons (Int -> T) -> Int -> T
forall a b. (a -> b) -> a -> b
$ (Int -> Int -> Int) -> Int -> Int -> Int
forall a b c. (a -> b -> c) -> b -> a -> c
flip Int -> Int -> Int
forall a. Integral a => a -> a -> a
mod Int
modulus (Int -> Int) -> Int -> Int
forall a b. (a -> b) -> a -> b
$
Int
splitRemInt -> Int -> Int
forall a. Num a => a -> a -> a
*Int
sHigh Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
factorInt -> Int -> Int
forall a. Num a => a -> a -> a
*Int
sLow)
{-# INLINE split #-}
split :: T -> (T, T)
split (Cons Int
s) = (Int -> T
Cons (Int
sInt -> Int -> Int
forall a. Num a => a -> a -> a
*Int
s), Int -> T
Cons (Int
13Int -> Int -> Int
forall a. Num a => a -> a -> a
+Int
s))
{-# INLINE genRange #-}
genRange :: T -> (Int, Int)
genRange T
_ = (Int
1, Int -> Int
forall a. Enum a => a -> a
pred Int
modulus)