Struct VolumeIndexBuilder 

pub struct VolumeIndexBuilder {
    idx: VolumeIndex,
    parent_frns: Vec<Frn>,
}

Two-pass builder for the initial scan: collect everything, then resolve parents and sort the permutations (scan order ≠ parent-before-child).

Fields

idx: VolumeIndex

parent_frns: Vec<Frn>

Implementations

impl VolumeIndexBuilder

pub fn new(volume_label: &str, root_record: u64) -> Self

volume_label is the root display name, e.g. C:. root_record is the MFT record number of the root directory (5 on NTFS).

pub fn push(&mut self, e: RawEntry<'_>)

Append a scanned entry with a provisional ROOT parent; the real parent is resolved later in Self::finish once the FRN index exists.

pub fn push_encoded(&mut self, e: EncodedEntry<'_>)

Append an entry whose name was WTF-8 encoded off-thread (parallel scan workers). Identical semantics to Self::push.

pub const fn len(&self) -> usize

The number of entries pushed so far (including the root).

pub const fn is_empty(&self) -> bool

True when no entries have been pushed (never true after Self::new, which seeds the root).

pub fn finish(self) -> VolumeIndex

Run the two-pass finalization and return the queryable VolumeIndex, discarding the stage timings.

pub fn finish_timed(self) -> (VolumeIndex, FinishTimings)

Run the two-pass finalization (resolve parents, propagate EXCLUDED, build the name sort) and return the VolumeIndex with stage timings.