This is a very useful hack to bootstrap GHC, at least for minor
versions...
If you have the autoconf utility avalaible on your box:
-which autoconf
-type autoconf ( under bash shell )
try as follow:
1) Remove configure file ( rm configure)
2)Open the file fptools/aclocal.m4
dnl
dnl
Building GHC requires GHC too, not just Happy.
The best thing to do is usually to download and install
both GHC and Happpy, which is what the building guide
recommends
http://haskell.cs.yale.edu/ghc/docs/latest/building/sec-pre-supposed.htm
l
You can get away with downloading just GHC, building
Hi,
I have what I think is a really strange problem. I have a fair sized
problem, which involves sorting a data set, first on labels (which are
Strings) and then on scores (which are Ints).
The strange thing is that string sorting is *vastly* faster than int
scoring! Now, I've tried
I have an alternative HTML library if you are interested... it uses an
intermediate representation (a DOM style model) and defines the type
ShowDOM = DOM - DOM , allowing efficent concatination using function
composition, finally a layer on top of this using the type
ShowDOM - (a,ShowDOM),
Ketil Z. Malde wrote:
I have what I think is a really strange problem. I have a fair sized
problem, which involves sorting a data set, first on labels (which are
Strings) and then on scores (which are Ints).
The strange thing is that string sorting is *vastly* faster than int
scoring! Now,
Colin Runciman [EMAIL PROTECTED] writes:
Could it be that the string-comparison sort simply has less sorting to do
than the int-comparison sort?
Not quite improbable, hang on while I print the profiling (with
comparison in its own function): Yes, that seems to be the case, for
90K values to
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
for 90K values to sort, I get 7M string comparisons and 321M integer
..and with different parameters giving 127K values, ie. a factor of
1.4, I get 12M and 614M comparisons, *very* close to the expected
O(n²) behavior of insertion sort.
The default
It appears that building GHC requires Happy. It appears that
building Happy requires GHC. How does one bootstrap this thing ?
Building GHC shouldn't really require Happy, but there's a bug in the 5.02 source
distribution which means that the configure script complains if you don't have
On Wednesday 26 June 2002 04:19 am, Colin Runciman wrote:
Could it be that the string-comparison sort simply has less sorting to do
than the int-comparison sort? The default definition of sortBy uses
insertion sort, so if the string-sort input happens to be already sorted
it takes linear
I think the problem is that GHCi doesn't respect #ifdef
conditional compilation.
I wasn't aware of any bugs in that area, can anyone provide some sample
code? (and I'm surprised, because GHCi just runs cpp in the same way as
GHC).
Ah, I think it is probably just a failure to use the
10 matches
Mail list logo
