Struct gclient::ext::sp_core::sp_std::prelude::Box

1.0.0 · source ·
pub struct Box<T, A = Global>(/* private fields */)
where
    A: Allocator,
    T: ?Sized;
Expand description

A pointer type that uniquely owns a heap allocation of type T.

See the module-level documentation for more.

Implementations§

source§

impl<T> Box<T>

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);
source

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)
source

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.

source

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)?;
source

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);
source

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);
source§

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

source

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);
source

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)?;
source

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)
source

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);
source

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)
source

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);
source

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.

source

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.

source

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);
source§

impl<T> Box<[T]>

source

pub fn new_uninit_slice(len: usize) -> Box<[MaybeUninit<T>]>

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

Constructs a new boxed slice with uninitialized contents.

§Examples
#![feature(new_uninit)]

let mut values = Box::<[u32]>::new_uninit_slice(3);

let values = unsafe {
    // Deferred initialization:
    values[0].as_mut_ptr().write(1);
    values[1].as_mut_ptr().write(2);
    values[2].as_mut_ptr().write(3);

    values.assume_init()
};

assert_eq!(*values, [1, 2, 3])
source

pub fn new_zeroed_slice(len: usize) -> Box<[MaybeUninit<T>]>

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

Constructs a new boxed slice 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 values = Box::<[u32]>::new_zeroed_slice(3);
let values = unsafe { values.assume_init() };

assert_eq!(*values, [0, 0, 0])
source

pub fn try_new_uninit_slice( len: usize ) -> Result<Box<[MaybeUninit<T>]>, AllocError>

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

Constructs a new boxed slice with uninitialized contents. Returns an error if the allocation fails

§Examples
#![feature(allocator_api, new_uninit)]

let mut values = Box::<[u32]>::try_new_uninit_slice(3)?;
let values = unsafe {
    // Deferred initialization:
    values[0].as_mut_ptr().write(1);
    values[1].as_mut_ptr().write(2);
    values[2].as_mut_ptr().write(3);
    values.assume_init()
};

assert_eq!(*values, [1, 2, 3]);
source

pub fn try_new_zeroed_slice( len: usize ) -> Result<Box<[MaybeUninit<T>]>, AllocError>

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

Constructs a new boxed slice with uninitialized contents, with the memory being filled with 0 bytes. Returns 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)]

let values = Box::<[u32]>::try_new_zeroed_slice(3)?;
let values = unsafe { values.assume_init() };

assert_eq!(*values, [0, 0, 0]);
source§

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

source

pub fn new_uninit_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>

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

Constructs a new boxed slice with uninitialized contents in the provided allocator.

§Examples
#![feature(allocator_api, new_uninit)]

use std::alloc::System;

let mut values = Box::<[u32], _>::new_uninit_slice_in(3, System);

let values = unsafe {
    // Deferred initialization:
    values[0].as_mut_ptr().write(1);
    values[1].as_mut_ptr().write(2);
    values[2].as_mut_ptr().write(3);

    values.assume_init()
};

assert_eq!(*values, [1, 2, 3])
source

pub fn new_zeroed_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>

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

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

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

§Examples
#![feature(allocator_api, new_uninit)]

use std::alloc::System;

let values = Box::<[u32], _>::new_zeroed_slice_in(3, System);
let values = unsafe { values.assume_init() };

assert_eq!(*values, [0, 0, 0])
source§

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

source

pub unsafe fn assume_init(self) -> Box<T, A>

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

Converts to Box<T, A>.

§Safety

As with MaybeUninit::assume_init, it is up to the caller to guarantee that the value really is in an initialized state. Calling this when the content is not yet fully initialized causes immediate undefined behavior.

§Examples
#![feature(new_uninit)]

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

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

    five.assume_init()
};

assert_eq!(*five, 5)
source

pub fn write(boxed: Box<MaybeUninit<T>, A>, value: T) -> Box<T, A>

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

Writes the value and converts to Box<T, A>.

This method converts the box similarly to Box::assume_init but writes value into it before conversion thus guaranteeing safety. In some scenarios use of this method may improve performance because the compiler may be able to optimize copying from stack.

§Examples
#![feature(new_uninit)]

let big_box = Box::<[usize; 1024]>::new_uninit();

let mut array = [0; 1024];
for (i, place) in array.iter_mut().enumerate() {
    *place = i;
}

// The optimizer may be able to elide this copy, so previous code writes
// to heap directly.
let big_box = Box::write(big_box, array);

for (i, x) in big_box.iter().enumerate() {
    assert_eq!(*x, i);
}
source§

impl<T, A> Box<[MaybeUninit<T>], A>
where A: Allocator,

source

pub unsafe fn assume_init(self) -> Box<[T], A>

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

Converts to Box<[T], A>.

§Safety

As with MaybeUninit::assume_init, it is up to the caller to guarantee that the values really are in an initialized state. Calling this when the content is not yet fully initialized causes immediate undefined behavior.

§Examples
#![feature(new_uninit)]

let mut values = Box::<[u32]>::new_uninit_slice(3);

let values = unsafe {
    // Deferred initialization:
    values[0].as_mut_ptr().write(1);
    values[1].as_mut_ptr().write(2);
    values[2].as_mut_ptr().write(3);

    values.assume_init()
};

assert_eq!(*values, [1, 2, 3])
source§

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);
}
source§

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));
}
source

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);
source§

impl<A> Box<dyn Any, A>
where A: Allocator,

source

pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any, A>>
where T: Any,

Attempt to downcast the box to a concrete type.

§Examples
use std::any::Any;

fn print_if_string(value: Box<dyn Any>) {
    if let Ok(string) = value.downcast::<String>() {
        println!("String ({}): {}", string.len(), string);
    }
}

let my_string = "Hello World".to_string();
print_if_string(Box::new(my_string));
print_if_string(Box::new(0i8));
source

pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>
where T: Any,

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

Downcasts the box to a concrete type.

For a safe alternative see downcast.

§Examples
#![feature(downcast_unchecked)]

use std::any::Any;

let x: Box<dyn Any> = Box::new(1_usize);

unsafe {
    assert_eq!(*x.downcast_unchecked::<usize>(), 1);
}
§Safety

The contained value must be of type T. Calling this method with the incorrect type is undefined behavior.

source§

impl<A> Box<dyn Any + Send, A>
where A: Allocator,

source

pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send, A>>
where T: Any,

Attempt to downcast the box to a concrete type.

§Examples
use std::any::Any;

fn print_if_string(value: Box<dyn Any + Send>) {
    if let Ok(string) = value.downcast::<String>() {
        println!("String ({}): {}", string.len(), string);
    }
}

