pub enum GraphLimitKind {
Depth,
Nodes,
References,
Bytes,
}Expand description
The graph ceiling that stopped parse-only discovery.
Variants§
Depth
Maximum traversal depth.
Nodes
Maximum distinct manifest nodes.
References
Maximum examined references.
Bytes
Maximum cumulative visited JUMBF bytes.
Trait Implementations§
Source§impl Clone for GraphLimitKind
impl Clone for GraphLimitKind
impl Copy for GraphLimitKind
Source§impl Debug for GraphLimitKind
impl Debug for GraphLimitKind
impl Eq for GraphLimitKind
Source§impl Hash for GraphLimitKind
impl Hash for GraphLimitKind
Source§impl PartialEq for GraphLimitKind
impl PartialEq for GraphLimitKind
impl StructuralPartialEq for GraphLimitKind
Auto Trait Implementations§
impl Freeze for GraphLimitKind
impl RefUnwindSafe for GraphLimitKind
impl Send for GraphLimitKind
impl Sync for GraphLimitKind
impl Unpin for GraphLimitKind
impl UnsafeUnpin for GraphLimitKind
impl UnwindSafe for GraphLimitKind
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.