pub struct GraphLimits {
pub max_depth: usize,
pub max_nodes: usize,
pub max_references: usize,
pub max_bytes: usize,
}Expand description
Resource ceilings for one verification graph.
Fields§
§max_depth: usizeMaximum graph edges followed from the active manifest.
max_nodes: usizeMaximum distinct manifests visited, including append-history stores.
max_references: usizeMaximum references examined across the pass.
max_bytes: usizeMaximum cumulative JUMBF bytes of visited manifests and predecessor stores.
Implementations§
Trait Implementations§
Source§impl Clone for GraphLimits
impl Clone for GraphLimits
impl Copy for GraphLimits
Source§impl Debug for GraphLimits
impl Debug for GraphLimits
Source§impl Default for GraphLimits
impl Default for GraphLimits
impl Eq for GraphLimits
Source§impl PartialEq for GraphLimits
impl PartialEq for GraphLimits
impl StructuralPartialEq for GraphLimits
Auto Trait Implementations§
impl Freeze for GraphLimits
impl RefUnwindSafe for GraphLimits
impl Send for GraphLimits
impl Sync for GraphLimits
impl Unpin for GraphLimits
impl UnsafeUnpin for GraphLimits
impl UnwindSafe for GraphLimits
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.