tom.davie:
>
> On 19 Apr 2009, at 11:10, Duncan Coutts wrote:
>
>> On Sun, 2009-04-19 at 10:02 +0200, Thomas Davie wrote:
>>
> It really rather makes "cabal install" rather odd – because it
> doesn't actually install anything you can use without providing
> extra
> options!
>
dbueno:
> Hi all,
>
> In a command-line app of mine I want to have a --version flag, like
> many GNU apps do to report their version. The only way I know to
> provide the version number is to hardcode it in the source code
> somewhere. That means I have the version number in two places: the
> .c
The Haskell Cafe isn't the right forum for this.
Please file a bug report here:
http://hackage.haskell.org/trac/ghc/newticket?type=bug
-- Don
manlio_perillo:
> Hi.
>
> In a program I have experienced a segmentation fault;
> not only that but also:
>
> * tpp.c:63: __pthread_tpp_change_priorit
barsoap:
> Peter Verswyvelen wrote:
>
> > Is it possible to use all CPU cores when compiling with GHC and/or
> > Cabal?
> >
> Nope. Last thing I heard is that file-parallel compilation is low
> priority as not much would be gained anyway due to excessive
> cross-package stuff that's done and muc
GCC is generating very different code on 32 bit and 64 bit.
fft1976:
> Not that this is a very good benchmark, but I compiled the nearly
> equivalent C and Haskell (1st, recursive version) programs from this
> blog post:
>
> http://donsbot.wordpress.com/2008/06/04/haskell-as-fast-as-c-working-at-
jason.dusek:
> In the paper "Stream Fusion: From Streams To Lists To Nothing
> At All", we find:
>
> For large multi-module programs, the results are less clear,
> with just as many programs speeding up as slowing down. We
> find that for larger programs, GHC has a tendency to miss
It is a bit odd. I'd suggest improvements (particularly implementing
"carding" strategies) should be uploaded to hackage.
-- Don
bugfact:
> These functions have their arguments reversed when compare to e.g. Map
>
> For example
>
> Data.HashTable.lookup :: HashTable key val -> key -> IO (Maybe
-fno-state-hack?
xofon:
>
> Hello all,
>
> I have a haskell program that runs an order of magnitude slower
> when compiled with optimisations turned on. This happens on 6.8.2
> as well as 6.10.1:
>
>
> p...@r4at184:/tmp[1]% ghc --make -fforce-recomp -o out buga.hs
> [1 of 1] Comp
johan.tibell:
> Hi,
>
> I just uploaded network-2.2.1. It appears on Hackage [1] but a `cabal
> update` followed by `cabal install network-2.2.1` results in:
>
> Resolving dependencies...
> cabal: There is no available version of network that satisfies ==2.2.1
>
> The upload took a very long tim
cristiano.paris:
> On Sat, Apr 4, 2009 at 10:21 PM, Bulat Ziganshin
> wrote:
> > Hello Cristiano,
> > ...
> > there was a large thread a few months ago and many peoples voted for
> > excluding any OS-specific packages at all since this decreases
> > portability of code developed by Hoogle users :)
malcolm.wallace:
>
> On 30 Mar 2009, at 20:16, Andrew Coppin wrote:
>>> Lennart, what is the next language DSL you are going to build?
>>> Prolog? XSLT?
>>
>> Declarative 3D scene construction? ;-)
>
> The ICFP programming contest in year 2000 was to write a ray tracer for a
> given declarative 3D
Yes. It would be fairly easy to check this in the docs, too :)
bugfact:
> Okay, thanks. So the rumors about this must be incorrect?
>
> On Wed, Apr 1, 2009 at 9:57 PM, Ketil Malde wrote:
>
> Don Stewart writes:
>
> >> Rumor goes that this is very difficul
Did you use hubigraph?
http://ooxo.org/hubigraph/
This cabalized project doesn't appear to be on hackage!
gleb.alexeev:
> Don Stewart wrote:
>> I am pleased to announce the release of vacuum-cairo, a Haskell library
>> for interactive rendering and display of values o
Please upload!!
moonpatio:
> Holy crap! That looks amazing. I think you should most definitely upload it.
>
> 2009/4/1 Gleb Alexeyev
>
> Don Stewart wrote:
>
> I am pleased to announce the release of vacuum-cairo, a Haskell
> library
> fo
bugfact:
> Rumor goes that this is very difficult to do with Darcs. Is this correct?
darcs unpull
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Is there a Mac OSX packaging team?
sebf:
>
> On Mar 31, 2009, at 7:40 AM, Don Stewart wrote:
>
>> I am pleased to announce the release of vacuum-cairo, a Haskell
>> library
>> for interactive rendering and display of values on the GHC heap using
>> Matt Morrow
I am pleased to announce the release of vacuum-cairo, a Haskell library
for interactive rendering and display of values on the GHC heap using
Matt Morrow's vacuum library.
This library takes vacuum's output, generates dot graph format from it,
renders it to SVG with graphviz, and displays the res
xmonad's state is represented as a zipper on nested lists.
The wikipedia article on zippers lists this and other examples.
gue.schmidt:
> Hi,
>
> my quest for data structures continues. Lately I came across "Zippers".
>
> Can anybody point be to some useful examples?
>
> Günther
>
> _
such a transformation?
>
> -- Lennart
>
> On Mon, Mar 30, 2009 at 3:28 AM, Don Stewart wrote:
> > Nested constructed product returns? Or constructed sums?
> >
> > lennart:
> >> Well, yes and no. GHC actually does a decent job when given very
> >>
Can I close this ticket as not being to do with uvector?
-- Don
manlio_perillo:
> Claus Reinke ha scritto:
>>> But Claus was right, appendU is lazy; this seems to be the cause of
>>> the problem.
>>
>> appendU is strict, insertWith just doesn't force it (follow the source link
>> in the haddock
Nested constructed product returns? Or constructed sums?
lennart:
> Well, yes and no. GHC actually does a decent job when given very
> imperative code with references and mutable arrays.
> Now the type I use to wrap the references to get type safe l-values
> and r-values makes it tricker, and ghc
manlio_perillo:
> Don Stewart ha scritto:
>> [...]
>>> So the question is: why appending an array of only one element to an
>>> existing array causes memory problems?
>>
>>
>> It must copy the entire array.
>>
>
> Isn't it the same
manlio_perillo:
> Hi.
>
> As with a previous post, I think I have found a possible memory problem
> with the uvector package.
>
> I have this data structure (for, again, my Netflix Prize project):
>
> IntMap (UArr (Word16 :*: Word8))
>
> I was adding elements to the map using something like:
A small milestone in the packaging business:
http://archhaskell.wordpress.com/2009/03/27/arch-haskell-news-mar-14-2009-1000-haskell-packages/
More than 1000 Haskell packages packaged up for Arch Linux.
Hackage now has 1163 (+41) Haskell packages, of which 1007 (+33) have
been natively packaged f
bwsanders:
> Hello,
>
> I just uploaded fallingblocks to Hackage. It is another Tetris clone, but it
> uses SDL, and I thought there could be more SDL examples.
>
> Any and all comments and suggestions will be extremely appreciated!
>
> There is a darcs repo at
> http://patch-tag.com/publicrep
manlio_perillo:
> Bulat Ziganshin ha scritto:
>> Hello Manlio,
>>
>> Thursday, March 26, 2009, 6:39:12 PM, you wrote:
>>
>>> The test consists in adding 1000 elements to an empty map.
>>
>> +RTS -c -F1.1
>>
>> then read about garbage collection
>>
>>
>
> It now requires 386 MB of memory, but is
bauertim:
> I have a program that is currently blowing out the stack,
>Stack space overflow: current size 8388608 bytes.
>Use `+RTS -Ksize' to increase it.
> I am pretty sure I get to the end of the computation that
> increments various statistic counters (lazily?) and only
> when I go to p
claus.reinke:
> Perhaps the "make a video" slogan doesn't quite explain what is
> intended - it didn't to me!-) Reading John Udell's short article
>
> What is Screencasting?
> http://www.oreillynet.com/pub/a/oreilly/digitalmedia/2005/11/16/what-is-screencasting.html?page=1
>
> gave me a better idea
barsoap:
> "Brettschneider, Matthias" wrote:
>
> > Thx for your hints, I played around with them and the performance
> > gets slightly better. But the major boost is still missing :)
> >
> > I noticed, that one real bottleneck seems to be the conversion of the
> > array back into a list. The in
We need a redirect...
rmm-haskell:
> I thought that HAppS has gone, replaced by happstack?
>
> http://happstack.com/
>
> -Ross
>
> On Mar 24, 2009, at 11:32 AM, Vimal wrote:
>
>> Hi,
>>
>> http://happs.org/ has some Javascript visible as plain text. It looks
>> like some tags are missing in the pa
Hey guys,
I've been making quick youtube videos of projects to convey what they
do. Here, for example, using Tim Docker's Charts library in ghci:
http://www.youtube.com/watch?v=2Lqzygxvus0
(Click on the HD button for higher res).
Or one of Neil Brown's "SG" OpenGL graphics library,
htt
For the first time, we've got download and popularity statistics from
Hackage:
http://www.galois.com/blog/2009/03/23/one-million-haskell-downloads/
Find out if your package made the top 100, and when we reach our 1
millionth hackage download!
-- Don
_
sfvisser:
> Hello,
>
> Currently I'm trying to upload a minor update of Salvia to Hackage to
> fix some dependency issues but Hackage times out all the time? Both the
> CLI tool and the web-interface do not react to my upload request.
>
> Any known problems here?
Discussion taking place on libr
bulat.ziganshin:
> Hello Don,
>
> Saturday, March 21, 2009, 12:06:48 AM, you wrote:
>
> >> i distribute my gtk2hs program for windows and linux. no problems, i
> >> just included runtime libraries provided by gtk2hs team. it was with
> >> gtk2hs 0.9.12.1 though, may be they don't provided updated
bulat.ziganshin:
> Hello Jeff,
>
> Friday, March 20, 2009, 10:22:35 PM, you wrote:
>
> > As this continues to build, I guess the issue for me, and I'm willing
> > to help with it, is trying to figure out how to redistribute programs
> > written with gtk2hs. on Windows, people can just install th
dons:
> Good to hear you're shipping graphical Haskell apps, Jefferson. Well done.
>
> We do have tools for packaging for various distros:
>
> * Mac OSX:
> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mkbndl
>
> * Windows
> http://hackage.haskell.org/cgi-bin/hackage
ll.org/haskellwiki/Gtk2hs#Using_the_GTK.2B_OS_X_Framework
> >>>
> >>> -Ross
> >>>
> >>> On Mar 20, 2009, at 2:10 PM, Jeff Heard wrote:
> >>>
> >>>> cabal-install works for me. The one thing that would be REALLY R
martijn:
> Don Stewart wrote:
>> Yes, anything that is relevant to the development experience on this
>> platform. Remember: it is more than just getting ghc. How do they get
>> hold of new libraries and apps? Is cabal-install available?
>
> Since GHC is written in H
tom.davie:
>
> On 20 Mar 2009, at 18:46, Don Stewart wrote:
>
>> tom.davie:
>>>
>>> On 20 Mar 2009, at 18:08, Don Stewart wrote:
>>>
>>>> tom.davie:
>>>>>
>>>>> Other than chose the graphics card carefully, an i
tom.davie:
>
> On 20 Mar 2009, at 18:08, Don Stewart wrote:
>
>> tom.davie:
>>>
>>> Other than chose the graphics card carefully, an iMac will do you
>>> very well.
>>>
>>> Hope that helps.
>>
>> This is very useful.
>
tom.davie:
>
> Other than chose the graphics card carefully, an iMac will do you very well.
>
> Hope that helps.
This is very useful.
Could the Mac users add information (and screenshots?) to the OSX wiki
page,
http://haskell.org/haskellwiki/OSX
It would be great to have a video of this in action up on youtube.
You can simply 'recordmydesktop' on linux (and likely elsewhere), then
upload the result.
It also helps the general adoption cause, having Haskell more visible
and accessible.
claus.reinke:
>>> The problem occurs when the result v
Brettschneider:
> Hey There,
>
> I am trying to write a hash-algorithm that in fact is working, but as you
> might have guessed the problem is the performance :) At the moment I am 40
> times worse than the same implementation in C.
>
> My problem is, I need mutable arrays which are the heart
bugfact:
> The GHC documentation lists a lot of tweaks that can be done to the garbage
> collector.
>
> However, Haskell spin-offs like Timber implement their own incremental garbage
> collector that is better suitable for real-time usage.
>
> Did someone already fiddle with GHC's gc flags so it
Hey all,
I noticed we didn't have an easy page to find out how to get hold of
the Haskell toolchain for various systems. So there's now a link from
haskell.org to (existing) pages on how to obtain Haskell on windows, mac
osx and linux and bsd.
If you're a distro maintainer for these systems, plea
manlio_perillo:
> Don Stewart ha scritto:
>> I've just finished a post (and quick tool) for graphing the complete
>> module namespace of Haskell, taken from the core libraries and all of
>> Hackage.
>>
>> It's quite large:
>>
>> http://d
My secret hope is that Jeff will take the .dot files and doing
something very cool with them
jefferson.r.heard:
> Very impressive looking, Don.
>
> -- Jeff
>
> On Mon, Mar 16, 2009 at 11:14 AM, Don Stewart wrote:
> > Oh, barely any time (maybe 30-60 seconds). It'
Oh, barely any time (maybe 30-60 seconds). It's "just" a 10k node graph with a
50k edges. :)
vanenkj:
> How long did the haskell universe graphs take to render?
>
> On Mon, Mar 16, 2009 at 11:05 AM, Don Stewart wrote:
>
> I've just finished a pos
I've just finished a post (and quick tool) for graphing the complete
module namespace of Haskell, taken from the core libraries and all of
Hackage.
It's quite large:
http://donsbot.wordpress.com/2009/03/16/visualising-the-haskell-universe/
___
Hask
fft1976:
> I noticed that on Programming Reddit, where I lurk, there is a big
> discussion about the disconnect between how much Haskell is advocated
> there and the number of applications written in it.
>
> http://www.reddit.com/r/programming/comments/84sqt/dear_reddit_i_am_seeing_12_articles_in/
Fixed on hackage.
$ cabal update
$ cabal install plugins-1.4.1
Or via the web:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/plugins-1.4.1
-- Don
yuri.kashnikoff:
> Thanks. Problem solved now!
>
> On Sun, Mar 15, 2009 at 7:20 PM, Duncan Coutts
> wrote:
> > On Sun, 2
It depends on if you need 'eval' or object loading capability.
For true plugins, hs-plugins is still the only binding to the GHC rts
object loader, for eval-like mechanisms, we've a number of bindings to
the ghc-api bytecode interpreter, such as hint.
That said, hs-plugins is kinda sorta patches-
wren:
> There also a number of "idioms" which are similar in scope to the idioms
> that arise in other languages: using tail recursion, accumulators,
> continuation-passing transformations, closures over recursion[6],
> Schwartzian transforms, etc.
> [6] For lack of a better name. I mean doi
Also, consider stealing the regex susbt code from:
http://shootout.alioth.debian.org/u64q/benchmark.php?test=regexdna&lang=ghc&id=4
tphyahoo:
> So, I tweaked Text.Regex to have the behavior I need.
>
> http://patch-tag.com/repo/haskell-learning/browse/regexStuff/pcreReplace.hs
>
> FWIW, th
http://archhaskell.wordpress.com/2009/03/14/arch-haskell-news-mar-14-2009/
A regular update of Haskell in Arch Linux
Arch now has 974 Haskell packages in AUR. That’s 12 new packages this
week, and lots of updates as well.
See the blog for the full list of updates.
-- Don
___
grzegorz.chrupala:
>
> Hi all,
> Is there a serialization library other than the Data.Binary from hackage?
>
> I am using Data.Binary in a couple of projects, but I have found its stack
> and memory usage very hard to control. Its very common that decoding a map
> or list of non-trivial size uses
llows the productions to still work.
>
> Either way, I'm in the process of writing a Binary instance, so maybe
> we can get the best of both worlds eventually.
>
> Thanks,
> Dan
>
> On Fri, Mar 13, 2009 at 7:21 PM, Don Stewart wrote:
> > manlio_perillo:
>
manlio_perillo:
> Don Stewart ha scritto:
>> [...]
>>>
>>> So, the patch is: "just revert this change".
>>
>> Or... use your own UIO instance. That's why it's a type class!
>>
>
> Why should I rewrite the UIO instance, if one
manlio_perillo:
> Daniel Fischer ha scritto:
>> [...]
>> Worked with uvector-0.1.0.1:
>>
>> [...]
>> But not with uvector-0.2
> > [...]
>
> The main difference is that in uvector 0.2, hPutBU does not write in the
> file the length of the array; hGetBU simply use the file size.
>
>let elemSiz
>> As far as I know, the reason for this is that the UIO instance for
>> productions writes the two "rows" out sequentially to file, but
>> doesn't include any means to determine the length of the two halves
>> when it's loading up again. When you try to read the production back
>> in, it tries to
UIO's also only a truly alpha idea as a proxy for bytestring/Binary
support.
Patches welcome.
pumpkingod:
> As far as I know, the reason for this is that the UIO instance for
> productions writes the two "rows" out sequentially to file, but
> doesn't include any means to determine the length of t
tphyahoo:
> Is there something like subRegex... something like =~ s/.../.../ in
> perl... for haskell pcre Regexen?
>
> I mean, subRegex from Text.Regex of course:
> http://hackage.haskell.org/cgi-bin/hackage-scripts/package/regex-compat
>
> Thanks for any advice,
Basically, we should have it.
_
manlio_perillo:
> Bryan O'Sullivan ha scritto:
>> [...]
>> text is not mature, and is based on the same modern fusion framework as
>> uvector and vector. It uses unpinned arrays, but provides functions for
>> dealing with foreign code.
>
> What is the reason why you have decided to use unpinned
manlio_perillo:
> Don Stewart ha scritto:
>> bulat.ziganshin:
>>> Hello Don,
>>>
>>> Wednesday, March 11, 2009, 12:12:07 AM, you wrote:
>>>
>>>> Right, so my point stands: there's no difference now. If you can write a
>>>>
karel.gardas:
> Don Stewart wrote:
> > marlowsd:
> >> Ben Lippmeier wrote:
> >>
> >>> On 12/03/2009, at 12:24 AM, Satnam Singh wrote:
> >>>> Before making the release I thought it would be an idea to ask people
> >>>> what othe
Send it to the maintainer...
Explain what the patch is for, and why it should be applied.
dbueno:
> On Wed, Mar 11, 2009 at 20:54, Denis Bueno wrote:
> > I've got a small patch for Data.Binary. Should I post it here, or is
> > there some more appropriate forum?
>
> In case whoever reads this is
marlowsd:
> Ben Lippmeier wrote:
>
>>
>> On 12/03/2009, at 12:24 AM, Satnam Singh wrote:
>>> Before making the release I thought it would be an idea to ask people
>>> what other features people would find useful or performance tuning.
>>> So if you have any suggestions please do let us know!
>>>
manlio_perillo:
> Don Stewart ha scritto:
>> manlio_perillo:
>>> Don Stewart ha scritto:
>>>> [...]
>>>> {-# LANGUAGE OverloadedStrings #-}
>>>>
>>>> import qualified Data.ByteString.Char8 as C
>>>>
>>>
mark.spezzano:
> Hi,
>
> Just wondering if Generics and Parametric polymorphism are one and the same in
> Haskell.
>
> I read (somewhere!) an article stating that generics might be included in
> Haskell Prime but I thought that they’re already included as parametric
> polymorphism.
>
> Did I mis
manlio_perillo:
> Don Stewart ha scritto:
>> [...]
>> {-# LANGUAGE OverloadedStrings #-}
>>
>> import qualified Data.ByteString.Char8 as C
>>
>> isMatch :: C.ByteString -> Bool
>> isMatch "match" = True
>> isMatc
manlio_perillo:
> Don Stewart ha scritto:
>> manlio_perillo:
>>> Hi.
>>>
>>> Using normal String type I can define a pattern like:
>>>
>>>> let foo "baz" = 777
>>>> foo "baz"
>>> 777
>>&
manlio_perillo:
> Hi.
>
> Using normal String type I can define a pattern like:
>
> > let foo "baz" = 777
> > foo "baz"
> 777
>
>
> But if I want to use ByteString, what should I do?
> This seems impossible, since ByteString data constructor is not available.
-XOverloadedStrings
e.g.
{-# LAN
bulat.ziganshin:
> Hello Don,
>
> Wednesday, March 11, 2009, 12:48:35 AM, you wrote:
>
> >> unfortunately, Array library unboxed arrays still aren't based on any
> >> Unboxable *class*
>
> > Hmm. Aren't all the array library types based on MArray and IArray?
>
> > So I can define my own say, ne
bulat.ziganshin:
> Hello Don,
>
> Wednesday, March 11, 2009, 12:12:07 AM, you wrote:
>
> > Right, so my point stands: there's no difference now. If you can write a
> > Storable instance, you can write a UA et al instance.
>
> yes, if there is some class provided for this and not just hard-coded
xj2106:
> Don Stewart writes:
>
> > And what is Storable limited to?
> >
> > Ultimately they're all limited to the primops for reading and writing,
> > and to what types we can encode in those. So:
> >
> > primop ReadOffAddrOp_Char "readCha
bulat.ziganshin:
> Hello Don,
>
> Tuesday, March 10, 2009, 11:01:31 PM, you wrote:
>
> >> if uavector use ghc's built-in unboxed array operations (as
> >> Data.Array.Unboxed does) then it's necessarily bounded to types
> >> supported by those operations
>
> > And what is Storable limited to?
>
I thought this was our unofficial mascot:
http://www.haskell.org/sitewiki/images/8/85/NarleyYeeaaahh.jpg
Available in plush form:
http://www.amazon.com/Narwhal-Plush-Stuffed-Animal-Toy/dp/B0011DFUGE/ref=sr_1_3?ie=UTF8&s=toys-and-games&qid=1236716339&sr=1-3
YEEHH!
mads_lindstroem:
bulat.ziganshin:
> Hello Don,
>
> Tuesday, March 10, 2009, 10:40:30 PM, you wrote:
>
> >> I think uvector only works with certain types that can be
> >> unboxed, while storablevector works with all types that
> >> instantiate Foreign.Storable.Storable. I don't know about
> >> vector. From the d
xj2106:
> Alexander Dunlap writes:
>
> > - uvector, storablevector and vector are all designed for dealing with
> > arrays. They *can* be used for characters/word8s but are not
> > specialized for that purpose, do not deal with Unicode at all, and are
> > probably worse at it. They are better for
> If it is a hurdle for me, I can imagine a lot of people are getting frustrated
> at trying to distribute their binaries on Linux.
Yes. This is not a new observation :)
-- Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.or
Who needs to build futures into the language -- all you need is MVars, eh?
-- Don
vanenkj:
> I'd also like to point out that Chris did this with 165 lines of
> code--including comments and whitespace! If you drop the whitespace and
> comments, it's only 91 lines!
>
__
colin:
> Is there a function that yields the minimum value of Int on an implementation?
Prelude> minBound :: Int
-9223372036854775808
Prelude> maxBound :: Int
9223372036854775807
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
htt
lists:
> Hi folks,
>
> I've got an application to release. I'm releasing the source, but I also
> wanted
> to release binary versions for people that don't have GHC. I developed on
> Windows, so making a Windows executable was simple. I also have access to an
> Ubuntu Linux box, on which I can ea
claus.reinke:
>> I'm trying to catch up with all the wonderful Haskell Types, classes,
>> Abstract Data Types, Algebraic Data Types, Types that give peoples
>> headaches and all the other, deeper stuff I have been happily putting
>> off.
>
> Hmm, do we need more pragmas?-)
>
> {-# LANGUAGE Typ
New Haskell packages for the week ending Mar 8.
http://archhaskell.wordpress.com/2009/03/08/arch-haskell-news-mar-8-2009/
Arch now has 962 Haskell packages in AUR. That’s 17 new packages this week, and
lots of updates as well.
Notable releases this week
* htar-0.3: Command-line tar archive
duncan.coutts:
> On Sat, 2009-03-07 at 17:30 +, Colin Paul Adams wrote:
> > > "Svein" == Svein Ove Aas writes:
> >
> > >> Preprocessing library game-tree-1.0.0.0... Building
> > >> game-tree-1.0.0.0...
> > >>
> > >> Data/Tree/Game/Negascout.hs:31:0: Unrecognised pragma [
bos:
> On Sat, Mar 7, 2009 at 10:23 PM, Alexander Dunlap
> wrote:
>
> Hi all,
>
> For a while now, we have had Data.ByteString[.Lazy][.Char8] for our
> fast strings. Now we also have Data.Text, which does the same for
> Unicode. These seem to be the standard for dealing with list
gue.schmidt:
> Hi,
>
> is the above mentioned book still *the* authority on the subject?
>
> I bought the book, read about 10 pages and then put it back on the
> shelf. Um.
> In my app I have to deal with 4 csv files, each between 5 - 10 mb, and
> some static data.
>
> I had put all that data
you might want something that avoids flattening it to a list first
-- Don
frigginfriggins:
> can you link to a good example of writing your own because I couldn't find
> one.
>
> On Sat, Mar 7, 2009 at 8:57 PM, Don Stewart wrote:
>
> Increase the stack size, or use
Increase the stack size, or use a different serialiser (they're only a
half dozen lines to write), or different data structure?
-- Don
frigginfriggins:
> I'm playing around with Netflix, implementing a simple KNN-algorithm, I will
> later try SVD which seems to be the most successful approach.
>
colin:
> I have just attempted Cabal-izing my program (splitting it into a
> library and main program as well), and I'm mystified by some problems
> I am having.
>
> First, when I try to build the library I get:
>
> [co...@susannah game-tree]$ runhaskell Setup build
> Preprocessing library game-t
bos:
> On Thu, Mar 5, 2009 at 10:43 AM, FFT wrote:
>
>
> > Are MPI bindings still the best way of using Haskell on Beowulf
> > clusters? It's my feeling that the bindings stagnated, or are they
> > just very mature?
>
>
> MPI itself hasn't changed in 14 years, so it's not exactly a
fft1976:
> On Wed, Mar 4, 2009 at 5:03 PM, FFT wrote:
> > Are MPI bindings still the best way of using Haskell on Beowulf
> > clusters? It's my feeling that the bindings stagnated, or are they
> > just very mature?
>
> What's the story with distributed memory multiprocessing? Are Haskell
> progra
eelco:
> Hi there!
>
> It's been quiet for a while around the 'new logo' competition, but here
> is how it is going to work:
>
> The list with options can be found here (for now):
> http://community.haskell.org/~eelco/poll.html Notice that some (very)
> similar logos are grouped as one option (
manlio_perillo:
> Hi.
>
> I'm still having problems with the uvector package.
>
>
> I have an IntMap (UArr xxx) data type, and I want to serialize it to
> disk, in binary format.
>
> I'm using the uvector package from
> http://patch-tag.com/repo/pumpkin-uvector/home
>
>
> The problem is with mi
Avoid unpack!
ndmitchell:
> Hi Gwern,
>
> I get String/Data.Binary issues too. My suggestion would be to change
> your strings to ByteString's, serisalise, and then do the reverse
> conversion when reading. Interestingly, a String and a ByteString have
> identical Data.Binary reps, but in my expe
fft1976:
> Is there a way to do binary serialization of Haskell values (in GHC,
> at least)? If you propose a method, what are its type safety and
> portability properties?
There are many ways. See Data.Binary (fast, portable). Most are type
safe, or additional safety can be added.
___
jwlato:
> On Tue, Mar 3, 2009 at 1:03 AM, Henning Thielemann
> wrote:
> >
> > On Mon, 2 Mar 2009, John Lato wrote:
> >
> > While I think that the Iteratee pattern has benefits, I suspect that it
> > can't be combined with regular lazy functions, e.g. of type [a] -> [a]. Say
> > I have a chain of f
manlio_perillo:
> Hi.
>
> After some work I have managed to implement two simple programs that
> parse the Netflix Prize data set.
>
> For details about the Netflix Prize, there was a post by Kenneth Hoste
> some time ago.
>
> I have cabalized the program, and made available here:
> http://hask
andrewcoppin:
> Svein Ove Aas wrote:
>> For what it's worth, I tried it myself on 6.10.. details follow, but
>> overall impression is that while you lose some time to overhead, it's
>> still 50% faster than unthreaded.
On a quad core, ghc 6.10 snapshot from today:
Single threaded
whirlpool$
601 - 700 of 1785 matches
Mail list logo
