- Beginners - Haskell.org

Help with slow algorithm
by Diego Echeverri 16 May '10

16 May '10

Hi guys. I've been playing with https://www.spoj.pl/ to get better with Haskell. I'm trying to do: https://www.spoj.pl/problems/PALIN/ Basically given a number k, you have to find a number bigger than k that is palindrome. The thing is that k can be 1000000 digits long. I have learnt a bunch of things doing this exercise but I'm still getting time-limit exception. Here's the code: http://gist.github.com/401880 I believe that the bottleneck is in the addOne function (Specially in the case where you have a bunch of nines). I have rewritten it to use STArray but isn't fast enough. doing: addOne $ B.replicate 500000 'a' takes too much time! Can anybody point me out of better (faster) ways to improve the code? I don't need my code fixed, just suggestions and clues about things to try. Thanks! Diego Echeverri

4 8

Re: [Haskell-beginners] Help with slow algorithm
by Diego Echeverri 15 May '10

15 May '10

Thanks! I checked Brandon's link and it was indeed wasting too much time doing GC (80%-70%). I did profiling by type and most of it were lists. I'm only using lists in the addOne function when I get the elements of the array. Maybe it would help to create the ByteArray directly without using that intermediate list (No idea how to do it). Or it would be even better if I could just use something like "mutable bytestrings" That would avoid some of the packing and unpacking. Even when I managed to make it pass. I feel like cheating. Instead of changing it algorithmically I changed some of the GC options to avoid GC time. In order to do this I followed this: http://www.haskell.org/haskellwiki/SPOJ In case anybody is interested, here's the code: http://gist.github.com/402282 On Sat, May 15, 2010 at 2:57 AM, Daniel Fischer <daniel.is.fischer(a)web.de> wrote: > Congrats. > But you should try to squeeze a little more out of it. > > Cheers, > Daniel > -- Att: Diego Echeverri Saldarriaga

1 0

gnuplot problem in ghci
by Scott N. Walck 14 May '10

14 May '10

Hello, I've used the gnuplot package http://hackage.haskell.org/package/gnuplot before with great satisfaction. Now I have a new computer (a Lenovo T400 with ubuntu 9.10) and I have a problem. After I make a plot in ghci, using a command such as plotFunc [] [0.0,0.1..10.0] cos shown below, the keyboard no longer echos my input to ghci. ghci will still do what I ask, as in computing 3+4 below, but I could not see the "3+4" until after I hit return. This is gnuplot 0.3.4. Could anyone suggest an idea? Thanks, Scott walck@walck-nsf:~/courses/phy261/code$ gnuplot --version gnuplot 4.2 patchlevel 5 walck@walck-nsf:~/courses/phy261/code$ ghci GHCi, version 6.12.1: http://www.haskell.org/ghc/ :? for help Loading package ghc-prim ... linking ... done. Loading package integer-gmp ... linking ... done. Loading package base ... linking ... done. Loading package ffi-1.0 ... linking ... done. Prelude> :m +Graphics.Gnuplot.Simple Prelude Graphics.Gnuplot.Simple> plotFunc [] [0.0,0.1..10.0] cos Loading package syb-0.1.0.2 ... linking ... done. Loading package base-3.0.3.2 ... linking ... done. Loading package array-0.3.0.0 ... linking ... done. Loading package containers-0.3.0.0 ... linking ... done. Loading package monoid-transformer-0.0.2 ... linking ... done. Loading package old-locale-1.0.0.2 ... linking ... done. Loading package filepath-1.1.0.3 ... linking ... done. Loading package old-time-1.0.0.3 ... linking ... done. Loading package unix-2.4.0.0 ... linking ... done. Loading package directory-1.0.1.0 ... linking ... done. Loading package process-1.0.1.2 ... linking ... done. Loading package time-1.1.4 ... linking ... done. Loading package utility-ht-0.0.5.1 ... linking ... done. Loading package gnuplot-0.3.4 ... linking ... done. Prelude Graphics.Gnuplot.Simple> 3+4 7 Prelude Graphics.Gnuplot.Simple> -- Scott N. Walck Associate Professor of Physics Lebanon Valley College Annville, PA 17003 phone: 717-867-6153 fax: 717-867-6075 email: walck(a)lvc.edu

3 4

Call for papers : MULTICONF-10, USA, July 2010
by John Edward 14 May '10

14 May '10

