pub struct BuildParams {
pub metric: Metric,
pub build_ef: usize,
pub degree: usize,
pub alpha: f32,
pub code_bits: usize,
pub seed: u64,
pub quantized_search: bool,
}Fields§
§metric: MetricDistance the graph is built for.
build_ef: usizeCandidate list size of the construction-time greedy search (the first of the two insertion passes uses at most 200).
degree: usizeOut-degree of the bottom layer (even).
alpha: f32Pruning parameter of the second pass (the first pass uses 1.0).
code_bits: usizeLength of the 1-bit edge codes; rounded up to a power of two of at least 64 and at least the dimension. 0 picks the smallest such length.
seed: u64§quantized_search: boolScore the construction search’s candidates with the 8-bit codes (one SDOT over a
dim-byte row) instead of exact float distances, at every dimension; the expanded
set is re-scored exactly before the prune, which stays exact. The cache header does
not record this yet: build with a fresh cache path when it changes.
Trait Implementations§
Source§impl Clone for BuildParams
impl Clone for BuildParams
Source§fn clone(&self) -> BuildParams
fn clone(&self) -> BuildParams
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for BuildParams
impl Debug for BuildParams
Auto Trait Implementations§
impl Freeze for BuildParams
impl RefUnwindSafe for BuildParams
impl Send for BuildParams
impl Sync for BuildParams
impl Unpin for BuildParams
impl UnsafeUnpin for BuildParams
impl UnwindSafe for BuildParams
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.