Skip to main content

AdcLut

Struct AdcLut 

Source
pub struct AdcLut {
    pub subspace_count: u16,
    pub centroids_per_subspace: u16,
    pub table: Vec<f32>,
}
Expand description

Asymmetric Distance Computation lookup table — used by codecs that pre-decompose the query into per-subspace distance tables (PQ, IVF-PQ, TurboQuant). Consumed by base-layer rerank kernels via AVX2 pshufb or AVX-512 vpermb.

Layout:

  • subspace_count: number of independent subspaces (PQ M parameter)
  • centroids_per_subspace: typically 256 (one byte per code)
  • table: row-major [subspace][centroid] -> f32 distance

Fields§

§subspace_count: u16§centroids_per_subspace: u16§table: Vec<f32>

Implementations§

Source§

impl AdcLut

Source

pub fn new(subspace_count: u16, centroids_per_subspace: u16) -> Self

Source

pub fn lookup(&self, subspace: u16, centroid: u8) -> f32

Return the precomputed distance for the given subspace and centroid.

§Panics

Panics if subspace >= self.subspace_count or centroid as usize >= self.centroids_per_subspace as usize. Bounds checking is the caller’s responsibility on this hot-path accessor.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.