Struct chalk_ir::FnPointer

pub struct FnPointer<I: Interner> {
    pub num_binders: usize,
    pub abi: I::FnAbi,
    pub safety: Safety,
    pub variadic: bool,
    pub substitution: Substitution<I>,
}

for<'a...'z> X -- all binders are instantiated at once, and we use deBruijn indices within self.ty

Fields

num_binders: usize

abi: I::FnAbi

safety: Safety

variadic: bool

substitution: Substitution<I>

Trait Implementations

impl<I: Clone + Interner> Clone for FnPointer<I> where
    I::FnAbi: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Interner> Copy for FnPointer<I> where
    I::InternedSubstitution: Copy, 

impl<I: Interner> Debug for FnPointer<I>

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

Formats the value using the given formatter.

impl<I: Eq + Interner> Eq for FnPointer<I> where
    I::FnAbi: Eq, 

impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for FnPointer<I>

type Result = FnPointer<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 FnPointer<I>

type Interner = I

The interner associated with the type.

impl<I: Hash + Interner> Hash for FnPointer<I> where
    I::FnAbi: Hash, 

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<FnPointer<I>> for FnPointer<I> where
    I::FnAbi: PartialEq, 

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

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

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

This method tests for !=.

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

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

impl<I: Interner> Visit<I> for FnPointer<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.