qdrant-edge 0.8.0

A lightweight, in-process vector search engine designed for embedded devices, autonomous systems, and mobile agents.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

use crate::segment::types::{Filter, VectorNameBuf};

/// A single-shard distance-matrix request: sample `sample_size` random points that
/// carry the `using` vector, then find each sample's `limit_per_sample` nearest
/// neighbours restricted to the sampled set.
#[derive(Clone, Debug, PartialEq)]
pub struct SearchMatrixRequest {
    /// How many random points to sample.
    pub sample_size: usize,
    /// How many nearest neighbours to return per sampled point.
    pub limit_per_sample: usize,
    /// Look only for points which satisfy these conditions.
    pub filter: Option<Filter>,
    /// Name of the vector the sampled points are compared by.
    pub using: VectorNameBuf,
}

impl SearchMatrixRequest {
    pub fn new(sample_size: usize, limit_per_sample: usize, using: VectorNameBuf) -> Self {
        Self {
            sample_size,
            limit_per_sample,
            filter: None,
            using,
        }
    }
}