org.apache.solr.search

Class SortedIntDocSet

java.lang.Object

org.apache.solr.search.DocSetBase

org.apache.solr.search.SortedIntDocSet

All Implemented Interfaces:

DocSet

public class SortedIntDocSet
extends DocSetBase

SortedIntDocSet represents a sorted set of Lucene Document Ids.

Field Summary

Fields

Modifier and Type	Field and Description
protected int[]	docs
static SortedIntDocSet	zero
static int[]	zeroInts

Constructor Summary

Constructors

Constructor and Description
SortedIntDocSet(int[] docs)
SortedIntDocSet(int[] docs, int len)

Method Summary

Modifier and Type	Method and Description
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)
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
org.apache.lucene.util.OpenBitSet	getBits() Inefficient base implementation.
int[]	getDocs()
org.apache.lucene.search.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)
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.
static int[]	shrink(int[] arr, int newSize)
int	size() Returns the number of documents in the set.

Methods inherited from class org.apache.solr.search.DocSetBase

add, addUnique, andNotSize, equals, union, unionSize

Methods inherited from class java.lang.Object

clone, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

docs

protected final int[] docs

zeroInts

public static int[] zeroInts

zero

public static SortedIntDocSet zero

Constructor Detail

SortedIntDocSet

public SortedIntDocSet(int[] docs)

Parameters:

docs - Sorted list of ids

SortedIntDocSet

public SortedIntDocSet(int[] docs,
                       int len)

Parameters:

docs - Sorted list of ids

len - Number of ids in the list

Method Detail

getDocs

public int[] getDocs()

size

public int size()

Description copied from interface: DocSet

Returns the number of documents in the set.

memSize

public long memSize()

Description copied from interface: DocSet

Returns the approximate amount of memory taken by this DocSet. This is only an approximation and doesn't take into account java object overhead.

Returns:

the approximate memory consumption in bytes

shrink

public static int[] shrink(int[] arr,
                           int newSize)

firstNonSorted

public 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

intersectionSize

public static int intersectionSize(int[] smallerSortedList,
                                   int[] biggerSortedList)

intersectionSize

public int intersectionSize(DocSet other)

Description copied from interface: DocSet

Returns the number of documents of the intersection of this set with another set. May be more efficient than actually creating the intersection and then getting it's size.

Specified by:

intersectionSize in interface DocSet

Overrides:

intersectionSize in class DocSetBase

intersection

public 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

intersectionBinarySearch

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. lena should be smaller than lenb

intersection

public DocSet intersection(DocSet other)

Description copied from interface: DocSet

Returns the intersection of this set with another set. Neither set is modified - a new DocSet is created and returned.

Specified by:

intersection in interface DocSet

Overrides:

intersection in class DocSetBase

Returns:

a DocSet representing the intersection

andNotBinarySearch

protected static int andNotBinarySearch(int[] a,
                                        int lena,
                                        int[] b,
                                        int lenb,
                                        int[] target)

andNot

public 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

andNot

public DocSet andNot(DocSet other)

Description copied from interface: DocSet

Returns the documents in this set that are not in the other set. Neither set is modified - a new DocSet is created and returned.

Specified by:

andNot in interface DocSet

Overrides:

andNot in class DocSetBase

Returns:

a DocSet representing this AND NOT other

exists

public boolean exists(int doc)

Description copied from interface: DocSet

Returns true if a document is in the DocSet.

iterator

public DocIterator iterator()

Description copied from interface: DocSet

Returns an iterator that may be used to iterate over all of the documents in the set.

The order of the documents returned by this iterator is non-deterministic, and any scoring information is meaningless

getBits

public org.apache.lucene.util.OpenBitSet getBits()

Description copied from class: DocSetBase

Inefficient base implementation.

Specified by:

getBits in interface DocSet

Overrides:

getBits in class DocSetBase

Returns:

An OpenBitSet with the bit number of every docid set in the set.

See Also:

BitDocSet.getBits()

findIndex

public static int findIndex(int[] arr,
                            int value,
                            int low,
                            int high)

getTopFilter

public org.apache.lucene.search.Filter getTopFilter()

Description copied from interface: DocSet

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.

Specified by:

getTopFilter in interface DocSet

Overrides:

getTopFilter in class DocSetBase