Package org.apache.lucene.index

Class VectorValuesWriter.BufferedVectorValues

java.lang.Object
org.apache.lucene.search.DocIdSetIterator
org.apache.lucene.index.VectorValues
org.apache.lucene.index.VectorValuesWriter.BufferedVectorValues
All Implemented Interfaces:
RandomAccessVectorValues, RandomAccessVectorValuesProducer
Enclosing class:
VectorValuesWriter
private static class VectorValuesWriter.BufferedVectorValues extends VectorValues implements RandomAccessVectorValues, RandomAccessVectorValuesProducer

  • Field Details

  • Constructor Details

    • BufferedVectorValues

      BufferedVectorValues(DocsWithFieldSet docsWithField, List<float[]> vectors, int dimension)

  • Method Details

    • randomAccess

      public RandomAccessVectorValues randomAccess()
      Description copied from interface: RandomAccessVectorValuesProducer
      Return a random access interface over this iterator's vectors. Calling the RandomAccess methods will have no effect on the progress of the iteration or the values returned by this iterator. Successive calls will retrieve independent copies that do not overwrite each others' returned values.
      Specified by:
      randomAccess in interface RandomAccessVectorValuesProducer

    • dimension

      public int dimension()
      Description copied from class: VectorValues
      Return the dimension of the vectors
      Specified by:
      dimension in interface RandomAccessVectorValues
      Specified by:
      dimension in class VectorValues

    • size

      public int size()
      Description copied from class: VectorValues
      TODO: should we use cost() for this? We rely on its always being exactly the number of documents having a value for this field, which is not guaranteed by the cost() contract, but in all the implementations so far they are the same.
      Specified by:
      size in interface RandomAccessVectorValues
      Specified by:
      size in class VectorValues
      Returns:
      the number of vectors returned by this iterator

    • binaryValue

      public BytesRef binaryValue()
      Description copied from class: VectorValues
      Return the binary encoded vector value for the current document ID. These are the bytes corresponding to the float array return by VectorValues.vectorValue(). It is illegal to call this method when the iterator is not positioned: before advancing, or after failing to advance. The returned storage may be shared across calls, re-used and modified as the iterator advances.
      Overrides:
      binaryValue in class VectorValues
      Returns:
      the binary value

    • binaryValue

      public BytesRef binaryValue(int targetOrd)
      Description copied from interface: RandomAccessVectorValues
      Return the vector indexed at the given ordinal value as an array of bytes in a BytesRef; these are the bytes corresponding to the float array. The provided bytes may be shared and overwritten by subsequent calls to this method and RandomAccessVectorValues.vectorValue(int).
      Specified by:
      binaryValue in interface RandomAccessVectorValues
      Parameters:
      targetOrd - a valid ordinal, ≥ 0 and < RandomAccessVectorValues.size().

    • vectorValue

      public float[] vectorValue()
      Description copied from class: VectorValues
      Return the vector value for the current document ID. It is illegal to call this method when the iterator is not positioned: before advancing, or after failing to advance. The returned array may be shared across calls, re-used, and modified as the iterator advances.
      Specified by:
      vectorValue in class VectorValues
      Returns:
      the vector value

    • vectorValue

      public float[] vectorValue(int targetOrd)
      Description copied from interface: RandomAccessVectorValues
      Return the vector value indexed at the given ordinal. The provided floating point array may be shared and overwritten by subsequent calls to this method and RandomAccessVectorValues.binaryValue(int).
      Specified by:
      vectorValue in interface RandomAccessVectorValues
      Parameters:
      targetOrd - a valid ordinal, ≥ 0 and < RandomAccessVectorValues.size().

    • docID

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

    • nextDoc

      public int nextDoc() throws IOException
      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
      Throws:
      IOException

    • 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