Struct Solution 

pub struct Solution { /* private fields */ }

The result of solving a graph under one policy.

Implementations

impl Solution

pub fn enabled(&self, id: FuncId) -> CategorySet

The categories a function can raise under the solved policy.

pub fn unwinds(&self, id: FuncId) -> bool

Whether a function can unwind under the solved policy.

pub fn through(&self, call: &CallSite, callee: FuncId) -> CategorySet

The categories of a callee that are visible through a call.

A barrier call contains the callee’s unwinding panics, so only the aborting ones are seen through it.

pub fn is_clean(&self, id: FuncId) -> bool

Whether a function raises nothing the user asked to see.

pub const fn policy(&self) -> Policy

The policy this solution was produced under.

pub fn activity(&self, graph: &Graph, id: FuncId) -> Activity

Which sites and calls of a function are reachable under the policy.

pub const fn follows(&self, call: &CallSite) -> bool

Whether the policy admits an edge.

pub fn cleared_by_suppression( &self, graph: &Graph, selection: Selection, ) -> Result<usize>

How many functions the selection shows are clean only because of the policy.

A function that raises nothing whatever is assumed is not one the suppression cleared, so the answer is the difference between two solutions rather than a count of the clean ones. That costs a second fixpoint over the graph, which is why callers ask for it only when they are about to say something about it. Functions are counted by the names the report prints.

Errors

Returns an error if the second fixpoint does not converge.

Trait Implementations

impl Debug for Solution

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

Formats the value using the given formatter.