Type Alias precompile_utils::testing::handle::SubcallHandle

impl<T> Box<T>

1.0.0 · source

pub fn new(x: T) -> Box<T>

Allocates memory on the heap and then places x into it.

This doesn’t actually allocate if T is zero-sized.

§Examples

let five = Box::new(5);

pub fn new_uninit() -> Box<MaybeUninit<T>>

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

Constructs a new box with uninitialized contents.

§Examples

#![feature(new_uninit)]

let mut five = Box::<u32>::new_uninit();

let five = unsafe {
    // Deferred initialization:
    five.as_mut_ptr().write(5);

    five.assume_init()
};

assert_eq!(*five, 5)

pub fn new_zeroed() -> Box<MaybeUninit<T>>

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

Constructs a new Box with uninitialized contents, with the memory being filled with 0 bytes.

See MaybeUninit::zeroed for examples of correct and incorrect usage of this method.

§Examples

#![feature(new_uninit)]

let zero = Box::<u32>::new_zeroed();
let zero = unsafe { zero.assume_init() };

assert_eq!(*zero, 0)

1.33.0 · source

pub fn pin(x: T) -> Pin<Box<T>>

Constructs a new Pin<Box<T>>. If T does not implement Unpin, then x will be pinned in memory and unable to be moved.

Constructing and pinning of the Box can also be done in two steps: Box::pin(x) does the same as Box::into_pin(Box::new(x)). Consider using into_pin if you already have a Box<T>, or if you want to construct a (pinned) Box in a different way than with Box::new.

pub fn try_new(x: T) -> Result<Box<T>, AllocError>

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

Allocates memory on the heap then places x into it, returning an error if the allocation fails

This doesn’t actually allocate if T is zero-sized.

§Examples

#![feature(allocator_api)]

let five = Box::try_new(5)?;

pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>

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

Constructs a new box with uninitialized contents on the heap, returning an error if the allocation fails

§Examples

#![feature(allocator_api, new_uninit)]

let mut five = Box::<u32>::try_new_uninit()?;

let five = unsafe {
    // Deferred initialization:
    five.as_mut_ptr().write(5);

    five.assume_init()
};

assert_eq!(*five, 5);

pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>

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

Constructs a new Box with uninitialized contents, with the memory being filled with 0 bytes on the heap

See MaybeUninit::zeroed for examples of correct and incorrect usage of this method.

§Examples

#![feature(allocator_api, new_uninit)]

let zero = Box::<u32>::try_new_zeroed()?;
let zero = unsafe { zero.assume_init() };

assert_eq!(*zero, 0);

impl<T, A> Box<T, A>
where A: Allocator,

pub fn new_in(x: T, alloc: A) -> Box<T, A>
where A: Allocator,

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

Allocates memory in the given allocator then places x into it.

This doesn’t actually allocate if T is zero-sized.

§Examples

#![feature(allocator_api)]

use std::alloc::System;

let five = Box::new_in(5, System);

pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>
where A: Allocator,

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

Allocates memory in the given allocator then places x into it, returning an error if the allocation fails

This doesn’t actually allocate if T is zero-sized.

§Examples

#![feature(allocator_api)]

use std::alloc::System;

let five = Box::try_new_in(5, System)?;

pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>
where A: Allocator,

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

Constructs a new box with uninitialized contents in the provided allocator.

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

let mut five = Box::<u32, _>::new_uninit_in(System);

let five = unsafe {
    // Deferred initialization:
    five.as_mut_ptr().write(5);

    five.assume_init()
};

assert_eq!(*five, 5)

pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
where A: Allocator,

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

Constructs a new box with uninitialized contents in the provided allocator, returning an error if the allocation fails

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

let mut five = Box::<u32, _>::try_new_uninit_in(System)?;

let five = unsafe {
    // Deferred initialization:
    five.as_mut_ptr().write(5);

    five.assume_init()
};

assert_eq!(*five, 5);

pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>
where A: Allocator,

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

Constructs a new Box with uninitialized contents, with the memory being filled with 0 bytes in the provided allocator.

See MaybeUninit::zeroed for examples of correct and incorrect usage of this method.

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

let zero = Box::<u32, _>::new_zeroed_in(System);
let zero = unsafe { zero.assume_init() };

assert_eq!(*zero, 0)

pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
where A: Allocator,

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

Constructs a new Box with uninitialized contents, with the memory being filled with 0 bytes in the provided allocator, returning an error if the allocation fails,

See MaybeUninit::zeroed for examples of correct and incorrect usage of this method.

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

let zero = Box::<u32, _>::try_new_zeroed_in(System)?;
let zero = unsafe { zero.assume_init() };

assert_eq!(*zero, 0);

pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>
where A: 'static + Allocator,

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

Constructs a new Pin<Box<T, A>>. If T does not implement Unpin, then x will be pinned in memory and unable to be moved.

Constructing and pinning of the Box can also be done in two steps: Box::pin_in(x, alloc) does the same as Box::into_pin(Box::new_in(x, alloc)). Consider using into_pin if you already have a Box<T, A>, or if you want to construct a (pinned) Box in a different way than with Box::new_in.

pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>

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

Converts a Box<T> into a Box<[T]>

This conversion does not allocate on the heap and happens in place.

pub fn into_inner(boxed: Box<T, A>) -> T

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

Consumes the Box, returning the wrapped value.

§Examples

#![feature(box_into_inner)]

let c = Box::new(5);

assert_eq!(Box::into_inner(c), 5);

impl<T> Box<T>
where T: ?Sized,

1.4.0 · source

pub unsafe fn from_raw(raw: *mut T) -> Box<T>

Constructs a box from a raw pointer.

After calling this function, the raw pointer is owned by the resulting Box. Specifically, the Box destructor will call the destructor of T and free the allocated memory. For this to be safe, the memory must have been allocated in accordance with the memory layout used by Box .

§Safety

This function is unsafe because improper use may lead to memory problems. For example, a double-free may occur if the function is called twice on the same raw pointer.

The safety conditions are described in the memory layout section.

§Examples

Recreate a Box which was previously converted to a raw pointer using Box::into_raw:

let x = Box::new(5);
let ptr = Box::into_raw(x);
let x = unsafe { Box::from_raw(ptr) };

Manually create a Box from scratch by using the global allocator:

use std::alloc::{alloc, Layout};

unsafe {
    let ptr = alloc(Layout::new::<i32>()) as *mut i32;
    // In general .write is required to avoid attempting to destruct
    // the (uninitialized) previous contents of `ptr`, though for this
    // simple example `*ptr = 5` would have worked as well.
    ptr.write(5);
    let x = Box::from_raw(ptr);
}

impl<T, A> Box<T, A>
where A: Allocator, T: ?Sized,

const: unstable · source

pub unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>

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

Constructs a box from a raw pointer in the given allocator.

After calling this function, the raw pointer is owned by the resulting Box. Specifically, the Box destructor will call the destructor of T and free the allocated memory. For this to be safe, the memory must have been allocated in accordance with the memory layout used by Box .

§Safety

This function is unsafe because improper use may lead to memory problems. For example, a double-free may occur if the function is called twice on the same raw pointer.

§Examples

Recreate a Box which was previously converted to a raw pointer using Box::into_raw_with_allocator:

#![feature(allocator_api)]

use std::alloc::System;

let x = Box::new_in(5, System);
let (ptr, alloc) = Box::into_raw_with_allocator(x);
let x = unsafe { Box::from_raw_in(ptr, alloc) };

Manually create a Box from scratch by using the system allocator:

#![feature(allocator_api, slice_ptr_get)]

use std::alloc::{Allocator, Layout, System};

unsafe {
    let ptr = System.allocate(Layout::new::<i32>())?.as_mut_ptr() as *mut i32;
    // In general .write is required to avoid attempting to destruct
    // the (uninitialized) previous contents of `ptr`, though for this
    // simple example `*ptr = 5` would have worked as well.
    ptr.write(5);
    let x = Box::from_raw_in(ptr, System);
}

1.4.0 · source

pub fn into_raw(b: Box<T, A>) -> *mut T

Consumes the Box, returning a wrapped raw pointer.

The pointer will be properly aligned and non-null.

After calling this function, the caller is responsible for the memory previously managed by the Box. In particular, the caller should properly destroy T and release the memory, taking into account the memory layout used by Box. The easiest way to do this is to convert the raw pointer back into a Box with the Box::from_raw function, allowing the Box destructor to perform the cleanup.

Note: this is an associated function, which means that you have to call it as Box::into_raw(b) instead of b.into_raw(). This is so that there is no conflict with a method on the inner type.

§Examples

Converting the raw pointer back into a Box with Box::from_raw for automatic cleanup:

let x = Box::new(String::from("Hello"));
let ptr = Box::into_raw(x);
let x = unsafe { Box::from_raw(ptr) };

Manual cleanup by explicitly running the destructor and deallocating the memory:

use std::alloc::{dealloc, Layout};
use std::ptr;

let x = Box::new(String::from("Hello"));
let ptr = Box::into_raw(x);
unsafe {
    ptr::drop_in_place(ptr);
    dealloc(ptr as *mut u8, Layout::new::<String>());
}

Note: This is equivalent to the following:

let x = Box::new(String::from("Hello"));
let ptr = Box::into_raw(x);
unsafe {
    drop(Box::from_raw(ptr));
}

pub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)

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

Consumes the Box, returning a wrapped raw pointer and the allocator.

The pointer will be properly aligned and non-null.

After calling this function, the caller is responsible for the memory previously managed by the Box. In particular, the caller should properly destroy T and release the memory, taking into account the memory layout used by Box. The easiest way to do this is to convert the raw pointer back into a Box with the Box::from_raw_in function, allowing the Box destructor to perform the cleanup.

Note: this is an associated function, which means that you have to call it as Box::into_raw_with_allocator(b) instead of b.into_raw_with_allocator(). This is so that there is no conflict with a method on the inner type.

§Examples

Converting the raw pointer back into a Box with Box::from_raw_in for automatic cleanup:

#![feature(allocator_api)]

use std::alloc::System;

let x = Box::new_in(String::from("Hello"), System);
let (ptr, alloc) = Box::into_raw_with_allocator(x);
let x = unsafe { Box::from_raw_in(ptr, alloc) };

Manual cleanup by explicitly running the destructor and deallocating the memory:

#![feature(allocator_api)]

use std::alloc::{Allocator, Layout, System};
use std::ptr::{self, NonNull};

let x = Box::new_in(String::from("Hello"), System);
let (ptr, alloc) = Box::into_raw_with_allocator(x);
unsafe {
    ptr::drop_in_place(ptr);
    let non_null = NonNull::new_unchecked(ptr);
    alloc.deallocate(non_null.cast(), Layout::new::<String>());
}

