- Haskell-Cafe - Haskell.org

space leak?
by Massimiliano Gubinelli 04 Nov '07

04 Nov '07

> ( these two lines are just to fool the gmane post algorithm which > complains for top-posting....) Hi, i'm learning Haskell and trying to use the HPDF 1.2 library I've come across some large memory consumption for which I do not understand the origin. I've tried heap profiling but without much success. This is my code > module Main where > import Control.Monad.State > import Graphics.PDF > data Opcodes = Rect | Ship deriving (Show) > doPage (Rect:ops) = do > stroke $! Rectangle 10.0 10.0 10.0 10.0 > doPage ops > doPage l = return l > doOps [] = return () > doOps (Ship:ops) = {-# SCC "OPSHIP" #-} do > p <- addPage Nothing > ops' <- drawWithPage p $! do > strokeColor red > applyMatrix $ (translate 72.0 72.0) > doPage ops > doOps ops' > doOps (op:_) = error ("unexpected " ++ show op) > testpdf = do > let ops = concat $ replicate 100 (Ship : (replicate 1000 Rect )) > pageRect = PDFRect 0 0 > (floor $ 21.0/2.54*72.0) (floor $ 29.7/2.54*72.0) > runPdf "test1.pdf" (standardDocInfo { author=toPDFString "mgubi", > compressed = False}) > pageRect $ doOps ops > testpdf' = do > let pageRect = PDFRect 0 0 > (floor $ 21.0/2.54*72.0) (floor $ 29.7/2.54*72.0) > runPdf "full.pdf" (standardDocInfo { author=toPDFString "mgubi", > compressed = False}) > pageRect $ sequence_ $ foldM f [] $ replicate 100 $ > (\p -> sequence_ $ replicate 1000 $ > drawWithPage p $ stroke $ > Rectangle 0.0 0.0 10.0 10.0) > where f ps acts = do > p <- addPage Nothing > acts p > return $ p:ps > main = testpdf now, if I run testpdf' then memory profile is very low and everything is as expected while if I run testpdf then the profile grows up to 80MB and more. This is the stripped down version of the original program (which is a DVI interpreter) so there I will have also some StateT and more complicated opcodes. I would like to know what is wrong with the above code. Could someone help me? thanks, Massimiliano Gubinelli

2 2

torrent for 6.8.1?
by brad clawsie 04 Nov '07

04 Nov '07

do torrents exist for 6.8.1? my experience is that people will use torrents if they are offered and they really do lift the pressure from the origin domain (haskell.org)

7 7

Help please
by Ryan Bloor 04 Nov '07

04 Nov '07

hello, I am struggling with rose trees in Haskell. I need to construct an algebraic data type definition for "family trees" and a representation of the tree below. Also I need to construct a function that returns a persons children when given both a family tree and a name. The same is needed but for a getParents function. 1 2 3 4 5 6 7 8 9 10 11 That is the rose tree that I seek. Where each number above is equivalent to (String, String) Data Tree a = Empty | Leaf a | Node a [(Tree a)] example :: Tree (String, String) example = Node ("a","b") -- root node [ ...............define tree.........................] -- end of tree _________________________________________________________________ 100’s of Music vouchers to be won with MSN Music https://www.musicmashup.co.uk

1 0

Rose Tree
by Ryan Bloor 04 Nov '07

04 Nov '07

Hello, I need help... I am having trouble with rose trees. 1 2 3 4 5 6 7 8 9 10 11 That is the rose tree that I seek. Data Tree a = Empty | Leaf a | Node a [(Tree a)] example :: Tree (String, String) example = Node ("a","b") -- root node [ ........................................] -- end of tree What I want to do is create two functions that return either the children or parents of a given input, here a String. String -> Tree -> [String] I think _________________________________________________________________ The next generation of MSN Hotmail has arrived - Windows Live Hotmail http://www.newhotmail.co.uk

4 3

Could someone explain winhugs does not accept this argument?
by karle 04 Nov '07

04 Nov '07

type Address = Int data Port = C | D deriving(Eq,Show) data Payload = UP[Char] | RTDP(Address,Port) deriving(Eq,Show) data Pkgtype = RTD | U deriving(Eq,Show) type Pkg = (Pkgtype,Address,Payload) type Table = Signal (Address,Port) system inA inB = (outC,outD) where route = update_pr inA inB s1 = lookup_pr route inA s2 = lookup_pr route inB (s3,s4) = unzipSY s1 (s5,s6) = unzipSY s2 s7 = add_list_pr s3 s5 s8 = add_list_pr s4 s6 outC = fifoSY s7 outD = fifoSY s8 lookup_pr::Signal Table->AbstExt Pkg->AbstExt Pkg lookup_pr t (Prst(x,y,z)) |(delive_adr_A t == y && x == U) = (Prst(x,y,z)) |otherwise = look_if_RTD_pkG_A t (Prst(x,y,z)) the error message is Type error in application *** Expression : delive_adr_A t *** Term : t *** Type : Signal Table *** Does not match : Signal (Int,Port) -- View this message in context: http://www.nabble.com/Could-someone-explain-winhugs-does-not-accept-this-ar… Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.

2 1

Why does GHC limit stack size?
by Abhay Parvate 04 Nov '07

04 Nov '07

Hello all, Why is there a limitation on the stack size in GHC? Like heap where we can limit the size by -M RTS option but the default is unlimited, why not let the program use as big a stack as required? If not by default, then by a separate option? Some of the functions that we write in recursive fashion will usually cause a stack overflow, but will work fine if there is more stack (suppose we are not worried about efficiency). And these functions generally look nicer and compact than their tail recursive versions. Is this is a technical hurdle, or just a checkpoint for runaway programs? Can we have an RTS flag allowing unlimited stack size? Thanks, Abhay

