public class BitDocSet extends Object
BitDocSet
represents an unordered set of Lucene Document Ids
using a BitSet. A set bit represents inclusion in the set for that document.Constructor and Description |
---|
BitDocSet() |
BitDocSet(FixedBitSet bits)
Construct a BitDocSet.
|
BitDocSet(FixedBitSet 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 |
addAllTo(DocSet target)
Adds all the docs from this set to the target set.
|
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() |
void |
close()
FUTURE: for off-heap
|
boolean |
equals(Object obj) |
boolean |
exists(int doc)
Returns true of the doc exists in the set.
|
FixedBitSet |
getBits()
Return a
FixedBitSet with a bit set for every document in this
DocSet . |
Collection<Accountable> |
getChildResources() |
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()
Returns an iterator that may be used to iterate over all of the documents in the set.
|
long |
ramBytesUsed() |
int |
size()
Returns the number of documents in the set.
|
static FixedBitSet |
toBitSet(DocSet 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(FixedBitSet bits)
FixedBitSet
should be at
least maxDoc()public BitDocSet(FixedBitSet bits, int size)
FixedBitSet
should be at least maxDoc()public DocIterator iterator()
DocSet
The order of the documents returned by this iterator is non-deterministic, and any scoring information is meaningless
public FixedBitSet getBits()
FixedBitSet
with a bit set for every document in this
DocSet
. The default implementation iterates on all docs and sets
the relevant bits. You should override if you can provide a more efficient
implementation.FixedBitSet
that should not be modified.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)
FixedBitSet.length()
.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 addAllTo(DocSet target)
DocSet
public DocSet andNot(DocSet other)
DocSet
public DocSet union(DocSet other)
DocSet
public Filter getTopFilter()
DocSet
getTopFilter
in interface DocSet
public long ramBytesUsed()
public Collection<Accountable> getChildResources()
public static FixedBitSet toBitSet(DocSet set)
public DocSet intersection(DocSet other)
DocSet
intersection
in interface DocSet
public void close() throws IOException
close
in interface Closeable
close
in interface AutoCloseable
IOException
Copyright © 2000-2015 Apache Software Foundation. All Rights Reserved.