Struct SparseBitVector 

pub struct SparseBitVector {
    pub indices: Vec<u16>,
    /* private fields */
}

Sparse bit vector storing only active indices

Efficient representation for sparse binary vectors where only a small fraction of bits are set (active). Stores only the indices of active bits rather than the full bit array.

Properties

• Memory: O(k) where k is number of active bits
• Set operations: O(k1 + k2) for intersection/union
• Typical k: 200-500 active bits out of 10000+ total

Example

use ruvector_nervous_system::SparseBitVector;

let mut sparse = SparseBitVector::new(10000);
sparse.set(42);
sparse.set(100);
sparse.set(500);

Fields

indices: Vec<u16>

Sorted list of active bit indices

Implementations

impl SparseBitVector

pub fn new(capacity: u16) -> Self

Create a new sparse bit vector with given capacity

Arguments

• capacity - Maximum number of bits (max index + 1)

Example

use ruvector_nervous_system::SparseBitVector;

let sparse = SparseBitVector::new(10000);

pub fn from_indices(indices: Vec<u16>, capacity: u16) -> Self

Create from a list of active indices

Arguments

• indices - Vector of active bit indices
• capacity - Total capacity

Example

use ruvector_nervous_system::SparseBitVector;

let sparse = SparseBitVector::from_indices(vec![10, 20, 30], 10000);

pub fn set(&mut self, index: u16)

Set a bit to active

Arguments

• index - Bit index to set

Panics

Panics if index >= capacity

pub fn is_set(&self, index: u16) -> bool

Check if a bit is active

Arguments

• index - Bit index to check

Returns

true if bit is set, false otherwise

pub fn count(&self) -> usize

Get number of active bits

pub fn capacity(&self) -> u16

Get capacity

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

Compute intersection with another sparse bit vector

Arguments

• other - Other sparse bit vector

Returns

New sparse bit vector containing intersection

Example

use ruvector_nervous_system::SparseBitVector;

let a = SparseBitVector::from_indices(vec![1, 2, 3], 100);
let b = SparseBitVector::from_indices(vec![2, 3, 4], 100);
let intersection = a.intersection(&b);
assert_eq!(intersection.count(), 2); // {2, 3}

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

Compute union with another sparse bit vector

Arguments

• other - Other sparse bit vector

Returns

New sparse bit vector containing union

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

Compute Jaccard similarity with another sparse bit vector

Jaccard similarity = |A ∩ B| / |A ∪ B|

Arguments

• other - Other sparse bit vector

Returns

Similarity in range [0.0, 1.0]

Example

use ruvector_nervous_system::SparseBitVector;

let a = SparseBitVector::from_indices(vec![1, 2, 3], 100);
let b = SparseBitVector::from_indices(vec![2, 3, 4], 100);
let sim = a.jaccard_similarity(&b);
assert!((sim - 0.5).abs() < 0.001); // 2/4 = 0.5

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

Compute Hamming distance with another sparse bit vector

Hamming distance = number of positions where bits differ

Arguments

• other - Other sparse bit vector

Returns

Hamming distance (number of differing bits)

Trait Implementations

impl Clone for SparseBitVector

fn clone(&self) -> SparseBitVector

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SparseBitVector

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SparseBitVector

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SparseBitVector

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for SparseBitVector

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for SparseBitVector

impl StructuralPartialEq for SparseBitVector