Struct tantivy::query::Intersection

pub struct Intersection<TDocSet: DocSet, TOtherDocSet: DocSet = Box<dyn Scorer>> { /* fields omitted */ }

Creates a DocSet that iterator through the intersection of two DocSets.

Trait Implementations

impl<TScorer, TOtherScorer> Scorer for Intersection<TScorer, TOtherScorer> where
    TScorer: Scorer,
    TOtherScorer: Scorer, 

fn score(&mut self) -> Score

Returns the score.

fn for_each(&mut self, callback: &mut dyn FnMut(DocId, Score))

Iterates through all of the document matched by the DocSet DocSet and push the scored documents to the collector.

impl<TDocSet: DocSet, TOtherDocSet: DocSet> DocSet for Intersection<TDocSet, TOtherDocSet>

fn advance(&mut self) -> bool

Goes to the next element. .advance(...) needs to be called a first time to point to the correct element.

fn skip_next(&mut self, target: DocId) -> SkipResult

After skipping, position the iterator in such a way that .doc() will return a value greater than or equal to target.

fn doc(&self) -> DocId

Returns the current document

fn size_hint(&self) -> u32

Returns a best-effort hint of the length of the docset.

fn fill_buffer(&mut self, buffer: &mut [DocId]) -> usize

Fills a given mutable buffer with the next doc ids from the DocSet

fn append_to_bitset(&mut self, bitset: &mut BitSet)

Appends all docs to a bitset.

fn count(&mut self, delete_bitset: &DeleteBitSet) -> u32

Returns the number documents matching. Calling this method consumes the DocSet.

fn count_including_deleted(&mut self) -> u32

Returns the count of documents, deleted or not. Calling this method consumes the DocSet.