[Haskell-cafe] Re: Speed of ByteString.Lazy

2006-06-29 Thread Chad Scherrer
Then I should be thanking Duncan as well (thanks!). I had seen the array fusion idea before in the NDP work, but I hadn't thought of applying to this area. I wonder where else the concept might apply? Is there a typeclass to be built? -- Chad Scherrer"Time flies like an arrow; fruit flies like a ba

Re: [Haskell-cafe] System.FilePath, Request for comments

2006-06-29 Thread Brian Hulley
Neil Mitchell wrote: The other important point regarding ADT's is what is a FilePath and what is a String? If I set the extension of a FilePath, is that extension itself a FilePath or a String? What if I set the drive or the filename? Is a filename on its own a FilePath? Even though it doesn't co

Re: [Haskell-cafe] System.FilePath, Request for comments

2006-06-29 Thread Neil Mitchell
Hi 1) there are two independent filepath modules used with little modifications in all projects i seen. They both included in MissingH (FilePath.hs and NameManip.hs). From what I can tell, FilePath.hs is the one from Cabal, which I already used as a reference. As far as I can tell, this library

Re: [Haskell-cafe] System.FilePath, Request for comments

2006-06-29 Thread Bulat Ziganshin
Hello Neil, Thursday, June 29, 2006, 8:42:08 PM, you wrote: > I have written a System.FilePath module in part based on the one in > Yhc, and in part based on the one in Cabal (thanks to Lemmih). The aim > is to try and get this module into the base package, as FilePath's are i think that filepat

[Haskell-cafe] System.FilePath, Request for comments

2006-06-29 Thread Neil Mitchell
Hi, I have written a System.FilePath module in part based on the one in Yhc, and in part based on the one in Cabal (thanks to Lemmih). The aim is to try and get this module into the base package, as FilePath's are something many programs use, but its all too easy to hack up a little function that

Re: [Haskell-cafe] A question about stack overflow

2006-06-29 Thread ihope
On 6/27/06, Udo Stenzel <[EMAIL PROTECTED]> wrote: Neil Mitchell wrote: > Or if you don't want to go for a fold next, in a style more similar to > the original: > > maximum [] = undefined > maximum [x] = x > maximum (a:b:xs) = maximum (max a b : xs) It even reproduces the stack overflow, though