Struct HVec10240 

pub struct HVec10240 {
    pub data: [u128; 80],
}

10240-bit hypervector (80 x 128-bit words)

Fields

data: [u128; 80]

Implementations

impl HVec10240

pub const DIMENSION: usize = 10240

pub const WORDS: usize = 80

pub const fn zero() -> Self

Create a new hypervector with all zeros

pub fn random() -> Self

Create a random hypervector (each bit has 50% probability)

Performance Optimization: Uses rng.fill() for bulk data generation, reducing per-word overhead and allowing the RNG to use vectorized memory-filling paths. Expected speedup: ~15% for random generation.

pub fn new_seeded(seed: u64) -> Self

Create a deterministic random hypervector from a seed.

Uses rand::rngs::StdRng for reproducibility across runs.

pub fn sparse(density: f32) -> Self

Create a random sparse hypervector with given density

pub fn set_bit(&mut self, pos: usize)

Set a specific bit in the hypervector.

Panics

Panics if pos >= DIMENSION (10240).

pub fn bundle(vectors: &[Self]) -> Result<Self>

Bundle (sum) multiple hypervectors using bit-sliced addition.

This implementation is optimized for performance and memory efficiency:

1. It uses word-parallel bit-sliced addition to count set bits across vectors.
2. It eliminates the large heap-allocated counter array and bit-by-bit loops.
3. It parallelizes over hypervector words rather than over vectors to minimize memory traffic and synchronization overhead.

pub fn bind(&self, other: &Self) -> Self

XOR binding of two hypervectors.

pub fn cosine_similarity(&self, other: &Self) -> f32

Cosine similarity between two hypervectors.

Calculated as 1.0 - (HammingDistance / 5120.0) for 10240-bit vectors.

pub fn hamming_distance(&self, other: &Self) -> u32

Hamming distance

Dispatches to optimized SIMD paths based on platform:

• x86_64: AVX2 (runtime detection) or unrolled scalar GPR popcount fallback
• aarch64: NEON
• Other: unrolled scalar GPR popcount

pub fn permute(&self, shift: usize) -> Self

Permute the hypervector (cyclic rotation)

Optimized implementation that eliminates modulo operations and branches from the hot loop by splitting the rotation into two contiguous segments.

pub fn to_bytes(&self) -> Vec<u8>

Serialize to bytes

pub fn from_bytes(bytes: &[u8]) -> Result<Self>

Deserialize from bytes

Trait Implementations

impl Clone for HVec10240

fn clone(&self) -> HVec10240

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for HVec10240

impl Debug for HVec10240

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for HVec10240

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for HVec10240

impl Hash for HVec10240

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hypervector for HVec10240

const DIMENSION: usize = 10240

const FORMAT_NAME: &'static str = "f32"

fn zero() -> Self

fn random() -> Self

fn new_seeded(seed: u64) -> Self

fn bundle(vectors: &[&Self]) -> Result<Self>

fn bind(&self, other: &Self) -> Self

fn cosine_similarity(&self, other: &Self) -> f32

fn hamming_distance(&self, other: &Self) -> u32

fn permute(&self, shift: usize) -> Self

fn to_bytes(&self) -> Vec<u8>

fn from_bytes(bytes: &[u8]) -> Result<Self>

impl PartialEq for HVec10240

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for HVec10240

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for HVec10240