Constructor and Description |
---|
BitDocSet() |
BitDocSet(OpenBitSet bits)
Construct a BitDocSet.
|
BitDocSet(OpenBitSet bits,
int size)
Construct a BitDocSet, and provides the number of set bits.
|
Modifier and Type | Method and Description |
---|---|
void |
add(int doc)
Adds the specified document if it is not currently in the DocSet
(optional operation).
|
void |
addUnique(int doc)
Adds a document the caller knows is not currently in the DocSet
(optional operation).
|
DocSet |
andNot(DocSet other)
Returns the documents in this set that are not in the other set.
|
int |
andNotSize(DocSet other)
Returns the number of documents in this set that are not in the other set.
|
protected BitDocSet |
clone() |
boolean |
equals(Object obj) |
boolean |
exists(int doc)
Returns true of the doc exists in the set.
|
OpenBitSet |
getBits()
Inefficient base implementation.
|
Filter |
getTopFilter()
Returns a Filter for use in Lucene search methods, assuming this DocSet
was generated from the top-level MultiReader that the Lucene search
methods will be invoked with.
|
DocSet |
intersection(DocSet other)
Returns the intersection of this set with another set.
|
int |
intersectionSize(DocSet other)
Returns the number of documents of the intersection of this set with another set.
|
boolean |
intersects(DocSet other)
Returns true if these sets have any elements in common
|
void |
invalidateSize()
The number of set bits - size - is cached.
|
DocIterator |
iterator()
DocIterator using nextSetBit()
public DocIterator iterator() {
return new DocIterator() {
int pos=bits.nextSetBit(0);
public boolean hasNext() {
return pos>=0;
}
public Integer next() {
return nextDoc();
}
public void remove() {
bits.clear(pos);
}
public int nextDoc() {
int old=pos;
pos=bits.nextSetBit(old+1);
return old;
}
public float score() {
return 0.0f;
}
};
}
|
long |
memSize()
Returns the approximate amount of memory taken by this DocSet.
|
void |
setBitsOn(OpenBitSet target)
Takes the docs from this set and sets those bits on the target OpenBitSet.
|
int |
size()
Returns the number of documents in the set.
|
DocSet |
union(DocSet other)
Returns the union of this set with another set.
|
int |
unionSize(DocSet other)
Returns the number of documents of the union of this set with another set.
|
public BitDocSet()
public BitDocSet(OpenBitSet bits)
public BitDocSet(OpenBitSet bits, int size)
public DocIterator iterator()
public OpenBitSet getBits()
public void add(int doc)
DocSet
add
in interface DocSet
DocSet.addUnique(int)
public void addUnique(int doc)
DocSet
This method may be faster then add(doc)
in some
implementaions provided the caller is certain of the precondition.
addUnique
in interface DocSet
DocSet.add(int)
public int size()
DocSet
public void invalidateSize()
public boolean exists(int doc)
public int intersectionSize(DocSet other)
DocSet
intersectionSize
in interface DocSet
public boolean intersects(DocSet other)
DocSet
intersects
in interface DocSet
public int unionSize(DocSet other)
DocSet
public int andNotSize(DocSet other)
DocSet
andNotSize
in interface DocSet
public void setBitsOn(OpenBitSet target)
DocSet
public DocSet andNot(DocSet other)
DocSet
public DocSet union(DocSet other)
DocSet
public long memSize()
DocSet
public Filter getTopFilter()
DocSet
getTopFilter
in interface DocSet
public DocSet intersection(DocSet other)
DocSet
intersection
in interface DocSet
Copyright © 2000-2013 Apache Software Foundation. All Rights Reserved.