2 % (c) The GRASP/AQUA Project, Glasgow University, 1995-99
6 The June 1988 (v31 #6) issue of the Communications of the ACM has an
7 article by Pierre L'Ecuyer called, "Efficient and Portable Combined
8 Random Number Generators". Here is the Portable Combined Generator of
9 L'Ecuyer for 32-bit computers. It has a period of roughly 2.30584e18.
11 Transliterator: Lennart Augustsson
13 sof 1/99 - code brought (kicking and screaming) into the new Random
19 RandomGen(next, split)
22 , Random ( random, randomR,
31 import CPUTime (getCPUTime)
36 import PrelNumExtra ( float2Double, double2Float )
39 import Char ( isSpace, chr, ord )
40 import Time (getClockTime, ClockTime(..))
45 class RandomGen g where
55 instance RandomGen StdGen where
59 instance Show StdGen where
60 showsPrec p (StdGen s1 s2) =
65 instance Read StdGen where
69 _ -> [stdFromString r] -- because it shouldn't ever fail.
72 (s1, r1) <- readDec (dropWhile isSpace r)
73 (s2, r2) <- readDec (dropWhile isSpace r1)
74 return (StdGen s1 s2, r2)
77 If we cannot unravel the StdGen from a string, create
78 one based on the string given.
80 stdFromString :: String -> (StdGen, String)
81 stdFromString s = (mkStdGen num, rest)
82 where (cs, rest) = splitAt 6 s
83 num = foldl (\a x -> x + 3 * a) 1 (map ord cs)
87 mkStdGen :: Int -> StdGen -- why not Integer ?
89 | s < 0 = mkStdGen (-s)
90 | otherwise = StdGen (s1+1) (s2+1)
92 (q, s1) = s `divMod` 2147483562
93 s2 = q `mod` 2147483398
95 createStdGen :: Integer -> StdGen
97 | s < 0 = createStdGen (-s)
98 | otherwise = StdGen (toInt (s1+1)) (toInt (s2+1))
100 (q, s1) = s `divMod` 2147483562
101 s2 = q `mod` 2147483398
105 The class definition - see library report for details.
109 -- Minimal complete definition: random and randomR
110 random :: RandomGen g => g -> (a, g)
111 randomR :: RandomGen g => (a,a) -> g -> (a,g)
113 randoms :: RandomGen g => g -> [a]
114 randoms g = x : randoms g' where (x,g') = random g
116 randomRs :: RandomGen g => (a,a) -> g -> [a]
117 randomRs ival g = x : randomRs ival g' where (x,g') = randomR ival g
120 randomIO = getStdRandom random
122 randomRIO :: (a,a) -> IO a
123 randomRIO range = getStdRandom (randomR range)
127 instance Random Int where
128 randomR (a,b) g = randomIvalInteger (toInteger a, toInteger b) g
129 random g = randomR (minBound,maxBound) g
131 instance Random Char where
133 case (randomIvalInteger (toInteger (ord a), toInteger (ord b)) g) of
135 random g = randomR (minBound,maxBound) g
137 instance Random Bool where
139 case (randomIvalInteger (toInteger (bool2Int a), toInteger (bool2Int b)) g) of
140 (x, g) -> (int2Bool x, g)
148 random g = randomR (minBound,maxBound) g
150 instance Random Integer where
151 randomR ival g = randomIvalInteger ival g
152 random g = randomR (toInteger (minBound::Int), toInteger (maxBound::Int)) g
154 instance Random Double where
155 randomR ival g = randomIvalDouble ival id g
156 random g = randomR (0::Double,1) g
158 -- hah, so you thought you were saving cycles by using Float?
159 instance Random Float where
160 randomR (a,b) g = randomIvalDouble (float2Double a, float2Double b) double2Float g
161 random g = randomIvalDouble (0::Double,1) double2Float g
167 mkStdRNG :: Integer -> IO StdGen
170 (TOD sec _) <- getClockTime
171 return (createStdGen (sec * 12345 + ct + o))
173 randomIvalInteger :: (RandomGen g, Num a) => (Integer, Integer) -> g -> (a, g)
174 randomIvalInteger (l,h) rng
175 | l > h = randomIvalInteger (h,l) rng
176 | otherwise = case (f n 1 rng) of (v, rng') -> (fromInteger (l + v `mod` k), rng')
187 f (n-1) (fromInt x + acc * b) g'
189 randomIvalDouble :: (RandomGen g, Fractional a) => (Double, Double) -> (Double -> a) -> g -> (a, g)
190 randomIvalDouble (l,h) fromDouble rng
191 | l > h = randomIvalDouble (h,l) fromDouble rng
193 case (randomIvalInteger (toInteger (minBound::Int), toInteger (maxBound::Int)) rng) of
197 fromDouble ((l+h)/2) +
198 fromDouble ((h-l) / realToFrac intRange) *
199 fromIntegral (x::Int)
204 intRange = toInteger (maxBound::Int) - toInteger (minBound::Int)
206 iLogBase :: Integer -> Integer -> Integer
207 iLogBase b i = if i < b then 1 else 1 + iLogBase b (i `div` b)
209 stdNext :: StdGen -> (Int, StdGen)
210 stdNext (StdGen s1 s2) = (z', StdGen s1'' s2'')
211 where z' = if z < 1 then z + 2147483562 else z
215 s1' = 40014 * (s1 - k * 53668) - k * 12211
216 s1'' = if s1' < 0 then s1' + 2147483563 else s1'
219 s2' = 40692 * (s2 - k' * 52774) - k' * 3791
220 s2'' = if s2' < 0 then s2' + 2147483399 else s2'
222 stdSplit :: StdGen -> (StdGen, StdGen)
223 stdSplit std@(StdGen s1 _) = (std, unsafePerformIO (mkStdRNG (fromInt s1)))
229 global_rng :: MutableVar RealWorld StdGen
230 global_rng = unsafePerformIO $ do
234 setStdGen :: StdGen -> IO ()
235 setStdGen sgen = stToIO (writeVar global_rng sgen)
237 getStdGen :: IO StdGen
238 getStdGen = stToIO (readVar global_rng)
240 newStdGen :: IO StdGen
243 let (a,b) = split rng
247 getStdRandom :: (StdGen -> (a,StdGen)) -> IO a
250 let (v, new_rng) = f rng