const: unstable · source

pub fn allocator(b: &Box<T, A>) -> &A

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

Returns a reference to the underlying allocator.

Note: this is an associated function, which means that you have to call it as Box::allocator(&b) instead of b.allocator(). This is so that there is no conflict with a method on the inner type.

1.26.0 · source

pub fn leak<'a>(b: Box<T, A>) -> &'a mut T
where A: 'a,

Consumes and leaks the Box, returning a mutable reference, &'a mut T. Note that the type T must outlive the chosen lifetime 'a. If the type has only static references, or none at all, then this may be chosen to be 'static.

This function is mainly useful for data that lives for the remainder of the program’s life. Dropping the returned reference will cause a memory leak. If this is not acceptable, the reference should first be wrapped with the Box::from_raw function producing a Box. This Box can then be dropped which will properly destroy T and release the allocated memory.

Note: this is an associated function, which means that you have to call it as Box::leak(b) instead of b.leak(). This is so that there is no conflict with a method on the inner type.

§Examples

Simple usage:

let x = Box::new(41);
let static_ref: &'static mut usize = Box::leak(x);
*static_ref += 1;
assert_eq!(*static_ref, 42);

Unsized data:

let x = vec![1, 2, 3].into_boxed_slice();
let static_ref = Box::leak(x);
static_ref[0] = 4;
assert_eq!(*static_ref, [4, 2, 3]);

1.63.0 (const: unstable) · source

pub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>
where A: 'static,

Converts a Box<T> into a Pin<Box<T>>. If T does not implement Unpin, then *boxed will be pinned in memory and unable to be moved.

This conversion does not allocate on the heap and happens in place.

This is also available via From.

Constructing and pinning a Box with Box::into_pin(Box::new(x)) can also be written more concisely using Box::pin(x). This into_pin method is useful if you already have a Box<T>, or you are constructing a (pinned) Box in a different way than with Box::new.

§Notes

It’s not recommended that crates add an impl like From<Box<T>> for Pin<T>, as it’ll introduce an ambiguity when calling Pin::from. A demonstration of such a poor impl is shown below.

struct Foo; // A type defined in this crate.
impl From<Box<()>> for Pin<Foo> {
    fn from(_: Box<()>) -> Pin<Foo> {
        Pin::new(Foo)
    }
}

let foo = Box::new(());
let bar = Pin::from(foo);

Trait Implementations

1.0.0 · source§

impl<S> Seek for Box<S>
where S: Seek + ?Sized,

fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>

Seek to an offset, in bytes, in a stream. Read more

fn stream_position(&mut self) -> Result<u64, Error>

Returns the current seek position from the start of the stream. Read more

1.55.0 · source§

fn rewind(&mut self) -> Result<(), Error>

Rewind to the beginning of a stream. Read more

fn stream_len(&mut self) -> Result<u64, Error>

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

Returns the length of this stream (in bytes). Read more

fn seek_relative(&mut self, offset: i64) -> Result<(), Error>

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

Seeks relative to the current position. Read more

1.0.0 · source§

impl<W> Write for Box<W>
where W: Write + ?Sized,

fn write(&mut self, buf: &[u8]) -> Result<usize, Error>

Write a buffer into this writer, returning how many bytes were written. Read more

fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>

Like write, except that it writes from a slice of buffers. Read more

fn is_write_vectored(&self) -> bool

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

Determines if this Writer has an efficient write_vectored implementation. Read more

fn flush(&mut self) -> Result<(), Error>

Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more

fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>

Attempts to write an entire buffer into this writer. Read more

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

Writes a formatted string into this writer, returning any error encountered. Read more

fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>

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

Attempts to write multiple buffers into this writer. Read more

1.0.0 · source§

fn by_ref(&mut self) -> &mut Self
where Self: Sized,

Creates a “by reference” adapter for this instance of Write. Read more

1.63.0 · source§

impl<T> AsRawFd for Box<T>
where T: AsRawFd,

fn as_raw_fd(&self) -> i32

Extracts the raw file descriptor. Read more

1.0.0 · source§

impl BufRead for Box
where B: BufRead + ?Sized,

fn fill_buf(&mut self) -> Result<&[u8], Error>

Returns the contents of the internal buffer, filling it with more data from the inner reader if it is empty. Read more

fn consume(&mut self, amt: usize)

Tells this buffer that amt bytes have been consumed from the buffer, so they should no longer be returned in calls to read. Read more

fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes into buf until the delimiter byte or EOF is reached. Read more

fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until a newline (the 0xA byte) is reached, and append them to the provided String buffer. Read more

fn has_data_left(&mut self) -> Result<bool, Error>

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

Check if the underlying Read has any data left to be read. Read more

fn skip_until(&mut self, byte: u8) -> Result<usize, Error>

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

Skip all bytes until the delimiter byte or EOF is reached. Read more

1.0.0 · source§

fn split(self, byte: u8) -> Split<Self>
where Self: Sized,

Returns an iterator over the contents of this reader split on the byte byte. Read more

1.0.0 · source§

fn lines(self) -> Lines<Self>
where Self: Sized,

Returns an iterator over the lines of this reader. Read more

1.0.0 · source§

impl<R> Read for Box<R>
where R: Read + ?Sized,

fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>

Pull some bytes from this source into the specified buffer, returning how many bytes were read. Read more

fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

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

Pull some bytes from this source into the specified buffer. Read more

fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>

Like read, except that it reads into a slice of buffers. Read more

fn is_read_vectored(&self) -> bool

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

Determines if this Reader has an efficient read_vectored implementation. Read more

fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>

Read all bytes until EOF in this source, placing them into buf. Read more

fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>

Read all bytes until EOF in this source, appending them to buf. Read more

fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>

Read the exact number of bytes required to fill buf. Read more

fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>

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

Read the exact number of bytes required to fill cursor. Read more

1.0.0 · source§

fn by_ref(&mut self) -> &mut Self
where Self: Sized,

Creates a “by reference” adaptor for this instance of Read. Read more

1.0.0 · source§

fn bytes(self) -> Bytes<Self>
where Self: Sized,

Transforms this Read instance to an Iterator over its bytes. Read more

1.0.0 · source§

fn chain<R>(self, next: R) -> Chain<Self, R>
where R: Read, Self: Sized,

Creates an adapter which will chain this stream with another. Read more

1.0.0 · source§

fn take(self, limit: u64) -> Take<Self>
where Self: Sized,

Creates an adapter which will read at most limit bytes from it. Read more

1.64.0 · source§

impl<T> AsFd for Box<T>
where T: AsFd,

fn as_fd(&self) -> BorrowedFd<'_>

Borrows the file descriptor. Read more

1.0.0 · source§

impl<T> Default for Box<T>
where T: Default,

fn default() -> Box<T>

Creates a Box<T>, with the Default value for T.

1.0.0 · source§

impl<I, A> ExactSizeIterator for Box<I, A>
where I: ExactSizeIterator + ?Sized, A: Allocator,

fn len(&self) -> usize

Returns the exact remaining length of the iterator. Read more

fn is_empty(&self) -> bool

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

Returns true if the iterator is empty. Read more

1.8.0 · source§

impl<T> Error for Box<T>
where T: Error,

fn description(&self) -> &str

👎Deprecated since 1.42.0: use the Display impl or to_string()

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any. Read more

fn provide<'b>(&'b self, request: &mut Request<'b>)

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

Provides type based access to context intended for error reports. Read more

1.0.0 · source§

impl<T, A> Display for Box<T, A>
where T: Display + ?Sized, A: Allocator,

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

Formats the value using the given formatter. Read more

impl<G, R, A> Coroutine<R> for Box<G, A>
where G: Coroutine<R> + Unpin + ?Sized, A: Allocator + 'static,

type Yield = <G as Coroutine<R>>::Yield

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

The type of value this coroutine yields. Read more

type Return = <G as Coroutine<R>>::Return

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

The type of value this coroutine returns. Read more

fn resume( self: Pin<&mut Box<G, A>>, arg: R ) -> CoroutineState<<Box<G, A> as Coroutine<R>>::Yield, <Box<G, A> as Coroutine<R>>::Return>

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

Resumes the execution of this coroutine. Read more

1.0.0 · source§

impl<T, A> Eq for Box<T, A>
where T: Eq + ?Sized, A: Allocator,

impl<S> AsyncIterator for Box<S>
where S: AsyncIterator + Unpin + ?Sized,

type Item = <S as AsyncIterator>::Item

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

The type of items yielded by the async iterator.

