Struct Closure

Source

#[repr(C)]pub(super) struct Closure<'a> {
    call: extern "C" fn(*mut Env, Buffer) -> Buffer,
    env: *mut Env,
    _marker: PhantomData<*mut &'a mut ()>,
}

🔬This is a nightly-only experimental API. (proc_macro_internals)

Fields§

§call: extern "C" fn(*mut Env, Buffer) -> Buffer

🔬This is a nightly-only experimental API. (proc_macro_internals)

§env: *mut Env

🔬This is a nightly-only experimental API. (proc_macro_internals)

§_marker: PhantomData<*mut &'a mut ()>

🔬This is a nightly-only experimental API. (proc_macro_internals)

Implementations§

Source §

impl<'a> Closure<'a>

Source

pub(super) fn call(&mut self, arg: Buffer) -> Buffer

🔬This is a nightly-only experimental API. (proc_macro_internals)

Trait Implementations§

Source §

impl<'a, F: FnMut(Buffer) -> Buffer> From<&'a mut F> for Closure<'a>

Source §

fn from(f: &'a mut F) -> Self

Converts to this type from the input type.

Auto Trait Implementations§

§

impl<'a> UnwindSafe for Closure<'a>

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> SizeHint for T
where T: ?Sized,

Source §

default fn lower_bound(&self) -> usize

🔬This is a nightly-only experimental API. (core_io_internals)

Returns a lower bound on the number of elements this container-like item contains. For example, an array [u8; 12] could return any value between 0 and 12 inclusively as a correct implementation. Read more

Source §