- Haskell-Cafe - Haskell.org

Parsec allocating a lot of memory
by Nick Name 04 Aug '03

04 Aug '03

Hi all, I am using "parsec" to parse the output from "xmame -listinfo" wich is a list of records of the form game ( attr1 value1 ... attrN valueN ) and for approx. 3500 records I got ~250 mb of RSS memory during parsing, wich takes 20 seconds on my athlon 1400. I think that I must have done something wrong (this is the first time I use parsec), here is my parser: --- Begin games = many game game = do openGame x <- manyTill attribute closeGame return (mkGameInfo x) attribute = do whitespaces x <- identifier whitespaces y <- tillEOL return (x,y) openGame = do string "game (" newline closeGame = do string ")" newline newline whitespace = "\v\f\t\r " whitespaces = skipMany (oneOf whitespace) tillEOL = manyTill anyChar newline identifier = many alphaNum --- End Thanks for any advice Vincenzo

2 1

PROMOTION
by SANDER SMITH 04 Aug '03

04 Aug '03

BINGO NETHERLANDS SWEEEPSTAKE LOTTERY NL BURDENSTRAAT21B 1053 DS AMSTERDAM, THE NETHERLANDS TEL NO: +31-611-188-193 FROM: THE DESK OF THE MANAGING DIRECTOR INTERNATIONAL PROMOTION/PRIZE AWARD DEPT REF: HWS/200118308/02 BATCH: 18/203/JJS. ATTN: CEO We are pleased to inform you of the release today the 29th JULY 2003, of the BINGO NETHERLANDS SWEEPSTAKE LOTTERY/INTERNATIONAL PROGRAMMS held on the 10th JULY 2003. Your company name attached to the ticket numbers 564-75600545-188 with serial number 5388/01 drew the lucky numbers 3-11-27-30-34-41, which consequently won the lottery in the 2 category. You have therefore been approved for a lump sum pay out of us$1million in cash credited to file HWS/2001183808/01.this is from a total cash prize of us$10million share the ten international lucky winners in this category. CONGRATULATIONS. Your funds is now deposited with our security department to your name, due to the mixed up of some numbers and names, we ask that you keep this winning a top secret from the public notice until your claims has been processed and your remitted to your account as this is apart of security protocol, to avoid double claiming or unwarranted taking advantage of this program by participants. All participants were selected through a computer ballot system drawn from the 30,000 company and 20,000 individuals� names from all over the world as part of our international promotions program, which we conduct every year. We hope with a part of winning, you will take part in our end of year stake us$50million international lottery. TO begin your claim, please contact your claim agent, Jame Morrison, Foreign Service manager FOREX BUREAU AMSTERDAM, THE NETHERLANDS.TEL:+31-615-264-830,E-Mail:jamemorrison1@europe.com,jamemorrison1@winnIng.com, for processing and remittance of your cash to a designated account of your choice. Remember, all winning must be claiming not later than AUGUST 18th 2003, after this date all funds will be returned as unclaimed. NOTE: In order to avoid unnecessary delays and complications, please remember to quote your reference and batch numbers in every correspondence with your agent. Furthermore, should there be any change of your address, do inform your agent as soon as possible. Congratulations again from all members of our staff and thank you for being part of our promotions program. Sincerely, Sander Smith.

1 0

-------|�Ż��|------
by webmaster 02 Aug '03

02 Aug '03

�װ��ѣ� ��ã� ��б��Ƽ��޹�˾��ʺ��л��տ��ʼ��ϵ�ϣ�� ܳ�Ϊ��ڹ��Ҫ��顣��һ�Ҳ��¼��ᾧ��о��ƹ�ͷ�չ �¼��ڻ��Ϣ��ע��ĸ��¼��ҵ�� :http://www.host-china.com ��˾��2003��ȫ��ʻ��Ƴ��²�Ʒ��пռ䶼֧�� ݿ⣨linux+PHP+Mysql;NT+asp+acess��⽫��ֵ��ѡ�� 1.30M�ռ�+30M��ҵ�ʾ� + ��һ�� ȫ�棬��198Ԫ/�ꡣ ��2.120M�ռ䣫120M��ҵ��䣫1��ȫ�棬��330Ԫ/�ꡣ 3.200M�ռ䣫50M��ҵ��䣫1��ȫ�棬��450Ԫ/�ꡣ 4.300M�ռ䣫50M��ҵ��䣫1��ȫ�棬��580Ԫ/�ꡣ �� Ǿ��Ϊ��ṩ��õķ��񡣣��ų��ʧ��Ը�� ˿Ҳ��Ϊ��һ��Ĳ��ġ��ǳ�ŵ��ⰴʵ�� ˿�벻Ҫֱ�ӻظ�,�ظ��뷢:xiamen263@hotmail.com ��ף��ģ�˳�� webmaster of http://www.host-china.com ��б��Ƽ��޹�˾ http://www.host-china.com �绰��0592-5915491��ߣ� 0592-5652685�� 棺0592-5652687�� ϵ�ˣ�� С�� --------------------------------------------------------------- �е�Ⱥ��ʼ�,��ר��(http://www.21cmm.com) ��CMM��У(http://www.21cmm.com)��Ŀ��ר��

1 0

-------|�Ż��|------
by webmaster 02 Aug '03

02 Aug '03

