Enum HammingKernel 

pub enum HammingKernel {
    Avx512,
    Avx2,
    Scalar,
}

Architecture kernel resolved once for a whole scan.

Hot binary paths — HNSW centroid routing, k-majority assignment, leaf scanning — score millions of code pairs against one query. Resolving the kernel up front keeps runtime feature detection out of the inner loop, and the row-batched entry points let one dispatch cover a whole neighbour list.

Variants

Avx512

Avx2

Scalar

Implementations

impl HammingKernel

pub fn resolve() -> Self

Detect the widest kernel this CPU supports.

pub fn distance(self, a: &[u8], b: &[u8]) -> u32

Hamming distance between two equal-length packed-bit vectors.

pub fn distances( self, query: &[u8], db: &[u8], byte_len: usize, out: &mut [u32], )

out[i] receives the distance from query to row i of db.

pub fn gather_distances( self, query: &[u8], db: &[u8], byte_len: usize, ids: &[u32], out: &mut [u32], )

out[i] receives the distance from query to row ids[i] of db.

Graph routing visits scattered centroid rows; gathering them through one dispatch keeps the batched kernel usable there.

Trait Implementations

impl Clone for HammingKernel

fn clone(&self) -> HammingKernel

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for HammingKernel

impl Debug for HammingKernel

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

Formats the value using the given formatter.

impl Eq for HammingKernel

impl PartialEq for HammingKernel

fn eq(&self, other: &HammingKernel) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for HammingKernel