Enum StoredDtype 

pub enum StoredDtype {
    Bf16,
    F32,
    Q8,
    Q4,
}

How a tensor’s elements are stored in the container.

Narrow on purpose, and unknown values are refused. The high-precision variants exist because the quant recipe protects norms, codebooks, and the speaker path — an artifact that claims a dtype we have never conformed is a refusal, not a best-effort read.

Variants

Bf16

bfloat16, kept verbatim from the checkpoint.

F32

32-bit float.

Q8

int8 with separate per-group scales.

Q4

int4, two elements per byte, with separate per-group scales.

Implementations

impl StoredDtype

pub const fn as_str(self) -> &'static str

The stable wire string.

Examples found in repository

examples/fttsq_census.rs (line 85)

fn main() {
    let path = std::env::args().nth(1).unwrap_or_else(|| {
        eprintln!("usage: fttsq_census <artifact.fttsq>");
        std::process::exit(2);
    });
    let mapped = match MappedFttsq::open(&path) {
        Ok(mapped) => mapped,
        Err(error) => {
            eprintln!("refusing census: {error}");
            std::process::exit(1);
        }
    };
    let reader = mapped.reader();
    let file_bytes = mapped.len() as u64;

    let mut class_bytes: BTreeMap<&str, u64> = BTreeMap::new();
    let mut sections_total = 0_u64;
    for section in reader.sections() {
        sections_total += section.length;
        *class_bytes
            .entry(section.access_class.as_str())
            .or_default() += section.length;
        row(
            "section",
            &[
                ("name", quoted(&section.name)),
                ("access_class", quoted(section.access_class.as_str())),
                ("bytes", section.length.to_string()),
                ("share_of_file", share(section.length, file_bytes)),
            ],
        );
    }

    // Dtype split inside each section: separates payload from quantization-scale overhead and
    // shows how much of a "quantized" section is still wide.
    let mut dtype_bytes: BTreeMap<(String, &str), u64> = BTreeMap::new();
    let mut scale_bytes: BTreeMap<String, u64> = BTreeMap::new();
    let scale_names: std::collections::BTreeSet<&str> = reader
        .tensors()
        .iter()
        .filter_map(|tensor| tensor.scales.as_deref())
        .collect();
    for tensor in reader.tensors() {
        *dtype_bytes
            .entry((tensor.section.clone(), tensor.dtype.as_str()))
            .or_default() += tensor.length;
        if scale_names.contains(tensor.name.as_str()) {
            *scale_bytes.entry(tensor.section.clone()).or_default() += tensor.length;
        }
    }
    for ((section, dtype), bytes) in &dtype_bytes {
        row(
            "section_dtype",
            &[
                ("section", quoted(section)),
                ("dtype", quoted(dtype)),
                ("bytes", bytes.to_string()),
                ("share_of_file", share(*bytes, file_bytes)),
            ],
        );
    }
    for (section, bytes) in &scale_bytes {
        row(
            "scale_overhead",
            &[
                ("section", quoted(section)),
                ("bytes", bytes.to_string()),
                ("share_of_file", share(*bytes, file_bytes)),
            ],
        );
    }

    for (class, bytes) in &class_bytes {
        row(
            "access_class",
            &[
                ("access_class", quoted(class)),
                ("bytes", bytes.to_string()),
                ("share_of_file", share(*bytes, file_bytes)),
            ],
        );
    }
    row(
        "total",
        &[
            ("file_bytes", file_bytes.to_string()),
            ("section_bytes", sections_total.to_string()),
            (
                "header_directory_bytes",
                (file_bytes - sections_total).to_string(),
            ),
            ("model_family", quoted(reader.model_family())),
        ],
    );
}

pub fn parse(text: &str) -> Option<Self>

Parses a wire string, refusing anything unrecognized.

pub const fn storage_bytes(self, elements: u64) -> Option<u64>

Storage bytes for elements values, or None on overflow.

Q4 packs two elements per byte and rounds up, so an odd element count still occupies a whole trailing byte.

Trait Implementations

impl Clone for StoredDtype

fn clone(&self) -> StoredDtype

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for StoredDtype

impl Debug for StoredDtype

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

Formats the value using the given formatter.

impl Display for StoredDtype

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

Formats the value using the given formatter.

impl Eq for StoredDtype

impl Ord for StoredDtype

fn cmp(&self, other: &StoredDtype) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for StoredDtype

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for StoredDtype

fn partial_cmp(&self, other: &StoredDtype) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for StoredDtype