pub(crate) fn invalid_vertices(&mut self, mut vertices: Vec<Dependency<C>>) -> HashSet<I> {
        let mut senders = HashSet::new();
        while !vertices.is_empty() {
            let (new_vertices, new_senders) = self.do_drop_dependent_vertices(vertices);
            vertices = new_vertices;
            senders.extend(new_senders);
        }
        senders
    }
/// Drops all vertices that (directly or indirectly) have the specified dependencies, and
/// returns the set of their senders. If the specified dependencies are known to be invalid,
/// those senders must be faulty.
Drops all vertices that (directly or indirectly) have the specified dependencies, and
returns the set of their senders. If the specified dependencies are known to be invalid,
those senders must be faulty.
Drops all vertices that ( directly or indirectly ) have the specified dependencies and returns the set of their senders . If the specified dependencies are known to be invalid those senders must be faulty .
pub(crate) fn invalid_vertices(&mut self, mut vertices: Vec<Dependency<C>>) -> HashSet<I> {
        let mut senders = HashSet::new();
        while !vertices.is_empty() {
            let (new_vertices, new_senders) = self.do_drop_dependent_vertices(vertices);
            vertices = new_vertices;
            senders.extend(new_senders);
        }
        senders
    }
pub ( crate ) fn invalid_vertices ( & mut self , mut vertices : Vec < Dependency < C > > ) -> HashSet < I > { let mut senders = HashSet :: new ( ) ; while ! vertices . is_empty ( ) { let ( new_vertices , new_senders ) = self . do_drop_dependent_vertices ( vertices ) ; vertices = new_vertices ; senders . extend ( new_senders ) ; } senders }
Drops all vertices that (directly or indirectly) have the specified dependencies, and
returns the set of their senders.
Drops all vertices that ( directly or indirectly ) have the specified dependencies and returns the set of their senders .
&mut self
vertices
Vec<Dependency<C>>
&mut self
vertices
Vec<Dependency<C>>