Re: Re[2]: [Haskell] Simple and Easy Persistence

2005/12/8, Bulat Ziganshin <[EMAIL PROTECTED]>: > imho, it's better to start from NewBinary library and add features of > SerTH to it. i can make TH support. btw, where i can download > NewBinary version about you talk? there is many different variations. Thanks. Your help will be appreciable. I a

[Haskell] Re: comment vs varsym

On 12/8/05, Taral <[EMAIL PROTECTED]> wrote: > or b) comment, because the maximal munch rule says so (it matches the > newline): > > comment -> dashes [any {any}] newline > varsym -> (symbol {symbol | :}) Aha. Maximal munch only applies to non-whitespace, so Hugs is right. Yay. -- Taral <[EMAIL

[Haskell] comment vs varsym

The first token in "--:\n" is... a) varsym, because varsym always wins according to section 2.3: An ordinary comment begins with a sequence of two or more consecutive dashes (e.g. --) and extends to the following newline. The sequence of dashes must not form part of a legal lexeme. For example, "

Re[2]: [Haskell] Simple and Easy Persistence

Hello Krasimir, Thursday, December 08, 2005, 5:40:15 PM, you wrote: KA> the stream. What I want is to have a single Binary library that is KA> fast and that have all these features: KA> - fast implementation KA> - optional serialization of cyclic datastructures KA> - optional support for bit lev

Re: [Haskell] fptools mirror in darcs ready for testing

> http://cvs.haskell.org/darcs/ghc > http://cvs.haskell.org/darcs/libraries It suddenly occurs to me that there are other projects in CVS that have not yet been converted to darcs, e.g. Hugs98 and nhc98. Are there plans to do so? If not, then since both of these depend on the libraries tree, ther

Re: [Haskell] Simple and Easy Persistence

Hello Guys, I am looking at SerTH. The serialization of cyclic datastructures is quite useful feature but since I did some performance testing I found that it is too slow and consumes a lot of memory. It isn't surprising, since the cycles detection has extra overhead. I have changed the SerTH sour

Re: [Haskell] Libraries mailing list

Thanks. Maybe this is the problem. 2005/12/8, Rob Ennals <[EMAIL PROTECTED]>: > Hi Krasmir, > > It is possible that you may be running up against one of GMail's > ideosynchrosies. I have found that GMail tries to avoid showing > multiple copies of the same mail. In particular, if one sends a mail

Re: [Haskell] Simple and Easy Persistence

Donald, Shae, and Bulat, It sounds like Binary is the right tool for this job. Thanks for all of your helpful suggestions. - Matt On Dec 7, 2005, at 8:36 AM, Bulat Ziganshin wrote: Hello Matthew, Wednesday, December 07, 2005, 5:28:42 AM, you wrote: MMM>I have some program data t

Re: [Haskell] Libraries mailing list

Hi Krasmir, It is possible that you may be running up against one of GMail's ideosynchrosies. I have found that GMail tries to avoid showing multiple copies of the same mail. In particular, if one sends a mail to a list that one is subscribed to, one will not see a second copy of the mail when it

Re: [Haskell] Libraries mailing list

Hi, On 12/8/05, Krasimir Angelov <[EMAIL PROTECTED]> wrote: > Hi Guys, > > Yesterday I sent a message to [EMAIL PROTECTED] mailing list but > it seems like the message isn't dispatched yet. Is there any problem > with the list or I have to send the message again? > > Cheers, > Krasimir Is it "S

[Haskell] Libraries mailing list

Hi Guys, Yesterday I sent a message to [EMAIL PROTECTED] mailing list but it seems like the message isn't dispatched yet. Is there any problem with the list or I have to send the message again? Cheers, Krasimir ___ Haskell mailing list Haskell@haskell