There are a few binary search implmentations in lucene that suffer from a now
well known overflow bug
-----------------------------------------------------------------------------------------------------
Key: LUCENE-1457
URL: https://issues.apache.org/jira/browse/LUCENE-1457
Project: Lucene - Java
Issue Type: Bug
Reporter: Mark Miller
Priority: Trivial
http://googleresearch.blogspot.com/2006/06/extra-extra-read-all-about-it-nearly.html
The places I see it are:
MultiSearcher.subSearcher(int)
TermInfosReader.getIndexOffset(Term)
MultiSegmentReader.readerIndex(int, int[], int)
MergeDocIDRemapper.remap(int)
I havn't taken much time to consider how likely any of these are to overflow.
The values being averaged would have to be very large. That would rule out
possible problems for at least a couple of these, but how about something like
the MergeDocIDRemapper? Is there a document number that could be reached that
has a chance of triggering this bug? If not we can close this and have a record
of looking into it.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
