Struct SparseDist 

pub struct SparseDist {
    pub ids: Vec<u32>,
    pub probs: Vec<f32>,
}

A distribution supported on a small candidate set, ids[j] -> probs[j]. Everything outside ids has probability zero.

Block drafters (DFlash2’s candidate selector, Medusa-style heads) only ever expose a top-k slate, and a target sampler with top-k / top-p applied is likewise sparse. Carrying [n, vocab] dense rows for those is ~150k floats per position of pure waste, so the sparse path exists alongside speculative_accept rather than forcing callers to densify.

Duplicate ids are summed on lookup, so a caller may push the same id twice without corrupting the mass.

Fields

ids: Vec<u32>

probs: Vec<f32>

Implementations

impl SparseDist

pub fn prob_of(&self, id: u32) -> f32

Probability this distribution assigns to id (0.0 if absent).

Trait Implementations

impl Clone for SparseDist

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 SparseDist

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

Formats the value using the given formatter.

impl Default for SparseDist

fn default() -> Self

Returns the “default value” for a type.