Jason Dagit dag...@gmail.com writes:
Lots of servers turn off ICMP packet responses these days
Because users don't really need error messages, that's privileged
information for system administrators.
Besides, if someone is trying to debug http protocol issues using
ICMP, they're taking an
On Thu, Aug 25, 2011 at 20:56, Simon Michael si...@joyful.com wrote:
I'm pleased to announce shelltestrunner 1.1.
shelltestrunner tests command-line programs or arbitrary shell
commands. It reads simple declarative tests specifying a command,
some input, and the expected output, error output
Hi,
i installed Hoogle succesfullly with
cabal install hoogle
then i try to run
hoogle data
but the connection to
http://code.galois.com/darcs/haskell-platform/haskell-platform.cabal
times out.
How can i download the data needed for the hoogle command line
tool?
Greetings
Chris
The Galois link works fine for me now - it also worked for me earlier
today when I ran hoogle data for my own system. I suggest you try
again, possibly with a better internet connection?
Cheers,
Thomas
On Fri, Aug 26, 2011 at 12:39 AM, informationen informatio...@gmx.de wrote:
Hi,
i
On Wed, Aug 24, 2011 at 3:47 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
I was just trying to remember some of the tricks Daniel Peebles (aka
{co}pumpkin) used to do in #haskell with Data.List.genericLength.
I've never really used ListLike, but was just trying to guess why the
Hello,
I stumbled upon this blog post describing a method from dynamically loading
modules using GHC api.
While trying to test the given method, I got the following error which
obviously tells me my packages are not correctly installed but I have no
idea how to fix this.
D:\projets\ghc -package
Hi !
I'm trying to compile shared library. This library will use as part of
plugin for some program.
If I compile library with option -dynamic my library has links for HS
libraries like libHSbase-4.2.0.2-ghc6.12.3.so and so on.
But program has crashed constantly.
Is it possible to make shared
On 26 August 2011 13:52, Sergiy Nazarenko nazarenko.ser...@gmail.com wrote:
/usr/local/lib/ghc-6.12.3/base-4.2.0.2/libHSbase-4.2.0.2.a(Conc__270.o):
relocation R_X86_64_32 against
`base_GHCziConc_ensureIOManagerIsRunning1_closure' can not be used when
making a shared object; recompile with
Hi,
i am using ghc version 7.0.3 and a pretty recent version of the
haskell-platform.
Whenever i use the System.Directory module, i run into this
conflict:
Ambiguous module name `System.Directory':
it was found in multiple packages:
system-fileio-0.2.1 directory-1.1.0.0
On 26 August 2011 18:00, informationen informatio...@gmx.de wrote:
Hi,
i am using ghc version 7.0.3 and a pretty recent version of the
haskell-platform.
Whenever i use the System.Directory module, i run into this
conflict:
Ambiguous module name `System.Directory':
it was found in
Thanks Conrad! Those are some great links.
I wrapped up some manpage generation code in a package called
ui-command, which is kind of orthogonal to cmdargs (ui-command just
deals with subcommands). Example commands are often useful, so I added
Interesting. Have you tried using both ui-command
On 26/08/2011 02:40 AM, Daniel Peebles wrote:
And as Daniel mentioned earlier, it's not at all obvious what we mean by
bits used when it comes to negative numbers.
I guess part of the problem is that the documentation asserts that
bitSize will never depend on its argument. (So would will
On Friday 26 August 2011, 19:24:37, Andrew Coppin wrote:
On 26/08/2011 02:40 AM, Daniel Peebles wrote:
And as Daniel mentioned earlier, it's not at all obvious what we mean
by bits used when it comes to negative numbers.
I guess part of the problem is that the documentation asserts that
On Fri, 26 Aug 2011 18:24:37 +0100, you wrote:
I would usually want #3 or #4.
Out of curiosity, what for? While I do occasionally need to get a
logarithmic size estimate of a number (which is basically what #3 and
#4 are), the specific requirements in each case tend to vary, enough so
that it's
On 26/08/2011 07:36 PM, Steve Schafer wrote:
On Fri, 26 Aug 2011 18:24:37 +0100, you wrote:
I would usually want #3 or #4.
Out of curiosity, what for? While I do occasionally need to get a
logarithmic size estimate of a number (which is basically what #3 and
#4 are), the specific
Occasionally, the behaviour of decodeFloat and its consequences causes
concern and/or bug reports (e.g.
http://hackage.haskell.org/trac/ghc/ticket/3898).
The main problem is the treatment of NaNs and infinities (that it doesn't
distinguish between 0.0 and -0.0 is a minor thing), which are
On Friday 26 August 2011, 21:30:02, Andrew Coppin wrote:
You wouldn't want to know how many bits you need to store on disk to
reliably recreate the value? Or how many bits of randomness you need to
compute a value less than or equal to this one?
I suppose I could use a binary logarithm.
On 11-08-26 04:51 AM, Arnaud Bailly wrote:
D:\projets\ghc -package ghc main.hs --make
command line: cannot satisfy -package ghc:
ghc-7.0.3-fc75cf67c86ba2c0d64b07024a18d3b4 is unusable due to
missing or recursive dependencies:
template-haskell-2.5.0.0-7d9b1443ac5ab69e5ed705a487990deb
On 11-08-26 12:00 PM, informationen wrote:
How can i resolve this conflict permamently (i know about :set
-hide-package ... )? And shouldn't there be a rule in the
haskell platform which forbids modules of the same name?
Two permanent resolutions, choose one:
ghc-pkg hide system-fileio
On Fri, 26 Aug 2011 20:30:02 +0100, you wrote:
You wouldn't want to know how many bits you need to store on disk to
reliably recreate the value?
I can't say that I have cared about that sort of thing in a very long
time. Bits are rather cheap these days. I store data on disk, and the
space it
Hi,
I order to improve my Haskell skills I started (again) to solve the
project euler problems with this language.
I am now at problem 11 and would really appreciate any comment about
my code in order to make it more elegant or efficient.
My solutions can be found here:
Is Problem 11 the 4 consecutive #'s problem?
If so what must be true for 4 #'s to have a large product?
Hint: x * y * z * 2 is that going to be larger?
--
--
Regards,
KC
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Thank you, there is also a nice link here :-)
http://stackoverflow.com/questions/7178919/how-to-make-callcc-more-dynamic
and for this type,
ContT {runContT :: forall r1 . (forall r2 . a- m r2) - m r1}
callCC can be defined, however, you can not run it, and reset couldn't
type check
于 11-8-25
23 matches
Mail list logo
