datastructures in Haskell and give some introduction into
amortized O(1) queues and Tries.
So if you are interested to come have a look at
http://www.doodle.com/da9tr6zeynmcq3z6 (german).
Further announcements will be made via Twitter, so you may want to follow
https://twitter.com/hug_hh.
Andreas
Hi there,
I wanted to give the 2.1.0 version a try, so I followed the install
instructions on the website and downloaded one of the available Eclipse
packages (I chose "Eclipse IDE for JavaScript Web Developers"). Installing
EclipseFP then gave me the following error:
> Cannot complete the instal
On 13:04 Sat 01 Jan , Felipe Almeida Lessa wrote:
> But, if you want to have a strang Ord instance, then why not have a
> strange unsafeTypeRepKey :: TypeRep -> Int?
Yes, that would be nice. But only if this really helps the compiler with
optimising the code. Otherwise one could easily use uns
Thinking about this there might be one problem:
Without having looked further into this I think perfomance might not
be as expected. Using unsafePerformIO affects ghc's optimzations,
doesn't it?
So I wonder if it's a good idea (from a performance point of view) to
use this.
>
On 01:08 Sun 05 Dec , Serguey Zefirov wrote:
> Why TypeRep does have equality and doesn't have ordering?
>
> It would be good to have that.
I think the problem is, that it's hard to give an ordering that stays the
same for all runs of your program. If you don't need this property you could
us
