| Key: |
LUCENE-700
|
| Type: |
Bug
|
| Status: |
Resolved
|
| Resolution: |
Cannot Reproduce
|
| Priority: |
Major
|
| Assignee: |
Unassigned
|
| Reporter: |
kaineci
|
| Votes: |
0
|
| Watchers: |
1
|
|
If you were logged in you would be able to see more operations.
|
|
|
| Resolution Date: |
26/Oct/06 08:54 PM
|
the extreme case is: when querying term1, term2, term3 and current docid of inverted lists of term1, term2, term3 are 0, i (larger than 0), BucketTable.SIZE, what could happen in search???However this case should occur with low possibility.
BucketTable table = new BucketTable();
Random random = new Random();
int tmpValue = random.nextInt(Integer.MAX_VALUE);
table.newCollector().collect(0, 0);
table.newCollector().collect(tmpValue, tmpValue);
table.newCollector().collect(2048, 2048);
Bucket bucket = table.first;
while(bucket != null)
{
bucket = bucket.next;
num++;
}
|
|
Description
|
the extreme case is: when querying term1, term2, term3 and current docid of inverted lists of term1, term2, term3 are 0, i (larger than 0), BucketTable.SIZE, what could happen in search???However this case should occur with low possibility.
BucketTable table = new BucketTable();
Random random = new Random();
int tmpValue = random.nextInt(Integer.MAX_VALUE);
table.newCollector().collect(0, 0);
table.newCollector().collect(tmpValue, tmpValue);
table.newCollector().collect(2048, 2048);
Bucket bucket = table.first;
while(bucket != null)
{
bucket = bucket.next;
num++;
} |
Show » |
made changes - 26/Oct/06 08:54 PM
| Field |
Original Value |
New Value |
|
Resolution
|
|
Cannot Reproduce
[ 5
]
|
|
Lucene Fields
|
[New]
|
|
|
Status
|
Open
[ 1
]
|
Resolved
[ 5
]
|
|
endless loop when querying using BooleanQuery.
