fn retain_node_views(&self, ids: &HashSet<ast::Id>) {
        let to_remove = {
            let borrowed = self.node_views.borrow();
            let filtered = borrowed.iter().filter(|(id, _)| !ids.contains(id));
            filtered.map(|(k, v)| (*k, *v)).collect_vec()
        };
        for (id, displayed_id) in to_remove {
            self.view.graph().frp.input.remove_node.emit(&displayed_id);
            self.node_views.borrow_mut().remove_by_left(&id);
        }
    }
/// Retain only given nodes in displayed graph.
Retain only given nodes in displayed graph.
Retain only given nodes in displayed graph .
fn retain_node_views(&self, ids: &HashSet<ast::Id>) {
        let to_remove = {
            let borrowed = self.node_views.borrow();
            let filtered = borrowed.iter().filter(|(id, _)| !ids.contains(id));
            filtered.map(|(k, v)| (*k, *v)).collect_vec()
        };
        for (id, displayed_id) in to_remove {
            self.view.graph().frp.input.remove_node.emit(&displayed_id);
            self.node_views.borrow_mut().remove_by_left(&id);
        }
    }
fn retain_node_views ( & self , ids : & HashSet < ast :: Id > ) { let to_remove = { let borrowed = self . node_views . borrow ( ) ; let filtered = borrowed . iter ( ) . filter ( | ( id , _ ) | ! ids . contains ( id ) ) ; filtered . map ( | ( k , v ) | ( * k , * v ) ) . collect_vec ( ) } ; for ( id , displayed_id ) in to_remove { self . view . graph ( ) . frp . input . remove_node . emit ( & displayed_id ) ; self . node_views . borrow_mut ( ) . remove_by_left ( & id ) ; } }
Retain only given nodes in displayed graph.
Retain only given nodes in displayed graph .
&self
ids
&HashSet<ast::Id>
&self
ids
&HashSet<ast::Id>