use std::collections::HashSet;

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

            let mut paths = Vec::with_capacity(inodes.len());

            let mut paths = BTreeSet::new();

                    paths.push(path)

                    paths.insert(path);

            }
            if paths.is_empty() {
                paths.insert(String::from(""));

            let mut last = None;

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

                        &path,

                        path,

                last = Some(path)

            if paths.is_empty() {
                conflicts.extend(
                    libpijul::output::output_repository_no_pending(
                        &repo.working_copy,
                        &repo.changes,
                        &txn,
                        &channel,
                        "",
                        true,
                        None,
                        num_cpus::get(),
                        0,
                    )?
                    .into_iter(),
                );
            }