Dear GHC developers,
the function let ns = [1 .. 10^6] :: [Int]
p = partition even ns
in
take 2 $ fst p
computes too long in ghc-6.2.2-September-26
and needs several megabyte of stack.
What might be the reason?
-
the function let ns = [1 .. 10^6] :: [Int]
p = partition even ns
in
take 2 $ fst p
computes too long in ghc-6.2.2-September-26
and needs several megabyte of stack.
this has been noticed a few times, for example
A little browsing in the CVS reveals that partition is fixed in GHC's
libraries but that it was done after the 6.2 branch. So the 6.2 branch is
still using the old erroneous definition.
Could this fix be merged into the 6.2 branch, please?
/Josef
-Original Message-
From:
Indeed, could it?
For 6.2.2 is have not been released so far ...
On Thu, Oct 14, 2004 at 12:02:20PM +0200, Josef Svenningsson wrote:
A little browsing in the CVS reveals that partition is fixed in GHC's
libraries but that it was done after the 6.2 branch. So the 6.2 branch is
still using
Bugs item #1047408, was opened at 2004-10-14 15:41
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1047408group_id=8032
Category: None
Group: 6.2.1
Status: Open
Resolution: None
