Am Mittwoch, 8. März 2006 12:06 schrieben Sie:
Daniel Fischer wrote:
Hi all,
I've just installed haddock-0.7, nice, but...
haddock -o h7doc -h -D h7doc/fusi.haddock --use-package=base
Verwaltung.hs
Teams.hs Stats.hs Match.hs Main.hs Liga.hs Item.hs Helpers.hs Datum.hs
Warning
Am Mittwoch, 8. März 2006 10:51 schrieb zell_ffhut:
Just wondering if anyone can help me with a Haskell problem im having.
How would I get the value of, lets say, the 9th object in [4179355,
567412] ?
(in this case, that should return 6)
Any help/adivce would be great :)
--
View this
schrieb Daniel Fischer:
Hi all,
I've just installed haddock-0.7, nice, but...
haddock -o h7doc -h -D h7doc/fusi.haddock --use-package=base
Verwaltung.hs
Teams.hs Stats.hs Match.hs Main.hs Liga.hs Item.hs Helpers.hs Datum.hs
Warning: Helpers: could not find link destinations
Am Donnerstag, 9. März 2006 14:04 schrieb Martin Percossi:
Hello, the following code doesn't compile
snip
matMul :: MMatrix s - MMatrix s - ST s (MMatrix s)
--matMul a b = do let foo = 2*5
--return a
matMul a b = do { let foo = 2*5; return a }
/snip
under ghc 6.4.1,
Hello All,
how would I get myself a working (and easy to use) GUI-library?
Fudgets looks good, but I couldn't get it to build.
I downloaded the snapshot from 2005, how to compile says
make ghc-all; make ghc-install,
but it doesn't work.
First, in several scripts/makefiles, the ghc version 4.06
2006 10:11 schrieben Sie:
On Mon, 2006-03-13 at 09:58 +0100, Daniel Fischer wrote:
Hello All,
how would I get myself a working (and easy to use) GUI-library?
There are two main GUI libraries at the moment: Gtk2Hs and wxHaskell.
http://haskell.org/gtk2hs/
http://wxhaskell.sourceforge.net
Hi,
probably somebody else has already come up with something better, but still...
I surmise that you have two kinds of infix-operators,
1. dot-like operators, made up entirely of symbols (^!$%/\,.:;#+-~* ...)
2. LaTeX-command-like operators, starting with a backslash and then followed
by a
Am Freitag, 31. März 2006 15:24 schrieb Daniel Fischer:
Hi,
probably somebody else has already come up with something better, but
still...
I surmise that you have two kinds of infix-operators,
1. dot-like operators, made up entirely of symbols (^!$%/\,.:;#+-~* ...)
2. LaTeX-command-like
Am Montag, 3. April 2006 18:52 schrieb Chris Kuklewicz:
Claus Reinke wrote:
It solves sudoku puzzles. (What pleasure do people get by doing
these in their heads?!?)
probably the same you get from writing programs?-) figuring out the
rules, not getting lost in complexity, making
Am Mittwoch, 5. April 2006 15:09 schrieb Chris Kuklewicz:
Henning Thielemann wrote:
On Mon, 3 Apr 2006, Jared Updike wrote:
or ambiguously) with your Sudoku solver? A rough mesaure of the
difficulty of the unsolved puzzle could be how long the solver took to
solve it (number of steps)
Am Freitag, 7. April 2006 01:50 schrieben Sie:
On Apr 6, 2006, at 6:05 PM, Daniel Fischer wrote:
I've also written a version using David F. Place's EnumSet instead
of [Int],
that takes less MUT time, but more GC time, so is slower on the
36,628 test,
but faster for a single puzzle
Am Freitag, 7. April 2006 17:33 schrieben Sie:
Just out of curiosity, speed was not the objective when I wrote my
solver, I wanted to avoid guesswork (as much as possible), but in
comparison with Cale Gibbard's and Alson Kemp's solvers (which are much
more beautifully coded), it turned out
Am Freitag, 7. April 2006 22:57 schrieb David F. Place:
After reading Daniel Fischer's message about trying to use EnumSet in
his Sudoku.hs and finding that it was slower when processing a large
data set, I decided to do some profiling. I rewrote his solver to
use EnumSets and profiled it.
Am Samstag, 8. April 2006 02:20 schrieb Daniel Fischer:
Am Freitag, 7. April 2006 17:33 schrieben Sie:
Just out of curiosity, speed was not the objective when I wrote my
solver, I wanted to avoid guesswork (as much as possible), but in
comparison with Cale Gibbard's and Alson Kemp's
Hum,
oddly, these actually slow things down.
While the new size brought the sudoku17 time from ~570s down to ~490s,
the new findMinIndex/findMaxIndex increased the time to ~515s, although hardly
used.
Why?
Cheers,
Daniel
Am Sonntag, 9. April 2006 00:54 schrieb Robert Dockins:
On Apr 8, 2006,
Am Samstag, 8. April 2006 20:28 schrieb Chris Kuklewicz:
I have finished my cleanup of the dancing links based solver for Sudoku.
I don't have time to compare performance with the other programs that have
been posted recently, or to do more profiling of my code.
Your dancing links:
ckSud
Am Samstag, 8. April 2006 10:21 schrieb Chris Kuklewicz:
Daniel Fischer wrote:
But, lo and behold, I also tried how plain Array fared in comparison to
DiffArray and ... reduced the running time to under ten minutes (a little
above for the list version), 5% GC time without -AxM, 1.2
Moin Claus,
Am Montag, 10. April 2006 10:11 schrieben Sie:
Mine's even faster now (at least on my computer, would you care to test
it on your's? If you don't want to get EnumSet, just change DiffArray to
Array, worked wonders for me), I'll dig into yours tomorrow to see what
I can get out
I have added 'solve method F', aka X-wing, swordfish...
(www.sudokusolver.co.uk) to my solver, that reduced the number of puzzles
needing guesses to 5306, so I suppose that's it.
I haven't yet implemented it efficiently, so it was devastating for
performance - and solving thirteen puzzles more
On Monday 09 August 2010 21:19:01, John Lato wrote:
I don't find purify2 particularly helpful because I almost never want
to break out of any arbitrary monad; I want to be able to break out of
a specific monad without knowing which monad it is, that is:
purify3 :: Monad m = m a - a
purify3
On Tuesday 10 August 2010 19:12:57, michael rice wrote:
OK, then there's also an implicit *in* after the *let* in this code.
Yes.
do let x = foo
bar
baz
is desugared to
let x = foo in (bar baz)
Must the implicit (or explicit) *in* actually use the calculated
value(s)?
No, and if
On Friday 13 August 2010 17:25:58, Gábor Lehel wrote:
How about the case for text which is guaranteed to be in ascii/latin1?
ByteString again?
If you can be sure that that won't change anytime soon, definitely.
Bonus points if you can write the code so that later changing to e.g.
Data.Text
On Friday 13 August 2010 17:27:32, Sean Leather wrote:
Which one do you use for strings in HTML or XML in which UTF-8 has
become the commonly accepted standard encoding? It's text, not binary,
so I should choose Data.Text. But isn't there a performance penalty for
translating from Data.Text's
On Friday 13 August 2010 17:57:36, Bryan O'Sullivan wrote:
3. Some commonly used functions, such as substring searching, are
*way*faster than their ByteString counterparts.
That's an unfortunate example. Using the stringsearch package, substring
searching in ByteStrings was considerably
On Friday 13 August 2010 19:53:37, Bryan O'Sullivan wrote:
On Fri, Aug 13, 2010 at 9:55 AM, Daniel Fischer
daniel.is.fisc...@web.dewrote:
That's an unfortunate example. Using the stringsearch package,
substring searching in ByteStrings was considerably faster than in
Data.Text in my tests
On Friday 13 August 2010 19:53:37 you wrote:
On Fri, Aug 13, 2010 at 9:55 AM, Daniel Fischer
daniel.is.fisc...@web.dewrote:
That's an unfortunate example. Using the stringsearch package,
substring searching in ByteStrings was considerably faster than in
Data.Text in my tests.
Interesting
.
Or is there native Text IO but just not in your example?
Outdated information, sorry.
Up to ghc-6.10, text's IO was via ByteString, it's no longer so.
However, the native Text IO is (of course) much slower than ByteString IO
due to the need of en/decoding.
Kevin
On Aug 13, 8:57 pm, Daniel
On Sunday 15 August 2010 20:04:01, Bryan O'Sullivan wrote:
On Sat, Aug 14, 2010 at 6:05 PM, Bryan O'Sullivan
b...@serpentine.comwrote:
- If it's not good enough, and the fault lies in a library you
chose, report a bug and provide a test case.
As a case in point, I took the string
On Sunday 15 August 2010 20:53:32, Bryan O'Sullivan wrote:
On Sun, Aug 15, 2010 at 11:39 AM, Daniel Fischer
daniel.is.fisc...@web.dewrote:
Out of curiosity, what kind of speed-up did your Friday fix bring to
the searching/replacing functions?
Quite a bit!
text 0.7.1.0 and 0.7.2.1
Hi Bulat,
On Monday 16 August 2010 07:35:44, Bulat Ziganshin wrote:
Hello Daniel,
Sunday, August 15, 2010, 10:39:24 PM, you wrote:
That's great. If that performance difference is a show stopper, one
shouldn't go higher-level than C anyway :)
*all* speed measurements that find Haskell is
On Monday 16 August 2010 14:37:34, Roel van Dijk wrote:
On Sat, Aug 14, 2010 at 5:41 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
(Then again, the Fibonacci numbers can be computed
in O(1) time, and nobody ever needs Fibonacci numbers in the first
place, so this is obviously
On Tuesday 17 August 2010 08:59:29, Sebastian Fischer wrote:
I wonder whether the numbers in a single step of the computation
occupy all the memory or whether old numbers are retained although
they shouldn't be.
BTW, what sort of memory usage are we talking about here?
I have now tried your
On Tuesday 17 August 2010 17:33:15, Sebastian Fischer wrote:
BTW, what sort of memory usage are we talking about here?
./calcfib 1 +RTS -s
451,876,020 bytes allocated in the heap
10,376 bytes copied during GC
19,530,184 bytes maximum
On Wednesday 18 August 2010 16:00:41, Henk-Jan van Tuyl wrote:
L.S.,
I hope someone can help me with the following:
I am trying to check the SHA1 hash of a file, using the package
cryptohash [0]; the following error message is displayed when I try to
compile my program:
On Wednesday 18 August 2010 19:13:48, Andrew Coppin wrote:
Ben Millwood wrote:
I think it's not completely a stupid idea to have profiling default
off. I personally do not really enjoy the fact that I compile
everything three times nowadays :)
Fair enough. However, having documentation
On Thursday 19 August 2010 22:15:59, Andrew Coppin wrote:
It's something I've always _wanted_ Cabal to do, but this is the first
time I've ever seen it happen. I don't know what particularly I did to
make this happen, and now it seems to be gone, so...
Hm, I just renamed my
On Friday 20 August 2010 15:20:41, Johannes Waldmann wrote:
Here's another instance of the machine (*) telling me what to do,
instead of doing it (or am I missing something):
I have a large set of cabal packages installed with ghc.
Then suddenly I need some package Foo with profiling.
So I
On Saturday 21 August 2010 14:57:26, Andrew Coppin wrote:
Ivan Lazar Miljenovic wrote:
Andrew Coppin andrewcop...@btinternet.com writes:
So now I wonder about Darcs, Cabal, Haddock, Hackage, and all those
other big projects. Do they really have a bazillion people working on
them? Or is it
On Saturday 21 August 2010 15:35:08, Ivan Lazar Miljenovic wrote:
A Bazillion is an imaginary number meant to indicate something extremely
large: http://en.wikipedia.org/wiki/Bazillion#-illion
Yes, but 'extremely large' numbers mean different things, depending on
whether we talk about for
On Sunday 22 August 2010 19:23:03, Yves Parès wrote:
In fact the encoding problem is more general.
When I simply do 'readFile bar/fooé', then I'm told:
*** Exception: bar/fooé: openFile: does not exist (No such file or
directory)
Try
ghci readFile (Data.ByteString.Char8.unpack
On Sunday 22 August 2010 20:12:16, Vladimir Matveev wrote:
I think the problem is with terribly inefficient data representation.
Worse, it's a terribly inefficient algorithm.
The constraints are applied too late, so a huge number of partial boards
are created only to be pruned afterwards. Since
On Sunday 22 August 2010 22:15:02, Luke Palmer wrote:
On Sun, Aug 22, 2010 at 1:18 PM, Daniel Fischer
daniel.is.fisc...@web.de wrote:
On Sunday 22 August 2010 20:12:16, Vladimir Matveev wrote:
I think the problem is with terribly inefficient data representation.
Worse, it's a terribly
On Monday 23 August 2010 22:30:03, Oscar Finnsson wrote:
Hi,
I'm wondering why I have to repeat the class constraints at every
function.
If I got the data type
data (Eq a, Show a, Data a, Eq b, Show b, Data b, Eq c, Show c, Data
c) = Foo a b c = Foo a b c
Type class constraints on
On Wednesday 25 August 2010 13:53:47, John Lato wrote:
From: Heinrich Apfelmus apfel...@quantentunnel.de
Do you have an example where you want chunking instead of single
character access?
I am unable to think of any examples where you want chunking for any
reason other than efficiency.
On Wednesday 25 August 2010 18:59:26, Oscar Finnsson wrote:
Thanks for the tip. You saved my day (and code)!
So what is the point of having the constraint on the left side of the
'='?
I don't really know. What it does is preventing users from constructing
values with arguments whose types
On Thursday 26 August 2010 09:04:23, Luc TAESCH wrote:
and looked at Lekah's message:
src\Main.hs:19:17:
Could not find module `Data.Map':
It is a member of the hidden package `containers-0.3.0.0'.
Perhaps you need to add `containers' to the build-depends in
your .cabal
On Thursday 26 August 2010 09:33:30, Heinrich Apfelmus wrote:
Daniel Fischer wrote:
John Lato wrote:
Heinrich Apfelmus wrote:
Do you have an example where you want chunking instead of single
character access?
I am unable to think of any examples where you want chunking for any
On Friday 27 August 2010 14:54:53, Patrick Browne wrote:
class BEING human = HUMAN human where
At this point there is no additional functionality is defined for the
subclass HUMAN
Sub-classing is logical implication BEING(human) = HUMAN(human)
All types t that make BEING(t) = true also
On Friday 27 August 2010 16:54:09, sylvain wrote:
Hi,
the results given by the same research at the world level is worrisome:
the interest in Haskell is steadily declining since 2004. Why was
Haskell not successful conquering the hearts? Is it doomed to fail or is
there still a chance?
On Sunday 29 August 2010 15:17:20, Don Stewart wrote:
http://hackage.haskell.org/trac/ghc/ticket/4277
Proposal: Significant performance improvements for Data.Map
Description
Milan Straka's recent [52] Haskell Symposium paper (PDF) shed light
on the containers:Data.Map library,
On Sunday 29 August 2010 18:48:32, Johan Tibell wrote:
On Sun, Aug 29, 2010 at 3:41 PM, Daniel Fischer
daniel.is.fisc...@web.dewrote:
That is great.
Have you any data about the speedup relative to map sizes?
Milan Straka's benchmarks ran only on very small maps (= 2^10
elements), I'd
On Wednesday 01 September 2010 06:08:07, Bryan O'Sullivan wrote:
New in this release:
- Substantial performance improvements.
- Bug fixes, and better quality assurance via automated QuickCheck
and HPC tests and coverage.
- An even nicer API than before.
Good job.
The text
On Wednesday 01 September 2010 18:15:19, Bryan O'Sullivan wrote:
Hi, Daniel -
Thanks for taking the new code for a test drive!
The interesting part is the comparison between text and vanilla String
I/O, the difference is smaller than I expected for text-0.8.0.0.
Yes. Much of this is due
On Wednesday 01 September 2010 21:29:47, Daniel Fischer wrote:
that's where you definitely get a space leak, because
intersperse :: a - [a] - [a]
intersperse _ [] = []
intersperse _ [x] = [x]
intersperse sep (x:xs) = x : sep : intersperse sep xs
isn't lazy enough
On Thursday 02 September 2010 00:05:03, Jan Christiansen wrote:
Hi,
there is a new ticket that Data.List.intersperse is not as non-strict
as possible (http://hackage.haskell.org/trac/ghc/ticket/4282).
It's not that it's not as non-strict as possible per se. (Sorry, had to :)
It's that
On Thursday 02 September 2010 09:25:59, Jan Christiansen wrote:
Hi,
On 02.09.2010, at 01:35, Daniel Fischer wrote:
It's not that it's not as non-strict as possible per se. (Sorry, had
to :)
It's that intersperse's current definition (in GHC at least) can
cause a
space leak
Changes vs. 0.3.0:
- fixed a space leak in the splitting of lazy ByteStrings
Changes of the 0.3 series vs. 0.2.*:
- improved performance of the searching functions
- new functionality:
- breaking of ByteStrings at the first occurrence of a substring
- splitting a ByteString at each occurrence
On Thursday 02 September 2010 14:49:12, Eoin C. Bairéad wrote:
Example 2
Prelude let fac n = if n == 0 then 1 else n * fac (n-1)
How does it know to stop ?
It tests for n == 0. If that returns True, the recursion stops.
and why does fac 2.5 hang?
Because 2.5 is not an integer, so fac
On Thursday 02 September 2010 18:25:11, Henning Thielemann wrote:
The Ord instance for Bool might be justified for using Bools as keys of
Data.Map, however you can also consider using Ord for Map as abuse.
Why would one consider using Ord for Map an abuse?
A kludge, for performance reasons, but
On Thursday 02 September 2010 19:34:07, Don Stewart wrote:
andrewcoppin:
Arnaud Bailly wrote:
Hello,
I installed (succesfully) HAskell Platform 2010.2 on windows and have
a small but annoying issue: Some links in HTML documentation lead to
broken links. I did not investigate all the
On Thursday 02 September 2010 20:05:12, Daniel Fischer wrote:
Probably not. I'm on Linux and build my GHCs from source. There's no
directory mtl-1.1.0.2 in ~/share/doc/ghc/html/libraries although it's
linked to from the package index built with the compiler. (Hadn't
noticed before because I
On Friday 03 September 2010 00:22:14, Jan Christiansen wrote:
Hi,
On 02.09.2010, at 13:41, Daniel Fischer wrote:
takes a little to run and keeps the entire file until the first
occurrence
of pat in memory.
first of all thanks very much for the detailed instructions.
I have rewritten
On Friday 03 September 2010 12:28:43, Jan Christiansen wrote:
Hi,
On 03.09.2010, at 01:32, Daniel Fischer wrote:
No surprise, there aren't many 'ä's in Shakespeare's works, are there?
nope
On the other hand, the current implementation of lines does not seem
to
suffer from Wadler's
On Friday 03 September 2010 14:04:26, JP Moresmau wrote:
Hello all
After reading the modules docs and some other discussions, I'm still not
sure what's the best choice of tools for my problem. I'm looking at the
scion server code base. At the moment, it's reading and writing on
sockets using
On Saturday 04 September 2010 00:21:39, Jan Christiansen wrote:
On 03.09.2010, at 14:38, Daniel Fischer wrote:
I can't reproduce that. For me, it leaks also with profiling.
Have you used optimizations?
Of course. Always do :)
It disappears if I compile the program with -O2.
Yeah, without
On Sunday 05 September 2010 21:52:44, Henning Thielemann wrote:
Daniel Fischer schrieb:
Yes. Ordinarily, lines in text files aren't longer than a few hundred
characters, leaking those, who cares?
I got several space leaks of this kind in the past. They are very
annoying
On Monday 06 September 2010 10:47:54, Henning Thielemann wrote:
Daniel Fischer schrieb:
On Sunday 05 September 2010 21:52:44, Henning Thielemann wrote:
Daniel Fischer schrieb:
Yes. Ordinarily, lines in text files aren't longer than a few
hundred characters, leaking those, who cares?
I
On Tuesday 07 September 2010 05:22:55, David Menendez wrote:
On Mon, Sep 6, 2010 at 10:22 PM, wren ng thornton w...@freegeek.org
wrote:
On 9/6/10 1:33 PM, David Menendez wrote:
For that matter, can you even describe what pure is intended to do
without reference to* or join?
As already
On Wednesday 08 September 2010 06:44:32, Bryan O'Sullivan wrote:
I have a Replace.hs benchmark in the main text repo, just to be sure
we're talking about the same thing.
Grabbed the darcs repo, compiled with the darcs version and also with the
installed text package, both exhibit the same
On Wednesday 08 September 2010 13:46:13, Daniel Fischer wrote:
My timings are quite different, but that's probably because 6.12.3's
inliner doesn't give the full fusion benefit, so it'll improve
automatically with the next GHC release.
Or maybe not so much. Just built the latest source bundle
On Thursday 09 September 2010 20:23:13, Ali Razavi wrote:
Unfortunately I don't have ghc installed. Can I install it without root
priv?
That ought to work. I just unpacked and installed ghc-6.8.3-i386-unknown-
linux.tar.bz2 in a subdir of $HOME without root privileges.
(I would've tried a newer
On Thursday 09 September 2010 22:55:14, Wanas wrote:
Hey all,
So I have a two part question (I'm new to haskell, so you can throw all
your mugs at me).
a) I want to write a function that generates lists of lists of size $n$.
All having the property that sum lst = sum [1..n].
a-1) After
On Saturday 11 September 2010 13:20:08, Andrew Coppin wrote:
Suppose that I'm in foo/bar/box1/top and I want to access a file in
foo/bar/box2/side. How do I construct the shortest possible relative
path from one to the other?
The filepath package doesn't seem to provide
a function to do this.
On Saturday 11 September 2010 14:46:48, Bas van Dijk wrote:
On Sat, Sep 11, 2010 at 5:13 AM, michael rice nowg...@yahoo.com wrote:
Which of these would be more costly for a long list?
f :: [Int] - [Int]
f [x] = [x]
f (x:xs) = x + (head xs) : f xs
f :: [Int] - [Int]
f [x] = [x]
f
On Saturday 11 September 2010 20:38:21, Paolo Giarrusso wrote:
Hi,
after Andrew Coppin's odissey [1], I also had a few problem with
cabal, which stopped installing new packages. Details will follow;
meanwhile, here are some questions prompted by what happened:
- when recompiling a package
On Sunday 12 September 2010 21:23:50, Petr Prokhorenkov wrote:
I experienced a following problem while dealing with some text
processing.
I have a text and want to get the same text with parts enclosed into {}
or [] stripped away. Substituting them with a ' ' would also work.
Here is the
On Monday 13 September 2010 11:50:14, Vo Minh Thu wrote:
2010/9/13 David Virebayre dav.vire+hask...@gmail.com:
Does it help to compile with ghc --make -O2 -funbox-strict-fields ??
No, it doesn't. Can I assume you don't have the problem I described?
Currently, GHC's native code generator is
On Wednesday 15 September 2010 02:50:15, David Terei wrote:
On 13 September 2010 20:41, Vo Minh Thu not...@gmail.com wrote:
... the post is from 2008. No LLVM goodness. So I thought GHC 6.12.1
(not the latest and greatest HEAD) would be enough.
I compiled the two programs myself out of
On Wednesday 15 September 2010 12:22:24, Vo Minh Thu wrote:
Thanks all for your answsers. I still wonder why some people get very
different results between gcc and ghc, and some others don't. A
difference in processor?
Architecture (32/64-bit, x86/..., ...), processor, gcc version, OS, all
On Wednesday 15 September 2010 22:38:48, Tim Chevalier wrote:
On the other hand, if you wrote:
let fib50 = slowFib 50 in
fib50 + (slowFib 50)
then (slowFib 50) would be evaluated twice, because there's no
principle requiring the compiler to notice that (slowFib 50) is the
same expression
On Wednesday 15 September 2010 23:01:34, Peter Schmitz wrote:
textLine :: Parser String
textLine = do
x - many (noneOf \n)
char '\n'
return x
textLines :: Parser [String]
textLines = many textLine
And it can probably be coded more succinctly that that (suggestions
On Saturday 18 September 2010 19:44:38, Jake McArthur wrote:
On 09/18/2010 02:51 AM, Christopher Tauss wrote:
I am trying to write a function that takes a list and returns the last
n elements.
This may just be for the sake of learning, in which case this is fine,
but usually, needing to do
On Saturday 18 September 2010 22:42:57, Luke Palmer wrote:
I think this is O(n) time, O(1) space (!).
lastk :: Int - [a] - [a]
lastk k xs = last $ zipWith const (properTails xs) (drop k xs)
where properTails = tail . tails
Luke
No, it's O(k) too. You zip [[x_n, x_{n+1}, ... ], ... ]
On Sunday 19 September 2010 09:58:02, Николай Кудасов wrote:
$ sudo ./Setup.hs haddock
Running Haddock for type-level-0.2.4...
Preprocessing library type-level-0.2.4...
Warning: The documentation for the following packages are not installed.
No links will be generated to these packages:
On Monday 20 September 2010 06:47:12, John Millikin wrote:
On Sun, Sep 19, 2010 at 21:43, Patrick Perry patpe...@gmail.com wrote:
I needed real IEEE754 binary support for round-trip parsing, where
(for example) maintaining the particular bit pattern of a NaN is
important. For 99% of people,
On Monday 20 September 2010 15:20:53, James Andrew Cook wrote:
On Sep 20, 2010, at 5:10 AM, Jean-Marie Gaillourdet wrote:
Hi Alberto,
On 20.09.2010, at 10:53, Alberto G. Corona wrote:
2010/9/18 Daniel Fischer daniel.is.fisc...@web.de
n_lastn n = reverse . take n . reverse
On Tuesday 21 September 2010 07:11:24, Conrad Parker wrote:
On 21 September 2010 12:18, John Millikin jmilli...@gmail.com wrote:
On Mon, Sep 20, 2010 at 03:22, Daniel Fischer
daniel.is.fisc...@web.de wrote:
unsafeCoerce is not supposed to work for casts between Integral and
Floating types
On Tuesday 21 September 2010 19:46:02, John Millikin wrote:
On Tue, Sep 21, 2010 at 07:10, Daniel Fischer daniel.is.fisc...@web.de
wrote:
And I'd expect it to be a heck of a lot faster than the previous
implementation. Have you done any benchmarks?
Only very rough ones -- a few basic
On Tuesday 21 September 2010 19:45:50, Daniel Seidel wrote:
Hi,
I've got the answer - its the sumLeafs function that behaves different
for leftPath / rightPath. If one exchanges it in the leftPath case by
sumLeafs (Fork l r) = sumLeafs r + sumLeafs l
sumLeafs (Leaf i) = i
the
On Tuesday 21 September 2010 21:35:21, John Millikin wrote:
Oh, I misunderstood the question -- you're asking about architectures
on which floating-point and fixed-point numbers use a different
endianness?
Basically, I wanted to know whether there are such beasts (apparently yes)
and if,
On Wednesday 22 September 2010 17:10:06, David Sankel wrote:
The following code (full code available here[1], example taken from
comments here[2]),
const' = \a _ - a
test1 c = let a = const' (nthPrime 10)
in (a c, a c)
test2 c = let a = \_ - (nthPrime 10)
in
On Sunday 26 September 2010 12:53:46, Michael Snoyman wrote:
data MyStruct = forall a. MyTypeClass a = MyStruct {myField :: a}
Note that that requires
{-# LANGUAGE ExistentialQuantification #-}
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
- whatever
foo (MyStruct field) = methodOfMyTypeClass field
On Sep 26, 1:09 pm, Daniel Fischer daniel.is.fisc...@web.de wrote:
On Sunday 26 September 2010 12:53:46, Michael Snoyman wrote:
data MyStruct = forall a. MyTypeClass a = MyStruct {myField :: a}
Note that that requires
{-# LANGUAGE
On Monday 27 September 2010 14:52:18, Henning Thielemann wrote:
data Foo a b =
Foo a
| Bar b
| Foobar a b
avoids this, at least for the type name Foo.
Tastes vary, but I find that ugly. I much rather have the '=' aligned with
the '|'.
data Foo a b
= Foo a
|
On Monday 27 September 2010 18:09:08, Evan Laforge wrote:
data Foo a b
= Foo a
| Bar b
| Foobar a b
deriving (Eq, Ord)
There, that looks good.
There is a trap if you do a similar thing with records:
data Foo = Foo
{ a :: Int
, b :: Int
}
If
On Wednesday 29 September 2010 19:10:22, Ben Franksen wrote:
Note the last line mentions only '}'. I would rather like to see
expecting } or digit
since the parser could very well accept another digit here.
parsec2 did that, I don't know whether that change is intentional or
On Wednesday 29 September 2010 23:02:02, Andrew Coppin wrote:
So anyway, that's the problem. The solution is...
Two obvious solutions.
- stop using Windows and migrate to an OS where stuff works pretty much out
of the box (not going to happen a lot)
- start helping to make things work on
On Wednesday 29 September 2010 23:15:14, DavidA wrote:
Ryan Ingram ryani.spam at gmail.com writes:
Haskell doesn't have true type functions; what you are really saying
is
instance Monad (\v - Vect k (Monomial v))
Yes, that is exactly what I am trying to say. And since I'm not allowed
On Thursday 30 September 2010 00:56:56, cas...@istar.ca wrote:
When I change the cabal file to say
preference: base = 4
In the .cabal file of a package, that would belong in the build-depends.
I still get, you are using base 3.0 which is deprecated.
When I change the overall cabal profile,
On Sunday 03 October 2010 10:43:24, Henning Thielemann wrote:
On Sun, 3 Oct 2010, Ben Franksen wrote:
Christopher Done wrote:
Consider the following program:
main = putStrLn $ show $ length [undefined :: a,undefined :: b]
A concrete type of the element in list doesn't need to be
701 - 800 of 1464 matches
Mail list logo
