Struct WaitGraph 

pub struct WaitGraph { /* private fields */ }

Wait-for graph for deadlock detection

Implementations

impl WaitGraph

pub fn new() -> Self

Create a new empty wait-for graph

pub fn add_edge(&mut self, from: u64, to: u64)

Add an edge: process from is waiting for process to

pub fn remove_edges(&mut self, from: u64)

Remove all edges from a process (it’s no longer waiting)

pub fn has_cycle(&self) -> bool

Check if the graph contains a cycle (deadlock)

pub fn node_count(&self) -> usize

Get the number of nodes in the graph

Trait Implementations

impl Clone for WaitGraph

fn clone(&self) -> WaitGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for WaitGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for WaitGraph

fn default() -> WaitGraph

Returns the “default value” for a type.