Struct Hypervector 

pub struct Hypervector { /* private fields */ }

Bit-packed hypervector: each bit represents a bipolar value (0 → -1, 1 → +1). 10,000 dims = 157 u64 words = 1,256 bytes (vs 10,000 bytes as Vec).

Implementations

impl Hypervector

pub fn new(dims: usize) -> Self

pub fn bits_get(&self, word: usize) -> u64

Get bipolar value at index: returns -1 or +1.

pub fn get(&self, idx: usize) -> i8

pub fn set(&mut self, idx: usize, val: i8)

Set bipolar value at index: -1 → clear bit, +1 → set bit.

pub fn dot(&self, other: &Hypervector) -> i64

M1: XOR + popcount dot product — 64× fewer iterations than element-wise. For bipolar {-1,+1}: dot = (matching_bits - differing_bits) = dims - 2*hamming_distance.

pub fn norm(&self) -> f64

M3: Precomputed norm — for bipolar HVs, norm = sqrt(dims) ≈ constant. No per-call sum-of-squares needed.

pub fn cosine(&self, other: &Hypervector) -> f64

Cosine similarity = dot / (norm_a * norm_b). For bipolar HVs: cosine = 1 - 2*hamming/dims.

pub fn bundle_into(&mut self, other: &Hypervector)

Bundle: XOR-based majority vote for bipolar HVs. Sum via i32 accumulation, then sign → set/clear bit.

Trait Implementations

impl Clone for Hypervector

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Hypervector

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

Formats the value using the given formatter.

impl PartialEq for Hypervector

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Hypervector