Eugene Kirpichov writes:
> 2011/3/17 Ferenc Wagner :
>> Eugene Kirpichov writes:
>>
>>> 2010/12/17 Henning Thielemann :
>>>
>>>> Eugene Kirpichov schrieb:
>>>>
>>>>> I've published a large presentation about two Ha
Eugene Kirpichov writes:
> 2010/12/17 Henning Thielemann :
>
>> Eugene Kirpichov schrieb:
>>
>>> I've published a large presentation about two Haskell-based tools of
>>> mine - tplot and splot.
>>>
>>> Their motto is "visualize system behavior from logs with a shell one-liner".
>>> Based on my ex
James Andrew Cook writes:
> What an interesting coincidence, that makes at least three of
> us. Apparently it's an idea whose time has come.
>
> Mine is also an incomplete low-level binding but is currently under
> semi-active development and I aim to make it cover the entire hdf5.h
> interface.
writes:
> I worked out a small hdf5 binding using cabal and bindings-DSL and
> sqlite3 as my example.
Hi,
I just wanted to add that I also started an HDF5 binding recently (using
hsc2hs only). It does more than enough for me ATM, so I don't develop
it actively, but if you want to pursue this (
aditya siram writes:
> Yep, I do this often and it's pretty nasty. It's especially
> inconvenient that you don't have access to computations before the if,
> for example:
> do
> x <- something
> y <- something-else
> case y of
> Foo a -> do
> <--- I want access to 'x
aditya siram writes:
> byTwos :: [a] -> [(a,a)]
> byTwos []= []
> byTwos (x:[])= []
> byTwos (x:y:xs) = (x,y) : byTwos (y:xs)
byTwos l = zip l (tail l)
--
Cheers,
Feri.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http:
wren ng thornton <[EMAIL PROTECTED]> writes:
> [Bug trackers are an excellent source of tasks for active developers to
> use so things don't get lost, but they're awful for new developers. For
> someone just joining the project it's rarely clear how important a task
> is, how hard, or how far r
Vikrant <[EMAIL PROTECTED]> writes:
> I was trying to use wash to learn it. I am using ubuntu and I have ghc6.6.1
> installed on my system.
> I have also installed the package libghc6-wash-dev
>
> but in my code when i write
>
> "import WASH.CGI"
>
> it gives me following error
>
> firstCGI.hs:5:7
"Alexander McPhail" <[EMAIL PROTECTED]> writes:
> I am embarking on a project to bind to CBLAS and CLAPack.
Do you know of http://www.cs.utah.edu/~hal/HBlas/index.html ?
--
Feri.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell
"Matthew Brecknell" <[EMAIL PROTECTED]> writes:
>> enumLines :: (a -> String -> Either a a) -> a -> FilePath -> IO a
>> enumLines iter accum filename = do
>> h <- openFile filename ReadMode
>> flip fix accum $
>> \iterate accum -> do
>> try_line <- try (hGetLine h)
>> case try_
Magnus Therning <[EMAIL PROTECTED]> writes:
> Thanks for all the excellent answers to my original question. Somehow
> it feels like I advanced and got one level closer to a black belt in
> Haskell due to this; I've now legitimately used a function from
> System.IO.Unsafe :-)
>
> I tried to docume
Hi,
the following program
main = readFile "nonexistent" >>= putStr
is meant to produce an exception. When compiled with GHC 6.4, it
outputs the "*** Exception..." string to stderr, which makes me happy.
However, when run with runghc6 or runhugs, the message is sent to
stdout, which makes me sad
Bulat Ziganshin <[EMAIL PROTECTED]> writes:
> of remaining, Ubuntu has widest support here while SuSe is favourite
> of my friend. one thing that i like in suse is that it uses the same
> RPMs as RedHat and RPMs is widely used for packaging software
> available via internet. Is Ubuntu supports RPM
Bulat Ziganshin <[EMAIL PROTECTED]> writes:
>> out <- hGetContents o
>> -- print out
>
>> How can I force hGetContents to be strict (or at least to completely
>> process the stream prior to the waitForProcess command)?
>
> return $! last out
You will still get into trouble if the comman
"Donn Cave" <[EMAIL PROTECTED]> writes:
> Now that I look at what I did with ldap_set_option, I recall that
> s actually a little difficult to assign a type, since the third
> parameter is sometimes Int, Enum, TimeVal, String, and LDAP_OPT_*
> values overlap in a way that doesn't really say "enum"
Donn Cave <[EMAIL PROTECTED]> writes:
> On Thu, 13 Jul 2006, Ferenc Wagner wrote:
> ...
>> Second, I find no trace of SSL/TLS routines. Is that really
>> left out, or do I overlook something?
>
> OpenLDAP supports an option LDAP_OPT_X_TLS --
>
> ld
Hi,
trying to put WashNGo-2.9 to a nontrivial prototyping job
gave some very compelling results so far, but also got me
stumped on occasions. I'd be grateful for some guidance on
the following points, concerning abstract tables mainly.
* selectionDisplay: looks like displayFun (fourth arg)
mus
Hi,
to start off, I'm using ldap-haskell straight from its darcs
repo under GHC-6.4.1, and it works. Just not quite like I
want.
First, I can't make a static compile:
$ ghc --make prog.hs -o prog
works without a warning, while
$ ghc --make prog.hs -o prog -optl -static
[...]
/usr/lib/gcc-lib/i48
Hi!
Let me repeat my question from IRC here, too...
I installed HaskellDB and all the necessary stuff (I hope)
as local (not system-wide) packages:
$ ghc-pkg list
/usr/lib/ghc-6.4.1/package.conf:
rts-1.0, base-1.0, haskell98-1.0, template-haskell-1.0, unix-1.0,
Cabal-1.0, parsec-1.0, hask
Hi,
does anybody know of a library for writing LDIF files? If
not, I may create one, and would be grateful for
suggestions. Is it worth integrating with John Goerzen's
LDAP binding, for example?
--
Thanks,
Feri.
___
Haskell-Cafe mailing list
Haskell-C
Mark Carroll <[EMAIL PROTECTED]> writes:
> On Wed, 13 Jul 2005, Dinh Tien Tuan Anh wrote:
>
> (snip)
>> eg: m = 75, k = 5
>> => [50, 20, 5]
>> [50, 20, 1,2,2]
> (snip)
>> Is this problem suitable for functional programming language ?
>
> Oh, what fun. I like this sort of thing.
John Goerzen <[EMAIL PROTECTED]> writes:
> On 2005-06-02, Ferenc Wagner <[EMAIL PROTECTED]> wrote:
>
>> Yes, I also mailed upstream and got no response. But I'm
>> using WASH under GHC 6.4 without any problems. Automatic
>> preprocessor invocation is n
John Goerzen <[EMAIL PROTECTED]> writes:
> On Wed, Jun 01, 2005 at 10:54:54AM -0700, Jeremy Shaw wrote:
>
>> I have done all of those things in WASH. [...]
>
> From what I can tell, there are two problems with WASH:
>
> 1) Everything must be done the WASH way
>
> 2) WASH is mostly broken with GHC
Ben Rudiak-Gould <[EMAIL PROTECTED]> writes:
> Marcin 'Qrczak' Kowalczyk wrote:
>> Ben Rudiak-Gould <[EMAIL PROTECTED]> writes:
>>
>>> fileRead can be implemented in terms of OS primitives,
>>
>> Only if they already support reading from a fixed offset (like pread).
>> I'm not sure if we can rely
Douglas Bromley <[EMAIL PROTECTED]> writes:
> I've show(n) a particular data type and it shows up as:
> [([2,6],"British"),([1],"Charles"),([1,8],"Clarke"),([2,6],"Council"),([2],"Edinburgh"),([1],"Education"),([4],"Increasingly")]
>
> What I want to do is format that nicely into a table.
> Which
Henning Thielemann <[EMAIL PROTECTED]> writes:
> On Mon, 8 Nov 2004, Keean Schupke wrote:
>
>> If you tell me the library you wish to use I may be able
>> to suggest a better alternative.
>
> I'm using FFTW and PLPlot (but not with Haskell), both
> uses internal states and thus must be considered
Peter Simons <[EMAIL PROTECTED]> writes:
> http://cryp.to/blockio/docs/tutorial.html
Pretty neat. Wouldn't it be a nice addition to the
Tutorials section on the Haskell Bookshelf?
Note: as I gather, GHC's lists are not doubly linked.
--
Feri.
___
H
"Crypt Master" <[EMAIL PROTECTED]> writes:
> -- gaSolutionSpace :: [a] -> [a]
> gaSolutionSpace x = x : gaSolutionSpace (evolvepopulation x)
Stop deceiving yourself until it's too late. :)
Why did you comment out the type annotation?
--
Feri.
___
Haske
Graham Klyne <[EMAIL PROTECTED]> writes:
> At 18:18 22/04/04 -0400, Mark Carroll wrote:
>
>> I have data objects where each component is a labelled
>> field through which I access or modify it.
>
> Wading into the labelled field debate...
>
> I have found that using the labelled field update synta
"Matias Hernandez" <[EMAIL PROTECTED]> writes:
> I mean, apparently "/" is not defined for integers but I
> don't know how to "cast" the result of the length function
> into a Double...
>
> Prelude> (length [1,2]) / 3
Prelude> fromIntegral (length [1,2])/3
0.667
> Prelude> 2 / 3
> 0.
Glynn Clements <[EMAIL PROTECTED]> writes:
> David Roundy wrote:
>
>> On my terminal (aterm), calling
>>
>> hSetBuffering stdin NoBuffering
>>
>> within my program messes up the terminal settings somehow
>> [...]
>
> Disabling buffering with hSetBuffering not only disables
> the user-space bufferi
Keith Wansbrough <[EMAIL PROTECTED]> writes:
>> Hal Daume III <[EMAIL PROTECTED]> writes:
>>
f1 :: Int -> Int
f1 x
| trace ("The initial value is " ++ show x) False = undefined
| otherwise = f2 x
>>>
>>> In general, the 'trace ... False = undefined' thing is
>>> quite usef
Hal Daume III <[EMAIL PROTECTED]> writes:
>> f1 :: Int -> Int
>> f1 x
>> | trace ("The initial value is " ++ show x) False = undefined
>> | otherwise = f2 x
>
> In general, the 'trace ... False = undefined' thing is
> quite useful
How is it better than
> f1 x = trace ("The initial value is
Konrad Hinsen <[EMAIL PROTECTED]> writes:
> How would one best (read: most efficiently) create a
> histogram in Haskell?
Check out accumArray.
Feri.
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Sarah,
if Haskell -> MetaPost -> Postscript is good for you, have a
look at FMP. It's somewhat old and doesn't cover the entire
MetaPost language, but works for me.
Feri.
___
Haskell-Cafe
"Damien R. Sullivan" <[EMAIL PROTECTED]> writes:
> can I get Haskell to actually do that division itself?
You can use the function
fromRational :: Fractional a => Rational -> a
Feri.
___
Haskell-Cafe mailing list
[
"JJ" <[EMAIL PROTECTED]> writes:
> From my perspective, the learning curve for Haskell seems to be near
> vertical.
I also found it very steep. Keep on, read the "Gentle"
Introduction, and start coding. Read the Haskell list,
you'll understand more and more. Then read the Report...
Good luck!
Hello,
What's the way to express the following: a compound object
is generally made up of two components with identical type.
For this common case I'd like to provide some default
methods, which take the object apart, operate on the parts
and put the results back together. In other
Johan Steunenberg <[EMAIL PROTECTED]> writes:
> how to store a Double, or any non-char, to a file.
I can give you a general advice: store it in ASCII format
via show, unless you have *VERY* strong reasons against it.
Yes, it results in bigger files (but you can compress them),
and slower (what co
"Simon Peyton-Jones" <[EMAIL PROTECTED]> writes:
> You look in the instance declaration for Ratio, which is
> given in the Ratio chapter of the Library report.
This is what I ignorantly called implementation. Sorry for
the trouble.
> As I understand it, GHC conforms to the Report, but Hugs
> pe
"Simon Peyton-Jones" <[EMAIL PROTECTED]> writes:
> The Report says that the Enum instance for Ratio uses the
> same rule as for Float/Double,
Now I can see that the revised Report contains more about
this than the one on haskell.org. But I still can't see the
statement you cited above. Where sh
Alastair Reid <[EMAIL PROTECTED]> writes:
> H, the CVS copy of Hugs seems to suffer from a different problem:
>
> Prelude> [0.5,1.5..5.5]::[Rational]
> [0 % 1,1 % 1,2 % 1,3 % 1,4 % 1,5 % 1]
Yes, the instance declaration misses the numericEnumFrom-
ThenTo case, so it defaults to this. Btw, ho
With GHC-5.02.2, I do
$ ghci
Prelude> :m Ratio
Ratio> [1%2..10%2]
[1 % 2,3 % 2,5 % 2,7 % 2,9 % 2,11 % 2]
The question is, why is there 11%2 at the end of the list?
It's inconsistent with the (good) rules for Integer, since
Ratio> [1,3..10]
[1,3,5,7,9]
Is this intentional?
"Gerhard Navratil" <[EMAIL PROTECTED]> writes:
> I would like to write line graphics into a file
> (e.g. contour lines calculated by a Haskell function) and
> access the data from standard programs. For the output I
> need a Library.
Why don't you output some ASCII numbers, and use another
prog
Ralf Hinze <[EMAIL PROTECTED]> writes:
> I put my current version of FMP on the web, which works
> both with Hugs (2001 February) and GHC.
Dear Ralf,
thanks for your help. I used your modifications, and made
a couple of others to make GHC accept the code. So:
45 matches
Mail list logo
