On 06/10/12 03:06 PM, Ben Gamari wrote:
Let the list know if you encounter any issues. I'll try to dust off my
own development environment once I get back to the states next week to
ensure that everything still works. I've been meaning to setup the
PandaBoard as a build slave as Karel's has been
Thanks. I've linked to it from
http://www.haskell.org/haskellwiki/GHC/Type_families#Frequently_asked_questions
| -Original Message-
| From: Henning Thielemann [mailto:lemm...@henning-thielemann.de]
| Sent: 10 June 2012 15:14
| To: Simon Peyton-Jones
| Cc: Haskell Cafe
| Subject: RE:
On Mon, 11 Jun 2012, Simon Peyton-Jones wrote:
Thanks. I've linked to it from
http://www.haskell.org/haskellwiki/GHC/Type_families#Frequently_asked_questions
Thank you! I already added this and another link to a new See also
section below. Which one shall we maintain?
Pick the i-th word (replacing the previously chosen word, if any) with
probability 1/i? (numbering of words starts from 1 instead of 0).
On 11 June 2012 11:13, KC kc1...@gmail.com wrote:
An interesting related problem is if you are only allowed one pass through
the data how would you randomly
KC:
An interesting related problem is if you are only allowed one pass
through the data how would you randomly choose one word.
Let's choose n items.
You must know the length of the sequence, of course, otherwise the
'probability' loses its sense. So, for lists it might not be just one
Hello everyone.
I wonder why using do notation with `-` can ruin the performance.
In essence the problem is that, for some action `f :: m Double`,
running the code (in my case, `standard` from mwc-random).
f
for million times is fast but the code
do
v - f
return v
is
Well, it's not do notation, since replacing standard g with standard g =
return gives the same poor performance. I wonder if it has something to do
with error checking.
On 11 Jun 2012, at 13:38, Dmitry Dzhus wrote:
Hello everyone.
I wonder why using do notation with `-` can ruin the
On 11 Jun 2012, at 10:38, Dmitry Dzhus wrote:
main = do
g - create
e' - VU.replicateM count $ standard g
return ()
In all likelhood, ghc is spotting that the value e' is not used, and that there
are no side-effects, so it does not do anything at runtime. If you expand the
action
11.06.2012, 14:17, Malcolm Wallace malcolm.wall...@me.com:
that there are no side-effects
There are — PRNG state is updated for RealWorld, that's why monadic replicateM
is used.
You can add something like
print $ (VU.!) e 50
after e is bound and still get 0.057 sec with do-less
Gregory Collins greg at gregorycollins.net writes:
Try http://hackage.haskell.org/package/bytestring-mmap ?
Or:
http://hackage.haskell.org/package/mmap
--
Gracjan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Fri, Jun 8, 2012 at 1:40 PM, Johan Tibell johan.tib...@gmail.com wrote:
GHC used to complain when you use UNPACK with something that can't be
unpacked, but that warning seems to have been (accidentally) removed
in 7.4.1.
Turns out the warning is only on if you compile with -O or higher.
--
Bryan, do you remember what the issue is with C++ in this case? I
thought, adding a wrapper with extern C definitions should do the
trick for simpler libraries (as this one seems to be). Is the
interaction with the memory allocator the issue? Linker flags?
On 11 June 2012 06:38, Bryan
On Tue, May 29, 2012 at 12:52 PM, Roman Leshchinskiy r...@cse.unsw.edu.au
wrote:
On 29/05/2012, at 19:49, Evan Laforge wrote:
Good question.. I copied both to a file and tried ghc-core, but it
inlines big chunks of Data.Vector and I can't read it very well, but
it looks like the answer is
On Mon, Jun 11, 2012 at 10:50 AM, Thomas Schilling
nomin...@googlemail.comwrote:
Bryan, do you remember what the issue is with C++ in this case? I
thought, adding a wrapper with extern C definitions should do the
trick for simpler libraries (as this one seems to be). Is the
interaction with
On Mon, Jun 11, 2012 at 10:57 AM, Bryan O'Sullivan b...@serpentine.comwrote:
In the case of the double-conversion library, this means that static
read-only arrays that it assumes to contain valid data are full of junk.
You can join in the fun over at
On 11/06/2012, at 18:52, Evan Laforge wrote:
On Tue, May 29, 2012 at 12:52 PM, Roman Leshchinskiy r...@cse.unsw.edu.au
wrote:
Vector should definitely fuse this, if it doesn't it's a bug. Please report
if it doesn't for you. To verify, just count the number of letrecs in the
optimised
Thanks.
On Sat, Jun 2, 2012 at 12:57 PM, Michal Terepeta
michal.terep...@gmail.comwrote:
On 01.06 11:06, John Van Enk wrote:
Hi Cafe,
Is there a reason that the GHCi interpreter doesn't detect and report
infinite loops in statements like this (like compiled programs do) even
though no
On 11/06/2012, at 10:38, Dmitry Dzhus wrote:
Consider this simple source where we generate an unboxed vector with million
pseudo-random numbers:
8 -
import qualified Data.Vector.Unboxed as VU
import System.Random.MWC
import System.Random.MWC.Distributions (standard)
count =
On Mon, Jun 11, 2012 at 1:29 PM, Roman Leshchinskiy r...@cse.unsw.edu.au
wrote:
Hmm, which version of GHC and what compiler flags are you using? I'm not
familiar with ghc-core, maybe that's doing something wrong. Just run ghc -O2
-ddump-simpl and look at the output. Below is the code I'm
This is my first time hearing of Arch Linux ARM (http://archlinuxarm.org/)
but since it is based on Arch Linux (http://www.archlinux.org/),
it seems odd that Arch Linux ARM's ghc is still 6.12.3,
when Arch Linux's ghc has been 7.4.1 since March 3 or earlier.
As far as I could see, all the other
On Wed, May 30, 2012 at 5:47 PM, Roman Cheplyaka r...@ro-che.info wrote:
With this patch your code prints:
parse error at (line 1, column 7):
unexpected Hallofb, expecting one of [Hello,Hallo,Foo,HallofFame]
Hi folks,
Roman's patch has been included in the newly-released parsec
21 matches
Mail list logo
