[Haskell-cafe] ANN: hesql

2009-11-12 Thread Christoph Bauer
with postgresql, etc, etc. So, please send me patches :-) Don't expect too much. Christoph Bauer [1] on hackageDB ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Takusen, postgres and boolean fields

2009-04-25 Thread Christoph Bauer
. For performance reason you may convert from text to boolean (but keep bindP True). If there is a better solution, I'm also glad to know it. Christoph Bauer [1] http://www.communitystory.de ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [Haskell-cafe] ANN: Topkata

2008-06-15 Thread Christoph Bauer
Hi, There's a way to put something in the .cabal file about extra data files, and have it install them in a certain location that you can then find programmatically. I forget the details, but I think it's pretty easy to set

[Haskell-cafe] ANN: Topkata

2008-06-14 Thread Christoph Bauer
. BTW, I had a lot of support in #haskell! Christoph Bauer ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANN: Topkata

2008-06-14 Thread Christoph Bauer
. segmentation faults) on Gentoo with the openal package. But openal-soft-1.4.272 works fine. Christoph Bauer ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] ANNOUNCE: hiccup, a toy tcl impersonator in haskell

2007-06-30 Thread Christoph Bauer
. This is, because the variable lookup is done with slow Tcl_GetVar2Ex. But at the moment I'm a bit disapointed (about Tcl, not Haskell ;-) and don't work on it anymore... Regards. Christoph Bauer ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

[Haskell-cafe] New-bee question about seq in Parsec.Pos

2005-07-02 Thread Christoph Bauer
function? forcePos :: SourcePos - SourcePos forcePos pos@(SourcePos name line column) = seq line (seq column (pos)) thanks for an enlightenment, Christoph Bauer -- let () = let rec f a w i j = Printf.printf %.20f\r a; let a1 = a *. i /. j in if w then f a1 false (i +. 2.0) j else f a1 true

Re: [Haskell-cafe] Thompson's Exercise 9.13

2005-04-10 Thread Christoph Bauer
import Maybe left :: a - Maybe [a] - Maybe [a] left x None = (Just []) left x (Just l) = (Just (x:l)) init :: [a] - [a] init xs = fromJust . foldr left Nothing xs Sure, there is a better solution... Best Regards, Christoph Bauer -- let () = let rec f a w i j = Printf.printf %.20f\r a; let

Re: [Haskell-cafe] Thompson's Exercise 9.13

2005-04-10 Thread Christoph Bauer
Daniel Fischer [EMAIL PROTECTED] writes: On second thoughts, I think Maybe [a] is nicer than (Bool, [a]). Cool, this was my idea, too. Best regards, Christop Bauer -- let () = let rec f a w i j = Printf.printf %.20f\r a; let a1 = a *. i /. j in if w then f a1 false (i +. 2.0) j else f a1