Struct chalk_solve::rust_ir::FnDefInputsAndOutputDatum

pub struct FnDefInputsAndOutputDatum<I: Interner> {
    pub argument_types: Vec<Ty<I>>,
    pub return_type: Ty<I>,
}

Represents the inputs and outputs on a FnDefDatum. This is split from the where clauses, since these can contain bound lifetimes.

Fields

argument_types: Vec<Ty<I>>

Types of the function's arguments

fn foo<T>(bar: i32, baz: T);
               ^^^       ^

return_type: Ty<I>

Return type of the function

fn foo<T>() -> i32;
               ^^^

Trait Implementations

impl<I: Clone + Interner> Clone for FnDefInputsAndOutputDatum<I>

fn clone(&self) -> FnDefInputsAndOutputDatum<I>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Interner> Debug for FnDefInputsAndOutputDatum<I>

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for FnDefInputsAndOutputDatum<I>

impl<I: Interner, _TI> Fold<I, _TI> for FnDefInputsAndOutputDatum<I> where
    _TI: TargetInterner<I>, 

type Result = FnDefInputsAndOutputDatum<_TI>

The type of value that will be produced once folding is done. Typically this is Self, unless Self contains borrowed values, in which case owned values are produced (for example, one can fold over a &T value where T: Fold, in which case you get back a T, not a &T).

fn fold_with<'i>(
    &self,
    folder: &mut dyn Folder<'i, I, _TI>,
    outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i,
    _TI: 'i, 

Apply the given folder folder to self; binders is the number of binders that are in scope when beginning the folder. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.

impl<I: Interner> HasInterner for FnDefInputsAndOutputDatum<I>

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for FnDefInputsAndOutputDatum<I>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<I: PartialEq + Interner> PartialEq<FnDefInputsAndOutputDatum<I>> for FnDefInputsAndOutputDatum<I>

fn eq(&self, other: &FnDefInputsAndOutputDatum<I>) -> bool

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

fn ne(&self, other: &FnDefInputsAndOutputDatum<I>) -> bool

This method tests for !=.

impl<I: Interner> StructuralEq for FnDefInputsAndOutputDatum<I>

impl<I: Interner> StructuralPartialEq for FnDefInputsAndOutputDatum<I>

impl<I: Interner> Visit<I> for FnDefInputsAndOutputDatum<I>

fn visit_with<'i, R: VisitResult>(
    &self,
    visitor: &mut dyn Visitor<'i, I, Result = R>,
    outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

Apply the given visitor visitor to self; binders is the number of binders that are in scope when beginning the visitor. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.