Struct BinaryDenseVectorQuery 

pub struct BinaryDenseVectorQuery {
    pub field: Field,
    pub vector: Vec<u8>,
    pub combiner: MultiValueCombiner,
}

Binary dense vector query for Hamming distance similarity search

Uses brute-force XOR + popcount scoring. Score = 1.0 - hamming/dim_bits.

Fields

field: Field

Field containing the binary dense vectors

vector: Vec<u8>

Query vector (packed bits, ceil(dim/8) bytes)

combiner: MultiValueCombiner

How to combine scores for multi-valued documents

Implementations

impl BinaryDenseVectorQuery

pub fn new(field: Field, vector: Vec<u8>) -> Self

pub fn with_combiner(self, combiner: MultiValueCombiner) -> Self

Trait Implementations

impl Clone for BinaryDenseVectorQuery

fn clone(&self) -> BinaryDenseVectorQuery

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BinaryDenseVectorQuery

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for BinaryDenseVectorQuery

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Query for BinaryDenseVectorQuery

fn scorer<'a>( &self, reader: &'a SegmentReader, limit: usize, ) -> ScorerFuture<'a>

Create a scorer for this query against a single segment (async)

fn count_estimate<'a>(&self, _reader: &'a SegmentReader) -> CountFuture<'a>

Estimated number of matching documents in a segment (async)

fn scorer_sync<'a>( &self, reader: &'a SegmentReader, limit: usize, ) -> Result<Box<dyn Scorer + 'a>>

Create a scorer synchronously (mmap/RAM only).

fn decompose(&self) -> QueryDecomposition

Decompose this query for MaxScore optimization.

fn is_filter(&self) -> bool

True if this query is a pure filter (always scores 1.0, no positions). Used by the planner to convert non-selective MUST filters into predicates.

fn as_doc_predicate<'a>( &self, _reader: &'a SegmentReader, ) -> Option<DocPredicate<'a>>

For filter queries: return a cheap per-doc predicate against a segment. The predicate does O(1) work per doc (e.g., fast-field lookup).

fn as_doc_bitset(&self, _reader: &SegmentReader) -> Option<DocBitset>

Build a compact bitset of matching doc_ids for this query.