let my_string = "Hello World".to_string();
print_if_string(Box::new(my_string));
print_if_string(Box::new(0i8));
source

pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>
where T: Any,

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

Downcasts the box to a concrete type.

For a safe alternative see downcast.

§Examples
#![feature(downcast_unchecked)]

use std::any::Any;

let x: Box<dyn Any + Send> = Box::new(1_usize);

unsafe {
    assert_eq!(*x.downcast_unchecked::<usize>(), 1);
}
§Safety

The contained value must be of type T. Calling this method with the incorrect type is undefined behavior.

source§

impl<A> Box<dyn Any + Send + Sync, A>
where A: Allocator,

1.51.0 · source

pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send + Sync, A>>
where T: Any,

Attempt to downcast the box to a concrete type.

§Examples
use std::any::Any;

fn print_if_string(value: Box<dyn Any + Send + Sync>) {
    if let Ok(string) = value.downcast::<String>() {
        println!("String ({}): {}", string.len(), string);
    }
}

let my_string = "Hello World".to_string();
print_if_string(Box::new(my_string));
print_if_string(Box::new(0i8));
source

pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>
where T: Any,

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

Downcasts the box to a concrete type.

For a safe alternative see downcast.

§Examples
#![feature(downcast_unchecked)]

use std::any::Any;

let x: Box<dyn Any + Send + Sync> = Box::new(1_usize);

unsafe {
    assert_eq!(*x.downcast_unchecked::<usize>(), 1);
}
§Safety

The contained value must be of type T. Calling this method with the incorrect type is undefined behavior.

Trait Implementations§

1.64.0 · source§

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

source§

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

Borrows the file descriptor. Read more
1.5.0 · source§

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

source§

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

Converts this type into a mutable reference of the (usually inferred) input type.
1.63.0 · source§

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

source§

fn as_raw_fd(&self) -> i32

Extracts the raw file descriptor. Read more
1.5.0 · source§

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

source§

fn as_ref(&self) -> &T

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

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> 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>>

Attempts 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
source§

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.
source§

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
source§

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
§

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> AsyncRead for Box<T>
where T: AsyncRead + Unpin + ?Sized,

§

