#[non_exhaustive]pub enum Refusal {
#[non_exhaustive] Stopped {
phase: Phase,
},
#[non_exhaustive] Memory {
phase: Phase,
limit_bytes: u64,
needed_bytes: Option<u64>,
},
#[non_exhaustive] Occurrences {
occurrences: u64,
limit: u64,
},
#[non_exhaustive] Terms {
terms: u64,
limit: u64,
},
#[non_exhaustive] Output {
what: &'static str,
estimate_bytes: u64,
limit_bytes: u64,
least_bytes: Option<u64>,
},
#[non_exhaustive] Work {
limit: u64,
},
#[non_exhaustive] Pixels {
pixels: u64,
limit: u64,
},
#[non_exhaustive] Elimination {
what: Bound,
limit: u64,
},
#[non_exhaustive] Atoms {
atoms: u64,
limit: u64,
},
#[non_exhaustive] Workspace {
what: Held,
count: u64,
limit: u64,
},
#[non_exhaustive] Index {
what: Space,
count: u64,
most: u64,
},
}Expand description
Why a call was given up without an answer: a bound, set or default, refused it, or the caller’s stop ended it. A refusal says nothing of the input. With the bound lifted, the call may answer.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
#[non_exhaustive]Stopped
The caller’s stop ended the call.
Fields
This variant is marked as non-exhaustive
#[non_exhaustive]Memory
The call would have held more memory than its bound.
Fields
This variant is marked as non-exhaustive
limit_bytes: u64The bound, Limits::memory_bytes.
#[non_exhaustive]Occurrences
A sequent unfolds to more occurrences than the bound. The count is exact, or the number at which counting stopped.
Fields
This variant is marked as non-exhaustive
limit: u64The bound, Limits::occurrences.
#[non_exhaustive]Terms
A sequent’s atoms unfold to more first-order terms than the bound, or a proof’s instance table holds more entries. The count is exact, or the number at which counting stopped.
Fields
This variant is marked as non-exhaustive
limit: u64The bound, Limits::terms.
#[non_exhaustive]Output
An output is estimated past its bound. Nothing was made.
Fields
This variant is marked as non-exhaustive
limit_bytes: u64The bound, Limits::derivation_bytes.
#[non_exhaustive]Work
A call did the most work its bound allows.
Fields
This variant is marked as non-exhaustive
limit: u64The bound, Limits::work.
#[non_exhaustive]Pixels
An image would have more pixels than its options allow.
Fields
This variant is marked as non-exhaustive
#[non_exhaustive]Elimination
Cut elimination reached its bound on steps or on a proof’s nodes.
Fields
This variant is marked as non-exhaustive
limit: u64Its value, cut::Options::steps
or cut::Options::nodes.
#[non_exhaustive]Atoms
A truth table would have more atoms than the bound, and so more rows than it allows.
Fields
This variant is marked as non-exhaustive
limit: u64The bound, Limits::table_atoms.
#[non_exhaustive]Workspace
A workspace would hold more than a bound of
Limits::workspace allows.
Fields
This variant is marked as non-exhaustive
#[non_exhaustive]Index
A count passes what a representation’s indices can name, whatever the bounds say.
Fields
This variant is marked as non-exhaustive
Implementations§
Source§impl Refusal
impl Refusal
Sourcepub const fn code(&self) -> &'static str
pub const fn code(&self) -> &'static str
Returns the stable name of the refusal that a program branches on.
Trait Implementations§
impl Eq for Refusal
Source§impl Error for Refusal
impl Error for Refusal
1.30.0 · Source§fn source(&self) -> Option<&(dyn Error + 'static)>
fn source(&self) -> Option<&(dyn Error + 'static)>
1.0.0 · Source§fn description(&self) -> &str
fn description(&self) -> &str
use the Display impl or to_string()
impl StructuralPartialEq for Refusal
Auto Trait Implementations§
impl Forget for Refusal
impl Freeze for Refusal
impl Move for Refusal
impl RefUnwindSafe for Refusal
impl Send for Refusal
impl Sync for Refusal
impl Unpin for Refusal
impl UnsafeUnpin for Refusal
impl UnwindSafe for Refusal
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
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
key and return true if they are equal.impl<T> ErasedDestructor for Twhere
T: 'static,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<U, T> ToOwnedObj<U> for Twhere
U: FromObjRef<T>,
impl<U, T> ToOwnedObj<U> for Twhere
U: FromObjRef<T>,
Source§fn to_owned_obj(&self, data: FontData<'_>) -> U
fn to_owned_obj(&self, data: FontData<'_>) -> U
T, using the provided data to resolve any offsets.