Struct PrunedSet 

pub struct PrunedSet { /* private fields */ }

Tracks paths already claimed by a rule, so nested candidates are not walked or re-reported.

This wrapper encapsulates the RefCell<HashSet<PathBuf>> to ensure borrow/borrow_mut operations are temporary and cannot overlap.

Implementations

impl PrunedSet

pub fn new() -> Self

Creates a new empty PrunedSet.

pub fn contains(&self, path: &Path) -> bool

Checks if a path is directly in the pruned set.

pub fn insert(&self, path: PathBuf)

Inserts a path into the pruned set.

pub fn is_already_claimed(&self, path: &Path) -> bool

Whether this path overlaps a candidate that has already been reported.

Reporting both a directory and something inside it would count the nested bytes twice in the total and race the two deletions against each other. Rules within a directory are applied in order, so the overlap can be found in either direction: a nested target may be claimed before the parent enclosing it, or after.

Candidates stream to the user as they are found, so the first claim stands and the overlapping one is dropped. That can leave an enclosing directory unreclaimed, which is the safe direction to err for a tool that deletes things.

Returns true if:

• Any ancestor of path is in the pruned set (path is inside a claimed directory)
• Any path in the pruned set starts with path (path is a parent of something claimed)

Trait Implementations

impl Debug for PrunedSet

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

Formats the value using the given formatter.

impl Default for PrunedSet

fn default() -> PrunedSet

Returns the “default value” for a type.