x64 Ubuntu : Intel® Q6600® quad-core
Computer Language Benchmarks Game      Help

- all benchmarks - binary-trees chameneos-redux fannkuch fasta k-nucleotide mandelbrot meteor-contest n-body pidigits regex-dna reverse-complement spectral-norm thread-ring - all languages - Ada 2005 GNAT ATS C GNU gcc C# Mono C++ GNU g++ F# Mono Go 6g 8g Haskell GHC Java 6 -server Java 6 -Xint Java 6 steady state OCaml Pascal Free Pascal Scala Scheme PLT

 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
12	0.12	0.15	?	512	100% 0% 0% 8%
16	1.86	1.35	86,536	512	16% 98% 0% 28%
20	43.24	30.90	357,576	512	5% 89% 42% 3%

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

Read binary-trees benchmark to see what this program should do.

 binary-trees Haskell GHC program source code

{-# OPTIONS -fbang-patterns -funbox-strict-fields #-}
--
-- The Computer Language Shootout
-- http://shootout.alioth.debian.org/
--
-- Contributed by Don Stewart
--

import System
import Data.Bits
import Text.Printf

--
-- an artificially strict tree.
--
-- normally you would ensure the branches are lazy, but this benchmark
-- requires strict allocation.
--
data Tree = Nil | Node !Int !Tree !Tree

minN = 4

io s n t = printf "%s of depth %d\t check: %d\n" s n t

main = do
    n <- getArgs >>= readIO . head
    let maxN     = max (minN + 2) n
        stretchN = maxN + 1

    -- stretch memory tree
    let c = check (make 0 stretchN)
    io "stretch tree" stretchN c

    -- allocate a long lived tree
    let !long    = make 0 maxN

    -- allocate, walk, and deallocate many bottom-up binary trees
    let vs = depth minN maxN
    mapM_ (\((m,d,i)) -> io (show m ++ "\t trees") d i) vs

    -- confirm the the long-lived binary tree still exists
    io "long lived tree" maxN (check long)

-- generate many trees
depth :: Int -> Int -> [(Int,Int,Int)]
depth d m
    | d <= m    = (2*n,d,sumT d n 0) : depth (d+2) m
    | otherwise = []
  where n = 1 `shiftL` (m - d + minN)

-- allocate and check lots of trees
sumT :: Int -> Int -> Int -> Int
sumT d 0 t = t
sumT  d i t = sumT d (i-1) (t + a + b)
  where a = check (make i    d)
        b = check (make (-i) d)

-- traverse the tree, counting up the nodes
check :: Tree -> Int
check Nil          = 0
check (Node i l r) = i + check l - check r

-- build a tree
make :: Int -> Int -> Tree
make i 0 = Node i Nil Nil
make i d = Node i (make (i2-1) d2) (make i2 d2)
  where i2 = 2*i; d2 = d-1

 notes

 

 make, command-line, and program output logs

Sat, 30 Jan 2010 02:51:49 GMT

MAKE:
mv binarytrees.ghc binarytrees.hs
/usr/bin/ghc --make -O2 -fglasgow-exts -fasm -threaded binarytrees.hs -o binarytrees.ghc_run

binarytrees.hs:1:11:
    Warning: -fbang-patterns is deprecated: use -XBangPatterns or pragma {-# LANGUAGE BangPatterns#-} instead
[1 of 1] Compiling Main             ( binarytrees.hs, binarytrees.o )
Linking binarytrees.ghc_run ...
rm binarytrees.hs
0.72s to complete and log all make actions

COMMAND LINE:
./binarytrees.ghc_run +RTS -N4 -H300M -RTS 20

PROGRAM OUTPUT:
stretch tree of depth 21	 check: -1
2097152	 trees of depth 4	 check: -2097152
524288	 trees of depth 6	 check: -524288
131072	 trees of depth 8	 check: -131072
32768	 trees of depth 10	 check: -32768
8192	 trees of depth 12	 check: -8192
2048	 trees of depth 14	 check: -2048
512	 trees of depth 16	 check: -512
128	 trees of depth 18	 check: -128
32	 trees of depth 20	 check: -32
long lived tree of depth 20	 check: -1

  Home   Flawed   Fastest   License   Help