Struct tantivy::query::Union

pub struct Union<TScorer, TScoreCombiner = DoNothingCombiner> { /* fields omitted */ }

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

Trait Implementations

impl<TScorer, TScoreCombiner> From<Vec<TScorer>> for Union<TScorer, TScoreCombiner> where     TScoreCombiner: ScoreCombiner,     TScorer: Scorer,

fn from(docsets: Vec<TScorer>) -> Union<TScorer, TScoreCombiner>

Performs the conversion.

impl<TScorer, TScoreCombiner> DocSet for Union<TScorer, TScoreCombiner> where     TScorer: Scorer,     TScoreCombiner: ScoreCombiner,

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 count(&mut self) -> u32

Returns the number documents matching.

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.

impl<TScorer, TScoreCombiner> Scorer for Union<TScorer, TScoreCombiner> where     TScoreCombiner: ScoreCombiner,     TScorer: Scorer,

fn score(&mut self) -> Score

Returns the score.

fn collect(     &mut self,     collector: &mut Collector,     delete_bitset_opt: Option<&DeleteBitSet> )

Consumes the complete DocSet and push the scored documents to the collector.