On 22 March 2011 15:49, Jason Dagit wrote:
>> This seems to consistently give about a 0.4s improvement, which isn't
>> nothing but isn't a particularly interesting chunck of 8s (actually
>> it's 8.4s -> 8s). Setting it to 256M doesn't make any difference.
>
> You should use criterion to make sure
On 22 March 2011 02:00, Jesper Louis Andersen
wrote:
> On Tue, Mar 22, 2011 at 00:59, David MacIver wrote:
>
>> It's for rank aggregation - taking a bunch of partial rankings of some
>> items from users and turning them into an overall ranking (aka "That
>>
Hi,
I have a Haskell program I'm trying to optimise, and could use some assistance.
It's for rank aggregation - taking a bunch of partial rankings of some
items from users and turning them into an overall ranking (aka "That
thing that Hammer Principle does").
The code is here: https://github.com
On Wed, Nov 12, 2008 at 11:05 PM, Jonathan Cast
<[EMAIL PROTECTED]> wrote:
> On Wed, 2008-11-12 at 23:02 +0000, David MacIver wrote:
>> On Wed, Nov 12, 2008 at 10:46 PM, Don Stewart <[EMAIL PROTECTED]> wrote:
>> > david.maciver:
>> >> On Wed, N
On Wed, Nov 12, 2008 at 10:46 PM, Don Stewart <[EMAIL PROTECTED]> wrote:
> david.maciver:
>> On Wed, Nov 12, 2008 at 8:35 PM, Lennart Augustsson
>> <[EMAIL PROTECTED]> wrote:
>> > Actually, unsafeInterleaveIO is perfectly fine from a RT point of view.
>>
>> Really? It seems easy to create things wi
On Wed, Nov 12, 2008 at 8:35 PM, Lennart Augustsson
<[EMAIL PROTECTED]> wrote:
> Actually, unsafeInterleaveIO is perfectly fine from a RT point of view.
Really? It seems easy to create things with it which when passed to
ostensibly pure functions yield different results depending on their
evaluati
On Sat, Jun 7, 2008 at 10:26 AM, Slavomir Kaslev
<[EMAIL PROTECTED]> wrote:
> Hello,
>
> I was just brushing my haskell-fu skills writing a solution for Google
> Treasure Hunt Problem 4. Hers is what it looks like:
>
>> primes = sieve [2..]
>> where
>> sieve (p:xs) = p : sieve [x | x <- x
On Sat, May 31, 2008 at 4:09 PM, Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
> David MacIver wrote:
>
>> The Hashable stuff in there looks like it might be independently
>> useful.
>
> Probably, yes.
>
>> Any interest in splitting it out into an indepe
On Fri, May 30, 2008 at 11:30 PM, Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
> I'm pleased to announce the availability of a fast Bloom filter library
> for Haskell. A Bloom filter is a probabilistic data structure that
> provides a fast set membership querying capability. It does not give
> fal
On Sun, Apr 20, 2008 at 5:22 PM, Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
> Niklas Broberg wrote:
>
> > So API suggestions would be most welcome!
>
> Your challenge will lie in finding an API that can be implemented
> efficiently on all concerned platforms. I don't know what the
> character
On Sun, Apr 20, 2008 at 4:46 AM, Jonathan Cast
<[EMAIL PROTECTED]> wrote:
>
> On 19 Apr 2008, at 5:02 AM, David MacIver wrote:
>
> > Independently of the rant...
> >
> > On Sat, Apr 19, 2008 at 6:01 AM, Jonathan Cast
> > <[EMAIL PROTECTED]> wrote
Independently of the rant...
On Sat, Apr 19, 2008 at 6:01 AM, Jonathan Cast
<[EMAIL PROTECTED]> wrote:
> > But why do I need to jump through these hoops for a perfectly safe &
> > commonly desired operation?
> >
>
> It's called a proof obligation. Haskell is not here to stop you from
> jumping t
12 matches
Mail list logo
