Struct QueryInput

pub struct QueryInput<I, P>
where
    I: Interner,
{
    pub goal: Goal<I, P>,
    pub predefined_opaques_in_body: <I as Interner>::PredefinedOpaques,
}

Fields

goal: Goal<I, P>

predefined_opaques_in_body: <I as Interner>::PredefinedOpaques

Trait Implementations

impl<I, P> Clone for QueryInput<I, P>

where I: Interner, Goal<I, P>: Clone,

fn clone(&self) -> QueryInput<I, P>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I, P> Debug for QueryInput<I, P>

where I: Interner, Goal<I, P>: Debug,

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

Formats the value using the given formatter.

impl<I, P, __D> Decodable<__D> for QueryInput<I, P>

where I: Interner, __D: TyDecoder<I = I>, Goal<I, P>: Decodable<__D>, <I as Interner>::PredefinedOpaques: Decodable<__D>,

fn decode(__decoder: &mut __D) -> QueryInput<I, P>

impl<I, P, __E> Encodable<__E> for QueryInput<I, P>

where I: Interner, __E: TyEncoder<I = I>, Goal<I, P>: Encodable<__E>, <I as Interner>::PredefinedOpaques: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<I, P> Hash for QueryInput<I, P>

where I: Interner, Goal<I, P>: Hash,

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<I, P, __CTX> HashStable<__CTX> for QueryInput<I, P>

where I: Interner, Goal<I, P>: HashStable<__CTX>, <I as Interner>::PredefinedOpaques: HashStable<__CTX>,

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

impl<I, P> PartialEq for QueryInput<I, P>

where I: Interner, Goal<I, P>: PartialEq,

fn eq(&self, __other: &QueryInput<I, P>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<I, P> TypeFoldable<I> for QueryInput<I, P>

where I: Interner, Goal<I, P>: TypeFoldable<I>, <I as Interner>::PredefinedOpaques: TypeFoldable<I>,

fn try_fold_with<__F>( self, __folder: &mut __F, ) -> Result<QueryInput<I, P>, <__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, folder: &mut F) -> Self

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, P> TypeVisitable<I> for QueryInput<I, P>

where I: Interner, Goal<I, P>: TypeVisitable<I>, <I as Interner>::PredefinedOpaques: TypeVisitable<I>,

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

where __V: TypeVisitor<I>,

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

impl<I, P> Copy for QueryInput<I, P>

where I: Interner, Goal<I, P>: Copy,

impl<I, P> Eq for QueryInput<I, P>

where I: Interner, Goal<I, P>: Eq,

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.