Extrema Sorting Bug

[Doug Beardsley]

Ok, I found the patch.  When do these patches get integrated into the
main version?  In my opinion, a bug of this nature should have been
fixed very quickly.  I'm new to open source development, so if this is a
dumb question, I'm sorry.  Thanks for the good work on a great product.

Doug Beardsley

On Mon, Sep 16, 2002 at 03:13:02PM -0500, Eric Seppanen wrote:
> On Tue, Sep 17, 2002 at 03:56:02AM -0400, Doug Beardsley wrote:
> > 
> > I believe there is a bug in the extrema sorting code that hasn't been
> > caught yet.  The basic idea of the bug is this:  When a new token is
> > found to be an extrema, it is put into the extrema array and the
> > previous entry at that point in the array is lost.  I believe this is
> > faulty because it is possible that the previous entry is in reality the
> > second largest (now that the larger one has been added), and it should
> > not be deleted from this list.
> 
> I believe this has already been fixed with a smaller patch.  The message 
> that included the patch was:
> 
> From: David Relson <relson at osagesoftware.com>
> Subject: placement patch [was: classification error ???]
> 
> ... bug me or David for the patch if you can't find it.