performance measurements

Each table row shows performance measurements for this Haskell GHC program with a particular command-line input value N.

 N  CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
2,0982.572.014,100803  11% 9% 9% 100%

Read the ↓ make, command line, and program output logs to see how this program was run.

Read meteor-contest benchmark to see what this program should do.

 notes

The Glorious Glasgow Haskell Compilation System, version 7.8.2

 meteor-contest Haskell GHC #4 program source code

{-
   	The Computer Language Benchmarks Game
   	http://benchmarksgame.alioth.debian.org/
   	contributed by Bertram Felgenhauer
-}

import Data.Word
import Data.Array
import Data.Bits
import System.Environment

pieces = [
    [(0,0),(0,1),(0,2),(0,3),(1,3)],
    [(0,0),(0,2),(0,3),(1,0),(1,1)],
    [(0,0),(0,1),(0,2),(1,2),(2,1)],
    [(0,0),(0,1),(0,2),(1,1),(2,1)],
    [(0,0),(0,2),(1,0),(1,1),(2,1)],
    [(0,0),(0,1),(0,2),(1,1),(1,2)],
    [(0,0),(0,1),(1,1),(1,2),(2,1)],
    [(0,0),(0,1),(0,2),(1,0),(1,2)],
    [(0,0),(0,1),(0,2),(1,2),(1,3)],
    [(0,0),(0,1),(0,2),(0,3),(1,2)]]

transform p =
    [ map (\(y,x) -> (y-dy,x-dx)) p''
    | p' <- take 6 (iterate (map (\(y,x) -> (x+y,-y))) p),
      p'' <- take 2 (iterate (map (\(y,x) -> (x,y))) p'),
      let (dy,dx) = minimum p'']

pieceMasks = listArray (0,9) (map (pieceMasks' . transform) pieces) where
    pieceMasks' ps = listArray (0,9) [pieceMasks'' ps (y,x) | y <- [0,1], x <- [0..4]]
    pieceMasks'' ps pos = [m | p <- ps, m <- mask 0 pos p]
    mask m (dy,dx) [] = [m]
    mask m (dy,dx) ((y,x):ps)
        | x' < 0 || x' > 4 = []
        | True = mask (m .|. shiftL 1 ((dy+y)*5+x')) (dy,dx) ps
        where x' = x + dx + div (y+dy) 2

search m 50 p ps = [ps]
search m i p ps | (m .&. shiftL 1 i) > 0 = search m (i+1) p ps
search m i p ps = let (q,r) = divMod i 10 in
    [ ps'
    | p' <- [0..9], p .&. shiftL 1 p' == 0,
      mask <- pieceMasks ! p' ! r,
      let mask' = shiftL mask (10*q),
      m .&. mask' == 0,
      ps' <- search (m .|. mask') (i+1) (p .|. shiftL 1 p') ((p',mask'):ps)]

rows ps = [[i | x <- [0..4], (i,m) <- ps, shiftL 1 (y*5+x) .&. m /= 0] | y <- [0..9]]

main = do
    n <- readIO . head =<< getArgs
    let sols = map rows (take n (search (-shiftL 1 50 :: Word64) 0 (0 :: Word) []))
    putStrLn (show (length sols) ++ " solutions found\n")
    mapM (putStrLn . unlines . (zipWith (++) (cycle [""," "]))
         . map ((++ " ") . unwords . map show)) [minimum sols,maximum sols]

 make, command-line, and program output logs

Wed, 16 Apr 2014 20:13:35 GMT

MAKE:
mv meteor.ghc-4.ghc meteor.ghc-4.hs
/usr/local/src/ghc-7.8.2/bin/ghc --make -fllvm -O2 -XBangPatterns -threaded -rtsopts -XScopedTypeVariables -XTypeSynonymInstances -XFlexibleInstances meteor.ghc-4.hs -o meteor.ghc-4.ghc_run
[1 of 1] Compiling Main             ( meteor.ghc-4.hs, meteor.ghc-4.o )
Linking meteor.ghc-4.ghc_run ...
rm meteor.ghc-4.hs
7.34s to complete and log all make actions

COMMAND LINE:
./meteor.ghc-4.ghc_run +RTS -N4 -RTS 2098

PROGRAM OUTPUT:
2098 solutions found

0 0 0 0 1 
 2 2 2 0 1 
2 6 6 1 1 
 2 6 1 5 5 
8 6 5 5 5 
 8 6 3 3 3 
4 8 8 9 3 
 4 4 8 9 3 
4 7 4 7 9 
 7 7 7 9 9 

9 9 9 9 8 
 9 6 6 8 5 
6 6 8 8 5 
 6 8 2 5 5 
7 7 7 2 5 
 7 4 7 2 0 
1 4 2 2 0 
 1 4 4 0 3 
1 4 0 0 3 
 1 1 3 3 3 

Revised BSD license

  Home   Conclusions   License   Play