On Mon, May 9, 2011 at 8:25 AM, Rogan Creswick wrote:
> Indeed :) The tag syntax is controlled by two command-line flags:
> --prefix=... and --suffix=...
>
> It can be difficult to get the desired strings past both the shell and
> the regular expression compiler (although that last bit is changin
I guess everyone has weighed in. I must have been hallucinating.
Yes, this will work.
Thanks,
Michael
--- On Thu, 5/12/11, Bryan O'Sullivan wrote:
From: Bryan O'Sullivan
Subject: Re: [Haskell-cafe] Hash table constructors return table in IO Monad.
Why?
To: "michael rice"
Cc: "Stephen Tetley"
On Friday 13 May 2011 01:19:52, Ganesh Sittampalam wrote:
> On 12/05/2011 19:41, Nick Bowler wrote:
> > On 2011-05-12 21:14 +0400, Grigory Sarnitskiy wrote:
> >> I don't want NaN to propagate, it is merely stupid, it should be
> >> terminated.
> >
> > NaN propagation is not stupid. Frequently, co
On 12/05/2011 19:41, Nick Bowler wrote:
> On 2011-05-12 21:14 +0400, Grigory Sarnitskiy wrote:
>> I don't want NaN to propagate, it is merely stupid, it should be terminated.
>
> NaN propagation is not stupid. Frequently, components of a computation
> that end up being NaN turn out to be irrelev
On Thu, May 12, 2011 at 12:45 PM, Andrew Coppin
wrote:
> Both Hackage and Cabal seem to assume as a matter of course that I want to
> use Haddock to generate all my documentation. Suppose I decide to violate
> this assumption. Then what?
>
> 1. Is there some way I can include my own HTML documenta
On Thu, May 12, 2011 at 12:59 PM, michael rice wrote:
>
> HashTable doesn't do it. Neither does Map. Was I dreaming?
>
multiInsert k v m = insertWith' (++) k [v] m
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/li
On Thu, May 12, 2011 at 11:00 AM, Don Stewart wrote:
> No, you should be using Haddock.
>
> If you wish to generate docs some other way, you are free to host that
> on your own site, and link to it from the Hackage page.
>
Or improve haddock if you think it's lacking something.
Jason
__
On 12 May 2011 20:59, michael rice wrote:
> HashTable doesn't do it. Neither does Map. Was I dreaming?
>
I suppose you could implement this functionality on top of either.
HTH,
Ozgur
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.ha
Thanks, Bryan and Stephan.
I seem to remember playing around with a data structure that accumulates (in a
list) different values associated with an identical key, i.e.,
insert data-structure "abc" 5insert data-structure "abc" 6
retrieve data-structure "abc" -> [5,6]
HashTable doesn't do it. Neithe
On 12/05/2011 06:14 PM, Grigory Sarnitskiy wrote:
How do I make my program stop whenever it gets somewhere NaN as a result during
a calculation? If there is no appropriate flag for ghc maybe there exist flags
for C to use in optc.
I don't want NaN to propagate, it is merely stupid, it should b
On 2011-05-12 21:14 +0400, Grigory Sarnitskiy wrote:
> How do I make my program stop whenever it gets somewhere NaN as a
> result during a calculation? If there is no appropriate flag for ghc
> maybe there exist flags for C to use in optc.
Under IEEE 754 floating point arithmetic, any operation wh
On Thu, May 12, 2011 at 9:22 AM, Stephen Tetley wrote:
> The hashtable needs to be been created in IO, after that, think of the
> 'hashtable' as a analogous to a file handle. You have to pass it
> around to do anything with it - but the only things you can do with it
> are in IO.
>
The appropriat
No, you should be using Haddock.
If you wish to generate docs some other way, you are free to host that
on your own site, and link to it from the Hackage page.
On Thu, May 12, 2011 at 10:45 AM, Andrew Coppin
wrote:
> Both Hackage and Cabal seem to assume as a matter of course that I want to
> us
Both Hackage and Cabal seem to assume as a matter of course that I want
to use Haddock to generate all my documentation. Suppose I decide to
violate this assumption. Then what?
1. Is there some way I can include my own HTML documentation in the
package tarball and have Hackage/Cabal use it?
On Thursday 12 May 2011 19:14:09, Felipe Almeida Lessa wrote:
> On Thu, May 12, 2011 at 2:04 PM, Stefan Kersten wrote:
> > extractModules = sort . nub . everything (++) ([] `mkQ` f)
> > where f (NameQ x) = [modString x]
> > f (NameG _ _ x) = [modString x]
> > f _ = []
>
>
At Thu, 12 May 2011 16:45:02 +0100,
Simon Marlow wrote:
>
> >> There are no locks here, thanks to the message-passing implementation we
> >> use for throwTo between processors.
> >
> > Okay, that sounds good. So then there is no guarantee about ordering
> > of throwTo exceptions? That seems like
How do I make my program stop whenever it gets somewhere NaN as a result during
a calculation? If there is no appropriate flag for ghc maybe there exist flags
for C to use in optc.
I don't want NaN to propagate, it is merely stupid, it should be terminated.
_
On Thu, May 12, 2011 at 2:04 PM, Stefan Kersten wrote:
> extractModules = sort . nub . everything (++) ([] `mkQ` f)
> where f (NameQ x) = [modString x]
> f (NameG _ _ x) = [modString x]
> f _ = []
Minor nitpick: instead of doing 'sort . nub', please use 'import
qualified
On 5/12/11 4:03 PM, Serguey Zefirov wrote:
Just pretty-print a Exp.
It seems that "show $ ppr exp" will produce exactly what you need.
The same goes for Dec (declarations), etc.
ah ok, thanks!
fwiw, here's a way to extract a list of module names that need to be
imported, adapted from an exa
The hashtable needs to be been created in IO, after that, think of the
'hashtable' as a analogous to a file handle. You have to pass it
around to do anything with it - but the only things you can do with it
are in IO.
(That's why no-one really likes it, of course...)
_
On 12/05/2011 16:04, David Mazieres expires 2011-08-10 PDT wrote:
At Thu, 12 May 2011 09:57:13 +0100,
Simon Marlow wrote:
So to answer my own question from earlier, I did a bit of
benchmarking, and it seems that on my machine (a 2.4 GHz Intel Xeon
3060, running linux 2.6.38), I get the followi
Is there some reason why ALL the ways to create a hash table return one in the
IO Monad, but all the functions for retrieving a value from a hash table take
as an argument a hash table NOT in the IO Monad?
Michael
=
Prelude Data.HashTable> let ht = fromList id [(5,'a'),(6,'b')]Pr
> Hello!
>
> I've just started using parallel computations in Haskell. parMap works fine,
>it is so easy to use. However, parMap fails with functions returning lazy
>structures, e.g. tuples.
>
> This code works as expected:
>
> (parMap rpar) bm tvalues
Using rpar is redundant. That strat
Just pretty-print a Exp.
It seems that "show $ ppr exp" will produce exactly what you need.
The same goes for Dec (declarations), etc.
2011/5/12 Stefan Kersten :
> hi,
>
> i was wondering if it's possible to directly generate Haskell source code
> from a Template Haskell `Q Exp', i.e. use TH as
hi,
i was wondering if it's possible to directly generate Haskell source
code from a Template Haskell `Q Exp', i.e. use TH as a kind of
preprocessor? i am asking because currently the iOS port of ghc doesn't
support TH and i need to generate some instances for the persistent
package [1,2].
Hello!
I've just started using parallel computations in Haskell. parMap works fine, it
is so easy to use. However, parMap fails with functions returning lazy
structures, e.g. tuples.
This code works as expected:
(parMap rpar) bm tvalues
bm :: Double -> Double is some heavy function. But if I
On 11/05/2011 23:57, dm-list-haskell-c...@scs.stanford.edu wrote:
At Wed, 11 May 2011 13:02:21 +0100,
Simon Marlow wrote:
However, if there's some simpler way to guarantee that>>= is the
point where exceptions are thrown (and might be the case for GHC in
practice), then I basically only need t
On Wed, May 11, 2011 at 6:13 PM, Gregory Crosswhite <
gcr...@phys.washington.edu> wrote:
[snip]
> 1) Cabal is a tool that can only be used to build Haskell packages with
> some supporting C/C++ code thrown in
>
> and
>
> 2) Cabal is currently the only tool that can realistically be used to
> prope
28 matches
Mail list logo
