- Haskell-Cafe - Haskell.org

Fwd: [Haskell-cafe] Data.Binary suboptimal instance
by Antoine Latter 23 May '09

23 May '09

I suppose I should send my reply to the list ... ---------- Forwarded message ---------- From: Antoine Latter <aslatter(a)gmail.com> Date: Fri, May 22, 2009 at 5:54 PM Subject: Re: [Haskell-cafe] Data.Binary suboptimal instance To: Khudyakov Alexey <alexey.skladnoy(a)gmail.com> On Fri, May 22, 2009 at 4:36 PM, Khudyakov Alexey <alexey.skladnoy(a)gmail.com> wrote: >> You can! - It's again time to point out that Put shouldn't be a monad, but >> a monoid. But as it is, Put is a Writer monad on top of the Builder >> monoid. Better use that Builder monoid directly. > > Could you elaborate? I didn't quite understand. > > > Anyway I had similar problem and simply wrote few functions. They > encode/decode values of same type element by element. It's lazy enough so code > could be written in following style: > Or you could go for the compromise position, where the list can be part of a complex data structure so you're not relying on EOF to find the end. (warning, I don't have my compiler handy so this may not even typecheck) import Control.Monad import Data.Monoid import Data.Binary.Builder import Data.Binary.Get data ChunkedList a = Cons [a] (ChunkedList a) -- Non-null list | Nil chunkSize = 50 fromList :: [a] -> ChunkedList a fromList [] = Nil fromList xs = let (front,back) = splitAt chunkSize xs in Cons front (fromList back) toList :: ChunkedList a -> [a] toList Nil = [] toList (Cons front back) = front ++ toList back putList :: (a -> Builder) -> [a] -> Builder putList f xs = putChunkedList (fromList xs) where putChunkedList Nil = singleton 0 putChunkedList (Cons front back) = mconcat [ singleton (genericLength front) , mconcat $ map f front , putChunkedList back ] getList :: Get a -> Get [a] getList m = toList `liftM` getChunkedList where getChunkedList = do cLen <- getWord8 case cLen of 0 -> return Nil _ -> Cons `liftM` replicateM (fromIntegral cLen) m `ap` getChunkedList

2 1

Re: [Haskell-cafe] Re: A problem with par and modules boundaries...
by Mario Blažević 23 May '09

23 May '09

On Fri 22/05/09 10:51 AM , John Lato jwlato(a)gmail.com sent: > Hi Mario, > > It looks like the parallelize function is getting inlined when it's in > the same file, but not when it's in a separate file. > > Adding a {-# INLINE parallelize #-} pragma to the module with > parallelize recovers all the performance for me. > > You could probably see exactly what's happening in more detail by > going through the Core output. Thank you, this advice helped. The Core output indicates that function `test' evaluates the arguments to `parallelize' before it calls it. In other words, the call to `parallelize' is optimized as a strict function call -- which it is. The problem is that this optimization evaluates the arguments sequentially. Compiling with optimizations turned off regains the parallel execution. I guess I will report this as a GHC bug. Or is it a feature request?

2 1

A problem with par and modules boundaries...
by Mario Blažević 23 May '09

23 May '09

I'll cut to the chase. The short program below works perfectly: when I compile it with -O2 -threaded and run with +RTS -N2 command-line options, I get a nearly 50% real-time improvement: $ time ./primes-test +RTS -N2 5001 real 0m9.307s user 0m16.581s sys 0m0.200s However, if I move the `parallelize' definition into another module and import that module, the performance is completely lost: $ time ./primes-test +RTS -N2 5001 real 0m15.282s user 0m15.165s sys 0m0.080s I'm confused. I know that `par` must be able work across modules boundaries, because Control.Parallel.Strategies is a module and presumably it works. What am I doing wrong? > module Main where > > import Control.Parallel > import Data.List (find) > import Data.Maybe (maybe) > > --import Parallelizable > parallelize a b = a `par` (b `pseq` (a, b)) > > test :: Integer -> Integer -> Integer > test n1 n2 = let (p1, p2) = parallelize > (product $ factors $ product [1..n1]) > (product $ factors $ product [1..n2]) > in p2 `div` p1 > > factors n = maybe [n] (\k-> (k : factors (n `div` k))) > (find (\k-> n `mod` k == 0) [2 .. n - 1]) > > main = print (test 5000 5001)

5 8

import qualified?
by Vasili I. Galchin 23 May '09

23 May '09

Hello, I am working with some somewhat legacy code. I understand what "import qualified Blah as B" means but what does "import qualified Blah" mean? Is this a deprecated feature? I saw with user defined module as well as with "import qualified System" for example. REgards, Vasili

4 4

MPI ... Globus APIs
by Vasili I. Galchin 23 May '09

23 May '09

Hello, 1) I think I read before that there some kind of MPI API (bindings) in Haskell. Yes? If so, current state? 2) http://www.globus.org/ Globus bindings? Kind regards, Vasili

