Struct test_generation::abstract_state::CallGraph
source · pub struct CallGraph { /* private fields */ }
Implementations§
source§impl CallGraph
impl CallGraph
pub fn new(max_function_handle_index: usize) -> Self
pub fn add_call( &mut self, caller: FunctionHandleIndex, callee: FunctionHandleIndex )
pub fn can_call(&self, my_index: FunctionHandleIndex) -> Vec<FunctionHandleIndex> ⓘ
pub fn max_calling_depth(&self, index: FunctionHandleIndex) -> usize
sourcepub fn call_depth(
&self,
caller: FunctionHandleIndex,
callee: FunctionHandleIndex
) -> Option<usize>
pub fn call_depth( &self, caller: FunctionHandleIndex, callee: FunctionHandleIndex ) -> Option<usize>
None if recursive, Some(index) if non-recursive, and index is the length of the maximal call graph path originating at caller, and calling through callee.
Trait Implementations§
source§impl PartialEq<CallGraph> for CallGraph
impl PartialEq<CallGraph> for CallGraph
impl Eq for CallGraph
impl StructuralEq for CallGraph
impl StructuralPartialEq for CallGraph
Auto Trait Implementations§
impl RefUnwindSafe for CallGraph
impl Send for CallGraph
impl Sync for CallGraph
impl Unpin for CallGraph
impl UnwindSafe for CallGraph
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.