: In fact, I fail to see a situation where "Hits"'s concept of "random access"
: to the results (you can ask for result #30 and then #70) even makes sense.
: In all search applications I'm familar with, at the time you call search(),
: you already know how many results you want to display - and yo
lt;[EMAIL PROTECTED]>
To: java-dev@lucene.apache.org
Sent: Sunday, November 26, 2006 3:07:26 AM
Subject: Re: Controlling Hits
On Fri, Nov 24, 2006, Otis Gospodnetic wrote about "Controlling Hits":
Hi,
Could we make Hits non-final, or at least expose something in Hits to control
th
PROTECTED]>
To: java-dev@lucene.apache.org
Sent: Sunday, November 26, 2006 3:07:26 AM
Subject: Re: Controlling Hits
On Fri, Nov 24, 2006, Otis Gospodnetic wrote about "Controlling Hits":
> Hi,
>
> Could we make Hits non-final, or at least expose something in Hits to contr
On Fri, Nov 24, 2006, Otis Gospodnetic wrote about "Controlling Hits":
> Hi,
>
> Could we make Hits non-final, or at least expose something in Hits to control
> the number of Documents it reads from disk?
>...
> Or maybe the answer is: Use the search method that re
On Nov 24, 2006, at 10:38 PM, Otis Gospodnetic wrote:
Could we make Hits non-final, or at least expose something in Hits
to control the number of Documents it reads from disk?
I'm looking at:
getMoreDocs(50); // retrieve 100 initially
...
int n = min * 2;// double # retrieved
(Why * 2
Hi,
Could we make Hits non-final, or at least expose something in Hits to control
the number of Documents it reads from disk?
I'm looking at:
getMoreDocs(50); // retrieve 100 initially
...
int n = min * 2;// double # retrieved
(Why * 2? To "read and cache ahead"?)
... and wondering how