4 4

Re: Why can't Haskell be faster?
by Isaac Gouy 03 Nov '07

03 Nov '07

Ketil Malde wrote: > [LOC vs gz as a program complexity metric] Do either of those make sense as a "program /complexity/ metric"? Seems to me that's reading a lot more into those measurements than we should. It's slightly interesting that, while we're happily opining about LOCs and gz, no one has even tried to show that switching from LOCs to gz made a big difference in those "program bulk" rankings, or even provided a specific example that they feel shows how gz is misrepresentative - all opinion, no data. (Incidentally LOC measures source code "shape" as much as anything else - programs in statement heavy languages tend to be longer and thinner, and expression heavy languages tend to be shorter and wider.) __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

10 14

Compile-time evaluation
by Nicholas Messenger 03 Nov '07

03 Nov '07

{-# OPTIONS_GHC -fglasgow-exts -fno-monomorphism-restriction #-} -- Many people ask if GHC will evaluate toplevel constants at compile -- time, you know, since Haskell is pure it'd be great if those -- computations could be done once and not use up cycles during -- runtime. Not an entirely bad idea, I think. -- -- So I set about allowing just that: for arbitrary expressions to be -- evaluated, and the expanded expression spliced into client code. -- -- If you had some data in a file just out of convenience, you could say: -- > yourData = $(compileTimeIO $ parseFile $ readFile "data.txt") -- -- Or if you had an expensive computation that you want done at compile: -- > result = $(compileTimeEval $ expensiveComputation) -- -- I would appreciate comments. I wrote this completely blind with just -- the TH and Generics haddocks, so if I'm doing something tremendously -- stupid that can be improved, let me know. :) Especially if you can -- think of a less awkward way to go from Generics' data to TH -- expressions than using 'showConstr'... -- -- I wrote this with 6.6.1, in case there's any incompatibilities. Copy/ -- paste this post into CompileTime.hs, load into ghci, :set -fth, and -- futz around with the splices. -- -- -- Nicholas Messenger (nmessenger at gmail.com, omnId on #haskell) module CompileTime(compileTimeEval, compileTimeIO) where import Data.Generics import Language.Haskell.TH import Control.Monad import Data.Tree import Data.Ratio -- Expands a datum into an expression tree to be spliced into -- client code. compileTimeEval :: Data a => a -> ExpQ compileTimeEval = return . toExp -- Runs the IO action and splices in the evaluated result datum. compileTimeIO :: Data a => IO a -> ExpQ compileTimeIO = liftM toExp . runIO -- Does the work. :) toTree gets us a tree of constructors, so -- we mostly just have to fold the tree with AppE, except for -- TH's bizarre TupE. toExp :: Data d => d -> Exp toExp = applyAll . toTree where applyAll (Node k args) | isTuple k = TupE (map applyAll args) | otherwise = foldl AppE k (map applyAll args) isTuple (ConE n) = all (==',') (nameBase n) isTuple _ = False -- Synonym to shorten the definition of exp below type Ex a = a -> Exp -- Turns some datum into a tree of TH expressions representing -- that datum. The Exp at each node represents the constructor, -- the subtrees are its arguments. toTree :: Data d => d -> Tree Exp toTree x = Node (exp x) (gmapQ toTree x) where -- The various ways to turn a (Data d => d) into an -- Exp representing its constructor. any = ConE . mkName . deparen . showConstr . toConstr char = LitE . CharL int = sigged $ LitE . IntegerL . toInteger rat = sigged $ LitE . RationalL . toRational sigged f x = SigE (f x) (ConT . mkName . show $ typeOf x) -- The above functions combined together for different types. -- This is what gives the constructor Exp at each Node. There -- are definitely more types to cover that 'any' gets wrong... exp = any `extQ` (int::Ex Int) `extQ` (int::Ex Integer) `extQ` char `extQ` (rat::Ex Float) `extQ` (rat::Ex Double) `extQ` (rat::Ex Rational) -- Generics' showConstr puts parens around infix -- constructors. TH's ConE doesn't like 'em. deparen s = (if last s == ')' then init else id) . (if head s == '(' then tail else id) $ s

3 3

Layout to non-layout code
by Maurício 03 Nov '07

03 Nov '07

Hi, I understand that many people like using layout in their code, and 99% of all Haskell examples use some kind of layout rule. However, sometimes, I would like not to use layout, so I can find errors easier (and maybe convert it to layout for presentation after all problems are solved). So, I wonder: would it be possible to implement a feature in, say, ghc, that would take code from input and output the same code with layout replaced by delimiting characters? For instance, it could take (untested code warning here): main = do s <- readLn putStrLn s and convert it to: main = do {s<-readLn; putStrLn s}; I imagine that would be easy, since the compiler has to do that as a first step anyway. If it's possible, how can I sugest that feature? Thanks, Maurício

2 2

Announce: xmonad 0.4.1
by Don Stewart 03 Nov '07

03 Nov '07

The xmonad strike force is pleased to announce the 0.4.1 release of xmonad! (a tiling window manager) This is a maintainence release with simpler build dependencies. The X11-extras library is no longer required, and instead xmonad uses the improved X11 binding: X11-1.3.0 In other respects this release is functionally identical to xmonad 0.4. As usual, you can find the latest and greatest xmonad codes on hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xmonad http://hackage.haskell.org/cgi-bin/hackage-scripts/package/X11 Brought to you by the xmonad team: Spencer Janssen Don Stewart Jason Creighton Andrea Rossato David Roundy

1 0