fork download 
  1. import Control.Monad (forM,forM_,(<=<),unless,replicateM)
  2. import Data.Array.IO (IOUArray,newArray,newArray_,readArray,writeArray,freeze)
  3. import Data.Array.Unboxed (listArray,Array,UArray,(!))
  4. import Data.Int (Int64)
  5. import Data.IORef (IORef,newIORef,readIORef,writeIORef,modifyIORef)
  6. import Data.Ix
  7.  
  8. fooArray = newArray_ (0,3) :: IO (IOUArray Int Int64)
  9.  
  10. main = do
  11. 	let len = 3
  12. 	a <- newArray_ (0, len) :: IO (IOUArray Int Int64)
  13. 	putStrLn "print a"
  14. 	forM_ [0..len] (print <=< readArray a)
  15. 	forM_ [0..len] (\i -> writeArray a i (fromIntegral $ (i+1)*2))
  16. 	putStrLn "print updated a"
  17. 	forM_ [0..len] $ \i -> do
  18. 		v <- readArray a i
  19. 		print v
  20.  
  21. 	rx <- newIORef (123 :: Int64)
  22. 	x <- readIORef rx -- copy value, not reference
  23. 	putStr "x "
  24. 	print x -- 123
  25. 	writeIORef rx 999
  26. 	putStr "x "
  27. 	print x -- 123
  28. 	x <- readIORef rx
  29. 	putStr "x "
  30. 	print x -- 999
  31.  
  32. 	foo <- fooArray
  33. 	putStrLn "print foo"
  34. 	print =<< forM [0..len] (readArray foo)
  35. 	forM_ [0..len] (\i -> writeArray foo i (fromIntegral $ (i+1)*2))
  36. 	putStrLn "print updated foo"
  37. 	print =<< forM [0..len] (readArray foo)
  38. 	bar <- fooArray
  39. 	putStrLn "print bar"
  40. 	print =<< forM [0..len] (readArray bar)
  41.  
  42. 	(primes, isPrime) <- primeTool (10^8)
  43. 	print (take 30 primes)
  44. 	print (filter isPrime [10^7..10^7+300])
  45.  
  46. 	arr <- genIntArray 10 0
  47. 	forM_ [0..9] $ \i -> writeIORef (arr!i) (i*(i+1)`div`2)
  48. 	print =<< forM [0..9] (readIORef.(arr!))
  49.  
  50. 	table <- genMatrix 5 5 0
  51. 	forM_ [0..4] $ \i -> do
  52. 		forM_ [0..4] $ \j -> do
  53. 			writeIORef (table!i!j) (i*100+j)
  54. 	print =<< forM [0..4] (\i -> forM [0..4] (readIORef.(table!i!)))
  55.  
  56.  
  57.  
  58. genArray :: (Integral a,Ix a) => a -> IO b -> IO (Array a b)
  59. genArray n initf = listArray (0,n-1) <$> replicateM (fromIntegral n) initf
  60.  
  61. genIntArray :: (Integral a, Ix a) => Integral b => a -> b -> IO (Array a (IORef b))
  62. genIntArray n initv = genArray n (newIORef initv)
  63.  
  64. genMatrix :: (Integral a, Ix a) => a -> a -> b -> IO (Array a (Array a (IORef b)))
  65. genMatrix n m initv = genArray n (genArray m (newIORef initv))
  66.  
  67.  
  68.  
  69. primeTool n = do
  70.     table <- newArray (0,n+6) False :: IO (IOUArray Int64 Bool)
  71.     primes <- newIORef [3,2]
  72.     forM_ [1..((n+5) `div` 6)] $ \i -> do
  73.         let x = 6*i - 1
  74.         r <- readArray table x
  75.         unless r $ do
  76.             modifyIORef primes (x:)
  77.             forM_ [3,5..((n+5) `div` x)] $ \k -> do
  78.                 writeArray table (k*x) True
  79.         let y = x + 2
  80.         q <- readArray table y
  81.         unless q $ do
  82.             modifyIORef primes (y:)
  83.             forM_ [3,5..((n+5) `div` y)] $ \k -> do
  84.                 writeArray table (k*y) True
  85.         writeArray table (y+2) True
  86.  
  87.     writeArray table 1 True
  88.     table <- freeze table :: IO (UArray Int64 Bool)
  89.     primes <- reverse <$> readIORef primes
  90.  
  91.     let isPrime v | even v = v == 2
  92.                   | v < n  = not (table!v)
  93.                   | otherwise = all ((/=0).mod v) $ takeWhile ((<=v).(^2)) primes
  94.  
  95.     return (primes, isPrime)
  96.  
  97.  
Success #stdin #stdout 3.39s 585656KB
comments (?)
stdin 
Standard input is empty
stdout 
print a
0
0
0
0
print updated a
2
4
6
8
x 123
x 123
x 999
print foo
[0,0,0,0]
print updated foo
[2,4,6,8]
print bar
[0,0,0,0]
[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113]
[10000019,10000079,10000103,10000121,10000139,10000141,10000169,10000189,10000223,10000229,10000247,10000253,10000261,10000271]
[0,1,3,6,10,15,21,28,36,45]
[[0,1,2,3,4],[100,101,102,103,104],[200,201,202,203,204],[300,301,302,303,304],[400,401,402,403,404]]
https://ideone.com/95MNyx
haskell練習
language:
Haskell (ghc 8.4.4)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!