# Function cargo::util::dependency_queue::depth

source ·

    fn depth<'a, N: Hash + Eq + Clone, E: Hash + Eq + Clone>(
        key: &N,
        map: &HashMap<N, HashMap<E, HashSet<N>>>,
        results: &'a mut HashMap<N, HashSet<N>>
    ) -> &'a HashSet<N>

Expand description

Creates a flattened reverse dependency list. For a given key, finds the set of nodes which depend on it, including transitively. This is different from self.reverse_dep_map because self.reverse_dep_map only maps one level of reverse dependencies.