1{- 2/* $NetBSD: genpat5.hs,v 1.1 2006/10/09 12:32:46 yamt Exp $ */ 3 4/*- 5 * Copyright (c)2005 YAMAMOTO Takashi, 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29-} 30 31import System.Environment 32import List 33import Numeric 34import Random 35 36byturns (x:xs) (y:ys) = x:y:byturns xs ys 37 38acc0 _ r1 = cycle [start..(start+n-1)] where 39 (start, n) = r1 40 41acc1 seed r1 = map f rands where 42 (start, n) = r1 43 f x = start + x `mod` n 44 rands = unfoldr (Just . next) $ mkStdGen seed 45 46acc2 seed r1 = map f rands where 47 (start, n) = r1 48 f x = start + intsqrt (x `mod` n ^ 2) 49 rands = unfoldr (Just . next) $ mkStdGen seed where 50 intsqrt = truncate . (sqrt . ((flip encodeFloat) 0)) . toInteger 51 52acc3 seed r1 = map f rands where 53 (start, n) = r1 54 f x = start + g (mod x 1024) n 55 g x n = x * x * n `div` (1024 * 1024) 56 rands = unfoldr (Just . next) $ mkStdGen seed where 57 58acc4 seed r1 = map g $ zip [1..] $ map f rands where 59 f x = apply r1 x where d = x `mod` 2 60 g (x,y) = x+y 61 apply r x = fst r + intsqrt (x `mod` (snd r) ^ 2) 62 intsqrt = truncate . (sqrt . ((flip encodeFloat) 0)) . toInteger 63 rands = unfoldr (Just . next) $ mkStdGen seed 64 65patterns = [acc0, acc1, acc2, acc3, acc4] 66 67mklist t a b = take t $ byturns a b 68 69main = getArgs >>= \ args -> 70 let 71 pat = read (args !! 0) 72 t = read (args !! 1) 73 start = read (args !! 2) 74 n = read (args !! 3) 75 seed = 0 76 in 77 mapM_ print $ take t $ (patterns !! pat) seed (start, n) 78