Daniel Fischer daniel.is.fischer at web.de writes:
Am Donnerstag 07 Januar 2010 11:43:44 schrieb Heinrich Apfelmus:
Will Ness wrote:
Heinrich Apfelmus writes:
The below code is now a well-behaved memory citizen (3MB for the 100
millionth prime, about the same as the PQ code). It
Dear David,
Thank you for your comments. I understand your suggestion that a program
should contain some synchronization points where the values are
evaluated. But this is not easy. Maybe I should just practice more.
I while ago I played with the strict and lazy ST monads and was able to
achieve
On Fri, Jan 08, 2010 at 09:10:38PM -0800, John Millikin wrote:
Also, you may want to have CappedList an instance of
Control.Functor.Bifunctor from category-extras:
[...]
This is probably a good idea, but, I am nervous about making such a
small package depend on the huge category-extras
Am Samstag 09 Januar 2010 08:04:20 schrieb Will Ness:
Daniel Fischer daniel.is.fischer at web.de writes:
Am Freitag 08 Januar 2010 19:45:47 schrieb Will Ness:
Daniel Fischer daniel.is.fischer at web.de writes:
It's not tail-recursive, the recursive call is inside a celebrate.
It is
Am Freitag 08 Januar 2010 18:37:21 schrieb Will Ness:
Daniel Fischer daniel.is.fischer at web.de writes:
Am Donnerstag 07 Januar 2010 11:43:44 schrieb Heinrich Apfelmus:
Will Ness wrote:
Hm? In my world view, there is only reduction to normal form and I
don't see how allocate its
Daniel Fischer daniel.is.fischer at web.de writes:
Am Samstag 09 Januar 2010 08:04:20 schrieb Will Ness:
Daniel Fischer daniel.is.fischer at web.de writes:
Am Freitag 08 Januar 2010 19:45:47 schrieb Will Ness:
Daniel Fischer daniel.is.fischer at web.de writes:
It's not
On Fri, Jan 8, 2010 at 6:38 PM, John Millikin jmilli...@gmail.com wrote:
Earlier today I uploaded the capped-list package; I didn't think there
would be any interest, since it's a relatively trivial data structure,
but already there's been three emails and an IRC convo about it.
In short,
Peter Green wrote:
Heinrich, thanks for some great help and food for thought!
My pleasure. :)
Thanks for describing the background of this problem in detail! I was
mainly asking because I'm always looking for interesting Haskell topics
that can be turned into a tutorial of sorts, and this
Excerpts from John Millikin's message of Sat Jan 09 00:38:15 +0100 2010:
Earlier today I uploaded the capped-list package; I didn't think there
would be any interest, since it's a relatively trivial data structure,
but already there's been three emails and an IRC convo about it.
In short,
Dear Haskellers,
Since 2008, the Darcs Team has made a big push to find hacking time.
We've been streamlining our patch approval processes, running Google
Summer of Code projects and holding bi-annual hacking sprints. These
efforts are starting to pay off, but we're not quite there yet and we
How does HackageDB generate the documentation for uploaded packages?
Specifically, if I am using my own build system rather than Cabal, then what do
I need to do (e.g., what interface do I need to supply) for HackageDB to
correctly generate the documentation? I've glanced through the source
On Sat, Jan 09, 2010 at 01:44:03PM -0800, Gregory Crosswhite wrote:
How does HackageDB generate the documentation for uploaded packages?
Specifically, if I am using my own build system rather than Cabal, then what
do I need to do (e.g., what interface do I need to supply) for HackageDB to
Thomas DuBuisson wrote:
- Michael Snoyman mich...@snoyman.com:
- Ivan Miljenovic ivan.miljeno...@gmail.com:
- Michael Snoyman mich...@snoyman.com:
Some of us prefer not to look at that kind of material. I'd appreciate
if, in the future, you could either refrain from sending such
Tom Tobin wrote:
- Heinrich Apfelmus apfel...@quantentunnel.de wrote:
Since the name Ring is already taken by an ubiquitous mathematical
structure, and thus already in hackage for example as Algebra.Ring in
the numeric-prelude , I suggest to call the data structure Necklace
instead.
On Sat, Jan 9, 2010 at 5:35 PM, wren ng thornton w...@freegeek.org wrote:
Even if folks don't mind the NSFW, some of us work to combat the sexist
culture that pervades computer science and prevents women from embracing
a love of mathematics and programming.
::sigh:: As much as I didn't care
I believe GMail put the original message in my SPAM folder.
Which is just as well. Let me re-affirm the collective
rejection of this post. Very no!
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Can somebody explain this?
getDirectoryContents inD
[..,#sanity.txt#,.,sanity.txt,etc.txt,patchTagDir.txt,jail.txt,notjail.txt,alldata.txt,allobjs.txt,namesNSizes.txt]
filterM doesFileExist = getDirectoryContents inD
[sanity.txt]
___
Haskell-Cafe
On Jan 10, 2010, at 00:24 , Thomas Hartman wrote:
Can somebody explain this?
getDirectoryContents inD
[..,#sanity
.txt
#,.,sanity
.txt
,etc
.txt
,patchTagDir
.txt
,jail
.txt,notjail.txt,alldata.txt,allobjs.txt,namesNSizes.txt]
filterM doesFileExist = getDirectoryContents inD
Thanks, that was it.
Dud question.
2010/1/9 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
On Jan 10, 2010, at 00:24 , Thomas Hartman wrote:
Can somebody explain this?
getDirectoryContents inD
[..,#sanity
.txt
#,.,sanity
.txt
,etc
.txt
,patchTagDir
.txt
,jail
19 matches
Mail list logo
