Struct VectorNeighborSearchOptions 

pub struct VectorNeighborSearchOptions<'a> {
    pub edge_label: &'a DbString,
    pub direction: VectorNeighborDirection,
    pub metric: VectorMetric,
    pub k: usize,
}

Tunable options for deriving and ranking vector neighbors from graph edges.

Fields

edge_label: &'a DbString

Edge label used to derive the one-hop candidate set.

direction: VectorNeighborDirection

Direction used when walking one-hop graph adjacency.

metric: VectorMetric

Distance metric requested by the caller.

k: usize

Maximum result count.

Implementations

impl<'a> VectorNeighborSearchOptions<'a>

pub const fn new( edge_label: &'a DbString, direction: VectorNeighborDirection, metric: VectorMetric, k: usize, ) -> Self

Construct one-hop vector-neighbor scoring options.

Trait Implementations

impl<'a> Clone for VectorNeighborSearchOptions<'a>

fn clone(&self) -> VectorNeighborSearchOptions<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for VectorNeighborSearchOptions<'a>

impl<'a> Debug for VectorNeighborSearchOptions<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for VectorNeighborSearchOptions<'a>

impl<'a> PartialEq for VectorNeighborSearchOptions<'a>

fn eq(&self, other: &VectorNeighborSearchOptions<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> StructuralPartialEq for VectorNeighborSearchOptions<'a>