Struct GramTable 

pub struct GramTable { /* private fields */ }

Precomputed codebook Gram table for approximate inner product scoring.

G[i, j] = <codeword_i, codeword_j> stored as a flat N × N f32 matrix in row-major order. For a codebook of size N=32, this is 1024 f32 values (4 KB). For N=256, it’s 64K values (256 KB). The table is symmetric, so only the lower triangle is computed, but the full matrix is stored for O(1) lookup without index arithmetic.

The table is lazily computed and cached inside FibScorer.

Implementations

impl GramTable

pub fn build(codewords: &[f32], n: usize, k: usize) -> Result<Self>

Build the Gram table from a codebook’s codewords.

codewords is the row-major N × k f32 array from FibCodebookV1. k is the block dimension.

pub fn get(&self, i: usize, j: usize) -> f32

Lookup <codeword_i, codeword_j>.

pub fn n(&self) -> usize

Size N of the Gram table.

pub fn values(&self) -> &[f32]

Raw values (for serialization/digest).