Apache
/
lucene
mirror of https://github.com/apache/lucene.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Reverse a mistaken optimization. With a larger collection and set of 

queries I find that a table size of 2k works best.


git-svn-id: https://svn.apache.org/repos/asf/lucene/java/trunk@150601 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Doug Cutting 2004-10-13 17:12:04 +00:00
parent 46ceb15879
commit c429a5f1e6
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/java/org/apache/lucene/search/BooleanScorer.java
View File

@ -176,7 +176,7 @@ final class BooleanScorer extends Scorer {
/** A simple hash table of document scores within a range. */
static final class BucketTable {
public static final int SIZE = 1 << 8;
public static final int SIZE = 1 << 11;
public static final int MASK = SIZE - 1;
final Bucket[] buckets = new Bucket[SIZE];