zahirscan 0.2.17

Token-efficient content compression for AI analysis using probabilistic template mining
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97

//! INI / .cfg metadata structures

use std::collections::BTreeMap;

use serde::de::{MapAccess, Visitor};
use serde::ser::SerializeStruct;
use serde::{Deserialize, Serialize, Serializer};

use crate::results::MinimalFallback;

/// Recursive type information for an INI value: scalar name or table (key → type).
/// INI has no arrays; sections map to key=value with inferred scalar types.
#[derive(Debug, Clone)]
pub enum IniTypeInfo {
    /// Scalar: "string", "integer", "number", "boolean", "date", "timestamp", "null"
    Scalar(String),
    /// Table: key names → their types (section’s key→type map)
    Table(BTreeMap<String, IniTypeInfo>),
}

impl Serialize for IniTypeInfo {
    fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error> {
        match self {
            IniTypeInfo::Scalar(x) => x.serialize(s),
            IniTypeInfo::Table(m) => m.serialize(s),
        }
    }
}

impl<'de> Deserialize<'de> for IniTypeInfo {
    fn deserialize<D: serde::Deserializer<'de>>(d: D) -> Result<Self, D::Error> {
        d.deserialize_any(IniTypeInfoVisitor)
    }
}

struct IniTypeInfoVisitor;

impl<'de> Visitor<'de> for IniTypeInfoVisitor {
    type Value = IniTypeInfo;

    fn expecting(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
        f.write_str("a string or an object (section table)")
    }

    fn visit_str<E: serde::de::Error>(self, v: &str) -> Result<Self::Value, E> {
        Ok(IniTypeInfo::Scalar(v.to_string()))
    }

    fn visit_string<E: serde::de::Error>(self, v: String) -> Result<Self::Value, E> {
        Ok(IniTypeInfo::Scalar(v))
    }

    fn visit_map<A: MapAccess<'de>>(self, mut map: A) -> Result<Self::Value, A::Error> {
        let mut table = BTreeMap::new();
        while let Some(k) = map.next_key::<String>()? {
            let v = map.next_value::<IniTypeInfo>()?;
            table.insert(k, v);
        }
        Ok(IniTypeInfo::Table(table))
    }
}

/// INI file metadata
#[derive(Debug, Clone, Deserialize, Default)]
pub struct IniMetadata {
    /// File size in bytes
    pub file_size: Option<usize>,
    /// Number of [section] headers
    pub section_count: Option<usize>,
    /// Total number of key=value pairs
    pub key_count: Option<usize>,
    /// Number of comment lines (; or # to EOL)
    pub comment_count: Option<usize>,
    /// Maximum nesting depth (2 for typical INI: section → keys)
    pub max_depth: Option<usize>,
    /// Schema: section name → Table of key → inferred scalar type (same shape as TOML/YAML schema)
    #[serde(skip_serializing_if = "Option::is_none")]
    pub schema: Option<BTreeMap<String, IniTypeInfo>>,
}

impl Serialize for IniMetadata {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        let mut state = serializer.serialize_struct("IniMetadata", 6)?;
        crate::serialize_optional!(state, self.file_size, "file_size");
        crate::serialize_optional!(state, self.section_count, "section_count");
        crate::serialize_optional!(state, self.key_count, "key_count");
        crate::serialize_optional!(state, self.comment_count, "comment_count");
        crate::serialize_optional!(state, self.max_depth, "max_depth");
        crate::serialize_optional!(state, self.schema, "schema");
        state.end()
    }
}

crate::impl_minimal_fallback!(IniMetadata, file_size);