Enum rustc_next_trait_solver::solve::MaybeCause

pub enum MaybeCause {
    Ambiguity,
    Overflow {
        suggest_increasing_limit: bool,
    },
}

Why we failed to evaluate a goal.

Variants

Ambiguity

We failed due to ambiguity. This ambiguity can either be a true ambiguity, i.e. there are multiple different answers, or we hit a case where we just don’t bother, e.g. ?x: Trait goals.

Overflow

We gave up due to an overflow, most often by hitting the recursion limit.

Fields

suggest_increasing_limit: bool

Trait Implementations

impl Clone for MaybeCause

fn clone(&self) -> MaybeCause

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MaybeCause

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

Formats the value using the given formatter.

impl Hash for MaybeCause

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<__CTX> HashStable<__CTX> for MaybeCause

fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )

impl PartialEq for MaybeCause

fn eq(&self, other: &MaybeCause) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I> TypeFoldable<I> for MaybeCause

where I: Interner,

fn try_fold_with<F>( self, _: &mut F, ) -> Result<MaybeCause, <F as FallibleTypeFolder<I>>::Error>

where F: FallibleTypeFolder<I>,

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, _: &mut F) -> MaybeCause

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<I> TypeVisitable<I> for MaybeCause

where I: Interner,

fn visit_with<F>(&self, _: &mut F) -> <F as TypeVisitor<I>>::Result

where F: TypeVisitor<I>,

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl Copy for MaybeCause

impl Eq for MaybeCause

impl StructuralPartialEq for MaybeCause

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 1 byte

Size for each variant:

• Ambiguity: 0 bytes
• Overflow: 1 byte