|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.apache.solr.search.SortedIntDocSet
public class SortedIntDocSet
SortedIntDocSet represents a sorted set of Lucene Document Ids.
| Field Summary | |
|---|---|
protected int[] |
docs
|
static SortedIntDocSet |
zero
|
static int[] |
zeroInts
|
| Fields inherited from interface org.apache.solr.search.DocSet |
|---|
EMPTY |
| Constructor Summary | |
|---|---|
SortedIntDocSet(int[] docs)
|
|
SortedIntDocSet(int[] docs,
int len)
|
|
| Method Summary | |
|---|---|
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. |
static int |
andNot(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
puts the intersection of a and not b into the target array and returns the size |
protected static int |
andNotBinarySearch(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
|
int |
andNotSize(DocSet other)
Returns the number of documents in this set that are not in the other set. |
protected SortedIntDocSet |
clone()
|
boolean |
equals(Object obj)
|
boolean |
exists(int doc)
Returns true if a document is in the DocSet. |
static int |
findIndex(int[] arr,
int value,
int low,
int high)
|
static int |
firstNonSorted(int[] arr,
int offset,
int len)
Returns the index of the first non-sorted element or -1 if they are all sorted |
OpenBitSet |
getBits()
Inefficient base implementation. |
int[] |
getDocs()
|
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. |
static int |
intersection(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
puts the intersection of a and b into the target array and returns the size |
protected static int |
intersectionBinarySearch(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
Puts the intersection of a and b into the target array and returns the size. |
int |
intersectionSize(DocSet other)
Returns the number of documents of the intersection of this set with another set. |
static int |
intersectionSize(int[] smallerSortedList,
int[] biggerSortedList)
|
boolean |
intersects(DocSet other)
Returns true if these sets have any elements in common |
static boolean |
intersects(int[] smallerSortedList,
int[] biggerSortedList)
|
DocIterator |
iterator()
Returns an iterator that may be used to iterate over all of the documents in the set. |
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. |
static int[] |
shrink(int[] arr,
int newSize)
|
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. |
| Methods inherited from class java.lang.Object |
|---|
finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
protected final int[] docs
public static int[] zeroInts
public static SortedIntDocSet zero
| Constructor Detail |
|---|
public SortedIntDocSet(int[] docs)
docs - Sorted list of ids
public SortedIntDocSet(int[] docs,
int len)
docs - Sorted list of idslen - Number of ids in the list| Method Detail |
|---|
public int[] getDocs()
public int size()
DocSet
public long memSize()
DocSet
public static int[] shrink(int[] arr,
int newSize)
public static int firstNonSorted(int[] arr,
int offset,
int len)
public static int intersectionSize(int[] smallerSortedList,
int[] biggerSortedList)
public static boolean intersects(int[] smallerSortedList,
int[] biggerSortedList)
public int intersectionSize(DocSet other)
DocSet
intersectionSize in interface DocSetpublic boolean intersects(DocSet other)
DocSet
intersects in interface DocSet
public static int intersection(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
protected static int intersectionBinarySearch(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
public DocSet intersection(DocSet other)
DocSet
intersection in interface DocSet
protected static int andNotBinarySearch(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
public static int andNot(int[] a,
int lena,
int[] b,
int lenb,
int[] target)
public DocSet andNot(DocSet other)
DocSet
andNot in interface DocSetpublic void setBitsOn(OpenBitSet target)
DocSet
setBitsOn in interface DocSetpublic boolean exists(int doc)
DocSet
public DocIterator iterator()
DocSetThe order of the documents returned by this iterator is non-deterministic, and any scoring information is meaningless
public OpenBitSet getBits()
getBits in interface DocSetBitDocSet.getBits()
public static int findIndex(int[] arr,
int value,
int low,
int high)
public Filter getTopFilter()
DocSet
getTopFilter in interface DocSetprotected SortedIntDocSet clone()
clone in class Objectpublic boolean equals(Object obj)
equals in class Objectpublic void add(int doc)
DocSet
add in interface DocSetSolrException - Base implementation does not allow modificationsDocSet.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 DocSetSolrException - Base implementation does not allow modificationsDocSet.add(int)public DocSet union(DocSet other)
DocSet
union in interface DocSetpublic int unionSize(DocSet other)
DocSet
unionSize in interface DocSetpublic int andNotSize(DocSet other)
DocSet
andNotSize in interface DocSet
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||