1 1

ANNOUNCE: text 0.2, fast and comprehensive Unicode support using stream fusion
by Bryan O'Sullivan 23 May '09

23 May '09

I'm pleased to announce the availability of text 0.2, an efficient Unicode text library that uses stream fusion. New and notable in this release is support for lazy, chunked text, so you can process text files far larger than memory using a small footprint. Hackage page: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/text Darcs repo: darcs get http://code.haskell.org/text Report bugs: http://trac.haskell.org/text/

1 0

community.haskell.org and code.haskell.org problems
by Neil Mitchell 22 May '09

22 May '09

Hi, I regularly (almost daily) have problems reaching both community and code.haskell.org, getting 500 server error messages. I've decided to make all my Haskell code available on community, which means that when it goes down, I can't access my repos - which is not great. Is there a reason for the poor reliability of these servers? Can anything be done to improve them? I know of servers running on Windows laptops which have far higher uptime :-) Thanks Neil

2 1

generic filter through MonadPlus
by Jason Dusek 22 May '09

22 May '09

It seems reasonable that filter should be generic. The underlying container need only support some kind of traversal, a zero element and a concatenation that eliminates zeroes. A `Monad` provides traversal via `join` and `fmap`; the remaining qualities are satisfied by `MonadPlus`. I've put together an implementation of `filter` for `MonadPlus` that works well enough for lists (though it presents somewhat greater obstacles to efficient compilation). I'm not sure whether `filter` is important enough to warrant its own generics package -- it's one of many collection operations that need to be generified. I'd like to know what folks think about the use of `MonadPlus` in this case. -- Jason Dusek |...an implementation of `filter`...| http://github.com/jsnx/genfil/blob/246026b975ec13587186681b7b346ae1e440d0c9…

2 1

Re: A problem with par and modules boundaries...
by John Lato 22 May '09

22 May '09

Hi Mario, It looks like the parallelize function is getting inlined when it's in the same file, but not when it's in a separate file. Adding a {-# INLINE parallelize #-} pragma to the module with parallelize recovers all the performance for me. You could probably see exactly what's happening in more detail by going through the Core output. John Lato > Message: 23 > Date: Thu, 21 May 2009 22:59:51 -0400 > From: Mario Bla?evi? <mblazevic(a)stilo.com> > Subject: [Haskell-cafe] A problem with par and modules boundaries... > To: <haskell-cafe(a)haskell.org> > Message-ID: <.1242961191@magma.ca> > Content-Type: text/plain; charset="utf-8" > > I'll cut to the chase. The short program below works perfectly: when I compile it > with -O2 -threaded and run with +RTS -N2 command-line options, I get a nearly 50% > real-time improvement: > > $ time ./primes-test +RTS -N2 > 5001 > > real 0m9.307s > user 0m16.581s > sys 0m0.200s > > However, if I move the `parallelize' definition into another module and import > that module, the performance is completely lost: > > $ time ./primes-test +RTS -N2 > 5001 > > real 0m15.282s > user 0m15.165s > sys 0m0.080s > > I'm confused. I know that `par` must be able work across modules boundaries, > because Control.Parallel.Strategies is a module and presumably it works. What am > I doing wrong? > > >> module Main where >> >> import Control.Parallel >> import Data.List (find) >> import Data.Maybe (maybe) >> >> --import Parallelizable >> parallelize a b = a `par` (b `pseq` (a, b)) >> >> test :: Integer -> Integer -> Integer >> test n1 n2 = let (p1, p2) = parallelize >> (product $ factors $ product [1..n1]) >> (product $ factors $ product [1..n2]) >> in p2 `div` p1 >> >> factors n = maybe [n] (\k-> (k : factors (n `div` k))) >> (find (\k-> n `mod` k == 0) [2 .. n - 1]) >> >> main = print (test 5000 5001) >

1 0

haskellnet
by Robert Wills 22 May '09

22 May '09

Hello, Yesterday I found myself wanting to clear out a spam-ridden pop account without downloading all the messages. Rather than just using Python's poplib, I thought I might look for a haskell solution and came across Haskellnet: http://darcs.haskell.org/SoC/haskellnet/ I ended up spending much of the afternoon getting it to compile and much of last night trying to get the pop library to actually work (the 'strip' method produced exceptions). It was a good learning experience (this was helpful: http://donsbot.wordpress.com/2007/11/14/no-more-exceptions-debugging-haskel…) I'm writing here because I'm wondering whether it would be worthwhile putting it up on hackage? From searching this list, there seem to have been a few times when people have stumbled across it but got frustrated when it didn't compile. If so, what's the protocol? Is the original author, Jun Mukai, still around? Thanks, Rob

2 2