fn poll_next( self: Pin<&mut Box<S>>, cx: &mut Context<'_> ) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>

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

Attempt to pull out the next value of this async iterator, registering the current task for wakeup if the value is not yet available, and returning None if the async iterator is exhausted. Read more

fn size_hint(&self) -> (usize, Option<usize>)

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

Returns the bounds on the remaining length of the async iterator. Read more

1.35.0 · source§

impl<Args, F, A> FnMut<Args> for Box<F, A>
where Args: Tuple, F: FnMut<Args> + ?Sized, A: Allocator,

extern "rust-call" fn call_mut( &mut self, args: Args ) -> <Box<F, A> as FnOnce<Args>>::Output

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

Performs the call operation.

1.1.0 · source§

impl<T, A> Borrow<T> for Box<T, A>
where A: Allocator, T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

1.0.0 · source§

impl<T, A> Deref for Box<T, A>
where A: Allocator, T: ?Sized,

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

1.0.0 · source§

impl<T, A> Hash for Box<T, A>
where T: Hash + ?Sized, A: Allocator,

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

Feeds this value into the given Hasher. Read more

1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more

1.5.0 · source§

impl<T, A> AsMut<T> for Box<T, A>
where A: Allocator, T: ?Sized,

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

Converts this type into a mutable reference of the (usually inferred) input type.

1.6.0 · source§

impl<T> From<T> for Box<T>

fn from(t: T) -> Box<T>

Converts a T into a Box<T>

The conversion allocates on the heap and moves t from the stack into it.

§Examples

let x = 5;
let boxed = Box::new(5);

assert_eq!(Box::from(x), boxed);

1.0.0 · source§

impl<T, A> PartialEq for Box<T, A>
where T: PartialEq + ?Sized, A: Allocator,

fn eq(&self, other: &Box<T, A>) -> bool

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

fn ne(&self, other: &Box<T, A>) -> bool

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

1.35.0 · source§

impl<Args, F, A> Fn<Args> for Box<F, A>
where Args: Tuple, F: Fn<Args> + ?Sized, A: Allocator,

extern "rust-call" fn call( &self, args: Args ) -> <Box<F, A> as FnOnce<Args>>::Output

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

Performs the call operation.

1.0.0 · source§

impl<T, A> DerefMut for Box<T, A>
where A: Allocator, T: ?Sized,

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

Mutably dereferences the value.

1.0.0 · source§

impl<T, A> PartialOrd for Box<T, A>
where T: PartialOrd + ?Sized, A: Allocator,

fn partial_cmp(&self, other: &Box<T, A>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more

fn lt(&self, other: &Box<T, A>) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more

fn le(&self, other: &Box<T, A>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

fn ge(&self, other: &Box<T, A>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

fn gt(&self, other: &Box<T, A>) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more

1.5.0 · source§

impl<T, A> AsRef<T> for Box<T, A>
where A: Allocator, T: ?Sized,

fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.

1.0.0 · source§

impl<T, A> Pointer for Box<T, A>
where A: Allocator, T: ?Sized,

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

Formats the value using the given formatter.

impl<T, U> DispatchFromDyn<Box> for Box<T>
where T: Unsize + ?Sized, U: ?Sized,

1.33.0 · source§

impl<T, A> Unpin for Box<T, A>
where A: Allocator + 'static, T: ?Sized,

impl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
where T: Unsize + ?Sized, A: Allocator, U: ?Sized,

1.0.0 · source§

impl<T, A> Drop for Box<T, A>
where A: Allocator, T: ?Sized,

fn drop(&mut self)

Executes the destructor for this type. Read more

1.0.0 · source§

impl<T, A> Clone for Box<T, A>
where T: Clone, A: Allocator + Clone,

fn clone(&self) -> Box<T, A>

Returns a new box with a clone() of this box’s contents.

§Examples

let x = Box::new(5);
let y = x.clone();

// The value is the same
assert_eq!(x, y);

// But they are unique objects
assert_ne!(&*x as *const i32, &*y as *const i32);

fn clone_from(&mut self, source: &Box<T, A>)

Copies source’s contents into self without creating a new allocation.

§Examples

let x = Box::new(5);
let mut y = Box::new(10);
let yp: *const i32 = &*y;

y.clone_from(&x);

// The value is the same
assert_eq!(x, y);

// And no allocation occurred
assert_eq!(yp, &*y);

1.35.0 · source§

impl<Args, F, A> FnOnce<Args> for Box<F, A>
where Args: Tuple, F: FnOnce<Args> + ?Sized, A: Allocator,

type Output = <F as FnOnce<Args>>::Output

The returned type after the call operator is used.

extern "rust-call" fn call_once( self, args: Args ) -> <Box<F, A> as FnOnce<Args>>::Output

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

Performs the call operation.

1.0.0 · source§

impl<T, A> Debug for Box<T, A>
where T: Debug + ?Sized, A: Allocator,

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

Formats the value using the given formatter. Read more

1.1.0 · source§

impl<T, A> BorrowMut<T> for Box<T, A>
where A: Allocator, T: ?Sized,

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

Mutably borrows from an owned value. Read more

1.0.0 · source§

impl<T, A> Ord for Box<T, A>
where T: Ord + ?Sized, A: Allocator,

fn cmp(&self, other: &Box<T, A>) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more

1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more

1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more

1.0.0 · source§

impl<I, A> DoubleEndedIterator for Box<I, A>
where I: DoubleEndedIterator + ?Sized, A: Allocator,

fn next_back(&mut self) -> Option<::Item>

Removes and returns an element from the end of the iterator. Read more

fn nth_back(&mut self, n: usize) -> Option<::Item>

Returns the nth element from the end of the iterator. Read more

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

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

Advances the iterator from the back by n elements. Read more

1.27.0 · source§

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator. Read more

1.27.0 · source§

fn rfold<B, F>(self, init: B, f: F) -> B
where Self: Sized, F: FnMut(B, Self::Item) -> B,

An iterator method that reduces the iterator’s elements to a single, final value, starting from the back. Read more

1.27.0 · source§

fn rfind(&mut self, predicate: P) -> Option<Self::Item>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator from the back that satisfies a predicate. Read more

1.36.0 · source§

impl<F, A> Future for Box<F, A>
where F: Future + Unpin + ?Sized, A: Allocator + 'static,

type Output = <F as Future>::Output

The type of value produced on completion.

fn poll( self: Pin<&mut Box<F, A>>, cx: &mut Context<'_> ) -> Poll<<Box<F, A> as Future>::Output>

Attempt to resolve the future to a final value, registering the current task for wakeup if the value is not yet available. Read more

1.0.0 · source§

impl<I, A> Iterator for Box<I, A>
where I: Iterator + ?Sized, A: Allocator,

type Item = ::Item

The type of the elements being iterated over.

fn next(&mut self) -> Option<::Item>

Advances the iterator and returns the next value. Read more

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator. Read more

fn nth(&mut self, n: usize) -> Option<::Item>

Returns the nth element of the iterator. Read more

fn last(self) -> Option<::Item>

Consumes the iterator, returning the last element. Read more

fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
where Self: Sized,

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

Advances the iterator and returns an array containing the next N values. Read more

1.0.0 · source§

fn count(self) -> usize
where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it. Read more

fn advance_by(&mut self, n: usize) -> Result<(), NonZeroUsize>

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

Advances the iterator by n elements. Read more

1.28.0 · source§

fn step_by(self, step: usize) -> StepBy<Self>
where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

1.0.0 · source§

fn chain(self, other: U) -> Chain<Self, ::IntoIter>
where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more

1.0.0 · source§

fn zip(self, other: U) -> Zip<Self, ::IntoIter>
where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>
where Self: Sized, G: FnMut() -> Self::Item,

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

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. Read more

1.0.0 · source§

fn map<B, F>(self, f: F) -> Map<Self, F>
where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element. Read more

1.21.0 · source§

fn for_each<F>(self, f: F)
where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator. Read more

1.0.0 · source§

fn filter(self, predicate: P) -> Filter<Self, P>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

1.0.0 · source§

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
where Self: Sized, F: FnMut(Self::Item) -> Option,

Creates an iterator that both filters and maps. Read more

1.0.0 · source§

fn enumerate(self) -> Enumerate<Self>
where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value. Read more

1.0.0 · source§

fn peekable(self) -> Peekable<Self>
where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information. Read more

1.0.0 · source§

fn skip_while(self, predicate: P) -> SkipWhile<Self, P>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate. Read more

1.0.0 · source§

fn take_while(self, predicate: P) -> TakeWhile<Self, P>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate. Read more

1.57.0 · source§

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>
where Self: Sized, P: FnMut(Self::Item) -> Option,

Creates an iterator that both yields elements based on a predicate and maps. Read more

1.0.0 · source§

fn skip(self, n: usize) -> Skip<Self>
where Self: Sized,

Creates an iterator that skips the first n elements. Read more

1.0.0 · source§

fn take(self, n: usize) -> Take<Self>
where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner. Read more

1.0.0 · source§

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator. Read more

1.0.0 · source§

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure. Read more

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

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

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well. Read more

1.0.0 · source§

fn fuse(self) -> Fuse<Self>
where Self: Sized,

Creates an iterator which ends after the first None. Read more

1.0.0 · source§

fn inspect<F>(self, f: F) -> Inspect<Self, F>
where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more

1.0.0 · source§

fn by_ref(&mut self) -> &mut Self
where Self: Sized,

Borrows an iterator, rather than consuming it. Read more

1.0.0 · source§

fn collect(self) -> B
where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection. Read more

fn collect_into<E>(self, collection: &mut E) -> &mut E
where E: Extend<Self::Item>, Self: Sized,

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

Collects all the items from an iterator into a collection. Read more

1.0.0 · source§

fn partition<B, F>(self, f: F) -> (B, B)
where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more

fn is_partitioned(self, predicate: P) -> bool
where Self: Sized, P: FnMut(Self::Item) -> bool,

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

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false. Read more

1.27.0 · source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

1.27.0 · source§

fn try_for_each<F, R>(&mut self, f: F) -> R
where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more

1.0.0 · source§

fn fold<B, F>(self, init: B, f: F) -> B
where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result. Read more

1.51.0 · source§

fn reduce<F>(self, f: F) -> Option<Self::Item>
where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more

fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
where Self: Sized, F: FnMut(Self::Item, Self::Item) -> R, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately. Read more

1.0.0 · source§

fn all<F>(&mut self, f: F) -> bool
where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more

1.0.0 · source§

fn any<F>(&mut self, f: F) -> bool
where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more

1.0.0 · source§

fn find(&mut self, predicate: P) -> Option<Self::Item>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate. Read more

1.30.0 · source§

fn find_map<B, F>(&mut self, f: F) -> Option
where Self: Sized, F: FnMut(Self::Item) -> Option,

Applies function to the elements of iterator and returns the first non-none result. Read more

fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
where Self: Sized, F: FnMut(&Self::Item) -> R, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

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

Applies function to the elements of iterator and returns the first true result or the first error. Read more

1.0.0 · source§

fn position(&mut self, predicate: P) -> Option<usize>
where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index. Read more

1.6.0 · source§

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function. Read more

1.15.0 · source§

fn max_by<F>(self, compare: F) -> Option<Self::Item>
where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

1.6.0 · source§

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function. Read more

1.15.0 · source§

fn min_by<F>(self, compare: F) -> Option<Self::Item>
where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

1.0.0 · source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
where FromA: Default + Extend<A>, FromB: Default + Extend, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers. Read more

1.36.0 · source§

fn copied<'a, T>(self) -> Copied<Self>
where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements. Read more

1.0.0 · source§

fn cloned<'a, T>(self) -> Cloned<Self>
where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements. Read more

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
where Self: Sized,

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

Returns an iterator over N elements of the iterator at a time. Read more

1.11.0 · source§

fn sum<S>(self) -> S
where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator. Read more

1.11.0 · source§

fn product(self) -> P
where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements Read more

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, ::Item) -> Ordering,

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

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more

1.5.0 · source§

fn partial_cmp(self, other: I) -> Option<Ordering>
where I: IntoIterator, Self::Item: PartialOrd<::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned. Read more

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>
where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, ::Item) -> Option<Ordering>,

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

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more

1.5.0 · source§

fn eq(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialEq<::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another. Read more

fn eq_by<I, F>(self, other: I, eq: F) -> bool
where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, ::Item) -> bool,

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

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function. Read more

1.5.0 · source§

fn ne(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialEq<::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another. Read more

1.5.0 · source§

fn lt(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another. Read more

1.5.0 · source§

fn le(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

1.5.0 · source§

fn gt(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

1.5.0 · source§

fn ge(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

fn is_sorted_by<F>(self, compare: F) -> bool
where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

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

Checks if the elements of this iterator are sorted using the given comparator function. Read more

fn is_sorted_by_key<F, K>(self, f: F) -> bool
where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

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

Checks if the elements of this iterator are sorted using the given key extraction function. Read more

1.22.0 · source§

impl<T, A> Hasher for Box<T, A>
where T: Hasher + ?Sized, A: Allocator,

fn finish(&self) -> u64

Returns the hash value for the values written so far. Read more

fn write(&mut self, bytes: &[u8])

Writes some data into this Hasher. Read more

fn write_u8(&mut self, i: u8)

Writes a single u8 into this hasher.

fn write_u16(&mut self, i: u16)

Writes a single u16 into this hasher.

fn write_u32(&mut self, i: u32)

Writes a single u32 into this hasher.

fn write_u64(&mut self, i: u64)

Writes a single u64 into this hasher.

fn write_u128(&mut self, i: u128)

Writes a single u128 into this hasher.

fn write_usize(&mut self, i: usize)

Writes a single usize into this hasher.

fn write_i8(&mut self, i: i8)

Writes a single i8 into this hasher.

fn write_i16(&mut self, i: i16)

Writes a single i16 into this hasher.

fn write_i32(&mut self, i: i32)

Writes a single i32 into this hasher.

fn write_i64(&mut self, i: i64)

Writes a single i64 into this hasher.

fn write_i128(&mut self, i: i128)

Writes a single i128 into this hasher.

fn write_isize(&mut self, i: isize)

Writes a single isize into this hasher.

fn write_length_prefix(&mut self, len: usize)

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

Writes a length prefix into this hasher, as part of being prefix-free. Read more

fn write_str(&mut self, s: &str)

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

Writes a single str into this hasher. Read more

1.26.0 · source§

impl<I, A> FusedIterator for Box<I, A>
where I: FusedIterator + ?Sized, A: Allocator,

impl<T> Backend for Box<T>
where T: Backend + ?Sized,

fn gas_price(&self) -> U256

Gas price. Unused for London.

fn origin(&self) -> H160

Origin.

fn block_hash(&self, number: U256) -> H256

Environmental block hash.

fn block_number(&self) -> U256

Environmental block number.

fn block_coinbase(&self) -> H160

Environmental coinbase.

fn block_timestamp(&self) -> U256

Environmental block timestamp.

fn block_difficulty(&self) -> U256

Environmental block difficulty.

fn block_randomness(&self) -> Option<H256>

Get environmental block randomness.

fn block_gas_limit(&self) -> U256

Environmental block gas limit.

fn block_base_fee_per_gas(&self) -> U256

Environmental block base fee.

fn chain_id(&self) -> U256

Environmental chain ID.

fn exists(&self, address: H160) -> bool

Whether account at address exists.

fn basic(&self, address: H160) -> Basic

Get basic account information.

fn code(&self, address: H160) -> Vec<u8> ⓘ

Get account code.

fn storage(&self, address: H160, index: H256) -> H256

Get storage value of address at index.

fn original_storage(&self, address: H160, index: H256) -> Option<H256>

Get original storage value of address at index, if available.

impl<'config, T> StackState<'config> for Box<T>
where T: StackState<'config> + ?Sized, Box<T>: Backend,

fn code_size(&self, address: H160) -> U256

Fetch the code size of an address. Provide a default implementation by fetching the code, but can be customized to use a more performant approach that don’t need to fetch the code.

fn code_hash(&self, address: H160) -> H256

Fetch the code hash of an address. Provide a default implementation by fetching the code, but can be customized to use a more performant approach that don’t need to fetch the code.

fn record_external_operation( &mut self, _op: ExternalOperation ) -> Result<(), ExitError>

fn record_external_dynamic_opcode_cost( &mut self, _opcode: Opcode, _gas_cost: GasCost, _target: StorageTarget ) -> Result<(), ExitError>

fn record_external_cost( &mut self, _ref_time: Option<u64>, _proof_size: Option<u64>, _storage_growth: Option<u64> ) -> Result<(), ExitError>

fn refund_external_cost( &mut self, _ref_time: Option<u64>, _proof_size: Option<u64> )

impl<R> CryptoRng for Box<R>
where R: CryptoRng + ?Sized,

impl<R> RngCore for Box<R>
where R: RngCore + ?Sized,

fn next_u32(&mut self) -> u32

Return the next random u32. Read more

fn next_u64(&mut self) -> u64

Return the next random u64. Read more

fn fill_bytes(&mut self, dest: &mut [u8])

Fill dest with random data. Read more

fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>

Fill dest entirely with random data. Read more

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

type Identity = T

The type identifying for which type info is provided. Read more

fn type_info() -> Type

Returns the static type identifier for Self.

impl<T> Serialize for Box<T>
where T: Serialize + ?Sized,

fn serialize<S>( &self, serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more

impl<'de, T> Deserialize<'de> for Box<T>
where T: Deserialize<'de>,

fn deserialize<D>( deserializer: D ) -> Result<Box<T>, <D as Deserializer<'de>>::Error>
where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more

impl<T> WrapperTypeDecode for Box<T>

type Wrapped = T

A wrapped type.

impl<T> WrapperTypeEncode for Box<T>
where T: ?Sized,

impl<T> MaxEncodedLen for Box<T>
where T: MaxEncodedLen,

fn max_encoded_len() -> usize

Upper bound, in bytes, of the maximum encoded size of this item.

impl<T> EncodeLike<T> for Box<T>
where T: Encode,

impl<T> EncodeLike for Box<T>
where T: Encode + ?Sized,

impl<T> ConstEncodedLen for Box<T>
where T: ConstEncodedLen,

impl<T> Buf for Box<T>
where T: Buf + ?Sized,

fn remaining(&self) -> usize

Returns the number of bytes between the current position and the end of the buffer. Read more

fn chunk(&self) -> &[u8] ⓘ

Returns a slice starting at the current position and of length between 0 and Buf::remaining(). Note that this can return shorter slice (this allows non-continuous internal representation). Read more

fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize

Fills dst with potentially multiple slices starting at self’s current position. Read more

fn advance(&mut self, cnt: usize)

Advance the internal cursor of the Buf Read more

fn has_remaining(&self) -> bool

Returns true if there are any more bytes to consume Read more

fn copy_to_slice(&mut self, dst: &mut [u8])

Copies bytes from self into dst. Read more

fn get_u8(&mut self) -> u8

Gets an unsigned 8 bit integer from self. Read more

fn get_i8(&mut self) -> i8

Gets a signed 8 bit integer from self. Read more

fn get_u16(&mut self) -> u16

Gets an unsigned 16 bit integer from self in big-endian byte order. Read more

fn get_u16_le(&mut self) -> u16

Gets an unsigned 16 bit integer from self in little-endian byte order. Read more

fn get_u16_ne(&mut self) -> u16

Gets an unsigned 16 bit integer from self in native-endian byte order. Read more

fn get_i16(&mut self) -> i16

Gets a signed 16 bit integer from self in big-endian byte order. Read more

fn get_i16_le(&mut self) -> i16

Gets a signed 16 bit integer from self in little-endian byte order. Read more

fn get_i16_ne(&mut self) -> i16

Gets a signed 16 bit integer from self in native-endian byte order. Read more

fn get_u32(&mut self) -> u32

Gets an unsigned 32 bit integer from self in the big-endian byte order. Read more

fn get_u32_le(&mut self) -> u32

Gets an unsigned 32 bit integer from self in the little-endian byte order. Read more

fn get_u32_ne(&mut self) -> u32

Gets an unsigned 32 bit integer from self in native-endian byte order. Read more

fn get_i32(&mut self) -> i32

Gets a signed 32 bit integer from self in big-endian byte order. Read more

fn get_i32_le(&mut self) -> i32

Gets a signed 32 bit integer from self in little-endian byte order. Read more

fn get_i32_ne(&mut self) -> i32

Gets a signed 32 bit integer from self in native-endian byte order. Read more

fn get_u64(&mut self) -> u64

Gets an unsigned 64 bit integer from self in big-endian byte order. Read more

fn get_u64_le(&mut self) -> u64

Gets an unsigned 64 bit integer from self in little-endian byte order. Read more

fn get_u64_ne(&mut self) -> u64

Gets an unsigned 64 bit integer from self in native-endian byte order. Read more

fn get_i64(&mut self) -> i64

Gets a signed 64 bit integer from self in big-endian byte order. Read more

fn get_i64_le(&mut self) -> i64

Gets a signed 64 bit integer from self in little-endian byte order. Read more

fn get_i64_ne(&mut self) -> i64

Gets a signed 64 bit integer from self in native-endian byte order. Read more

fn get_uint(&mut self, nbytes: usize) -> u64

Gets an unsigned n-byte integer from self in big-endian byte order. Read more

fn get_uint_le(&mut self, nbytes: usize) -> u64

Gets an unsigned n-byte integer from self in little-endian byte order. Read more

fn get_uint_ne(&mut self, nbytes: usize) -> u64

Gets an unsigned n-byte integer from self in native-endian byte order. Read more

fn get_int(&mut self, nbytes: usize) -> i64

Gets a signed n-byte integer from self in big-endian byte order. Read more

fn get_int_le(&mut self, nbytes: usize) -> i64

Gets a signed n-byte integer from self in little-endian byte order. Read more

fn get_int_ne(&mut self, nbytes: usize) -> i64

Gets a signed n-byte integer from self in native-endian byte order. Read more

fn copy_to_bytes(&mut self, len: usize) -> Bytes

Consumes len bytes inside self and returns new instance of Bytes with this data. Read more

fn get_u128(&mut self) -> u128

Gets an unsigned 128 bit integer from self in big-endian byte order. Read more

fn get_u128_le(&mut self) -> u128

Gets an unsigned 128 bit integer from self in little-endian byte order. Read more

fn get_u128_ne(&mut self) -> u128

Gets an unsigned 128 bit integer from self in native-endian byte order. Read more

fn get_i128(&mut self) -> i128

Gets a signed 128 bit integer from self in big-endian byte order. Read more

fn get_i128_le(&mut self) -> i128

Gets a signed 128 bit integer from self in little-endian byte order. Read more

fn get_i128_ne(&mut self) -> i128

Gets a signed 128 bit integer from self in native-endian byte order. Read more

fn get_f32(&mut self) -> f32

Gets an IEEE754 single-precision (4 bytes) floating point number from self in big-endian byte order. Read more

fn get_f32_le(&mut self) -> f32

Gets an IEEE754 single-precision (4 bytes) floating point number from self in little-endian byte order. Read more

fn get_f32_ne(&mut self) -> f32

Gets an IEEE754 single-precision (4 bytes) floating point number from self in native-endian byte order. Read more

fn get_f64(&mut self) -> f64

Gets an IEEE754 double-precision (8 bytes) floating point number from self in big-endian byte order. Read more

fn get_f64_le(&mut self) -> f64

Gets an IEEE754 double-precision (8 bytes) floating point number from self in little-endian byte order. Read more

fn get_f64_ne(&mut self) -> f64

Gets an IEEE754 double-precision (8 bytes) floating point number from self in native-endian byte order. Read more

fn take(self, limit: usize) -> Take<Self>
where Self: Sized,

Creates an adaptor which will read at most limit bytes from self. Read more

fn chain(self, next: U) -> Chain<Self, U>
where U: Buf, Self: Sized,

Creates an adaptor which will chain this buffer with another. Read more

fn reader(self) -> Reader<Self>
where Self: Sized,

Creates an adaptor which implements the Read trait for self. Read more

impl<T> BufMut for Box<T>
where T: BufMut + ?Sized,

fn remaining_mut(&self) -> usize

Returns the number of bytes that can be written from the current position until the end of the buffer is reached. Read more

fn chunk_mut(&mut self) -> &mut UninitSlice

Returns a mutable slice starting at the current BufMut position and of length between 0 and BufMut::remaining_mut(). Note that this can be shorter than the whole remainder of the buffer (this allows non-continuous implementation). Read more

unsafe fn advance_mut(&mut self, cnt: usize)

Advance the internal cursor of the BufMut Read more

fn put_slice(&mut self, src: &[u8])

Transfer bytes into self from src and advance the cursor by the number of bytes written. Read more

fn put_u8(&mut self, n: u8)

Writes an unsigned 8 bit integer to self. Read more

fn put_i8(&mut self, n: i8)

Writes a signed 8 bit integer to self. Read more

fn put_u16(&mut self, n: u16)

Writes an unsigned 16 bit integer to self in big-endian byte order. Read more

fn put_u16_le(&mut self, n: u16)

Writes an unsigned 16 bit integer to self in little-endian byte order. Read more

fn put_u16_ne(&mut self, n: u16)

Writes an unsigned 16 bit integer to self in native-endian byte order. Read more

fn put_i16(&mut self, n: i16)

Writes a signed 16 bit integer to self in big-endian byte order. Read more

fn put_i16_le(&mut self, n: i16)

Writes a signed 16 bit integer to self in little-endian byte order. Read more

fn put_i16_ne(&mut self, n: i16)

Writes a signed 16 bit integer to self in native-endian byte order. Read more

fn put_u32(&mut self, n: u32)

Writes an unsigned 32 bit integer to self in big-endian byte order. Read more

fn put_u32_le(&mut self, n: u32)

Writes an unsigned 32 bit integer to self in little-endian byte order. Read more

fn put_u32_ne(&mut self, n: u32)

Writes an unsigned 32 bit integer to self in native-endian byte order. Read more

fn put_i32(&mut self, n: i32)

Writes a signed 32 bit integer to self in big-endian byte order. Read more

fn put_i32_le(&mut self, n: i32)

Writes a signed 32 bit integer to self in little-endian byte order. Read more

fn put_i32_ne(&mut self, n: i32)

Writes a signed 32 bit integer to self in native-endian byte order. Read more

fn put_u64(&mut self, n: u64)

Writes an unsigned 64 bit integer to self in the big-endian byte order. Read more

fn put_u64_le(&mut self, n: u64)

Writes an unsigned 64 bit integer to self in little-endian byte order. Read more

fn put_u64_ne(&mut self, n: u64)

Writes an unsigned 64 bit integer to self in native-endian byte order. Read more

fn put_i64(&mut self, n: i64)

Writes a signed 64 bit integer to self in the big-endian byte order. Read more

fn put_i64_le(&mut self, n: i64)

Writes a signed 64 bit integer to self in little-endian byte order. Read more

fn put_i64_ne(&mut self, n: i64)

Writes a signed 64 bit integer to self in native-endian byte order. Read more

fn has_remaining_mut(&self) -> bool

Returns true if there is space in self for more bytes. Read more

fn put<T>(&mut self, src: T)
where T: Buf, Self: Sized,

Transfer bytes into self from src and advance the cursor by the number of bytes written. Read more

fn put_bytes(&mut self, val: u8, cnt: usize)

Put cnt bytes val into self. Read more

fn put_u128(&mut self, n: u128)

Writes an unsigned 128 bit integer to self in the big-endian byte order. Read more

fn put_u128_le(&mut self, n: u128)

Writes an unsigned 128 bit integer to self in little-endian byte order. Read more

fn put_u128_ne(&mut self, n: u128)

Writes an unsigned 128 bit integer to self in native-endian byte order. Read more

fn put_i128(&mut self, n: i128)

Writes a signed 128 bit integer to self in the big-endian byte order. Read more

fn put_i128_le(&mut self, n: i128)

Writes a signed 128 bit integer to self in little-endian byte order. Read more

fn put_i128_ne(&mut self, n: i128)

Writes a signed 128 bit integer to self in native-endian byte order. Read more

fn put_uint(&mut self, n: u64, nbytes: usize)

Writes an unsigned n-byte integer to self in big-endian byte order. Read more

fn put_uint_le(&mut self, n: u64, nbytes: usize)

Writes an unsigned n-byte integer to self in the little-endian byte order. Read more

fn put_uint_ne(&mut self, n: u64, nbytes: usize)

Writes an unsigned n-byte integer to self in the native-endian byte order. Read more

fn put_int(&mut self, n: i64, nbytes: usize)

Writes low nbytes of a signed integer to self in big-endian byte order. Read more

fn put_int_le(&mut self, n: i64, nbytes: usize)

Writes low nbytes of a signed integer to self in little-endian byte order. Read more

fn put_int_ne(&mut self, n: i64, nbytes: usize)

Writes low nbytes of a signed integer to self in native-endian byte order. Read more

fn put_f32(&mut self, n: f32)

Writes an IEEE754 single-precision (4 bytes) floating point number to self in big-endian byte order. Read more

fn put_f32_le(&mut self, n: f32)

Writes an IEEE754 single-precision (4 bytes) floating point number to self in little-endian byte order. Read more

fn put_f32_ne(&mut self, n: f32)

Writes an IEEE754 single-precision (4 bytes) floating point number to self in native-endian byte order. Read more

fn put_f64(&mut self, n: f64)

Writes an IEEE754 double-precision (8 bytes) floating point number to self in big-endian byte order. Read more

fn put_f64_le(&mut self, n: f64)

Writes an IEEE754 double-precision (8 bytes) floating point number to self in little-endian byte order. Read more

fn put_f64_ne(&mut self, n: f64)

Writes an IEEE754 double-precision (8 bytes) floating point number to self in native-endian byte order. Read more

fn limit(self, limit: usize) -> Limit<Self>
where Self: Sized,

Creates an adaptor which can write at most limit bytes to self. Read more

fn writer(self) -> Writer<Self>
where Self: Sized,

Creates an adaptor which implements the Write trait for self. Read more

fn chain_mut(self, next: U) -> Chain<Self, U>
where U: BufMut, Self: Sized,

Creates an adapter which will chain this buffer with another. Read more

impl<T> Decodable for Box<T>
where T: Decodable,

fn decode(rlp: &Rlp<'_>) -> Result<Box<T>, DecoderError>

Decode a value from RLP bytes

impl<T> Encodable for Box<T>
where T: Encodable + ?Sized,

fn rlp_append(&self, s: &mut RlpStream)

Append a value to the stream

fn rlp_bytes(&self) -> BytesMut

Get rlp-encoded bytes for this instance

impl<T> Handler for Box<T>
where T: Handler + ?Sized,

type CreateInterrupt = <T as Handler>::CreateInterrupt

Type of CREATE interrupt.

type CreateFeedback = <T as Handler>::CreateFeedback

Feedback value for CREATE interrupt.

type CallInterrupt = <T as Handler>::CallInterrupt

Type of CALL interrupt.

type CallFeedback = <T as Handler>::CallFeedback

Feedback value of CALL interrupt.

fn balance(&self, address: H160) -> U256

Get balance of address.

fn code_size(&self, address: H160) -> U256

Get code size of address.

fn code_hash(&self, address: H160) -> H256

Get code hash of address.

fn code(&self, address: H160) -> Vec<u8> ⓘ

Get code of address.

fn storage(&self, address: H160, index: H256) -> H256

Get storage value of address at index.

fn original_storage(&self, address: H160, index: H256) -> H256

Get original storage value of address at index.

fn gas_left(&self) -> U256

Get the gas left value.

fn gas_price(&self) -> U256

Get the gas price value.

fn origin(&self) -> H160

Get execution origin.

fn block_hash(&self, number: U256) -> H256

Get environmental block hash.

fn block_number(&self) -> U256

Get environmental block number.

fn block_coinbase(&self) -> H160

Get environmental coinbase.

fn block_timestamp(&self) -> U256

Get environmental block timestamp.

fn block_difficulty(&self) -> U256

Get environmental block difficulty.

fn block_randomness(&self) -> Option<H256>

Get environmental block randomness.

fn block_gas_limit(&self) -> U256

Get environmental gas limit.

fn block_base_fee_per_gas(&self) -> U256

Environmental block base fee.

fn chain_id(&self) -> U256

Get environmental chain ID.

fn exists(&self, address: H160) -> bool

Check whether an address exists.

fn deleted(&self, address: H160) -> bool

Check whether an address has already been deleted.

fn is_cold( &mut self, address: H160, index: Option<H256> ) -> Result<bool, ExitError>

Checks if the address or (address, index) pair has been previously accessed (or set in accessed_addresses / accessed_storage_keys via an access list transaction). References: Read more

fn set_storage( &mut self, address: H160, index: H256, value: H256 ) -> Result<(), ExitError>

Set storage value of address at index.

fn log( &mut self, address: H160, topics: Vec<H256>, data: Vec<u8> ) -> Result<(), ExitError>

Create a log owned by address with given topics and data.

fn mark_delete(&mut self, address: H160, target: H160) -> Result<(), ExitError>

Mark an address to be deleted, with funds transferred to target.

fn create( &mut self, caller: H160, scheme: CreateScheme, value: U256, init_code: Vec<u8>, target_gas: Option<u64> ) -> Capture<(ExitReason, Option<H160>, Vec<u8>), <Box<T> as Handler>::CreateInterrupt>

Invoke a create operation.

fn create_feedback( &mut self, _feedback: <Box<T> as Handler>::CreateFeedback ) -> Result<(), ExitError>

Feed in create feedback.

fn call( &mut self, code_address: H160, transfer: Option<Transfer>, input: Vec<u8>, target_gas: Option<u64>, is_static: bool, context: Context ) -> Capture<(ExitReason, Vec<u8>), <Box<T> as Handler>::CallInterrupt>

Invoke a call operation.

fn call_feedback( &mut self, _feedback: <Box<T> as Handler>::CallFeedback ) -> Result<(), ExitError>

Feed in call feedback.

fn pre_validate( &mut self, context: &Context, opcode: Opcode, stack: &Stack ) -> Result<(), ExitError>

Pre-validation step for the runtime.

fn other( &mut self, opcode: Opcode, _stack: &mut Machine ) -> Result<(), ExitError>

Handle other unknown external opcodes.

fn record_external_operation( &mut self, op: ExternalOperation ) -> Result<(), ExitError>

Records some associated ExternalOperation.

impl<T> Log for Box<T>
where T: Log + ?Sized,

fn enabled(&self, metadata: &Metadata<'_>) -> bool

Determines if a log message with the specified metadata would be logged. Read more

fn log(&self, record: &Record<'_>)

Logs the Record. Read more

fn flush(&self)

Flushes any buffered records.

impl<T> Externalities for Box<T>
where T: Externalities + ?Sized,

fn is_validator(&self) -> bool

Returns if the local node is a potential validator. Read more

fn network_state(&self) -> Result<OpaqueNetworkState, ()>

Returns information about the local node’s network state.

fn timestamp(&mut self) -> Timestamp

Returns current UNIX timestamp (in millis)

fn sleep_until(&mut self, deadline: Timestamp)

Pause the execution until deadline is reached.

fn random_seed(&mut self) -> [u8; 32]

Returns a random seed. Read more

fn http_request_start( &mut self, method: &str, uri: &str, meta: &[u8] ) -> Result<HttpRequestId, ()>

Initiates a http request given HTTP verb and the URL. Read more

fn http_request_add_header( &mut self, request_id: HttpRequestId, name: &str, value: &str ) -> Result<(), ()>

Append header to the request. Read more

fn http_request_write_body( &mut self, request_id: HttpRequestId, chunk: &[u8], deadline: Option<Timestamp> ) -> Result<(), HttpError>

Write a chunk of request body. Read more

fn http_response_wait( &mut self, ids: &[HttpRequestId], deadline: Option<Timestamp> ) -> Vec<HttpRequestStatus>

Block and wait for the responses for given requests. Read more

fn http_response_headers( &mut self, request_id: HttpRequestId ) -> Vec<(Vec<u8>, Vec<u8>)>

Read all response headers. Read more

fn http_response_read_body( &mut self, request_id: HttpRequestId, buffer: &mut [u8], deadline: Option<Timestamp> ) -> Result<usize, HttpError>

Read a chunk of body response to given buffer. Read more

fn set_authorized_nodes( &mut self, nodes: Vec<OpaquePeerId>, authorized_only: bool )

Set the authorized nodes from runtime. Read more

impl<T> DbExternalities for Box<T>
where T: DbExternalities + ?Sized,

fn local_storage_set(&mut self, kind: StorageKind, key: &[u8], value: &[u8])

Sets a value in the local storage. Read more

fn local_storage_clear(&mut self, kind: StorageKind, key: &[u8])

Removes a value in the local storage. Read more

fn local_storage_compare_and_set( &mut self, kind: StorageKind, key: &[u8], old_value: Option<&[u8]>, new_value: &[u8] ) -> bool

Sets a value in the local storage if it matches current value. Read more

fn local_storage_get( &mut self, kind: StorageKind, key: &[u8] ) -> Option<Vec<u8>>

Gets a value from the local storage. Read more

impl<'a, V> VisitOperator<'a> for Box<V>
where V: VisitOperator<'a> + ?Sized,

type Output = <V as VisitOperator<'a>>::Output

The result type of the visitor.

fn visit_operator( &mut self, op: &Operator<'a> ) -> <Box<V> as VisitOperator<'a>>::Output

Visits the [Operator] op using the given offset. Read more

fn visit_unreachable(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_nop(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_block( &mut self, blockty: BlockType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_loop( &mut self, blockty: BlockType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_if( &mut self, blockty: BlockType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_else(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_try( &mut self, blockty: BlockType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_catch( &mut self, tag_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_throw( &mut self, tag_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_rethrow( &mut self, relative_depth: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_end(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_br( &mut self, relative_depth: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_br_if( &mut self, relative_depth: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_br_table( &mut self, targets: BrTable<'a> ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_return(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_call( &mut self, function_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_call_indirect( &mut self, type_index: u32, table_index: u32, table_byte: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_return_call( &mut self, function_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_return_call_indirect( &mut self, type_index: u32, table_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_delegate( &mut self, relative_depth: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_catch_all(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_drop(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_select(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_typed_select( &mut self, ty: ValType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_local_get( &mut self, local_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_local_set( &mut self, local_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_local_tee( &mut self, local_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_global_get( &mut self, global_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_global_set( &mut self, global_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_load8_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_load8_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_load16_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_load16_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load8_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load8_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load16_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load16_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load32_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_load32_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_store8( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_store16( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_store8( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_store16( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_store32( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_size( &mut self, mem: u32, mem_byte: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_grow( &mut self, mem: u32, mem_byte: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_const( &mut self, value: i32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_const( &mut self, value: i64 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_const( &mut self, value: Ieee32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_const( &mut self, value: Ieee64 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_ref_null( &mut self, hty: HeapType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_ref_is_null(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_ref_func( &mut self, function_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_eqz(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_eqz(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_lt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_gt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_le(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_ge(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_lt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_gt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_le(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_ge(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_clz(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_ctz(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_popcnt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_div_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_div_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_rem_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_rem_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_and(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_or(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_xor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_rotl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_rotr(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_clz(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_ctz(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_popcnt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_div_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_div_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_rem_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_rem_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_and(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_or(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_xor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_rotl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_rotr(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_ceil(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_floor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_trunc(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_nearest(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_sqrt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_div(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_copysign(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_ceil(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_floor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_trunc(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_nearest(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_sqrt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_div(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_copysign(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_wrap_i64(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_f32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_f32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_f64_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_f64_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_extend_i32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_extend_i32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_f32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_f32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_f64_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_f64_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_convert_i32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_convert_i32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_convert_i64_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_convert_i64_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_demote_f64(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_convert_i32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_convert_i32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_convert_i64_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_convert_i64_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_promote_f32(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_reinterpret_f32(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_reinterpret_f64(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32_reinterpret_i32(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64_reinterpret_i64(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_extend8_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_extend16_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_extend8_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_extend16_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_extend32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_sat_f32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_sat_f32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_sat_f64_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_trunc_sat_f64_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_sat_f32_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_sat_f32_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_sat_f64_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_trunc_sat_f64_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_init( &mut self, data_index: u32, mem: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_data_drop( &mut self, data_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_copy( &mut self, dst_mem: u32, src_mem: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_fill( &mut self, mem: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_init( &mut self, elem_index: u32, table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_elem_drop( &mut self, elem_index: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_copy( &mut self, dst_table: u32, src_table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_fill( &mut self, table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_get( &mut self, table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_set( &mut self, table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_grow( &mut self, table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_table_size( &mut self, table: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_discard( &mut self, mem: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_atomic_notify( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_atomic_wait32( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_memory_atomic_wait64( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_atomic_fence(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_load8_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_load16_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_load8_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_load16_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_load32_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_store8( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_store16( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_store8( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_store16( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_store32( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_add( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_add( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_add_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_add_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_add_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_add_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_add_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_sub( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_sub( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_sub_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_sub_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_sub_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_sub_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_sub_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_and( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_and( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_and_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_and_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_and_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_and_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_and_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_or( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_or( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_or_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_or_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_or_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_or_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_or_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_xor( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_xor( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_xor_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_xor_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_xor_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_xor_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_xor_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_xchg( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_xchg( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_xchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_xchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_xchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_xchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_xchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw_cmpxchg( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw_cmpxchg( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw8_cmpxchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32_atomic_rmw16_cmpxchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw8_cmpxchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw16_cmpxchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64_atomic_rmw32_cmpxchg_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load8x8_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load8x8_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load16x4_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load16x4_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load32x2_s( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load32x2_u( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load8_splat( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load16_splat( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load32_splat( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load64_splat( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load32_zero( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load64_zero( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_store( &mut self, memarg: MemArg ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load8_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load16_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load32_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_load64_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_store8_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_store16_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_store32_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_store64_lane( &mut self, memarg: MemArg, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_const( &mut self, value: V128 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_shuffle( &mut self, lanes: [u8; 16] ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_extract_lane_s( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_extract_lane_u( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_replace_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extract_lane_s( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extract_lane_u( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_replace_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extract_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_replace_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extract_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_replace_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_extract_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_replace_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_extract_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_replace_lane( &mut self, lane: u8 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_swizzle(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_lt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_gt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_le(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_ge(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_lt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_gt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_le(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_ge(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_not(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_and(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_andnot(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_or(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_xor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_bitselect(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_v128_any_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_popcnt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_narrow_i16x8_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_narrow_i16x8_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_add_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_add_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_sub_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_sub_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_min_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_min_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_max_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_max_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_avgr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extadd_pairwise_i8x16_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extadd_pairwise_i8x16_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_q15mulr_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_narrow_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_narrow_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extend_low_i8x16_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extend_high_i8x16_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extend_low_i8x16_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extend_high_i8x16_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_add_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_add_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_sub_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_sub_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_min_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_min_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_max_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_max_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_avgr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extmul_low_i8x16_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extmul_high_i8x16_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extmul_low_i8x16_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_extmul_high_i8x16_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extadd_pairwise_i16x8_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extadd_pairwise_i16x8_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extend_low_i16x8_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extend_high_i16x8_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extend_low_i16x8_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extend_high_i16x8_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_min_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_min_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_max_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_max_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_dot_i16x8_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extmul_low_i16x8_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extmul_high_i16x8_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extmul_low_i16x8_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_extmul_high_i16x8_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extend_low_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extend_high_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extend_low_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extend_high_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extmul_low_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extmul_high_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extmul_low_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_extmul_high_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_ceil(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_floor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_trunc(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_nearest(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_sqrt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_div(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_pmin(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_pmax(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_ceil(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_floor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_trunc(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_nearest(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_sqrt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_div(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_pmin(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_pmax(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_trunc_sat_f32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_trunc_sat_f32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_convert_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_convert_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_trunc_sat_f64x2_s_zero( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_trunc_sat_f64x2_u_zero( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_convert_low_i32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_convert_low_i32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_demote_f64x2_zero( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_promote_low_f32x4( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_relaxed_swizzle( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_relaxed_trunc_f32x4_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_relaxed_trunc_f32x4_u( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_relaxed_trunc_f64x2_s_zero( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_relaxed_trunc_f64x2_u_zero( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_relaxed_madd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_relaxed_nmadd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_relaxed_madd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_relaxed_nmadd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i8x16_relaxed_laneselect( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_relaxed_laneselect( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_relaxed_laneselect( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i64x2_relaxed_laneselect( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_relaxed_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f32x4_relaxed_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_relaxed_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_f64x2_relaxed_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_relaxed_q15mulr_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i16x8_relaxed_dot_i8x16_i7x16_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_i32x4_relaxed_dot_i8x16_i7x16_add_s( &mut self ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_call_ref( &mut self, hty: HeapType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_return_call_ref( &mut self, hty: HeapType ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_ref_as_non_null(&mut self) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_br_on_null( &mut self, relative_depth: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

fn visit_br_on_non_null( &mut self, relative_depth: u32 ) -> <Box<V> as VisitOperator<'a>>::Output

impl<T> StableDeref for Box<T>
where T: ?Sized,

impl DoubleEndedFallibleIterator for Box
where I: DoubleEndedFallibleIterator + ?Sized,

fn next_back( &mut self ) -> Result<Option<::Item>, ::Error>

Advances the end of the iterator, returning the last value.

fn rfold<B, F>(self, init: B, f: F) -> Result<B, Self::Error>
where Self: Sized, F: FnMut(B, Self::Item) -> Result<B, Self::Error>,

Applies a function over the elements of the iterator in reverse order, producing a single final value.

fn try_rfold<B, E, F>(&mut self, init: B, f: F) -> Result<B, E>
where Self: Sized, E: From<Self::Error>, F: FnMut(B, Self::Item) -> Result<B, E>,

Applies a function over the elements of the iterator in reverse, producing a single final value. Read more

impl FallibleIterator for Box
where I: FallibleIterator + ?Sized,

type Item = ::Item

The type being iterated over.

type Error = ::Error

The error type.

fn next( &mut self ) -> Result<Option<::Item>, ::Error>

Advances the iterator and returns the next value. Read more

fn size_hint(&self) -> (usize, Option<usize>)

Returns bounds on the remaining length of the iterator. Read more

fn nth( &mut self, n: usize ) -> Result<Option<::Item>, ::Error>

Returns the nth element of the iterator.

fn count(self) -> Result<usize, Self::Error>
where Self: Sized,

Consumes the iterator, returning the number of remaining items.

fn last(self) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized,

Returns the last element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>
where Self: Sized,

Returns an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

fn chain(self, it: I) -> Chain<Self, I>
where I: IntoFallibleIterator<Item = Self::Item, Error = Self::Error>, Self: Sized,

Returns an iterator which yields the elements of this iterator followed by another.

fn zip( self, o: I ) -> Zip<Self, ::IntoFallibleIter>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>,

Returns an iterator that yields pairs of this iterator’s and another iterator’s values.

fn map<F, B>(self, f: F) -> Map<Self, F>
where Self: Sized, F: FnMut(Self::Item) -> Result<B, Self::Error>,

Returns an iterator which applies a fallible transform to the elements of the underlying iterator.

fn for_each<F>(self, f: F) -> Result<(), Self::Error>
where Self: Sized, F: FnMut(Self::Item) -> Result<(), Self::Error>,

Calls a fallible closure on each element of an iterator.

fn filter<F>(self, f: F) -> Filter<Self, F>
where Self: Sized, F: FnMut(&Self::Item) -> Result<bool, Self::Error>,

Returns an iterator which uses a predicate to determine which values should be yielded. The predicate may fail; such failures are passed to the caller.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
where Self: Sized, F: FnMut(Self::Item) -> Result<Option, Self::Error>,

Returns an iterator which both filters and maps. The closure may fail; such failures are passed along to the consumer.

fn enumerate(self) -> Enumerate<Self>
where Self: Sized,

Returns an iterator which yields the current iteration count as well as the value.

fn peekable(self) -> Peekable<Self>
where Self: Sized,

Returns an iterator that can peek at the next element without consuming it.

fn skip_while(self, predicate: P) -> SkipWhile<Self, P>
where Self: Sized, P: FnMut(&Self::Item) -> Result<bool, Self::Error>,

Returns an iterator that skips elements based on a predicate.

fn take_while(self, predicate: P) -> TakeWhile<Self, P>
where Self: Sized, P: FnMut(&Self::Item) -> Result<bool, Self::Error>,

Returns an iterator that yields elements based on a predicate.

fn skip(self, n: usize) -> Skip<Self>
where Self: Sized,

Returns an iterator which skips the first n values of this iterator.

fn take(self, n: usize) -> Take<Self>
where Self: Sized,

Returns an iterator that yields only the first n values of this iterator.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
where Self: Sized, F: FnMut(&mut St, Self::Item) -> Result<Option, Self::Error>,

Returns an iterator which applies a stateful map to values of this iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
where Self: Sized, U: IntoFallibleIterator<Error = Self::Error>, F: FnMut(Self::Item) -> Result<U, Self::Error>,

Returns an iterator which maps this iterator’s elements to iterators, yielding those iterators’ values.

fn fuse(self) -> Fuse<Self>
where Self: Sized,

Returns an iterator which yields this iterator’s elements and ends after the first Ok(None). Read more

fn inspect<F>(self, f: F) -> Inspect<Self, F>
where Self: Sized, F: FnMut(&Self::Item) -> Result<(), Self::Error>,

Returns an iterator which passes each element to a closure before returning it.

fn by_ref(&mut self) -> &mut Self
where Self: Sized,

Borrow an iterator rather than consuming it. Read more

fn collect<T>(self) -> Result<T, Self::Error>
where T: FromFallibleIterator<Self::Item>, Self: Sized,

Transforms the iterator into a collection. Read more

fn partition<B, F>(self, f: F) -> Result<(B, B), Self::Error>
where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> Result<bool, Self::Error>,

Transforms the iterator into two collections, partitioning elements by a closure.

fn fold<B, F>(self, init: B, f: F) -> Result<B, Self::Error>
where Self: Sized, F: FnMut(B, Self::Item) -> Result<B, Self::Error>,

Applies a function over the elements of the iterator, producing a single final value.

fn try_fold<B, E, F>(&mut self, init: B, f: F) -> Result<B, E>
where Self: Sized, E: From<Self::Error>, F: FnMut(B, Self::Item) -> Result<B, E>,

Applies a function over the elements of the iterator, producing a single final value. Read more

fn all<F>(&mut self, f: F) -> Result<bool, Self::Error>
where Self: Sized, F: FnMut(Self::Item) -> Result<bool, Self::Error>,

Determines if all elements of this iterator match a predicate.

fn any<F>(&mut self, f: F) -> Result<bool, Self::Error>
where Self: Sized, F: FnMut(Self::Item) -> Result<bool, Self::Error>,

Determines if any element of this iterator matches a predicate.

fn find<F>(&mut self, f: F) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized, F: FnMut(&Self::Item) -> Result<bool, Self::Error>,

Returns the first element of the iterator that matches a predicate.

fn find_map<B, F>(&mut self, f: F) -> Result<Option, Self::Error>
where Self: Sized, F: FnMut(Self::Item) -> Result<Option, Self::Error>,

Applies a function to the elements of the iterator, returning the first non-None result.

fn position<F>(&mut self, f: F) -> Result<Option<usize>, Self::Error>
where Self: Sized, F: FnMut(Self::Item) -> Result<bool, Self::Error>,

Returns the position of the first element of this iterator that matches a predicate. The predicate may fail; such failures are returned to the caller.

fn max_by_key<B, F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized, B: Ord, F: FnMut(&Self::Item) -> Result<B, Self::Error>,

Returns the element of the iterator which gives the maximum value from the function.

fn max_by<F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Result<Ordering, Self::Error>,

Returns the element that gives the maximum value with respect to the function.

fn min_by_key<B, F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized, B: Ord, F: FnMut(&Self::Item) -> Result<B, Self::Error>,

Returns the element of the iterator which gives the minimum value from the function.

fn min_by<F>(self, f: F) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Result<Ordering, Self::Error>,

Returns the element that gives the minimum value with respect to the function.

fn unzip<A, B, FromA, FromB>(self) -> Result<(FromA, FromB), Self::Error>
where Self: Sized + FallibleIterator<Item = (A, B)>, FromA: Default + Extend<A>, FromB: Default + Extend,

Converts an iterator of pairs into a pair of containers.

fn cloned<'a, T>(self) -> Cloned<Self>
where Self: Sized + FallibleIterator<Item = &'a T>, T: 'a + Clone,

Returns an iterator which clones all of its elements.

fn partial_cmp(self, other: I) -> Result<Option<Ordering>, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<::Item>,

Lexicographically compares the elements of this iterator to that of another.

fn eq(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialEq<::Item>,

Determines if the elements of this iterator are equal to those of another.

fn ne(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialEq<::Item>,

Determines if the elements of this iterator are not equal to those of another.

fn lt(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<::Item>,

Determines if the elements of this iterator are lexicographically less than those of another.

fn le(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<::Item>,

Determines if the elements of this iterator are lexicographically less than or equal to those of another.

fn gt(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<::Item>,

Determines if the elements of this iterator are lexicographically greater than those of another.

fn ge(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<::Item>,

Determines if the elements of this iterator are lexicographically greater than or equal to those of another.

fn iterator(self) -> Iterator<Self>
where Self: Sized,

Returns a normal (non-fallible) iterator over Result<Item, Error>.

fn map_err<B, F>(self, f: F) -> MapErr<Self, F>
where F: FnMut(Self::Error) -> B, Self: Sized,

Returns an iterator which applies a transform to the errors of the underlying iterator.

impl<T> WriteColor for Box<T>
where T: WriteColor + ?Sized,

fn supports_color(&self) -> bool

Returns true if and only if the underlying writer supports colors.

fn set_color(&mut self, spec: &ColorSpec) -> Result<(), Error>

Set the color settings of the writer. Read more

fn reset(&mut self) -> Result<(), Error>

Reset the current color settings to their original settings. Read more

fn is_synchronous(&self) -> bool

Returns true if and only if the underlying writer must synchronously interact with an end user’s device in order to control colors. By default, this always returns false. Read more

impl<T> Value for Box<T>
where T: Value + ?Sized,

fn record(&self, key: &Field, visitor: &mut dyn Visit)

Visits this value with the given Visitor.

impl<S> Subscriber for Box<S>
where S: Subscriber + ?Sized,

fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest

Registers a new callsite with this subscriber, returning whether or not the subscriber is interested in being notified about the callsite. Read more

fn enabled(&self, metadata: &Metadata<'_>) -> bool

Returns true if a span or event with the specified metadata would be recorded. Read more

fn max_level_hint(&self) -> Option<LevelFilter>

Returns the highest verbosity level that this Subscriber will enable, or None, if the subscriber does not implement level-based filtering or chooses not to implement this method. Read more

fn new_span(&self, span: &Attributes<'_>) -> Id

Visit the construction of a new span, returning a new span ID for the span being constructed. Read more

fn record(&self, span: &Id, values: &Record<'_>)

Record a set of values on a span. Read more

fn record_follows_from(&self, span: &Id, follows: &Id)

Adds an indication that span follows from the span with the id follows. Read more

fn event_enabled(&self, event: &Event<'_>) -> bool

Determine if an [Event] should be recorded. Read more

fn event(&self, event: &Event<'_>)

Records that an Event has occurred. Read more

fn enter(&self, span: &Id)

Records that a span has been entered. Read more

fn exit(&self, span: &Id)

Records that a span has been exited. Read more

fn clone_span(&self, id: &Id) -> Id

Notifies the subscriber that a span ID has been cloned. Read more

fn try_close(&self, id: Id) -> bool

Notifies the subscriber that a span ID has been dropped, and returns true if there are now 0 IDs that refer to that span. Read more

fn drop_span(&self, id: Id)

👎Deprecated since 0.1.2: use Subscriber::try_close instead

This method is deprecated. Read more

fn current_span(&self) -> Current

Returns a type representing this subscriber’s view of the current span. Read more

unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>

If self is the same type as the provided TypeId, returns an untyped *const pointer to that type. Otherwise, returns None. Read more

fn on_register_dispatch(&self, subscriber: &Dispatch)

Invoked when this subscriber becomes a [Dispatch]. Read more

impl<L, S> Layer<S> for Box<L>
where L: Layer<S>, S: Subscriber,

fn on_layer(&mut self, subscriber: &mut S)

Performs late initialization when attaching a Layer to a [Subscriber]. Read more

fn new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)

Notifies this layer that a new span was constructed with the given Attributes and Id.

fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest

Registers a new callsite with this layer, returning whether or not the layer is interested in being notified about the callsite, similarly to Subscriber::register_callsite. Read more

fn enabled(&self, metadata: &Metadata<'_>, ctx: Context<'_, S>) -> bool

Returns true if this layer is interested in a span or event with the given metadata in the current Context, similarly to Subscriber::enabled. Read more

fn on_record(&self, span: &Id, values: &Record<'_>, ctx: Context<'_, S>)

Notifies this layer that a span with the given Id recorded the given values.

fn on_follows_from(&self, span: &Id, follows: &Id, ctx: Context<'_, S>)

Notifies this layer that a span with the ID span recorded that it follows from the span with the ID follows.

fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)

Notifies this layer that an event has occurred.

fn on_enter(&self, id: &Id, ctx: Context<'_, S>)

Notifies this layer that a span with the given ID was entered.

fn on_exit(&self, id: &Id, ctx: Context<'_, S>)

Notifies this layer that the span with the given ID was exited.

fn on_close(&self, id: Id, ctx: Context<'_, S>)

Notifies this layer that the span with the given ID has been closed.

fn on_id_change(&self, old: &Id, new: &Id, ctx: Context<'_, S>)

Notifies this layer that a span ID has been cloned, and that the subscriber returned a different ID.

fn and_then<L>(self, layer: L) -> Layered<L, Self, S>
where L: Layer<S>, Self: Sized,

Composes this layer around the given Layer, returning a Layered struct implementing Layer. Read more

fn with_subscriber(self, inner: S) -> Layered<Self, S>
where Self: Sized,

Composes this Layer with the given Subscriber, returning a Layered struct that implements Subscriber. Read more

fn with_filter<F>(self, filter: F) -> Filtered<Self, F, S>
where Self: Sized, F: Filter<S>,

Combines self with a Filter, returning a Filtered layer. Read more

impl<T> Clear for Box<T>
where T: Clear,

fn clear(&mut self)

Clear all data in self, retaining the allocated capacithy.

impl<S> DebugSecret for Box<S>
where S: DebugSecret + Zeroize,

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

Format information about the secret’s type. Read more

impl<W> WriteFormatted for Box<W>
where W: Write + ?Sized,

fn write_formatted<F, N>(&mut self, n: &N, format: &F) -> Result<usize, Error>
where F: Format, N: ToFormattedString,

Formats the provided number according to the provided format and then writes the resulting bytes to the object. Meant to be analagous to io::Write’s write_all method or fmt::Write’s write_str method. On success, returns the number of bytes written. Read more

impl<R> RngCore for Box<R>
where R: RngCore + ?Sized,

fn next_u32(&mut self) -> u32

Return the next random u32. Read more

fn next_u64(&mut self) -> u64

Return the next random u64. Read more

fn fill_bytes(&mut self, dest: &mut [u8])

Fill dest with random data. Read more

fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>

Fill dest entirely with random data. Read more

impl<R> CryptoRng for Box<R>
where R: CryptoRng + ?Sized,

impl<S> Stream for Box<S>
where S: Stream + Unpin + ?Sized,

type Item = <S as Stream>::Item

Values yielded by the stream.

fn poll_next( self: Pin<&mut Box<S>>, cx: &mut Context<'_> ) -> Poll<Option<<Box<S> as Stream>::Item>>

Attempt to pull out the next value of this stream, registering the current task for wakeup if the value is not yet available, and returning None if the stream is exhausted. Read more

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the stream. Read more

impl<S> FusedStream for Box<S>
where S: FusedStream + Unpin + ?Sized,

fn is_terminated(&self) -> bool

Returns true if the stream should no longer be polled.

impl<F> FusedFuture for Box<F>
where F: FusedFuture + Unpin + ?Sized,

fn is_terminated(&self) -> bool

Returns true if the underlying future should no longer be polled.

impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>
where F: Future<Output = T> + 'a,

fn into_raw(self) -> *mut dyn Future<Output = T> + 'a

Convert an owned instance into a (conceptually owned) fat pointer. Read more

unsafe fn drop(ptr: *mut dyn Future<Output = T> + 'a)

Drops the future represented by the given fat pointer. Read more

impl<Sp> LocalSpawn for Box<Sp>
where Sp: LocalSpawn + ?Sized,

fn spawn_local_obj( &self, future: LocalFutureObj<'static, ()> ) -> Result<(), SpawnError>

Spawns a future that will be run to completion. Read more

fn status_local(&self) -> Result<(), SpawnError>

Determines whether the executor is able to spawn new tasks. Read more

impl<Sp> Spawn for Box<Sp>
where Sp: Spawn + ?Sized,

fn spawn_obj(&self, future: FutureObj<'static, ()>) -> Result<(), SpawnError>

Spawns a future that will be run to completion. Read more

fn status(&self) -> Result<(), SpawnError>

Determines whether the executor is able to spawn new tasks. Read more

impl<S, Item> Sink<Item> for Box<S>
where S: Sink<Item> + Unpin + ?Sized,

type Error = <S as Sink<Item>>::Error

The type of value produced by the sink when an error occurs.

fn poll_ready( self: Pin<&mut Box<S>>, cx: &mut Context<'_> ) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>

Attempts to prepare the Sink to receive a value. Read more

fn start_send( self: Pin<&mut Box<S>>, item: Item ) -> Result<(), <Box<S> as Sink<Item>>::Error>

Begin the process of sending a value to the sink. Each call to this function must be preceded by a successful call to poll_ready which returned Poll::Ready(Ok(())). Read more

fn poll_flush( self: Pin<&mut Box<S>>, cx: &mut Context<'_> ) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>

Flush any remaining output from this sink. Read more

fn poll_close( self: Pin<&mut Box<S>>, cx: &mut Context<'_> ) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>

Flush any remaining output and close this sink, if necessary. Read more

impl<T> AsyncWrite for Box<T>
where T: AsyncWrite + Unpin + ?Sized,

fn poll_write( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, buf: &[u8] ) -> Poll<Result<usize, Error>>

Attempt to write bytes from buf into the object. Read more

fn poll_write_vectored( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, bufs: &[IoSlice<'_>] ) -> Poll<Result<usize, Error>>

Attempt to write bytes from bufs into the object using vectored IO operations. Read more

fn poll_flush( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<(), Error>>

Attempt to flush the object, ensuring that any buffered data reach their destination. Read more

fn poll_close( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<(), Error>>

Attempt to close the object. Read more

impl<T> AsyncRead for Box<T>
where T: AsyncRead + Unpin + ?Sized,

fn poll_read( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, buf: &mut [u8] ) -> Poll<Result<usize, Error>>

Attempt to read from the AsyncRead into buf. Read more

fn poll_read_vectored( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, bufs: &mut [IoSliceMut<'_>] ) -> Poll<Result<usize, Error>>

Attempt to read from the AsyncRead into bufs using vectored IO operations. Read more

impl<T> AsyncSeek for Box<T>
where T: AsyncSeek + Unpin + ?Sized,

fn poll_seek( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, pos: SeekFrom ) -> Poll<Result<u64, Error>>

Attempt to seek to an offset, in bytes, in a stream. Read more

impl<T> AsyncBufRead for Box<T>
where T: AsyncBufRead + Unpin + ?Sized,

fn poll_fill_buf( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<&[u8], Error>>

Attempt to return the contents of the internal buffer, filling it with more data from the inner reader if it is empty. Read more

fn consume(self: Pin<&mut Box<T>>, amt: usize)

Tells this buffer that amt bytes have been consumed from the buffer, so they should no longer be returned in calls to poll_read. Read more

impl<T> EncodeValue for Box<T>
where T: EncodeValue,

fn value_len(&self) -> Result<Length, Error>

Compute the length of this value (sans [Tag]+[Length] header) when encoded as ASN.1 DER.

fn encode_value(&self, writer: &mut impl Writer) -> Result<(), Error>

Encode value (sans [Tag]+[Length] header) as ASN.1 DER using the provided [Writer].

impl<'a, T> DecodeValue<'a> for Box<T>
where T: DecodeValue<'a>,

fn decode_value<R>(reader: &mut R, header: Header) -> Result<Box<T>, Error>
where R: Reader<'a>,

Attempt to decode this message using the provided [Reader].