Package org.apache.lucene.util

Class DocBaseBitSetIterator

java.lang.Object
org.apache.lucene.search.DocIdSetIterator
org.apache.lucene.util.DocBaseBitSetIterator
public class DocBaseBitSetIterator extends DocIdSetIterator
A DocIdSetIterator like BitSetIterator but has a doc base in onder to avoid storing previous 0s.

  • Constructor Details

    • DocBaseBitSetIterator

      public DocBaseBitSetIterator(FixedBitSet bits, long cost, int docBase)

  • Method Details

    • getBitSet

      public FixedBitSet getBitSet()
      Get the FixedBitSet. A docId will exist in this DocIdSetIterator if the bitset contains the (docId - getDocBase())
      Returns:
      the offset docId bitset

    • docID

      public int docID()
      Description copied from class: DocIdSetIterator
      Returns the following:
      Specified by:
      docID in class DocIdSetIterator

    • getDocBase

      public int getDocBase()
      Get the docBase. It is guaranteed that docBase is a multiple of 64.
      Returns:
      the docBase

    • nextDoc

      public int nextDoc()
      Description copied from class: DocIdSetIterator
      Advances to the next document in the set and returns the doc it is currently on, or DocIdSetIterator.NO_MORE_DOCS if there are no more docs in the set.
      NOTE: after the iterator has exhausted you should not call this method, as it may result in unpredicted behavior.
      Specified by:
      nextDoc in class DocIdSetIterator

    • advance

      public int advance(int target)
      Description copied from class: DocIdSetIterator
      Advances to the first beyond the current whose document number is greater than or equal to target, and returns the document number itself. Exhausts the iterator and returns DocIdSetIterator.NO_MORE_DOCS if target is greater than the highest document number in the set.

      The behavior of this method is undefined when called with target ≤ current , or after the iterator has exhausted. Both cases may result in unpredicted behavior.

      When target > current it behaves as if written: 

       int advance(int target) {
   int doc;
   while ((doc = nextDoc()) < target) {
   }
   return doc;
 }
      Some implementations are considerably more efficient than that.

      NOTE: this method may be called with DocIdSetIterator.NO_MORE_DOCS for efficiency by some Scorers. If your implementation cannot efficiently determine that it should exhaust, it is recommended that you check for that value in each call to this method.

      Specified by:
      advance in class DocIdSetIterator

    • cost

      public long cost()
      Description copied from class: DocIdSetIterator
      Returns the estimated cost of this DocIdSetIterator.

      This is generally an upper bound of the number of documents this iterator might match, but may be a rough heuristic, hardcoded value, or otherwise completely inaccurate.

      Specified by:
      cost in class DocIdSetIterator