Re: from array update algorithm to nice Haskell code

2003-12-31 Thread Derek Elkins
> On Tue, 30 Dec 2003 23:14:05 +0100, Wolfgang Jeltsch > <[EMAIL PROTECTED]> wrote: [replying indirectly because the original email doesn't seem to have gotten here yet] > > I have an algorithm which updates one or more arrays in a loop. The > > update operations depend on the (old) contents of

Re: from array update algorithm to nice Haskell code

2003-12-31 Thread Wolfgang Jeltsch
Am Mittwoch, 31. Dezember 2003 00:06 schrieb Daan Leijen: > Hi Wolfgang, > > > is there some documentation about the complexity of the FiniteMap and Set > > operations? > [...] > The operations in the "Data.FiniteMap" library in Ghc have the same > complexity of the operations in the "DData.Map"

Re: no continuations

2003-12-31 Thread Tomasz Zielonka
On Tue, Dec 30, 2003 at 10:31:57PM -0500, [EMAIL PROTECTED] wrote: > G'day all. > > Quoting Tomasz Zielonka <[EMAIL PROTECTED]>: > > > BTW, the factorial example on > > http://www.haskell.org/hawiki/MonadicContinuationPassingStyle > > seems rather pointless to me, because it doesn't use any met

Re: from array update algorithm to nice Haskell code

2003-12-31 Thread Daan Leijen
On Wed, 31 Dec 2003 12:35:23 +0100, Wolfgang Jeltsch <[EMAIL PROTECTED]> wrote: The documentation of DData.Map states the following as an advantage of DData.Map over Data.FiniteMap: It uses the efficient hedge algorithm for both union and difference [...]. Does this mean that the Data.FiniteMa

long lines of code with Haddock

2003-12-31 Thread Wolfgang Jeltsch
Hello, Haddock 0.6 produces output where code generated from non-comment source (like the declarations in the synopsis) is not split across multiple lines. Since my type declarations are rather long, the Haddock-produced lines get much larger than my screen when shown in a web browser. How ca

class ??? with Haddock

2003-12-31 Thread Wolfgang Jeltsch
Hello, I have a datatype Relation element1 element2 which derives an Eq instance. In the Haddock-generated documentation the instances section of Relation says (Ord element1, Ord element2, ??? element1 element2) => [...]. Why does Haddock generate this mysterious ??? element1 element

Re: class ??? with Haddock

2003-12-31 Thread Sven Panne
Wolfgang Jeltsch wrote: I have a datatype Relation element1 element2 which derives an Eq instance. In the Haddock-generated documentation the instances section of Relation says (Ord element1, Ord element2, ??? element1 element2) => [...]. Why does Haddock generate this mysterious ???

Re: long lines of code with Haddock

2003-12-31 Thread Sven Panne
Wolfgang Jeltsch wrote: [...] How can I make Haddock split these lines and maybe even indenting lines to produce a nice layout? The documentation of the hierarchical libraries seems to use an automatic line breaking feature. There have been some small changes after Haddock 0.6 was released, includ

Re: class ??? with Haddock

2003-12-31 Thread Wolfgang Jeltsch
Am Mittwoch, 31. Dezember 2003 17:48 schrieb Sven Panne: > Wolfgang Jeltsch wrote: > > I have a datatype > > Relation element1 element2 > > which derives an Eq instance. In the Haddock-generated documentation the > > instances section of Relation says > > (Ord element1, Ord element2, ??? e

Re: safe array freezing?

2003-12-31 Thread Hal Daume III
afaik, this is fine. in fact, i use this idiom very frequently, so if it's bad, i've never seen the badness of it. On Tue, 30 Dec 2003, John Meacham wrote: > so, A common idiom when using Control.Monad.ST is to do some > complicated, state using computation to compute a big array which is > the

Re: no continuations

2003-12-31 Thread ajb
G'day all. Quoting Tomasz Zielonka <[EMAIL PROTECTED]>: > OK. I think I may be getting it now. The point is that MonadCont takes > care of passing the continuation, so you don't have to do it by hand. Is > that right? Precisely. > Happy New Year, And to you and yours. Cheers, Andrew Bromage _