fn poll_read( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, buf: &mut ReadBuf<'_> ) -> Poll<Result<(), Error>>

Attempts to read from the AsyncRead into buf. 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> AsyncSeek for Box<T>
where T: AsyncSeek + Unpin + ?Sized,

§

fn start_seek(self: Pin<&mut Box<T>>, pos: SeekFrom) -> Result<(), Error>

Attempts to seek to an offset, in bytes, in a stream. Read more
§

fn poll_complete( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<u64, Error>>

Waits for a seek operation to complete. 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> 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>>

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

fn is_write_vectored(&self) -> bool

Determines if this writer has an efficient poll_write_vectored implementation. Read more
§

fn poll_flush( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<(), Error>>

Attempts to flush the object, ensuring that any buffered data reach their destination. Read more
§

fn poll_shutdown( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<(), Error>>

Initiates or attempts to shut down this writer, returning success when the I/O connection has completely shut down. Read more
source§

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

§

type Data = <T as Body>::Data

Values yielded by the Body.
§

type Error = <T as Body>::Error

The error type this Body might generate.
source§

fn poll_data( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Option<Result<<Box<T> as Body>::Data, <Box<T> as Body>::Error>>>

Attempt to pull out the next data buffer of this stream.
source§

fn poll_trailers( self: Pin<&mut Box<T>>, cx: &mut Context<'_> ) -> Poll<Result<Option<HeaderMap>, <Box<T> as Body>::Error>>

Poll for an optional single HeaderMap of trailers. Read more
source§

fn is_end_stream(&self) -> bool

Returns true when the end of stream has been reached. Read more
source§

fn size_hint(&self) -> SizeHint

Returns the bounds on the remaining length of the stream. Read more
source§

fn data(&mut self) -> Data<'_, Self>
where Self: Unpin + Sized,

Returns future that resolves to next data chunk, if any.
source§

fn trailers(&mut self) -> Trailers<'_, Self>
where Self: Unpin + Sized,

Returns future that resolves to trailers, if any.
source§

fn map_data<F, B>(self, f: F) -> MapData<Self, F>
where Self: Sized, F: FnMut(Self::Data) -> B, B: Buf,

Maps this body’s data value to a different value.
source§

fn map_err<F, E>(self, f: F) -> MapErr<Self, F>
where Self: Sized, F: FnMut(Self::Error) -> E,

Maps this body’s error value to a different value.
1.1.0 · source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
1.1.0 · source§

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

source§

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

Mutably borrows from an owned value. Read more
§

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<U>(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<U>(self, next: U) -> Chain<Self, U>
where U: BufMut, Self: Sized,

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

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

source§

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
source§

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
source§

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
source§

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
source§

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
source§

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
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
source§

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

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

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

source§

fn clear(&mut self)

Clear all data in self, retaining the allocated capacithy.
1.3.0 · source§

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

source§

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

Returns a copy of the value. Read more
source§

fn clone_from(&mut self, other: &Box<[T], A>)

Performs copy-assignment from source. Read more
§

impl Clone for Box<BStr>

§

fn clone(&self) -> Box<BStr>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
1.29.0 · source§

impl Clone for Box<CStr>

source§

fn clone(&self) -> Box<CStr>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
1.29.0 · source§

impl Clone for Box<OsStr>

source§

fn clone(&self) -> Box<OsStr>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
1.29.0 · source§

impl Clone for Box<Path>

source§

fn clone(&self) -> Box<Path>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl Clone for Box<RawValue>

source§

fn clone(&self) -> Box<RawValue>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<K, V> Clone for Box<Slice<K, V>>
where K: Clone, V: Clone,

§

fn clone(&self) -> Box<Slice<K, V>>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<T> Clone for Box<Slice<T>>
where T: Clone,

§

fn clone(&self) -> Box<Slice<T>>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

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

source§

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);
source§

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);
source§

impl<'clone> Clone for Box<dyn DynClone + 'clone>

source§

fn clone(&self) -> Box<dyn DynClone + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<'clone> Clone for Box<dyn DynClone + Send + 'clone>

source§

fn clone(&self) -> Box<dyn DynClone + Send + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<'clone> Clone for Box<dyn DynClone + Send + Sync + 'clone>

source§

fn clone(&self) -> Box<dyn DynClone + Send + Sync + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

impl<'clone> Clone for Box<dyn DynClone + Sync + 'clone>

source§

fn clone(&self) -> Box<dyn DynClone + Sync + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl Clone for Box<dyn DynDigest>

§

fn clone(&self) -> Box<dyn DynDigest>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl Clone for Box<dyn DynDigest>

§

fn clone(&self) -> Box<dyn DynDigest>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnEssentialNamed + 'clone>

§

fn clone(&self) -> Box<dyn SpawnEssentialNamed + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnEssentialNamed + Send + 'clone>

§

fn clone(&self) -> Box<dyn SpawnEssentialNamed + Send + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnEssentialNamed + Send + Sync + 'clone>

§

fn clone(&self) -> Box<dyn SpawnEssentialNamed + Send + Sync + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnEssentialNamed + Sync + 'clone>

§

fn clone(&self) -> Box<dyn SpawnEssentialNamed + Sync + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnNamed + 'clone>

§

fn clone(&self) -> Box<dyn SpawnNamed + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnNamed + Send + 'clone>

§

fn clone(&self) -> Box<dyn SpawnNamed + Send + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnNamed + Send + Sync + 'clone>

§

fn clone(&self) -> Box<dyn SpawnNamed + Send + Sync + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
§

impl<'clone> Clone for Box<dyn SpawnNamed + Sync + 'clone>

§

fn clone(&self) -> Box<dyn SpawnNamed + Sync + 'clone>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
1.3.0 · source§

impl Clone for Box<str>

source§

fn clone(&self) -> Box<str>

Returns a copy of the value. Read more
source§

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

Performs copy-assignment from source. Read more
source§

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
source§

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
source§

impl<G, R, A> Coroutine<R> for Pin<Box<G, A>>
where G: Coroutine<R> + ?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
source§

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

🔬This is a nightly-only experimental API. (coroutine_trait)
Resumes the execution of this coroutine. 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
source§

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

source§

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

Formats the value using the given formatter. Read more
source§

impl<S> DebugSecret for Box<S>
where S: DebugSecret + Zeroize,

source§

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

Format information about the secret’s type. Read more
source§

impl<T> Default for Box<[T]>

source§

fn default() -> Box<[T]>

Returns the “default value” for a type. Read more
1.17.0 · source§

impl Default for Box<CStr>

source§

fn default() -> Box<CStr>

Returns the “default value” for a type. Read more
1.17.0 · source§

impl Default for Box<OsStr>

source§

fn default() -> Box<OsStr>

Returns the “default value” for a type. Read more
source§

impl Default for Box<RawValue>

source§

fn default() -> Box<RawValue>

Returns the “default value” for a type. Read more
§

impl<K, V> Default for Box<Slice<K, V>>

§

fn default() -> Box<Slice<K, V>>

Returns the “default value” for a type. Read more
§

impl<T> Default for Box<Slice<T>>

§

fn default() -> Box<Slice<T>>

Returns the “default value” for a type. Read more
source§

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

source§

fn default() -> Box<T>

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

1.17.0 · source§

impl Default for Box<str>

source§

fn default() -> Box<str>

Returns the “default value” for a type. Read more
source§

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

§

type Target = T

The resulting type after dereferencing.
source§

fn deref(&self) -> &T

Dereferences the value.
source§

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

source§

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

Mutably dereferences the value.
source§

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

source§

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
source§

impl<'de> Deserialize<'de> for Box<CStr>

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de> Deserialize<'de> for Box<OsStr>

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de> Deserialize<'de> for Box<Path>

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

impl<'de> Deserialize<'de> for Box<RawValue>

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

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

source§

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
source§

impl<'de> Deserialize<'de> for Box<str>

source§

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

Deserialize this value from the given Serde deserializer. Read more
source§

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

source§

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

Formats the value using the given formatter. Read more
source§

impl<I> DoubleEndedFallibleIterator for Box<I>

source§

fn next_back( &mut self ) -> Result<Option<<I as FallibleIterator>::Item>, <I as FallibleIterator>::Error>

Advances the end of the iterator, returning the last value.
source§

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.
source§

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
source§

impl<I, A> DoubleEndedIterator for Box<I, A>

source§

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

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

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

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

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<P>(&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
source§

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

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
§

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

§

fn encode_as_type_to( &self, type_id: u32, types: &PortableRegistry, out: &mut Vec<u8> ) -> Result<(), Error>

Given some type_id, types, a context and some output target for the SCALE encoded bytes, attempt to SCALE encode the current value into the type given by type_id.
§

fn encode_as_type( &self, type_id: u32, types: &PortableRegistry ) -> Result<Vec<u8>, Error>

This is a helper function which internally calls [EncodeAsType::encode_as_type_to]. Prefer to implement that instead.
source§

impl Error for Box<ErrorKind>

source§

fn custom<T>(desc: T) -> Box<ErrorKind>
where T: Display,

Raised when there is general error when deserializing a type. Read more
source§

fn invalid_type(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a type different from what it was expecting. Read more
source§

fn invalid_value(unexp: Unexpected<'_>, exp: &dyn Expected) -> Self

Raised when a Deserialize receives a value of the right type but that is wrong for some other reason. Read more
source§

fn invalid_length(len: usize, exp: &dyn Expected) -> Self

Raised when deserializing a sequence or map and the input data contains too many or too few elements. Read more
source§

fn unknown_variant(variant: &str, expected: &'static [&'static str]) -> Self

Raised when a Deserialize enum type received a variant with an unrecognized name.
source§

fn unknown_field(field: &str, expected: &'static [&'static str]) -> Self

Raised when a Deserialize struct type received a field with an unrecognized name.
source§

fn missing_field(field: &'static str) -> Self

Raised when a Deserialize struct type expected to receive a required field with a particular name but that field was not present in the input.
source§

fn duplicate_field(field: &'static str) -> Self

Raised when a Deserialize struct type received more than one of the same field.
source§

impl Error for Box<ErrorKind>

source§

fn custom<T>(msg: T) -> Box<ErrorKind>
where T: Display,

Used when a Serialize implementation encounters any error while serializing a type. Read more
1.8.0 · source§

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

source§

fn description(&self) -> &str

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

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

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

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

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

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
source§

impl<I, A> ExactSizeIterator for Box<I, A>

source§

fn len(&self) -> usize

Returns the exact remaining length of the iterator. Read more
source§

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.45.0 · source§

impl Extend<Box<str>> for String

source§

fn extend<I>(&mut self, iter: I)
where I: IntoIterator<Item = Box<str>>,

Extends a collection with the contents of an iterator. Read more
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
§

impl<E> Extension for Box<E>
where E: Extension + ?Sized,

§

fn is_enabled(&self) -> bool

Is this extension enabled?
§

fn name(&self) -> &str

The name of this extension.
§

fn params(&self) -> &[Param<'_>]

The parameters this extension wants to send for negotiation.
§

fn configure( &mut self, params: &[Param<'_>] ) -> Result<(), Box<dyn Error + Send + Sync>>

Configure this extension with the parameters received from negotiation.
§

fn encode( &mut self, header: &mut Header, data: &mut Storage<'_> ) -> Result<(), Box<dyn Error + Send + Sync>>

Encode a frame, given as frame header and payload data.
§

fn decode( &mut self, header: &mut Header, data: &mut Vec<u8> ) -> Result<(), Box<dyn Error + Send + Sync>>

Decode a frame. Read more
§

fn reserved_bits(&self) -> (bool, bool, bool)

The reserved bits this extension uses.
§

impl Extension for Box<dyn Extension>

§

fn as_mut_any(&mut self) -> &mut (dyn Any + 'static)

Return the extension as &mut dyn Any. Read more
§

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
source§

impl<I> FallibleIterator for Box<I>
where I: FallibleIterator + ?Sized,

§

type Item = <I as FallibleIterator>::Item

The type being iterated over.
§

type Error = <I as FallibleIterator>::Error

The error type.
source§

fn next( &mut self ) -> Result<Option<<I as FallibleIterator>::Item>, <I as FallibleIterator>::Error>

Advances the iterator and returns the next value. Read more
source§

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

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

fn nth( &mut self, n: usize ) -> Result<Option<<I as FallibleIterator>::Item>, <I as FallibleIterator>::Error>

Returns the nth element of the iterator.
source§

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

Consumes the iterator, returning the number of remaining items.
source§

fn last(self) -> Result<Option<Self::Item>, Self::Error>
where Self: Sized,

Returns the last element of the iterator.
source§

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
source§

fn chain<I>(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.
source§

fn zip<I>( self, o: I ) -> Zip<Self, <I as IntoFallibleIterator>::IntoFallibleIter>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>,

Returns an iterator that yields pairs of this iterator’s and another iterator’s values.
source§

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.
source§

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.
source§

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.
source§

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

Returns an iterator which both filters and maps. The closure may fail; such failures are passed along to the consumer.
source§

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

Returns an iterator which yields the current iteration count as well as the value.
source§

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

Returns an iterator that can peek at the next element without consuming it.
source§

fn skip_while<P>(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.
source§

fn take_while<P>(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.
source§

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

Returns an iterator which skips the first n values of this iterator.
source§

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

Returns an iterator that yields only the first n values of this iterator.
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) -> Result<Option<B>, Self::Error>,

Returns an iterator which applies a stateful map to values of this iterator.
source§

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.
source§

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
source§

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.
source§

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

Borrow an iterator rather than consuming it. Read more
source§

fn collect<T>(self) -> Result<T, Self::Error>
where T: FromFallibleIterator<Self::Item>, Self: Sized,

Transforms the iterator into a collection. Read more
source§

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.
source§

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.
source§

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
source§

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.
source§

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.
source§

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.
source§

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

Applies a function to the elements of the iterator, returning the first non-None result.
source§

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.
source§

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.
source§

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.
source§

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.
source§

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.
source§

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<B>,

Converts an iterator of pairs into a pair of containers.
source§

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.
source§

fn partial_cmp<I>(self, other: I) -> Result<Option<Ordering>, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<<I as IntoFallibleIterator>::Item>,

Lexicographically compares the elements of this iterator to that of another.
source§

fn eq<I>(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialEq<<I as IntoFallibleIterator>::Item>,

Determines if the elements of this iterator are equal to those of another.
source§

fn ne<I>(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialEq<<I as IntoFallibleIterator>::Item>,

Determines if the elements of this iterator are not equal to those of another.
source§

fn lt<I>(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<<I as IntoFallibleIterator>::Item>,

Determines if the elements of this iterator are lexicographically less than those of another.
source§

fn le<I>(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<<I as IntoFallibleIterator>::Item>,

Determines if the elements of this iterator are lexicographically less than or equal to those of another.
source§

fn gt<I>(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<<I as IntoFallibleIterator>::Item>,

Determines if the elements of this iterator are lexicographically greater than those of another.
source§

fn ge<I>(self, other: I) -> Result<bool, Self::Error>
where Self: Sized, I: IntoFallibleIterator<Error = Self::Error>, Self::Item: PartialOrd<<I as IntoFallibleIterator>::Item>,

Determines if the elements of this iterator are lexicographically greater than or equal to those of another.
source§

fn iterator(self) -> Iterator<Self>
where Self: Sized,

Returns a normal (non-fallible) iterator over Result<Item, Error>.
source§

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.
source§

impl<S> Filter<S> for Box<dyn Filter<S> + Send + Sync>

source§

fn enabled(&self, meta: &Metadata<'_>, cx: &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
source§

fn callsite_enabled(&self, meta: &'static Metadata<'static>) -> Interest

Returns an Interest indicating whether this layer will always, sometimes, or never be interested in the given Metadata. Read more
source§

fn max_level_hint(&self) -> Option<LevelFilter>

Returns an optional hint of the highest verbosity level that this Filter will enable. Read more
1.35.0 · source§

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

source§

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.35.0 · source§

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

source§

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.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.
source§

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.17.0 · source§

impl<T> From<&[T]> for Box<[T]>
where T: Clone,

source§

fn from(slice: &[T]) -> Box<[T]>

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

This conversion allocates on the heap and performs a copy of slice and its contents.

§Examples
// create a &[u8] which will be used to create a Box<[u8]>
let slice: &[u8] = &[104, 101, 108, 108, 111];
let boxed_slice: Box<[u8]> = Box::from(slice);

println!("{boxed_slice:?}");
1.17.0 · source§

impl From<&CStr> for Box<CStr>

source§

fn from(s: &CStr) -> Box<CStr>

Converts a &CStr into a Box<CStr>, by copying the contents into a newly allocated Box.

1.17.0 · source§

impl From<&OsStr> for Box<OsStr>

source§

fn from(s: &OsStr) -> Box<OsStr>

Copies the string into a newly allocated Box<OsStr>.

1.17.0 · source§

impl From<&Path> for Box<Path>

source§

fn from(path: &Path) -> Box<Path>

Creates a boxed Path from a reference.

This will allocate and clone path to it.

§

impl<K, V> From<&Slice<K, V>> for Box<Slice<K, V>>
where K: Copy, V: Copy,

§

fn from(slice: &Slice<K, V>) -> Box<Slice<K, V>>

Converts to this type from the input type.
§

impl<T> From<&Slice<T>> for Box<Slice<T>>
where T: Copy,

§

fn from(slice: &Slice<T>) -> Box<Slice<T>>

Converts to this type from the input type.
1.6.0 · source§

impl From<&str> for Box<dyn Error>

source§

fn from(err: &str) -> Box<dyn Error>

Converts a str into a box of dyn Error.

§Examples
use std::error::Error;
use std::mem;

let a_str_error = "a str error";
let a_boxed_error = Box::<dyn Error>::from(a_str_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
source§

impl<'a> From<&str> for Box<dyn Error + Send + Sync + 'a>

source§

fn from(err: &str) -> Box<dyn Error + Send + Sync + 'a>

Converts a str into a box of dyn Error + Send + Sync.

§Examples
use std::error::Error;
use std::mem;

let a_str_error = "a str error";
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_str_error);
assert!(
    mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
1.17.0 · source§

impl From<&str> for Box<str>

source§

fn from(s: &str) -> Box<str>

Converts a &str into a Box<str>

This conversion allocates on the heap and performs a copy of s.

§Examples
let boxed: Box<str> = Box::from("hello");
println!("{boxed}");
1.45.0 · source§

impl<T, const N: usize> From<[T; N]> for Box<[T]>

source§

fn from(array: [T; N]) -> Box<[T]>

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

This conversion moves the array to newly heap-allocated memory.

§Examples
let boxed: Box<[u8]> = Box::from([4, 2]);
println!("{boxed:?}");
§

impl<T, O> From<BitBox<T, O>> for Box<[T]>
where T: BitStore, O: BitOrder,

§

fn from(bb: BitBox<T, O>) -> Box<[T]>

Converts to this type from the input type.
1.18.0 · source§

impl<T, A> From<Box<[T], A>> for Vec<T, A>
where A: Allocator,

source§

fn from(s: Box<[T], A>) -> Vec<T, A>

Convert a boxed slice into a vector by transferring ownership of the existing heap allocation.

§Examples
let b: Box<[i32]> = vec![1, 2, 3].into_boxed_slice();
assert_eq!(Vec::from(b), vec![1, 2, 3]);
§

impl From<Box<[u8]>> for Box<BStr>

§

fn from(s: Box<[u8]>) -> Box<BStr>

Converts to this type from the input type.
§

impl From<Box<[u8]>> for Bytes

§

fn from(slice: Box<[u8]>) -> Bytes

Converts to this type from the input type.
§

impl From<Box<BStr>> for Box<[u8]>

§

fn from(s: Box<BStr>) -> Box<[u8]>

Converts to this type from the input type.
1.18.0 · source§

impl From<Box<CStr>> for CString

source§

fn from(s: Box<CStr>) -> CString

Converts a Box<CStr> into a CString without copying or allocating.

§

impl<'a, F> From<Box<F>> for FutureObj<'a, ()>
where F: Future<Output = ()> + Send + 'a,

§

fn from(boxed: Box<F>) -> FutureObj<'a, ()>

Converts to this type from the input type.
§

impl<'a, F> From<Box<F>> for LocalFutureObj<'a, ()>
where F: Future<Output = ()> + 'a,

§

fn from(boxed: Box<F>) -> LocalFutureObj<'a, ()>

Converts to this type from the input type.
1.18.0 · source§

impl From<Box<OsStr>> for OsString

source§

fn from(boxed: Box<OsStr>) -> OsString

Converts a Box<OsStr> into an OsString without copying or allocating.

1.18.0 · source§

impl From<Box<Path>> for PathBuf

source§

fn from(boxed: Box<Path>) -> PathBuf

Converts a Box<Path> into a PathBuf.

This conversion does not allocate or copy memory.

source§

impl From<Box<RawValue>> for Box<str>

source§

fn from(raw_value: Box<RawValue>) -> Box<str>

Converts to this type from the input type.
§

impl<T, O> From<Box<T>> for BitBox<T, O>
where T: BitStore, O: BitOrder,

§

fn from(elem: Box<T>) -> BitBox<T, O>

Converts to this type from the input type.
1.21.0 · source§

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

source§

fn from(v: Box<T, A>) -> Arc<T, A>

Move a boxed object to a new, reference-counted allocation.

§Example
let unique: Box<str> = Box::from("eggplant");
let shared: Arc<str> = Arc::from(unique);
assert_eq!("eggplant", &shared[..]);
1.33.0 · source§

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

source§

fn from(boxed: Box<T, A>) -> Pin<Box<T, A>>

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 Box::into_pin.

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

1.21.0 · source§

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

source§

fn from(v: Box<T, A>) -> Rc<T, A>

Move a boxed object to a new, reference counted, allocation.

§Example
let original: Box<i32> = Box::new(1);
let shared: Rc<i32> = Rc::from(original);
assert_eq!(1, *shared);
§

impl<H, CodecError> From<Box<TrieError<H, CodecError>>> for Error<H, CodecError>

§

fn from(error: Box<TrieError<H, CodecError>>) -> Error<H, CodecError>

Converts to this type from the input type.
§

impl<H> From<Box<TrieError<H, Error<H>>>> for Error<H>

§

fn from(x: Box<TrieError<H, Error<H>>>) -> Error<H>

Converts to this type from the input type.
§

impl From<Box<dyn CustomError>> for ErrorKind

§

fn from(original: Box<dyn CustomError>) -> ErrorKind

Converts to this type from the input type.
§

impl From<Box<dyn CustomError>> for ErrorKind

§

fn from(original: Box<dyn CustomError>) -> ErrorKind

Converts to this type from the input type.
§

impl From<Box<dyn DbExternalities>> for OffchainDbExt

§

fn from(inner: Box<dyn DbExternalities>) -> OffchainDbExt

Converts to this type from the input type.
§

impl From<Box<dyn Error + Send + Sync>> for Error

§

fn from(source: Box<dyn Error + Send + Sync>) -> Error

Converts to this type from the input type.
source§

impl From<Box<dyn Error + Send + Sync>> for ParseError

source§

fn from(e: Box<dyn Error + Send + Sync>) -> ParseError

Converts to this type from the input type.
§

impl From<Box<dyn Externalities>> for OffchainWorkerExt

§

fn from(inner: Box<dyn Externalities>) -> OffchainWorkerExt

Converts to this type from the input type.
§

impl<'a> From<Box<dyn Future<Output = ()> + 'a>> for LocalFutureObj<'a, ()>

§

fn from(boxed: Box<dyn Future<Output = ()> + 'a>) -> LocalFutureObj<'a, ()>

Converts to this type from the input type.
§

impl<'a> From<Box<dyn Future<Output = ()> + Send + 'a>> for FutureObj<'a, ()>

§

fn from(boxed: Box<dyn Future<Output = ()> + Send + 'a>) -> FutureObj<'a, ()>

Converts to this type from the input type.
§

impl From<Box<dyn ReadRuntimeVersion>> for ReadRuntimeVersionExt

§

fn from(inner: Box<dyn ReadRuntimeVersion>) -> ReadRuntimeVersionExt

Converts to this type from the input type.
§

impl From<Box<dyn Stream<Item = Result<Bytes, Box<dyn Error + Send + Sync>>> + Send>> for Body

§Optional

This function requires enabling the stream feature in your Cargo.toml.

§

fn from( stream: Box<dyn Stream<Item = Result<Bytes, Box<dyn Error + Send + Sync>>> + Send> ) -> Body

Converts to this type from the input type.
§

impl From<Box<dyn TransactionPool + Send>> for TransactionPoolExt

§

fn from(inner: Box<dyn TransactionPool + Send>) -> TransactionPoolExt

Converts to this type from the input type.
1.18.0 · source§

impl From<Box<str>> for String

source§

fn from(s: Box<str>) -> String

Converts the given boxed str slice to a String. It is notable that the str slice is owned.

§Examples
let s1: String = String::from("hello world");
let s2: Box<str> = s1.into_boxed_str();
let s3: String = String::from(s2);

assert_eq!("hello world", s3)
1.19.0 · source§

impl<A> From<Box<str, A>> for Box<[u8], A>
where A: Allocator,

source§

fn from(s: Box<str, A>) -> Box<[u8], A>

Converts a Box<str> into a Box<[u8]>

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

§Examples
// create a Box<str> which will be used to create a Box<[u8]>
let boxed: Box<str> = Box::from("hello");
let boxed_str: Box<[u8]> = Box::from(boxed);

// create a &[u8] which will be used to create a Box<[u8]>
let slice: &[u8] = &[104, 101, 108, 108, 111];
let boxed_slice = Box::from(slice);

assert_eq!(boxed_slice, boxed_str);
1.20.0 · source§

impl From<CString> for Box<CStr>

source§

fn from(s: CString) -> Box<CStr>

Converts a CString into a Box<CStr> without copying or allocating.

§

impl From<ColoredString> for Box<dyn Error>

§

fn from(cs: ColoredString) -> Box<dyn Error>

Converts to this type from the input type.
1.45.0 · source§

impl<T> From<Cow<'_, [T]>> for Box<[T]>
where T: Clone,

source§

fn from(cow: Cow<'_, [T]>) -> Box<[T]>

Converts a Cow<'_, [T]> into a Box<[T]>

When cow is the Cow::Borrowed variant, this conversion allocates on the heap and copies the underlying slice. Otherwise, it will try to reuse the owned Vec’s allocation.

1.45.0 · source§

impl From<Cow<'_, CStr>> for Box<CStr>

source§

fn from(cow: Cow<'_, CStr>) -> Box<CStr>

Converts a Cow<'a, CStr> into a Box<CStr>, by copying the contents if they are borrowed.

1.45.0 · source§

impl From<Cow<'_, OsStr>> for Box<OsStr>

source§

fn from(cow: Cow<'_, OsStr>) -> Box<OsStr>

Converts a Cow<'a, OsStr> into a Box<OsStr>, by copying the contents if they are borrowed.

1.45.0 · source§

impl From<Cow<'_, Path>> for Box<Path>

source§

fn from(cow: Cow<'_, Path>) -> Box<Path>

Creates a boxed Path from a clone-on-write pointer.

Converting from a Cow::Owned does not clone or allocate.

1.45.0 · source§

impl From<Cow<'_, str>> for Box<str>

source§

fn from(cow: Cow<'_, str>) -> Box<str>

Converts a Cow<'_, str> into a Box<str>

When cow is the Cow::Borrowed variant, this conversion allocates on the heap and copies the underlying str. Otherwise, it will try to reuse the owned String’s allocation.

§Examples
use std::borrow::Cow;

let unboxed = Cow::Borrowed("hello");
let boxed: Box<str> = Box::from(unboxed);
println!("{boxed}");
let unboxed = Cow::Owned("hello".to_string());
let boxed: Box<str> = Box::from(unboxed);
println!("{boxed}");
1.22.0 · source§

impl<'a> From<Cow<'a, str>> for Box<dyn Error>

source§

fn from(err: Cow<'a, str>) -> Box<dyn Error>

Converts a Cow into a box of dyn Error.

§Examples
use std::error::Error;
use std::mem;
use std::borrow::Cow;

let a_cow_str_error = Cow::from("a str error");
let a_boxed_error = Box::<dyn Error>::from(a_cow_str_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
1.22.0 · source§

impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + Send + Sync + 'a>

source§

fn from(err: Cow<'b, str>) -> Box<dyn Error + Send + Sync + 'a>

Converts a Cow into a box of dyn Error + Send + Sync.

§Examples
use std::error::Error;
use std::mem;
use std::borrow::Cow;

let a_cow_str_error = Cow::from("a str error");
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_cow_str_error);
assert!(
    mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
source§

impl<'a, E> From<E> for Box<dyn Error + 'a>
where E: Error + 'a,

source§

fn from(err: E) -> Box<dyn Error + 'a>

Converts a type of Error into a box of dyn Error.

§Examples
use std::error::Error;
use std::fmt;
use std::mem;

#[derive(Debug)]
struct AnError;

impl fmt::Display for AnError {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "An error")
    }
}

impl Error for AnError {}

let an_error = AnError;
assert!(0 == mem::size_of_val(&an_error));
let a_boxed_error = Box::<dyn Error>::from(an_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
source§

impl<'a, E> From<E> for Box<dyn Error + Send + Sync + 'a>
where E: Error + Send + Sync + 'a,

source§

fn from(err: E) -> Box<dyn Error + Send + Sync + 'a>

Converts a type of Error + Send + Sync into a box of dyn Error + Send + Sync.

§Examples
use std::error::Error;
use std::fmt;
use std::mem;

#[derive(Debug)]
struct AnError;

impl fmt::Display for AnError {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "An error")
    }
}

impl Error for AnError {}

unsafe impl Send for AnError {}

unsafe impl Sync for AnError {}

let an_error = AnError;
assert!(0 == mem::size_of_val(&an_error));
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(an_error);
assert!(
    mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
source§

impl From<Error> for Box<ErrorKind>

source§

fn from(err: Error) -> Box<ErrorKind>

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn Error>

source§

fn from(error: Error) -> Box<dyn Error>

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn Error + Send>

source§

fn from(error: Error) -> Box<dyn Error + Send>

Converts to this type from the input type.
source§

impl From<Error> for Box<dyn Error + Send + Sync>

source§

fn from(error: Error) -> Box<dyn Error + Send + Sync>

Converts to this type from the input type.
1.20.0 · source§

impl From<OsString> for Box<OsStr>

source§

fn from(s: OsString) -> Box<OsStr>

Converts an OsString into a Box<OsStr> without copying or allocating.

1.20.0 · source§

impl From<PathBuf> for Box<Path>

source§

fn from(p: PathBuf) -> Box<Path>

Converts a PathBuf into a Box<Path>.

This conversion currently should not allocate memory, but this behavior is not guaranteed on all platforms or in all future versions.

1.6.0 · source§

impl From<String> for Box<dyn Error>

source§

fn from(str_err: String) -> Box<dyn Error>

Converts a String into a box of dyn Error.

§Examples
use std::error::Error;
use std::mem;

let a_string_error = "a string error".to_string();
let a_boxed_error = Box::<dyn Error>::from(a_string_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
source§

impl From<String> for Box<dyn Error + Send + Sync>

source§

fn from(err: String) -> Box<dyn Error + Send + Sync>

Converts a String into a box of dyn Error + Send + Sync.

§Examples
use std::error::Error;
use std::mem;

let a_string_error = "a string error".to_string();
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_string_error);
assert!(
    mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
1.20.0 · source§

impl From<String> for Box<str>

source§

fn from(s: String) -> Box<str>

Converts the given String to a boxed str slice that is owned.

§Examples
let s1: String = String::from("hello world");
let s2: Box<str> = Box::from(s1);
let s3: String = String::from(s2);

assert_eq!("hello world", s3)
1.6.0 · source§

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

source§

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.20.0 · source§

impl<T, A> From<Vec<T, A>> for Box<[T], A>
where A: Allocator,

source§

fn from(v: Vec<T, A>) -> Box<[T], A>

Convert a vector into a boxed slice.

Before doing the conversion, this method discards excess capacity like Vec::shrink_to_fit.

§Examples
assert_eq!(Box::from(vec![1, 2, 3]), vec![1, 2, 3].into_boxed_slice());

Any excess capacity is removed:

let mut vec = Vec::with_capacity(10);
vec.extend([1, 2, 3]);

assert_eq!(Box::from(vec), vec![1, 2, 3].into_boxed_slice());
1.45.0 · source§

impl FromIterator<Box<str>> for String

source§

fn from_iter<I>(iter: I) -> String
where I: IntoIterator<Item = Box<str>>,

Creates a value from an iterator. Read more
1.32.0 · source§

impl<I> FromIterator<I> for Box<[I]>

source§

fn from_iter<T>(iter: T) -> Box<[I]>
where T: IntoIterator<Item = I>,

Creates a value from an iterator. Read more
§

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<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.
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.
source§

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
source§

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

source§

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.22.0 · source§

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

source§

fn finish(&self) -> u64

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

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

Writes some data into this Hasher. Read more
source§

fn write_u8(&mut self, i: u8)

Writes a single u8 into this hasher.
source§

fn write_u16(&mut self, i: u16)

Writes a single u16 into this hasher.
source§

fn write_u32(&mut self, i: u32)

Writes a single u32 into this hasher.
source§

fn write_u64(&mut self, i: u64)

Writes a single u64 into this hasher.
source§

fn write_u128(&mut self, i: u128)

Writes a single u128 into this hasher.
source§

fn write_usize(&mut self, i: usize)

Writes a single usize into this hasher.
source§

fn write_i8(&mut self, i: i8)

Writes a single i8 into this hasher.
source§

fn write_i16(&mut self, i: i16)

Writes a single i16 into this hasher.
source§

fn write_i32(&mut self, i: i32)

Writes a single i32 into this hasher.
source§

fn write_i64(&mut self, i: i64)

Writes a single i64 into this hasher.
source§

fn write_i128(&mut self, i: i128)

Writes a single i128 into this hasher.
source§

fn write_isize(&mut self, i: isize)

Writes a single isize into this hasher.
source§

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
source§

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
§

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

§

fn next_id(&self) -> SubscriptionId<'static>

Returns the next ID for the subscription.
§

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

§

fn next_id(&self) -> SubscriptionId<'static>

Returns the next ID for the subscription.
§

impl<K, V> IntoIterator for Box<Slice<K, V>>

§

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?
§

type Item = (K, V)

The type of the elements being iterated over.
§

fn into_iter(self) -> <Box<Slice<K, V>> as IntoIterator>::IntoIter

Creates an iterator from a value. Read more
§

impl<T> IntoIterator for Box<Slice<T>>

§

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?
§

type Item = T

The type of the elements being iterated over.
§

fn into_iter(self) -> <Box<Slice<T>> as IntoIterator>::IntoIter

Creates an iterator from a value. Read more
§

impl<T> IntoVisitor for Box<T>
where BasicVisitor<Box<T>>: for<'scale, 'info> Visitor<Error = Error, Value<'scale, 'info> = Box<T>>,

§

type Visitor = BasicVisitor<Box<T>>

The visitor type used to decode SCALE encoded bytes to Self.
§

fn into_visitor() -> <Box<T> as IntoVisitor>::Visitor

A means of obtaining this visitor.
source§

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

§

type Item = <I as Iterator>::Item

The type of the elements being iterated over.
source§

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

Advances the iterator and returns the next value. Read more
source§

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

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

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

Returns the nth element of the iterator. Read more
source§

fn last(self) -> Option<<I as Iterator>::Item>

Consumes the iterator, returning the last element. Read more
source§

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
source§

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

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

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
source§

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

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

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

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

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
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
source§

fn filter<P>(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
source§

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

Creates an iterator that both filters and maps. Read more
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
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
source§

fn skip_while<P>(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
source§

fn take_while<P>(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<B>,

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

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

Creates an iterator that skips the first n elements. Read more
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
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<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator. Read more
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
source§

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
source§

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

Creates an iterator which ends after the first None. Read more
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
source§

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

Borrows an iterator, rather than consuming it. Read more
source§

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

Transforms an iterator into a collection. Read more
source§

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
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
source§

fn is_partitioned<P>(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
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
source§

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
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
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
source§

fn find<P>(&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<B>
where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

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

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
source§

fn position<P>(&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
source§

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
where FromA: Default + Extend<A>, FromB: Default + Extend<B>, 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
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
source§

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<P>(self) -> P
where Self: Sized, P: Product<Self::Item>,

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

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::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<I>(self, other: I) -> Option<Ordering>
where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::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
source§

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>
where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::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<I>(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

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

fn eq_by<I, F>(self, other: I, eq: F) -> bool
where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::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<I>(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::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<I>(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::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<I>(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::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<I>(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::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<I>(self, other: I) -> bool
where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

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

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
source§

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
source§

impl<L, S> Layer<S> for Box<L>
where L: Layer<S>, S: Subscriber,

source§

fn on_layer(&mut self, subscriber: &mut S)

Performs late initialization when attaching a Layer to a [Subscriber]. Read more
source§

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.
source§

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
source§

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
source§

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.
source§

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.
source§

fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)

Notifies this layer that an event has occurred.
source§

fn on_enter(&self, id: &Id, ctx: Context<'_, S>)

Notifies this layer that a span with the given ID was entered.
source§

fn on_exit(&self, id: &Id, ctx: Context<'_, S>)

Notifies this layer that the span with the given ID was exited.
source§

fn on_close(&self, id: Id, ctx: Context<'_, S>)

Notifies this layer that the span with the given ID has been closed.
source§

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.
source§

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
source§

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
source§

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
source§

impl<S> Layer<S> for Box<dyn Layer<S> + Send + Sync>
where S: Subscriber,

source§

fn on_layer(&mut self, subscriber: &mut S)

Performs late initialization when attaching a Layer to a [Subscriber]. Read more
source§

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.
source§

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
source§

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
source§

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.
source§

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.
source§

fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)

Notifies this layer that an event has occurred.
source§

fn on_enter(&self, id: &Id, ctx: Context<'_, S>)

Notifies this layer that a span with the given ID was entered.
source§

fn on_exit(&self, id: &Id, ctx: Context<'_, S>)

Notifies this layer that the span with the given ID was exited.
source§

fn on_close(&self, id: Id, ctx: Context<'_, S>)

Notifies this layer that the span with the given ID has been closed.
source§

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.
source§

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
source§

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
source§

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<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
source§

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

source§

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

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

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

Logs the Record. Read more
source§

fn flush(&self)

Flushes any buffered records.
§

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.
source§

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

source§

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
source§

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

source§

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

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

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.
source§

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

source§

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
source§

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
source§

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
source§

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
source§

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
source§

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

source§

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

Formats the value using the given formatter.
source§

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

source§

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
source§

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
source§

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

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

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
source§

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
source§

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
source§

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

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

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
source§

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

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

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

Transforms this Read instance to an Iterator over its bytes. Read more
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
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
source§

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

source§

fn next_u32(&mut self) -> u32

Return the next random u32. Read more
source§

fn next_u64(&mut self) -> u64

Return the next random u64. Read more
source§

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

Fill dest with random data. Read more
source§

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

Fill dest entirely with random data. Read more
source§

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

source§

fn next_u32(&mut self) -> u32

Return the next random u32. Read more
source§

fn next_u64(&mut self) -> u64

Return the next random u64. Read more
source§

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

Fill dest with random data. Read more
source§

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

Fill dest entirely with random data. Read more
source§

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

source§

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

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

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
source§

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
source§

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
source§

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

source§

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<S, Request> Service<Request> for Box<S>
where S: Service<Request> + ?Sized,

§

type Response = <S as Service<Request>>::Response

Responses given by the service.
§

type Error = <S as Service<Request>>::Error

Errors produced by the service.
§

type Future = <S as Service<Request>>::Future

The future response value.
§

fn poll_ready( &mut self, cx: &mut Context<'_> ) -> Poll<Result<(), <S as Service<Request>>::Error>>

Returns Poll::Ready(Ok(())) when the service is able to process requests. Read more
§

fn call(&mut self, request: Request) -> <S as Service<Request>>::Future

Process the request and return the response asynchronously. 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> Source for Box<T>
where T: Source + ?Sized,

§

fn register( &mut self, registry: &Registry, token: Token, interests: Interest ) -> Result<(), Error>

Register self with the given Registry instance. Read more
§

fn reregister( &mut self, registry: &Registry, token: Token, interests: Interest ) -> Result<(), Error>

Re-register self with the given Registry instance. Read more
§

fn deregister(&mut self, registry: &Registry) -> Result<(), Error>

Deregister self from the given Registry instance. 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 SpawnEssentialNamed for Box<dyn SpawnEssentialNamed>

§

fn spawn_essential_blocking( &self, name: &'static str, group: Option<&'static str>, future: Pin<Box<dyn Future<Output = ()> + Send>> )

Spawn the given blocking future. Read more
§

fn spawn_essential( &self, name: &'static str, group: Option<&'static str>, future: Pin<Box<dyn Future<Output = ()> + Send>> )

Spawn the given non-blocking future. Read more
§

impl SpawnNamed for Box<dyn SpawnNamed>

§

fn spawn_blocking( &self, name: &'static str, group: Option<&'static str>, future: Pin<Box<dyn Future<Output = ()> + Send>> )

Spawn the given blocking future. Read more
§

fn spawn( &self, name: &'static str, group: Option<&'static str>, future: Pin<Box<dyn Future<Output = ()> + Send>> )

Spawn the given non-blocking future. Read more
§

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> 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<T, O> TryFrom<Box<[T]>> for BitBox<T, O>
where T: BitStore, O: BitOrder,

§

type Error = Box<[T]>

The type returned in the event of a conversion error.
§

fn try_from( boxed: Box<[T]> ) -> Result<BitBox<T, O>, <BitBox<T, O> as TryFrom<Box<[T]>>>::Error>

Performs the conversion.
1.43.0 · source§

impl<T, const N: usize> TryFrom<Box<[T]>> for Box<[T; N]>

source§

fn try_from( boxed_slice: Box<[T]> ) -> Result<Box<[T; N]>, <Box<[T; N]> as TryFrom<Box<[T]>>>::Error>

Attempts to convert a Box<[T]> into a Box<[T; N]>.

The conversion occurs in-place and does not require a new memory allocation.

§Errors

Returns the old Box<[T]> in the Err variant if boxed_slice.len() does not equal N.

§

type Error = Box<[T]>

The type returned in the event of a conversion error.
1.66.0 · source§

impl<T, const N: usize> TryFrom<Vec<T>> for Box<[T; N]>

source§

fn try_from( vec: Vec<T> ) -> Result<Box<[T; N]>, <Box<[T; N]> as TryFrom<Vec<T>>>::Error>

Attempts to convert a Vec<T> into a Box<[T; N]>.

Like Vec::into_boxed_slice, this is in-place if vec.capacity() == N, but will require a reallocation otherwise.

§Errors

Returns the original Vec<T> in the Err variant if boxed_slice.len() does not equal N.

§Examples

This can be used with vec! to create an array on the heap:

let state: Box<[f32; 100]> = vec![1.0; 100].try_into().unwrap();
assert_eq!(state.len(), 100);
§

type Error = Vec<T>

The type returned in the event of a conversion error.
§

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<'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<'a, T> UnsafeFutureObj<'a, T> for Box<dyn Future<Output = T> + 'a>
where 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<'a, T> UnsafeFutureObj<'a, T> for Box<dyn Future<Output = T> + Send + 'a>
where 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<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<'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, ty: ValType ) -> <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 ) -> <