It would be highly appreciated if you could share this announcement with your colleagues, students and individuals whose research is in computer science, computer engineering, information science and related areas. Call for papers : MULTICONF-10, USA, July 2010 The 2010 multi-conference (MULTICONF-10) (website: http://www.PromoteResearch.org ) will be held during July 12-14, 2010 in Orlando, Florida, USA. The primary goal of MULTICONF is to promote research and developmental activities in computer science, information technology, control engineering, and related fields. Another goal is to promote the dissemination of research to a multidisciplinary audience and to facilitate communication among researchers, developers, practitioners in different fields. The following conferences are planned to be organized as part of MULTICONF-10. • International Conference on Artificial Intelligence and Pattern Recognition (AIPR-10) • International Conference on Automation, Robotics and Control Systems (ARCS-10) • International Conference on Bioinformatics, Computational Biology, Genomics and Chemoinformatics (BCBGC-10) • International Conference on Computer Communications and Networks (CCN-10) • International Conference on Enterprise Information Systems and Web Technologies (EISWT-10) • International Conference on High Performance Computing Systems (HPCS-10) • International Conference on Information Security and Privacy (ISP-10) • International Conference on Image and Video Processing and Computer Vision (IVPCV-10) • International Conference on Software Engineering Theory and Practice (SETP-10) • International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-10) MULTICONF-10 will be held at Imperial Swan Hotel and Suites. It is a full-service resort that puts you in the middle of the fun! Located 1/2 block south of the famed International Drive, the hotel is just minutes from great entertainment like Walt Disney World® Resort, Universal Studios and Sea World Orlando. Guests can enjoy free scheduled transportation to these theme parks, as well as spacious accommodations, outdoor pools and on-site dining — all situated on 10 tropically landscaped acres. Here, guests can experience a full-service resort with discount hotel pricing in Orlando. Please see the website http://www.PromoteResearch.org for more details. Sincerely John Edward

1 0

More Data.Vector fun
by Philip Scott 13 May '10

13 May '10

Hey ho, This should be a quick one, I hope! I am mucking about with the moadic initialisers for vectors, and am experiencing all kinds of fun. For example, I think I should be able to make a new vector of, say, 3 thingies* long: Prelude Data.Vector.Generic.Mutable> new 3 Now of course, poor old haskell does not know what sort of thing I am going to put in it yet, so it gets a bit cross: <interactive>:1:0: Ambiguous type variable `m' in the constraint: `Control.Monad.Primitive.PrimMonad m' arising from a use of `new' at <interactive>:1:0-4 Probable fix: add a type signature that fixes these type variable(s) <interactive>:1:0: Ambiguous type variables `v', `a' in the constraint: `MVector v a' arising from a use of `new' at <interactive>:1:0-4 Probable fix: add a type signature that fixes these type variable(s) Now I have paid very close attention to this 'Probable Fix', but have not been able to find out precisely how to specify what sort of vector I would like (I guess this is v..) and am even more boggled by 'm'.. I guess this is asking what sort of Monad I am going to use to fill it up? An example would be greatly appreciated. I find the type of 'new' quite interesting: new :: forall (m :: * -> *) (v :: * -> * -> *) a. (PrimMonad m, Data.Vector.Generic.Mutable.MVector v a) => Int -> m (v (PrimState m) a) So I did a bit of reading up on exstential types, and I (just about) get what 'forall' does, however I don't know what the (m :: * -> *) and (v :: * -> * -> *) bits mean. Just telling me what they are called would probably be enough to get me googling! I get the feeling I am a bit out of my depth here, but hey ho, I guess that's how you learn to swim! All the best, Phil * thingies == things of some type, which doesn't really matter at the momant.

2 1

cabal haddock problem
by Ashish Agarwal 13 May '10

13 May '10

I've setup a cabal file for a project. Building works fine but cabal haddock gives the following error: src/AFRP/AFRP.hs:1:0: File name does not match module name: Saw: `Main' Expected: `AFRP.AFRP' However, the module name specified in AFRP.hs is in fact AFRP.AFRP so why is haddock seeing Main, especially since cabal build completes successfully?

1 1

Haskell Serialization
by Tom Hobbs 13 May '10

13 May '10

Hi all, Can anyone recommend any articles relating to de/serialization in Haskell? I've been reading these: - http://hackage.haskell.org/packages/archive/binary/0.4.1/doc/html/Data-Bina… - http://en.wikipedia.org/wiki/Serialization#Haskell - http://www.haskell.org/tutorial/stdclasses.html (The Read/Show bits) ...and I'd like some more examples etc. My situation is basically this, I have a non-Haskell black-box tuple space ( http://en.wikipedia.org/wiki/Tuple_space) which I want to use Haskell to read/write data from/into. I had trouble understanding how Read/Show could help me here. Data.Binary made more sense, but like I say, I'd really like to find some more articles and examples. Even apart from the tuple space stuff. I'm trying to piece together in my mind how I'd read some serialized data from anywhere and turn that into a Haskell data type in a nicely reusable way. I've been flicking through Real World Haskell and couldn't see much that I found helpful for this. Many thanks, Tom

5 14

Re: Beginners Digest, Vol 23, Issue 13
by Tim Sears 11 May '10

11 May '10

Thanks. Here you go. --Tim On May 11, 2010, at 12:00 PM, beginners-request(a)haskell.org wrote: > Send Beginners mailing list submissions to > beginners(a)haskell.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://www.haskell.org/mailman/listinfo/beginners > or, via email, send a message with subject or body 'help' to > beginners-request(a)haskell.org > > You can reach the person managing the list at > beginners-owner(a)haskell.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Beginners digest..." > > > Today's Topics: > > 1. Re: Haskell Serialization (Ashish Agarwal) > 2. Re: Problem installing Haskell platform on Ubuntu Karmic > (Ashish Agarwal) > 3. Re: Haskell Serialization (Daniel Fischer) > 4. Re: Haskell Serialization (Stephen Tetley) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Mon, 10 May 2010 15:00:14 -0400 > From: Ashish Agarwal <agarwal1975(a)gmail.com> > Subject: Re: [Haskell-beginners] Haskell Serialization > To: Stephen Tetley <stephen.tetley(a)gmail.com> > Cc: beginners(a)haskell.org > Message-ID: > <AANLkTikt2LTvCM-QH37ec0FJgsgCjUw2JhUxDcpFwdEG(a)mail.gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > >> the Binary class as it is specialized to serializing values for >> Haskell > only > > Can you please expand on this? I've been using Data.Binary to > (de)serialize > messages for some networking protocols, and have made all my types > instances > of Binary. Non-Haskell programs will be receiving and sending > messages on > one end, but I didn't think that mattered since my get and put > functions are > written to adhere to the protocol's definition. Is there some issue > I'm > missing? > > > On Mon, May 10, 2010 at 6:18 AM, Stephen Tetley <stephen.tetley(a)gmail.com > >wrote: > >> Hi Tom >> >> If you are interfacing with non-Haskell binary objects - you will >> want >> binary parsing / writing rather than simple serialization as the >> format will be determined by the foreign objects. >> >> You can still use Data.Binary (indeed its probably the best choice), >> but you will want to use the modules Data.Binary.Get and >> Data.Binary.Put directly and probably avoid the Binary class as it is >> specialized to serializing values for Haskell only. >> >> There are probably quite a few libraries on Hackage that you can look >> at for examples, though there might be more packages that supply >> parsers only and don't do writing, e.g: >> >> http://hackage.haskell.org/package/pecoff (Parser only) >> >> There will be more among the packages this list that directly >> depend on >> Binary: >> >> http://bifunctor.homelinux.net/~roel/cgi-bin/hackage-scripts/revdeps/binary… >> >> >> Best wishes >> >> Stephen >> _______________________________________________ >> Beginners mailing list >> Beginners(a)haskell.org >> http://www.haskell.org/mailman/listinfo/beginners >> >

1 0

Problem installing Haskell platform on Ubuntu Karmic
by Kim Stebel 10 May '10

10 May '10

Hello List, I can't compile the haskell platform. I followed this guide http://davidsiegel.org/haskell-platform-in-karmic-koala/ and downloaded http://hackage.haskell.org/platform/2010.1.0.0/haskell-platform-2010.1.0.0.… as suggested in comment 5. configure runs fine, but when I try to "make" it, it fails to compile the network package. Preprocessing library network-2.2.1.7... Building network-2.2.1.7... [1 of 5] Compiling Network.URI ( Network/URI.hs, dist/build/Network/URI.o ) [2 of 5] Compiling Network.Socket.Internal ( dist/build/Network/Socket/Internal.hs, dist/build/Network/Socket/Internal.o ) [3 of 5] Compiling Network.Socket ( dist/build/Network/Socket.hs, dist/build/Network/Socket.o ) [4 of 5] Compiling Network.BSD ( dist/build/Network/BSD.hs, dist/build/Network/BSD.o ) [5 of 5] Compiling Network ( Network.hs, dist/build/Network.o ) Network.hs:274:15: Warning: Pattern match(es) are overlapped In a case alternative: a -> ... Network/URI.hs:108:7: Could not find module `Text.ParserCombinators.Parsec': Perhaps you haven't installed the profiling libraries for package `parsec-2.1.0.1'? Use -v to see a list of the files searched for. Error: Building the network-2.2.1.7 package failed make: *** [build.stamp] Error 2 I'd really appreciate any help.

3 2

When, if ever, does Haskell "calculate once"?
by Travis Erdman 10 May '10

10 May '10

Two questions here, I think they might be related, perhaps even the same, but I am not sure, so I will ask both: Q1: Re the function f below, I like the first implementation as it's "cleaner", but is the second implementation necessary for performance purposes? -- g = some CPU intensive function -- alternate 1 f a b = c + (g b) where c = dosomethingelse a (g b) -- alternate 2 f a b = c + saveit where saveit = g b c = dosomethingelse a saveit Q2: Imagine that I might be creating a custom data structure. I need to access both the data in that structure, but also "features" (don't know proper comp sci term) of the data structure. For instance, consider a Haskell list. The stuff in the list is the data, whereas the length of the list is what I am calling a "feature" here. Some of my features might be quite a bit more computationally intensive than "length", and may be referenced multiple times in many different places in my code. For performance purposes, should I consider modifying my data structure to embed these "features" as part of the data to ensure that it is only calculated once? Or can I rely on Haskell to do that for me? For instance, do I need to create the equivalent of: data MyList a = MyList {mylist::[a], mylength::Int} Thanks again for all your generous advice.

5 8