| org.apache.solr.search.HashDocSet
| HashDocSet | | final public class HashDocSet extends DocSetBase (Code) | | HashDocSet represents an unordered set of Lucene Document Ids
using a primitive int hash table. It can be a better choice if there are few docs
in the set because it takes up less memory and is faster to iterate and take
set intersections.
author:
yonik
version:
$Id: HashDocSet.java 498246 2007-01-21 05:46:31Z yonik $
since:
solr 0.9 |
| Constructor Summary | |
| public | HashDocSet(int[] docs, int offset, int len)
| | public | HashDocSet(int[] docs, int offset, int len, float inverseLoadFactor)
|
| DEFAULT_INVERSE_LOAD_FACTOR | | static float DEFAULT_INVERSE_LOAD_FACTOR(Code) | | Default load factor to use for HashDocSets. We keep track of the inverse
since multiplication is so much faster than division. The default
is 1.0f / 0.75f
|
| HashDocSet | | public HashDocSet(int[] docs, int offset, int len)(Code) | | Create a HashDocSet from a list of *unique* ids
|
| HashDocSet | | public HashDocSet(int[] docs, int offset, int len, float inverseLoadFactor)(Code) | | Create a HashDocSet from a list of *unique* ids
|
| exists | | public boolean exists(int doc)(Code) | | |
| intersectionSize | | public int intersectionSize(DocSet other)(Code) | | |
| memSize | | public long memSize()(Code) | | |
|
|