igouy2:
--- Don Stewart [EMAIL PROTECTED] wrote:
-snip-
So still consolidating the system.
Pretty much.
Do I understand though, that if we submit, say, a quad-core version
of
binary-trees, for example, using `par` and -N4, it'll go live on the
benchmark page?
That's
bos:
On Mon, Aug 25, 2008 at 2:28 PM, Don Stewart [EMAIL PROTECTED] wrote:
I've pushed a decodeFile that does a whnf on the tail after decoding.
Does this mean that there are now NFData instances for bytestrings?
That would be handy.
No, since I can get whnf with `seq`. However
lemming:
On Sun, 24 Aug 2008, John Van Enk wrote:
Eric,
I was hoping to use a packed format like ByteString eventually. Right
now, I
want to get everything working nicely. As it stands, I end up marshaling a
lot of information into/out of arrays which I'd much rather keep as a
block
jed:
On Sun 2008-08-24 11:03, Thomas M. DuBuisson wrote:
Yay, the multicore version pays off when the workload is non-trivial.
CPU utilization is still rather low for the -N2 case (70%). I think the
Haskell threads have an affinity for certain OS threads (and thus a
CPU). Perhaps it
ryani.spam:
On Mon, Aug 25, 2008 at 5:33 AM, Hans van Thiel [EMAIL PROTECTED] wrote:
The books I use for reference, the Craft and SOE, don't seem to mention
this. I have to confess, I don't really understand the difference
between newtype and data. Again, an explanation would be
duncan.coutts:
On Thu, 2008-08-14 at 10:21 -0700, Don Stewart wrote:
I think you're right. The Binary instances cannot and must not read more
than they need to, so that gives us the behaviour that we read exactly
the length of the file, but no more, and thus we never hit EOF, so we
thomas.dubuisson:
dons:
Simon Marlow sez:
The thread-ring benchmark needs careful scheduling to get a speedup
on multiple CPUs. I was only able to get a speedup by explicitly
locking half of the ring onto each CPU. You can do this using
GHC.Conc.forkOnIO in GHC 6.8.x,
haskell:
At the end of this e-mail, you can find a list of Haskell sound
libraries and their supported audio formats.
Could you add that detail to the Haskell wiki Audio page?
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
dmehrtash:
I am trying to convert a string to a float. It seems that Data.ByteString
library only supports readInt.After some googling I came accross a
possibloe implementation: [1]http://sequence.svcs.cs.pdx.edu/node/373
Use the bytstring-lexing library,
package.
-- Don
dmehrtash:
I am curious to understand the logic, the Haskell Think, here. Why is
it that the byteString only supports conversion to int.
daryoush
On Sun, Aug 24, 2008 at 2:23 PM, Don Stewart [EMAIL PROTECTED] wrote:
dmehrtash:
I am trying
ben.franksen:
Galchin, Vasili wrote:
Thank you Murray. My post was not so clear I was referring to
automatic parellelization vs manual parallelization. By automatic I
mean the programmer doesn't have to indicate where to parallelize ...
instead the compiler decides how to parallize!
ashley:
Thomas Davie wrote:
I'd be interested to see your other examples -- because that error is
not happening in Haskell! You can't argue that Haskell doesn't give you
no segfaults, because you can embed a C segfault within Haskell.
This segfaults on my x86_64 Linux box:
module
It seems to me we should condense this thread into a series of new
entires on the Haskell in Education page?
People seem to be doing new courses, and new kinds of courses, in
Haskell, so reflecting that online is a good idea.
http://haskell.org/haskellwiki/Haskell_in_education
waldmann:
newsham:
I guess I didn't express my point very clearly... That C programmers
apparently don't realise that a type system that's sound will give them
something -- i.e. their programmer won't ever segfault. I wonder when we
try to advertise Haskell if we should be saying we can give you
magnus:
On Fri, Aug 22, 2008 at 2:32 AM, David Bremner [EMAIL PROTECTED] wrote:
At Thu, 21 Aug 2008 20:52:00 -0400 (EDT),
Christopher Lane Hinson wrote:
I'm not a DD, but I think uploading ~500 hackage packages to debian would
be a bit of a no-no. Debian packages are expected to have
nomeata:
Hi,
Am Freitag, den 22.08.2008, 10:13 +0100 schrieb Magnus Therning:
On Fri, Aug 22, 2008 at 2:32 AM, David Bremner [EMAIL PROTECTED] wrote:
At Thu, 21 Aug 2008 20:52:00 -0400 (EDT),
Christopher Lane Hinson wrote:
I'm not a DD, but I think uploading ~500 hackage packages to
magnus:
Sorry for not responding earlier but I didn't pay attention to this
thread at the time. The reason for finding it now is that I listened
to the FLOSS Weekly's episode on CouchDB yesterday; I stumbled on this
email from a search for haskell+couchdb.
On Sat, Jan 5, 2008 at 4:14 PM,
kaol:
On Tue, Aug 19, 2008 at 02:28:36PM -0700, Jeremy Shaw wrote:
- the cdbs extension for supporting haskell (the one posted on
debian-haskell mailing list a while ago)
I keep the newest version of that at
http://people.debian.org/~kaol/repos/hlibrary/
One thing that it doesn't
Monday was something of a landmark, as the 500th Haskell package was
added to the Arch Linux distribution.
I've written about the approach we took to fully automating the
construction of native packages from Hackage,
http://cgi.cse.unsw.edu.au/~dons/blog/2008/08/21#the_500
As well as a
chris:
I plan to give a course in compiler construction,
using Haskell as the implementation language
(not as source or target language).
Something along these lines:
1. combinator parsers (Parsec),
2. simple interpreter (arithmetical expressions)
3. add algebraic data types, functions
Similar course at UNSW,
http://www.cse.unsw.edu.au/~cs3161/
type checker, type inference and interpreter + proofs.
kr.angelov:
Hi Johannes,
There is a similar course in Chalmers. The home page is here:
http://www.cs.chalmers.se/Cs/Grundutb/Kurser/progs/current/
There students were
pedagand:
2008/8/20, Jason Dusek [EMAIL PROTECTED]:
What's the Haskeller friendly paper?
This version of the paper was submitted to ICFP this year (and was rejected):
http://perso.eleves.bretagne.ens-cachan.fr/~dagand/opis/icfp_paper.pdf
In the technical report, we tried to address
garious:
On Aug 19, 2008, at 9:12 AM, Greg Fitzgerald wrote:
Does anyone know of a good case study comparing a project written in C
versus one written in Haskell? I'm mostly looking for a comparison of
lines of code, but any other metric, such as time to market and
garious:
Greg wrote:
Thank you all for your help! These references are a great help for
pushing Haskell at work.
Don wrote:
I've also set up the Who's using Haskell section on [1]haskell.org's
front page -- let me know what you think
Great, thanks!
catamorphism:
Hi all,
I uploaded to Hackage a little program I wrote to organize my music
file collection in the hopes that someone else might find it useful
too:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/wavconvert
Tim wins the prize for the 500th Haskell package in
duncan.coutts:
On Mon, 2008-08-18 at 18:22 -0700, Don Stewart wrote:
Tim wins the prize for the 500th Haskell package in Arch Linux,
http://aur.archlinux.org/packages.php?ID=19205
Which, I should like to note, demonstrates why the original Cabal
design[1] was basically right[2
vigalchin:
Hi Ross,
When I upload a code contribution, how do I specify which category in
the Hackage database, e.g. System?
add:
category: System
to your project's .cabal file
___
Haskell-Cafe mailing list
DekuDekuplex:
On Thu, 14 Aug 2008 14:17:05 -0700, Don Stewart [EMAIL PROTECTED]
wrote:
[...]
Skills:
Proficiency and a strong interest in Haskell programming :)
Bachelor's degree in computer science or equivalent from a four-year
institution.
This is the required
wren:
-- Announcing: logfloat 0.8.2
I just released a new package, logfloat, for manipulating log-domain
floating numbers.
Arch Linux package now ready,
bos:
On Wed, Aug 13, 2008 at 5:39 PM, Tim Newsham [EMAIL PROTECTED] wrote:
So am I understanding you correctly that you believe this is not
a bug? That the use Data.Binary.decodeFile function leaks a file
descriptor and this is proper behavior?
I think he might be saying that decodeFile
newsham:
So am I understanding you correctly that you believe this is not
a bug? That the use Data.Binary.decodeFile function leaks a file
descriptor and this is proper behavior?
It's not a bug. It's lazy IO. If you want the Handle closed, demand all the
input. isEmpty will do this for you,
duncan.coutts:
On Wed, 2008-08-13 at 12:02 -1000, Tim Newsham wrote:
However, I think probably the real blame here should probably go
to Data.Binary which doesn't attempt to check that it has consumed
all of its input after doing a decode. If decode completes
and there is unconsumed
DekuDekuplex:
I tried posting a message to the haskell-beginners mailing list about
a half-hour ago, but it seems that all of haskell.org has been down
for at least the past half-hour.
If anybody on this mailing list responsible for server maintenance
receives this message, could you please
jon:
On Thursday 14 August 2008 14:03:48 Dougal Stanton wrote:
2008/8/14 Sean Leather [EMAIL PROTECTED]:
I can't reach www.haskell.org , and I'm having withdrawal issues.
I also can't get any response from it. It's not just you!
Haskell.org probably broke under stress after someone
By the way, for those wondering why Jon Harrop would say such an unusual
thing on the Haskell list, have a look at his contributions over on the
OCaml list,
http://article.gmane.org/gmane.comp.lang.caml.general/43430
Some choice quotes:
almost all of the examples of Haskell's use in
jon:
I'm not so sure about the library thing, it seems that Haskell has a
bigger community,
What gave you that impression?
According to the Debian and Ubuntu package popularity contest results, OCaml
currently has 10,635 registered installs compared to 6,606 for GHC. Moreover,
this
Hey all,
Below is a job opportunity for a Haskell programmer at Peerium, Inc. I
was asked for forward to the community. Enjoy!
-- Don
Subject: Haskell Job Opportunity
Platform Architect at Peerium, Inc.
Please mail
ketil:
Don Stewart [EMAIL PROTECTED] writes:
You really, really want to be using rnf for this job, instead of
turning your brain into a pretzel shape.
The Pretzel being one of the lesser-known lazy, cyclic, functional data
structures.
So pretzel-brain is actually a honorific
newsham:
Should the file be closed when the last byte is read (in this
case its definitely reading all four bytes) or when the first
byte after that is read (in this case it probably doesn't
attempt to read more than 4 bytes)?
I'll answer my own question. Both Prelude.readFile and
newsham:
Ok, surely at least everyone must agree that this is a bug:
force :: Word8 - IO Word8
force x = print x return x
-- force = return . (`using` rnf)
main = do
d - force = decodeFile stateFile
encodeFile stateFile d
where stateFile = 1word32.bin
newsham:
I have a program that read in and populated a large data structure and
then saved it out with Data.Binary and Data.ByteString.Lazy.Char8:
saveState db = B.writeFile stateFile =
encode $ atomically (readTVar db)
when I go to read this in later I get a stack overflow:
newsham:
so that fromAscList's the result of parsing the map as a list, via,
instance Binary a = Binary [a] where
put l = put (length l) mapM_ put l
get= do n - get :: Get Int
replicateM n get
so that's a length-prefixed list, strictly. Which is
bos:
On Tue, Aug 12, 2008 at 5:13 PM, Tim Newsham [EMAIL PROTECTED] wrote:
The data type I'm storing is a Map (of maps):
type DailyDb = M.Map Date Daily
type InstrsDb = M.Map String DailyDb
What's going on here?
The default marshalling scheme that Binary uses for lists and
bos:
On Tue, Aug 12, 2008 at 6:01 PM, Tim Newsham [EMAIL PROTECTED] wrote:
(my keys are dates, which are Enum). This should look at
every key in every inner map. Shouldn't that be sufficient to
force the entire data set (or do I have to touch the fields in the
data elements too?)
for a post-Dec 19, 2007 release, after the patch,
Wed Dec 19 22:06:13 PST 2007 Don Stewart
* For lazy IO operations, be sure to hClose the resource on EOF
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
cmb21:
Hi,
I have a question about cyclic inclusions. It appears in the Haskell 98
report that mutually recursive modules are allowed, however GHC complains
at any Haskell project that has cyclic inclusions (implicit or explicit).
Am I right in thinking that this is a GHC limitation?
patperry:
Hey everyone,
I've put together a new release of the Haskell BLAS bindings, now
available on hackage.
Arch Linux package available,
http://aur.archlinux.org/packages.php?ID=18098
Cheers,
Don
___
Haskell-Cafe mailing list
Haskell fans might be impressed by the good work of Joachim Breitner,
who got xmonad running on his openmoko phone,
http://www.joachim-breitner.de/blog/archives/300-Xmonad-on-my-mobile-phone.html
You can see a photo here,
http://galois.com/~dons/images/openmoko-nomeata.jpg
Haskell on
jefferson.r.heard:
This is the tutorial I'll be presenting at DEFUN 2008. I'll be
building a site around it until then, complete with compilable code
examples, but I thought I would let everyone get a sneak peek at the
long version of the tutorial before I'm done with it. The code is as
yet
jefferson.r.heard:
Hi folks. I've just released some Haskell bindings to FTGL at
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/FTGL .
FTGL is an easy to use library for portable rendering of TrueType
fonts in OpenGL, with functions for creating bitmapped fonts,
texture-mapped
trentbuck:
Neil Mitchell [EMAIL PROTECTED] writes:
The darcs 2.0 announcement read like an obituary
I don't know why, but a lot of people I spoke to seemed to have that
impression, and I essentially had to wave changelogs under their face to
convince them that darcs was still being worked
bradypus:
Suppose I've:
f = map g
I want to know how much time it takes (interpreted mode) to fully
process list xs (at least 1e6 elements) with function g. Is it
sufficient to execute:
*Main last . f $ xs
result
(x.xx secs, yyy bytes)
Are there any hidden difficulties
lutzsteens:
Hi,
I have IntMap String with about 40,000 entries. After saving it to disk
(via Data.Binary) the file is 3.5 Mb small. However if I load it and
save it back again my program needs 180 MB memory. Is there anything I
do wrong or does the map really need that much memory?
jeremy:
Hello,
I would recommend using TagSoup:
http://www-users.cs.york.ac.uk/~ndm/tagsoup/
The tutorial easy, and has good advice:
http://www.cs.york.ac.uk/fp/darcs/tagsoup/tagsoup.htm
There's also a wrapper for this, that uses curl+bytestrings for the
download part, and exposes
newsham:
Anyone interested in critiquing some code? I'm looking for ideas
for making it faster and/or simpler:
http://www.thenewsh.com/%7Enewsham/store/Server5.hs
This is an exercise to see how well a server in Haskell would perform.
My goals are roughly:
- retargetability to
agentzh:
On Thu, Jul 31, 2008 at 1:56 AM, Don Stewart [EMAIL PROTECTED] wrote:
We've had no problems with this and apache at least. Is lighttpd
doing something funny with error logging?
It seems that Apache is doing something funny :) According to my
teammate chaoslawful, apache
agentzh:
Hi,
I'm trying Network.FastCGI + lighttpd 1.4.9 to develop a RESTful
service platform. I've found that stderr (especially those from
Debug.Trace) get lost in the error.log file. But plain CGI mode with
Network.CGI works perfectly (all stderr outputs appear in error.log).
Besides,
A small announcement :)
6 1/2 years after its inception, under the guiding hand of Shae Erisson
(aka shapr), the #haskell IRC channel[1] on freenode has finally reached
500 users!
To chart the growth, we can note that the channel was founded
in late 2001, and had slow growth till 2006, reaching
mad.one:
Hi,
I've just uploaded a package to hackage which is an interface to the
random.org random number generator.
For those who don't know, random.org provides random data through the
use of atmospheric noise rather than a PRNG that would typically be
invoked if you were to use the
aneumann:
Hello,
I think it'd be nice if the compiler could warn me if there are any
exceptions which I'm not catching, similar to checked exceptions in
Java. Does anyone know of a possibility to do that in Haskell?
Adrian
You could provide exception-safe wrappers for the functions
jeanphilippe.bernardy:
I'm very pleased to announce the 0.4.1 release of the Yi editor.
== Yi ==
Yi is a text editor written and extensible in Haskell. The
long-term goal of the Yi project is to provide the editor of
choice for Haskell programmers. In the meantime, we have fun by
hacking
aslatter:
On Sat, Jul 26, 2008 at 9:50 PM, Felipe Lessa [EMAIL PROTECTED] wrote:
6.8.1).
You may get Cabal packages for both on Hackage at:
- http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Hipmunk
-
claus.reinke:
FYI: Haskell's OpenGL binding has just been dropped from GHC's
extralibs, which means that it will no longer be kept in sync with GHC
development, at least not by GHC HQ.
GHC HQ has its hands full and -generally speaking - extralibs are to
be replaced by H(L)P, the Haskell
agl:
2008/7/25 Krzysztof Skrzętnicki [EMAIL PROTECTED]:
Developing a high-performance web server in Concurrent Haskell
http://www.haskell.org/~simonmar/papers/web-server-jfp.pdf (see page 15)
Perhaps you might be interested in this paper also because of its topic.
That's a good
claus.reinke:
But neither do I believe the rumour that OpenGL isn't much
used, and forwarding the removal notice gives those users the
opportunity to speak up now if they prefer no gaps in OpenGL
presence, or forever to hold their peace, as they say.
I for one have noticed this library *is*
A tool originally developed to measure cache misses in GHC :)
Ben.Lippmeier:
http://valgrind.org/info/tools.html
On 26/07/2008, at 11:02 AM, Mitar wrote:
Hi!
If we spend so long blocked on memory reads that we're only utilising
50% of a core's time then there's lots of room for
patperry:
Last month Anatoly Yakovenko published some disturbing numbers about
the Haskell BLAS bindings I wrote being significantly slower than
using plain C. I wanted to let everyone know that I've closed the
performance gap, and now for doing ten million dot products, the
gracjanpolak:
Chaddaï Fouché chaddai.fouche at gmail.com writes:
2008/7/22 Luke Palmer lrpalmer at gmail.com:
A little formal reasoning reveals that sequence1 = sequence2 exactly
when (=) is strict in its left argument. There are four common
monads which are _not_: Identity, Reader,
coreyoconnor:
I have the need to regularly write tiny programs that analyze output
logs. The output logs don't have a consistent formatting so I
typically choose Perl for these tasks.
The latest instance of having to write such a program was simple
enough I figured I'd try my hand at using
coreyoconnor:
I have the need to regularly write tiny programs that analyze output
logs. The output logs don't have a consistent formatting so I
typically choose Perl for these tasks.
The latest instance of having to write such a program was simple
enough I figured I'd try my hand at using
brad.larsen:
And against gawk 3.1.5:
$ time awk -F: '{sum += 1 / $2} END{print sum}' test.out
3155.63
real0m0.197s
user0m0.184s
sys 0m0.004s
compared to Don's Haskell version:
$ time ./fastSum test.out
3155.62664377
real0m0.072s
user0m0.056s
sys
http://www.go-hero.net/jam/lang
Haskell as the highest ranked FP language in the Google Code Jam,
with more submissions than Lisp, Scheme, SML and OCaml put together :)
# C++ (used by 2875 people)
# Java (used by 1747 people)
# Python (used by 691 people)
# C# (used by 609
If you can demonstrate the required laziness/strictness properties
are identical, looks like a nice idea.
gracjanpolak:
Hi all,
On the other day I noticed that we could optimize 'sequence' more.
I needed it for my monadic parser. Below is my small experiment.
Sequence from standard
mmitar:
Hi!
Profiling says that my program spends 18.4 % of time (that is around
three seconds) and 18.3 % of allocations in this function which is
saving the rendered image to a PPM file:
saveImageList :: String - Int - Int - [ViewportDotColor] - IO ()
saveImageList filename width
sk:
On 17.07.2008, at 21:46, Lennart Augustsson wrote:
If scaleFloat and exponent are implemented with bit twiddling they can
be quite fast.
is there a way in ghc to 'cast' between float/int32 and double/int64
(without going through memory)?
Yeah,
fromIntegral/Int-Float
sk:
On 18.07.2008, at 19:47, Don Stewart wrote:
sk:
On 17.07.2008, at 21:46, Lennart Augustsson wrote:
If scaleFloat and exponent are implemented with bit twiddling
they can
be quite fast.
is there a way in ghc to 'cast' between float/int32 and double/int64
(without going through
ben.franksen:
Mitar wrote:
On Fri, Jul 18, 2008 at 3:54 PM, Chaddaï Fouché
[EMAIL PROTECTED] wrote:
So that I can easily change the type everywhere. But it would be much
nicer to write:
data Quaternion a = Q !a !a !a !a deriving (Eq,Show)
Only the performance of Num instance
noahaon:
Hello,
I'm trying to install the curl package 1.3.2.1 for haskell, I'm using Ubuntu
and
I've already installed curl-7.18.2. I can't get rid of the configuration
error.
According to the log entry the curl.h doesn't exist.
Shell output:
runghc Setup.hs configure
Configuring
jefferson.r.heard:
Is there a library out there that will allow me to remote-control the
firefox or mozilla browsers, e.g. change the current page, open a new
tab?
Yeah, use the haskell selenium bindings, on hackage.haskell.org
--- Don
___
sk:
currently i'm working on stuff that looks something like this:
1 read soundfile from disk in blocks of N samples (IOCArray, hsndfile
package)
2 convert to CArray with unsafeFreeze (simple O(1) cast, carray package)
3 perform FFT (CArray, fftw package)
4 convert to UArr (uvector
jules:
Don Stewart wrote:
sk:
currently i'm working on stuff that looks something like this:
1 read soundfile from disk in blocks of N samples (IOCArray, hsndfile
package)
2 convert to CArray with unsafeFreeze (simple O(1) cast, carray package)
3 perform FFT (CArray, fftw package)
4
chris:
The communication with Sphinx is done using a quite low-level binary
protocol, but Data.Binary saved the day: it made it very easy for us
to parse all the binary things. Especially the use of the Get and Put
monads are a big improvement over the manual reading and keeping track
sk:
On 14.07.2008, at 18:42, Jules Bean wrote:
It would be helpful to see the programs people are writing with
uvector,
so I can polish up the API some more :)
It would also be helpful to have someone explain why we have:
Ptr a
ByteString
IOUArray
IOCArray
lists:
Don Stewart wrote:
Yes, we have long been discussing a generic Stream library to which
the various sequence structures can be translated to and from. Already
it is useful to say, stream bytestrings into uvectors and out to lists.
Isn't there already such a thing
bulat.ziganshin:
Hello Roman,
Saturday, July 12, 2008, 7:01:05 PM, you wrote:
the vector library will eventually provide fast, Int-indexed arrays with
a powerful fusion framework.
GREAT! doom4 would be written in Haskell!
Did you know about Cheplyaka's Summer of Code project to build
johan.tibell:
On Sat, Jul 12, 2008 at 12:13 AM, Don Stewart [EMAIL PROTECTED] wrote:
Just a quick note about next week's Galois Tech Talk. Now that Galois
has completed its move into downtown Portland, and a shiny new, centrally
located, office space, we're opening up our tech talk series
Wonderful. Builds out of the box for me.
Available in Arch Linux:
http://aur.archlinux.org/packages.php?ID=18349
alistair:
Changes since 0.8.1 (I put 0.8.2 up on hackage with an error in Setup.hs,
so it's been skipped):
___
Haskell-Cafe mailing
gsan:
On Friday July 11 2008, Andre Nathan wrote:
On Thu, 2008-07-10 at 16:52 -0700, Don Stewart wrote:
Well, they're radically different graph representations, and fgl
hasn't been designed for large graphs.
Do you know if King and Launchbury's implementation (Data.Graph) scales
and formal methods, drop by!
Title: Stream Fusion for Haskell Arrays
Speaker:Don Stewart
Date: Tuesday, July 15th, 10.30am sharp.
Location: Galois, Inc.
421 SW 6th Ave. Suite 300
(3rd floor
jonathanccast:
On Thu, 2008-07-10 at 03:16 -0700, Grzegorz Chrupala wrote:
Hi all,
Is there a less ugly way of avoiding laziness in the code pasted below then
the use of seq in the last line?
The program is supposed to split a large input file into chunks and check in
how many of
eeoam:
Dear all,
I have downloaded cabal and am trying to install it but have gotten the
following error message:
C:\cabal\cabal-install-0.5.1runghc Setup configure
Configuring cabal-install-0.5.1...
Setup: At least the following dependencies are missing
Cabal =1.41.5, HTTP
andrewcoppin:
I could try GHC's new debugger. But my experiences with it so far have
shown that for all but the most trivial programs possible, it becomes
intractably difficult to figure out what the debugger is actually
showing you. I actually tried to debug a normal LZW implementation
andre:
On Thu, 2008-07-10 at 18:32 -0400, Ronald Guida wrote:
Your ratios are about 1 : 3 : 8.
That pretty close to quadratic growth, 1 : 4 : 9, so I think all is well.
Maybe, but 96MB of resident memory for a 1000-node graph looks bad,
especially considering p is low. Is the internal
thomas.dubuisson:
I could try GHC's new debugger. But my experiences with it so far have
shown that for all but the most trivial programs possible, it becomes
intractably difficult to figure out what the debugger is actually
showing you.
At times I think of ghcid as the anti-gdb.
marco-oweber:
Is Haskell still used (in industry as well ?) to write (V)HDL code to
program FPGAs and create circuits on chips?
The Chalmers Lava homepage tells abouta Xilinx version which should be
merged in soon. But on the xilinx homepage there was no reference to
neither Lava nor
lrpalmer:
On Mon, Jul 7, 2008 at 2:21 PM, Michael Feathers
[EMAIL PROTECTED] wrote:
Thanks. Here's a newb question: what does strictness really get me in this
code?
A bit of speed and memory improvements, I suspect. The type
(Double,Double) has three boxes, one for the tuple and one
Just use 'rnf', from the Control.Parallel namespace.
ryani.spam:
This is the classic exception embedded in pure value problem with
lazy languages. There's no need for the a returned by return to
be evaluated.
Even using seq isn't quite good enough:
boom2 = [1 `div` 0]
ghci doTinIO
mfeathers:
I have some code that looks like this and I'm having trouble with it:
zip12 ((tails . nub) flightPaths) wayPoints etopsPackets (hd geoCaches)
groundSpeeds headings (map windShift headings) (regulations !! 2)
(foldr (\|/) (tail pathDistances)) [ghy x | x - [1..], full x]
I win, almost ...
13:13:18 dons dolio: yeah, it was ... almost ... an April 1 style post
:)
And yes, this was truly shocking on a number of levels. However, we have
people doing a lot of weird things with Haskell these days, so its not
as absurd that someone would be hacking up a zip12 for
mfeathers:
segment :: Int - [a] - [[a]]
segment 0 _ = []
segment _ [] = []
segment n x = (take n x) : segment n (drop n x)
The first set of parens can go,
segment n x = take n x : segment n (drop n x)
I did a version of this which used splitAt but I wasn't sure whether it
was
1101 - 1200 of 1711 matches
Mail list logo
