Struct ScanState 

pub struct ScanState {
    pub matches: BinaryHeap<Reverse<RawMatch>>,
    pub credential_interner: HashSet<Arc<str>>,
    pub metadata_interner: HashMap<String, Arc<str>>,
    pub ml_score_cache: HashMap<(String, String), f64>,
    pub ml_cache_order: VecDeque<(String, String)>,
    pub ml_cache_bytes: usize,
    pub ml_pending: Vec<MlPendingMatch>,
}

Internal state for a single scan operation (tracks matches and ML cache).

Fields

matches: BinaryHeap<Reverse<RawMatch>>

Matches collected for this chunk, prioritized by confidence. Uses Reverse to make it a min-heap so we can easily pop the LOWEST confidence.

credential_interner: HashSet<Arc<str>>

Interner for credentials found in this chunk to save memory on duplicates.

metadata_interner: HashMap<String, Arc<str>>

Static string cache for detector metadata.

ml_score_cache: HashMap<(String, String), f64>

ml_cache_order: VecDeque<(String, String)>

ml_cache_bytes: usize

ml_pending: Vec<MlPendingMatch>

Detector matches deferred for batch ML scoring at the end of the scan.

Implementations

impl ScanState

pub fn intern_credential(&mut self, s: &str) -> Arc<str>

Intern a credential string, returning an Arc.

pub fn intern_metadata(&mut self, s: &str) -> Arc<str>

Intern a metadata string (detector_id, name, service).

pub fn push_match(&mut self, m: RawMatch, limit: usize)

Push a match to the state, maintaining priority and capacity. High-confidence secrets will displace lower-confidence findings.

pub fn into_matches(self) -> Vec<RawMatch>

Drain all matches into a sorted vector.

Trait Implementations

impl Default for ScanState

fn default() -> ScanState

Returns the “default value” for a type.