pub fn add_edge_to_move_fun_call_graph(
        &mut self,
        caller_mid: ModuleId,
        caller_fid: SpecFunId,
        callee_mid: ModuleId,
        callee_fid: SpecFunId,
    ) {
        self.move_fun_call_graph
            .entry(caller_mid.qualified(caller_fid))
            .or_insert_with(BTreeSet::new)
            .insert(callee_mid.qualified(callee_fid));
    }
/// Adds an edge from the caller to the callee to the Move fun call graph.
Adds an edge from the caller to the callee to the Move fun call graph.
Adds an edge from the caller to the callee to the Move fun call graph .
pub fn add_edge_to_move_fun_call_graph(
        &mut self,
        caller_mid: ModuleId,
        caller_fid: SpecFunId,
        callee_mid: ModuleId,
        callee_fid: SpecFunId,
    ) {
        self.move_fun_call_graph
            .entry(caller_mid.qualified(caller_fid))
            .or_insert_with(BTreeSet::new)
            .insert(callee_mid.qualified(callee_fid));
    }
pub fn add_edge_to_move_fun_call_graph ( & mut self , caller_mid : ModuleId , caller_fid : SpecFunId , callee_mid : ModuleId , callee_fid : SpecFunId , ) { self . move_fun_call_graph . entry ( caller_mid . qualified ( caller_fid ) ) . or_insert_with ( BTreeSet :: new ) . insert ( callee_mid . qualified ( callee_fid ) ) ; }
Adds an edge from the caller to the callee to the Move fun call graph.
Adds an edge from the caller to the callee to the Move fun call graph .
&mut self
caller_mid
ModuleId
caller_fid
SpecFunId
callee_mid
ModuleId
callee_fid
SpecFunId
&mut self
caller_mid
ModuleId
caller_fid
SpecFunId
callee_mid
ModuleId
callee_fid
SpecFunId