ate: Tue, 23 Jun 2009 06:49:00 -0400
> Subject: Re: Optimization of memory usage in PriorityQueue
> From: luc...@mikemccandless.com
> To: java-dev@lucene.apache.org
>
> OK I've added a NOTE to the javadocs for this...
>
> Mike
>
> On Mon, Jun 22, 2009 at 8:57 PM,
>> I think the common use case of TopScoreDocCollector is to request
10 results, then ask for 20 and so on. You ask for N results because
you want to display them, or manipulate them in some way.
>>
However, if we do add this to the base PQ, it means an extra check for
every put() call. We've tri
Hi,
The PriorityQueue used in TopDocCollector does not optimize the memory usage.
If I do this search:
TopDocs topDocs = searcher.search(query, null, 1);
And only 1 document is returned. The PriorityQueue will create an Object[] of
size 1 + 1, but only one position of the
See below.
>
> Op Friday 06 June 2008 16:23:15 schreef Claudio Corsi:
> > Hi,
> > I'm trying to extend the NearSpansOrdered and NearSpansUnordered
> > classes of the Lucene core in order to create a way to access to the
> > inner positions of the current span (in
afte the next() call?
Thank you for any hints!
-- Forwarded message --
From: Paul Elschot <[EMAIL PROTECTED]>
Date: Fri, May 30, 2008 at 8:51 PM
Subject: Re: SpanNearQuery: how to get the "intra-span" matching positions?
To: [EMAIL PROTECTED]
Op Friday 30 May 200812:10