�װ��ѣ� ��ã� ��б��Ƽ��޹�˾��ʺ��л��տ��ʼ��ϵ�ϣ�� ܳ�Ϊ��ڹ��Ҫ��顣��һ�Ҳ��¼��ᾧ��о��ƹ�ͷ�չ �¼��ڻ��Ϣ��ע��ĸ��¼��ҵ�� :http://www.host-china.com ��˾��2003��ȫ��ʻ��Ƴ��²�Ʒ��пռ䶼֧�� ݿ⣨linux+PHP+Mysql;NT+asp+acess��⽫��ֵ��ѡ�� 1.30M�ռ�+30M��ҵ�ʾ� + ��һ�� ȫ�棬��198Ԫ/�ꡣ ��2.120M�ռ䣫120M��ҵ��䣫1��ȫ�棬��330Ԫ/�ꡣ 3.200M�ռ䣫50M��ҵ��䣫1��ȫ�棬��450Ԫ/�ꡣ 4.300M�ռ䣫50M��ҵ��䣫1��ȫ�棬��580Ԫ/�ꡣ �� Ǿ��Ϊ��ṩ��õķ��񡣣��ų��ʧ��Ը�� ˿Ҳ��Ϊ��һ��Ĳ��ġ��ǳ�ŵ��ⰴʵ�� ˿�벻Ҫֱ�ӻظ�,�ظ��뷢:xiamen263@hotmail.com ��ף��ģ�˳�� webmaster of http://www.host-china.com ��б��Ƽ��޹�˾ http://www.host-china.com �绰��0592-5915491��ߣ� 0592-5652685�� 棺0592-5652687�� ϵ�ˣ�� С�� --------------------------------------------------------------- �е�Ⱥ��ʼ�,��ר��(http://www.21cmm.com) ��CMM��У(http://www.21cmm.com)��Ŀ��ר��

1 0

(no subject)
by Marcus D. Gabriel 01 Aug '03

01 Aug '03

-- Marcus D. Gabriel, Ph.D. Email: mdg(a)wanadoo.fr 213 ter, rue de Mulhouse F68300 Saint Louis FRANCE

1 0

Re: a breaking monad (to haskell cafe)
by Iavor Diatchki 01 Aug '03

01 Aug '03

hi, Derek Elkins wrote: > Anyways, most of my uses of the Cont monad have been for my own personal > entertainment, and usually I break the abstraction (using > Control.Monad.Cont) to do the things I want. I don't know if I've ever > written something that's used callCC that I kept. except for entertainment purposes i feel pretty much the same way :-) i think that in probably 95% of the cases that arise there is a simpler monad that does the job (i.e. exceptions, backtracking, etc). of course it could be that we are simply not used to program using the callcc. bye iavor -- ================================================== | Iavor S. Diatchki, Ph.D. student | | Department of Computer Science and Engineering | | School of OGI at OHSU | | http://www.cse.ogi.edu/~diatchki | ==================================================

1 0

FTP, XMLRPC libraries?
by Bryn Keller 01 Aug '03

01 Aug '03

Hi folks, I'm looking for FTP (client) and XMLRPC (client) libraries for Haskell. Does anyone know of any, or do I need to roll my own? Thanks, Bryn

1 0

Exporting GHC functions.
by Thomas L. Bevan 31 Jul '03

31 Jul '03

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Here is a copy of all the files I am using to try to export a Haskell function. This compiles but produces a executable that simply hangs. Tom -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.2 (GNU/Linux) iD8DBQE/KUHbYha8TWXIQwoRAs8RAKCIFcnH9uuqfMpDYXA0gfFjBtMfEwCgjZeD 5dkfLbz/lz4btmsR9G4kL2A= =pCBN -----END PGP SIGNATURE-----

1 1

Linking to exported GHC functions.
by Thomas L. Bevan 31 Jul '03

31 Jul '03

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Could someone give me a command line example of how to link a C programme using functions exported via GHC FFI? I've compile C object files using an FFI function but can't for the life of me work out what arguments to pass to the compiler to make it link correctly. Thanks, Tom -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.2 (GNU/Linux) iD8DBQE/KTyZYha8TWXIQwoRAlAwAKDu/gh3/TVvrVo8Damrr5K8YvbGgACgsz17 2MZqp/GG0K51O+6Gn829I0A= =mIS3 -----END PGP SIGNATURE-----

1 0

RE: Ann: HAllInOne bug fix release
by Hal Daume 31 Jul '03

31 Jul '03

(cafe) This seems like a reasonable hypothesis. Is there a way to get GHC to keep trying, despite the enormity of the input file? Specifically, I expect it to do a better job of (a) inlining and (b) specialization. Is there a way to hint to it to try a bit harder? :) - Hal -- Hal Daume III | hdaume(a)isi.edu "Arrest this man, he talks in maths." | www.isi.edu/~hdaume > -----Original Message----- > From: Koen Claessen [mailto:koen@cs.chalmers.se] > Sent: Thursday, July 31, 2003 1:49 AM > To: Simon Peyton-Jones > Cc: Hal Daume; Wolfgang Jeltsch; The Haskell Mailing List > Subject: RE: Ann: HAllInOne bug fix release > > > Simon Peyton-Jones wrote: > > | I don't know why the all in one version might go > | slower though. > > How about some (artificial) cut-offs during optimization > phases? Optimizing a hugs module could lead to some kind of > combinatorial explosion (which gets cut off by the > optimizer) which does not happen when you have separate > modules? > > Just my 2 öre! > > /Koen > >

1 0