[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Implementing "extremes"
From: |
Ben Pfaff |
Subject: |
Re: Implementing "extremes" |
Date: |
Wed, 06 Aug 2008 21:21:55 -0700 |
User-agent: |
Gnus/5.11 (Gnus v5.11) Emacs/22.2 (gnu/linux) |
John Darrington <address@hidden> writes:
> As part of my (re)implementation of EXAMINE, I have a decision to
> make. I can store extreme values in one of two ways:
>
> 1. Keep them in dynamically allocated memory (which is what the
> current implementation does).
>
> 2. Use a casereader.
>
> My first thought was that the casereader would be the prefered
> option. However, whilst it's more robust, it will require an extra
> data pass and therefore slow down the command. Keeping them on the
> heap will be faster, but could result in out-of-memory conditions if
> huge list of extremes are requested.
>
> So I'm tending towards option 1 at the moment, since in the most
> normal uses it will be faster, and could only cause a problem if
> somebody does something silly like:
Sounds fine to me.
--
"...I've forgotten where I was going with this,
but you can bet it was scathing."
--DesiredUsername