use std::collections::HashSet;

use std::collections::{BTreeSet, HashSet};

            let mut touched_paths: Vec<_> = Vec::new();

            let mut touched_paths = BTreeSet::new();

                        touched_paths.push(path)

                        touched_paths.insert(path);

            touched_paths.sort();
            let mut last = "";

            let mut last = None;

                if !last.is_empty() && path.starts_with(last) {
                    continue;

                match last {
                    Some(last_path) if path.starts_with(last_path) => continue,
                    _ => (),

                last = path

                last = Some(path)