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>
impl<T> Box<T>
1.0.0 · sourcepub fn new(x: T) -> Box<T>
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);
1.82.0 · sourcepub fn new_uninit() -> Box<MaybeUninit<T>>
pub fn new_uninit() -> Box<MaybeUninit<T>>
Constructs a new box with uninitialized contents.
§Examples
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)
sourcepub fn new_zeroed() -> Box<MaybeUninit<T>>
🔬This is a nightly-only experimental API. (new_zeroed_alloc
)
pub fn new_zeroed() -> Box<MaybeUninit<T>>
new_zeroed_alloc
)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_zeroed_alloc)]
let zero = Box::<u32>::new_zeroed();
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0)
1.33.0 · sourcepub fn pin(x: T) -> Pin<Box<T>>
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
.
sourcepub fn try_new(x: T) -> Result<Box<T>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new(x: T) -> Result<Box<T>, AllocError>
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)?;
sourcepub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
allocator_api
)Constructs a new box with uninitialized contents on the heap, returning an error if the allocation fails
§Examples
#![feature(allocator_api)]
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);
sourcepub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
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)]
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,
impl<T, A> Box<T, A>where
A: Allocator,
sourcepub fn new_in(x: T, alloc: A) -> Box<T, A>where
A: Allocator,
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn new_in(x: T, alloc: A) -> Box<T, A>where
A: Allocator,
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);
sourcepub 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
)
pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>where
A: Allocator,
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)?;
sourcepub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>where
A: Allocator,
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>where
A: Allocator,
allocator_api
)Constructs a new box with uninitialized contents in the provided allocator.
§Examples
#![feature(allocator_api)]
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)
sourcepub 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
)
pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>where
A: Allocator,
allocator_api
)Constructs a new box with uninitialized contents in the provided allocator, returning an error if the allocation fails
§Examples
#![feature(allocator_api)]
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);
sourcepub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>where
A: Allocator,
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>where
A: Allocator,
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)]
use std::alloc::System;
let zero = Box::<u32, _>::new_zeroed_in(System);
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0)
sourcepub 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
)
pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>where
A: Allocator,
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)]
use std::alloc::System;
let zero = Box::<u32, _>::try_new_zeroed_in(System)?;
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0);
sourcepub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>where
A: 'static + Allocator,
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>where
A: 'static + Allocator,
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
.
sourcepub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
🔬This is a nightly-only experimental API. (box_into_boxed_slice
)
pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
box_into_boxed_slice
)Converts a Box<T>
into a Box<[T]>
This conversion does not allocate on the heap and happens in place.
sourcepub fn into_inner(boxed: Box<T, A>) -> T
🔬This is a nightly-only experimental API. (box_into_inner
)
pub fn into_inner(boxed: Box<T, A>) -> T
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]>
impl<T> Box<[T]>
1.82.0 · sourcepub fn new_uninit_slice(len: usize) -> Box<[MaybeUninit<T>]>
pub fn new_uninit_slice(len: usize) -> Box<[MaybeUninit<T>]>
Constructs a new boxed slice with uninitialized contents.
§Examples
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])
sourcepub fn new_zeroed_slice(len: usize) -> Box<[MaybeUninit<T>]>
🔬This is a nightly-only experimental API. (new_zeroed_alloc
)
pub fn new_zeroed_slice(len: usize) -> Box<[MaybeUninit<T>]>
new_zeroed_alloc
)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_zeroed_alloc)]
let values = Box::<[u32]>::new_zeroed_slice(3);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [0, 0, 0])
sourcepub fn try_new_uninit_slice(
len: usize,
) -> Result<Box<[MaybeUninit<T>]>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new_uninit_slice( len: usize, ) -> Result<Box<[MaybeUninit<T>]>, AllocError>
allocator_api
)Constructs a new boxed slice with uninitialized contents. Returns an error if the allocation fails.
§Examples
#![feature(allocator_api)]
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]);
sourcepub fn try_new_zeroed_slice(
len: usize,
) -> Result<Box<[MaybeUninit<T>]>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new_zeroed_slice( len: usize, ) -> Result<Box<[MaybeUninit<T>]>, AllocError>
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)]
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,
impl<T, A> Box<[T], A>where
A: Allocator,
sourcepub fn new_uninit_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn new_uninit_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>
allocator_api
)Constructs a new boxed slice with uninitialized contents in the provided allocator.
§Examples
#![feature(allocator_api)]
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])
sourcepub fn new_zeroed_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn new_zeroed_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>
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)]
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])
sourcepub fn try_new_uninit_slice_in(
len: usize,
alloc: A,
) -> Result<Box<[MaybeUninit<T>], A>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new_uninit_slice_in( len: usize, alloc: A, ) -> Result<Box<[MaybeUninit<T>], A>, AllocError>
allocator_api
)Constructs a new boxed slice with uninitialized contents in the provided allocator. Returns an error if the allocation fails.
§Examples
#![feature(allocator_api)]
use std::alloc::System;
let mut values = Box::<[u32], _>::try_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]);
sourcepub fn try_new_zeroed_slice_in(
len: usize,
alloc: A,
) -> Result<Box<[MaybeUninit<T>], A>, AllocError>
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn try_new_zeroed_slice_in( len: usize, alloc: A, ) -> Result<Box<[MaybeUninit<T>], A>, AllocError>
allocator_api
)Constructs a new boxed slice with uninitialized contents in the provided allocator, 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)]
use std::alloc::System;
let values = Box::<[u32], _>::try_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,
impl<T, A> Box<MaybeUninit<T>, A>where
A: Allocator,
1.82.0 · sourcepub unsafe fn assume_init(self) -> Box<T, A>
pub unsafe fn assume_init(self) -> Box<T, A>
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
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)
sourcepub fn write(boxed: Box<MaybeUninit<T>, A>, value: T) -> Box<T, A>
🔬This is a nightly-only experimental API. (box_uninit_write
)
pub fn write(boxed: Box<MaybeUninit<T>, A>, value: T) -> Box<T, A>
box_uninit_write
)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(box_uninit_write)]
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,
impl<T, A> Box<[MaybeUninit<T>], A>where
A: Allocator,
1.82.0 · sourcepub unsafe fn assume_init(self) -> Box<[T], A>
pub unsafe fn assume_init(self) -> Box<[T], A>
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
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,
impl<T> Box<T>where
T: ?Sized,
1.4.0 · sourcepub unsafe fn from_raw(raw: *mut T) -> Box<T>
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);
}
sourcepub unsafe fn from_non_null(ptr: NonNull<T>) -> Box<T>
🔬This is a nightly-only experimental API. (box_vec_non_null
)
pub unsafe fn from_non_null(ptr: NonNull<T>) -> Box<T>
box_vec_non_null
)Constructs a box from a NonNull
pointer.
After calling this function, the NonNull
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 NonNull
pointer.
The safety conditions are described in the memory layout section.
§Examples
Recreate a Box
which was previously converted to a NonNull
pointer using Box::into_non_null
:
#![feature(box_vec_non_null)]
let x = Box::new(5);
let non_null = Box::into_non_null(x);
let x = unsafe { Box::from_non_null(non_null) };
Manually create a Box
from scratch by using the global allocator:
#![feature(box_vec_non_null)]
use std::alloc::{alloc, Layout};
use std::ptr::NonNull;
unsafe {
let non_null = NonNull::new(alloc(Layout::new::<i32>()).cast::<i32>())
.expect("allocation failed");
// In general .write is required to avoid attempting to destruct
// the (uninitialized) previous contents of `non_null`.
non_null.write(5);
let x = Box::from_non_null(non_null);
}
source§impl<T, A> Box<T, A>
impl<T, A> Box<T, A>
sourcepub const unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
🔬This is a nightly-only experimental API. (allocator_api
)
pub const unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
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);
}
sourcepub const unsafe fn from_non_null_in(raw: NonNull<T>, alloc: A) -> Box<T, A>
🔬This is a nightly-only experimental API. (allocator_api
)
pub const unsafe fn from_non_null_in(raw: NonNull<T>, alloc: A) -> Box<T, A>
allocator_api
)Constructs a box from a NonNull
pointer in the given allocator.
After calling this function, the NonNull
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 NonNull
pointer
using Box::into_non_null_with_allocator
:
#![feature(allocator_api, box_vec_non_null)]
use std::alloc::System;
let x = Box::new_in(5, System);
let (non_null, alloc) = Box::into_non_null_with_allocator(x);
let x = unsafe { Box::from_non_null_in(non_null, alloc) };
Manually create a Box
from scratch by using the system allocator:
#![feature(allocator_api, box_vec_non_null, slice_ptr_get)]
use std::alloc::{Allocator, Layout, System};
unsafe {
let non_null = System.allocate(Layout::new::<i32>())?.cast::<i32>();
// In general .write is required to avoid attempting to destruct
// the (uninitialized) previous contents of `non_null`.
non_null.write(5);
let x = Box::from_non_null_in(non_null, System);
}
1.4.0 · sourcepub fn into_raw(b: Box<T, A>) -> *mut T
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));
}
sourcepub fn into_non_null(b: Box<T, A>) -> NonNull<T>
🔬This is a nightly-only experimental API. (box_vec_non_null
)
pub fn into_non_null(b: Box<T, A>) -> NonNull<T>
box_vec_non_null
)Consumes the Box
, returning a wrapped NonNull
pointer.
The pointer will be properly aligned.
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 NonNull
pointer back into a Box
with the
Box::from_non_null
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_non_null(b)
instead of b.into_non_null()
.
This is so that there is no conflict with a method on the inner type.
§Examples
Converting the NonNull
pointer back into a Box
with Box::from_non_null
for automatic cleanup:
#![feature(box_vec_non_null)]
let x = Box::new(String::from("Hello"));
let non_null = Box::into_non_null(x);
let x = unsafe { Box::from_non_null(non_null) };
Manual cleanup by explicitly running the destructor and deallocating the memory:
#![feature(box_vec_non_null)]
use std::alloc::{dealloc, Layout};
let x = Box::new(String::from("Hello"));
let non_null = Box::into_non_null(x);
unsafe {
non_null.drop_in_place();
dealloc(non_null.as_ptr().cast::<u8>(), Layout::new::<String>());
}
Note: This is equivalent to the following:
#![feature(box_vec_non_null)]
let x = Box::new(String::from("Hello"));
let non_null = Box::into_non_null(x);
unsafe {
drop(Box::from_non_null(non_null));
}
sourcepub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
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>());
}
sourcepub fn into_non_null_with_allocator(b: Box<T, A>) -> (NonNull<T>, A)
🔬This is a nightly-only experimental API. (allocator_api
)
pub fn into_non_null_with_allocator(b: Box<T, A>) -> (NonNull<T>, A)
allocator_api
)Consumes the Box
, returning a wrapped NonNull
pointer and the allocator.
The pointer will be properly aligned.
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 NonNull
pointer back into a Box
with the
Box::from_non_null_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_non_null_with_allocator(b)
instead of
b.into_non_null_with_allocator()
. This is so that there is no
conflict with a method on the inner type.
§Examples
Converting the NonNull
pointer back into a Box
with
Box::from_non_null_in
for automatic cleanup:
#![feature(allocator_api, box_vec_non_null)]
use std::alloc::System;
let x = Box::new_in(String::from("Hello"), System);
let (non_null, alloc) = Box::into_non_null_with_allocator(x);
let x = unsafe { Box::from_non_null_in(non_null, alloc) };
Manual cleanup by explicitly running the destructor and deallocating the memory:
#![feature(allocator_api, box_vec_non_null)]
use std::alloc::{Allocator, Layout, System};
let x = Box::new_in(String::from("Hello"), System);
let (non_null, alloc) = Box::into_non_null_with_allocator(x);
unsafe {
non_null.drop_in_place();
alloc.deallocate(non_null.cast::<u8>(), Layout::new::<String>());
}
sourcepub fn as_mut_ptr(b: &mut Box<T, A>) -> *mut T
🔬This is a nightly-only experimental API. (box_as_ptr
)
pub fn as_mut_ptr(b: &mut Box<T, A>) -> *mut T
box_as_ptr
)Returns a raw mutable pointer to the Box
’s contents.
The caller must ensure that the Box
outlives the pointer this
function returns, or else it will end up dangling.
This method guarantees that for the purpose of the aliasing model, this method
does not materialize a reference to the underlying memory, and thus the returned pointer
will remain valid when mixed with other calls to as_ptr
and as_mut_ptr
.
Note that calling other methods that materialize references to the memory
may still invalidate this pointer.
See the example below for how this guarantee can be used.
§Examples
Due to the aliasing guarantee, the following code is legal:
#![feature(box_as_ptr)]
unsafe {
let mut b = Box::new(0);
let ptr1 = Box::as_mut_ptr(&mut b);
ptr1.write(1);
let ptr2 = Box::as_mut_ptr(&mut b);
ptr2.write(2);
// Notably, the write to `ptr2` did *not* invalidate `ptr1`:
ptr1.write(3);
}
sourcepub fn as_ptr(b: &Box<T, A>) -> *const T
🔬This is a nightly-only experimental API. (box_as_ptr
)
pub fn as_ptr(b: &Box<T, A>) -> *const T
box_as_ptr
)Returns a raw pointer to the Box
’s contents.
The caller must ensure that the Box
outlives the pointer this
function returns, or else it will end up dangling.
The caller must also ensure that the memory the pointer (non-transitively) points to
is never written to (except inside an UnsafeCell
) using this pointer or any pointer
derived from it. If you need to mutate the contents of the Box
, use as_mut_ptr
.
This method guarantees that for the purpose of the aliasing model, this method
does not materialize a reference to the underlying memory, and thus the returned pointer
will remain valid when mixed with other calls to as_ptr
and as_mut_ptr
.
Note that calling other methods that materialize mutable references to the memory,
as well as writing to this memory, may still invalidate this pointer.
See the example below for how this guarantee can be used.
§Examples
Due to the aliasing guarantee, the following code is legal:
#![feature(box_as_ptr)]
unsafe {
let mut v = Box::new(0);
let ptr1 = Box::as_ptr(&v);
let ptr2 = Box::as_mut_ptr(&mut v);
let _val = ptr2.read();
// No write to this memory has happened yet, so `ptr1` is still valid.
let _val = ptr1.read();
// However, once we do a write...
ptr2.write(1);
// ... `ptr1` is no longer valid.
// This would be UB: let _val = ptr1.read();
}
sourcepub const fn allocator(b: &Box<T, A>) -> &A
🔬This is a nightly-only experimental API. (allocator_api
)
pub const fn allocator(b: &Box<T, A>) -> &A
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 · sourcepub fn leak<'a>(b: Box<T, A>) -> &'a mut Twhere
A: 'a,
pub fn leak<'a>(b: Box<T, A>) -> &'a mut Twhere
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) · sourcepub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>where
A: 'static,
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,
impl<A> Box<dyn Any, A>where
A: Allocator,
1.0.0 · sourcepub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any, A>>where
T: Any,
pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any, A>>where
T: Any,
Attempts 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));
sourcepub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
🔬This is a nightly-only experimental API. (downcast_unchecked
)
pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
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,
impl<A> Box<dyn Any + Send, A>where
A: Allocator,
1.0.0 · sourcepub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send, A>>where
T: Any,
pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send, A>>where
T: Any,
Attempts 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));
sourcepub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
🔬This is a nightly-only experimental API. (downcast_unchecked
)
pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
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 + Sync + Send, A>where
A: Allocator,
impl<A> Box<dyn Any + Sync + Send, A>where
A: Allocator,
1.51.0 · sourcepub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Sync + Send, A>>where
T: Any,
pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Sync + Send, A>>where
T: Any,
Attempts 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));
sourcepub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
🔬This is a nightly-only experimental API. (downcast_unchecked
)
pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
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§
§impl<'a, A> Arbitrary<'a> for Box<[A]>where
A: Arbitrary<'a>,
impl<'a, A> Arbitrary<'a> for Box<[A]>where
A: Arbitrary<'a>,
§fn arbitrary(u: &mut Unstructured<'a>) -> Result<Box<[A]>, Error>
fn arbitrary(u: &mut Unstructured<'a>) -> Result<Box<[A]>, Error>
Self
from the given unstructured data. Read more§fn size_hint(depth: usize) -> (usize, Option<usize>)
fn size_hint(depth: usize) -> (usize, Option<usize>)
Unstructured
this type
needs to construct itself. Read more§fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
Self
from the entirety of the given
unstructured data. Read more§impl<'a, A> Arbitrary<'a> for Box<A>where
A: Arbitrary<'a>,
impl<'a, A> Arbitrary<'a> for Box<A>where
A: Arbitrary<'a>,
§fn arbitrary(u: &mut Unstructured<'a>) -> Result<Box<A>, Error>
fn arbitrary(u: &mut Unstructured<'a>) -> Result<Box<A>, Error>
Self
from the given unstructured data. Read more§fn size_hint(depth: usize) -> (usize, Option<usize>)
fn size_hint(depth: usize) -> (usize, Option<usize>)
Unstructured
this type
needs to construct itself. Read more§fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
Self
from the entirety of the given
unstructured data. Read more§impl<'a> Arbitrary<'a> for Box<str>
impl<'a> Arbitrary<'a> for Box<str>
§fn arbitrary(u: &mut Unstructured<'a>) -> Result<Box<str>, Error>
fn arbitrary(u: &mut Unstructured<'a>) -> Result<Box<str>, Error>
Self
from the given unstructured data. Read more§fn size_hint(depth: usize) -> (usize, Option<usize>)
fn size_hint(depth: usize) -> (usize, Option<usize>)
Unstructured
this type
needs to construct itself. Read more§fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>
Self
from the entirety of the given
unstructured data. Read more1.64.0 · source§impl<T> AsFd for Box<T>
impl<T> AsFd for Box<T>
source§fn as_fd(&self) -> BorrowedFd<'_>
fn as_fd(&self) -> BorrowedFd<'_>
source§impl<Args, F, A> AsyncFn<Args> for Box<F, A>
impl<Args, F, A> AsyncFn<Args> for Box<F, A>
source§extern "rust-call" fn async_call(
&self,
args: Args,
) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
extern "rust-call" fn async_call( &self, args: Args, ) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
async_fn_traits
)AsyncFn
, returning a future which may borrow from the called closure.source§impl<Args, F, A> AsyncFnMut<Args> for Box<F, A>
impl<Args, F, A> AsyncFnMut<Args> for Box<F, A>
source§type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a>
where
Box<F, A>: 'a
type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a> where Box<F, A>: 'a
async_fn_traits
)AsyncFnMut::async_call_mut
and AsyncFn::async_call
.source§extern "rust-call" fn async_call_mut(
&mut self,
args: Args,
) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
extern "rust-call" fn async_call_mut( &mut self, args: Args, ) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
async_fn_traits
)AsyncFnMut
, returning a future which may borrow from the called closure.source§impl<Args, F, A> AsyncFnOnce<Args> for Box<F, A>
impl<Args, F, A> AsyncFnOnce<Args> for Box<F, A>
source§type Output = <F as AsyncFnOnce<Args>>::Output
type Output = <F as AsyncFnOnce<Args>>::Output
async_fn_traits
)source§type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture
type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture
async_fn_traits
)AsyncFnOnce::async_call_once
.source§extern "rust-call" fn async_call_once(
self,
args: Args,
) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture
extern "rust-call" fn async_call_once( self, args: Args, ) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture
async_fn_traits
)AsyncFnOnce
, returning a future which may move out of the called closure.source§impl<S> AsyncIterator for Box<S>
impl<S> AsyncIterator for Box<S>
source§type Item = <S as AsyncIterator>::Item
type Item = <S as AsyncIterator>::Item
async_iterator
)source§fn poll_next(
self: Pin<&mut Box<S>>,
cx: &mut Context<'_>,
) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>
fn poll_next( self: Pin<&mut Box<S>>, cx: &mut Context<'_>, ) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>
async_iterator
)None
if the async iterator is exhausted. Read more1.1.0 · source§impl<T, A> BorrowMut<T> for Box<T, A>
impl<T, A> BorrowMut<T> for Box<T, A>
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
1.0.0 · source§impl<B> BufRead for Box<B>
impl<B> BufRead for Box<B>
source§fn fill_buf(&mut self) -> Result<&[u8], Error>
fn fill_buf(&mut self) -> Result<&[u8], Error>
source§fn consume(&mut self, amt: usize)
fn consume(&mut self, amt: usize)
amt
bytes have been consumed from the buffer,
so they should no longer be returned in calls to read
. Read moresource§fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>
fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>
0xA
byte) is reached, and append
them to the provided String
buffer. Read moresource§fn has_data_left(&mut self) -> Result<bool, Error>
fn has_data_left(&mut self) -> Result<bool, Error>
buf_read_has_data_left
)Read
has any data left to be read. Read more1.83.0 · source§fn skip_until(&mut self, byte: u8) -> Result<usize, Error>
fn skip_until(&mut self, byte: u8) -> Result<usize, Error>
byte
or EOF is reached. Read more§impl<T> BufRead for Box<T>where
T: BufRead + ?Sized,
impl<T> BufRead for Box<T>where
T: BufRead + ?Sized,
1.3.0 · source§impl<T, A> Clone for Box<[T], A>
impl<T, A> Clone for Box<[T], A>
source§fn clone_from(&mut self, source: &Box<[T], A>)
fn clone_from(&mut self, source: &Box<[T], A>)
Copies source
’s contents into self
without creating a new allocation,
so long as the two are of the same length.
§Examples
let x = Box::new([5, 6, 7]);
let mut y = Box::new([8, 9, 10]);
let yp: *const [i32] = &*y;
y.clone_from(&x);
// The value is the same
assert_eq!(x, y);
// And no allocation occurred
assert_eq!(yp, &*y);
1.0.0 · source§impl<T, A> Clone for Box<T, A>
impl<T, A> Clone for Box<T, A>
source§fn clone(&self) -> Box<T, A>
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>)
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<G, R, A> Coroutine<R> for Box<G, A>
impl<G, R, A> Coroutine<R> for Box<G, A>
source§type Yield = <G as Coroutine<R>>::Yield
type Yield = <G as Coroutine<R>>::Yield
coroutine_trait
)source§impl<G, R, A> Coroutine<R> for Pin<Box<G, A>>
impl<G, R, A> Coroutine<R> for Pin<Box<G, A>>
source§type Yield = <G as Coroutine<R>>::Yield
type Yield = <G as Coroutine<R>>::Yield
coroutine_trait
)source§impl<'de, T> Deserialize<'de> for Box<[T]>where
T: Deserialize<'de>,
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>,
fn deserialize<D>(
deserializer: D,
) -> Result<Box<[T]>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
source§impl<'de> Deserialize<'de> for Box<CStr>
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>,
fn deserialize<D>(
deserializer: D,
) -> Result<Box<CStr>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
source§impl<'de> Deserialize<'de> for Box<OsStr>
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>,
fn deserialize<D>(
deserializer: D,
) -> Result<Box<OsStr>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
source§impl<'de> Deserialize<'de> for Box<Path>
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>,
fn deserialize<D>(
deserializer: D,
) -> Result<Box<Path>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
source§impl<'de, T> Deserialize<'de> for Box<T>where
T: Deserialize<'de>,
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>,
fn deserialize<D>(
deserializer: D,
) -> Result<Box<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
source§impl<'de> Deserialize<'de> for Box<str>
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>,
fn deserialize<D>(
deserializer: D,
) -> Result<Box<str>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
1.0.0 · source§impl<I, A> DoubleEndedIterator for Box<I, A>
impl<I, A> DoubleEndedIterator for Box<I, A>
source§fn next_back(&mut self) -> Option<<I as Iterator>::Item>
fn next_back(&mut self) -> Option<<I as Iterator>::Item>
source§fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>
fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>
n
th element from the end of the iterator. Read moresource§fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
iter_advance_by
)n
elements. Read more1.27.0 · source§fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
Iterator::try_fold()
: it takes
elements starting from the back of the iterator. Read more1.8.0 · source§impl<T> Error for Box<T>where
T: Error,
impl<T> Error for Box<T>where
T: Error,
source§fn description(&self) -> &str
fn description(&self) -> &str
source§fn cause(&self) -> Option<&dyn Error>
fn cause(&self) -> Option<&dyn Error>
1.0.0 · source§impl<I, A> ExactSizeIterator for Box<I, A>
impl<I, A> ExactSizeIterator for Box<I, A>
1.45.0 · source§impl<A> Extend<Box<str, A>> for Stringwhere
A: Allocator,
impl<A> Extend<Box<str, A>> for Stringwhere
A: Allocator,
source§fn extend<I>(&mut self, iter: I)
fn extend<I>(&mut self, iter: I)
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)1.17.0 · source§impl<T> From<&[T]> for Box<[T]>where
T: Clone,
impl<T> From<&[T]> for Box<[T]>where
T: Clone,
source§fn from(slice: &[T]) -> Box<[T]>
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.6.0 · source§impl<'a> From<&str> for Box<dyn Error + 'a>
impl<'a> From<&str> for Box<dyn Error + 'a>
1.0.0 · source§impl<'a> From<&str> for Box<dyn Error + Sync + Send + 'a>
impl<'a> From<&str> for Box<dyn Error + Sync + Send + 'a>
1.33.0 · source§impl<T, A> From<Box<T, A>> for Pin<Box<T, A>>
impl<T, A> From<Box<T, A>> for Pin<Box<T, A>>
source§fn from(boxed: Box<T, A>) -> Pin<Box<T, A>>
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.19.0 · source§impl<A> From<Box<str, A>> for Box<[u8], A>where
A: Allocator,
impl<A> From<Box<str, A>> for Box<[u8], A>where
A: Allocator,
source§fn from(s: Box<str, A>) -> Box<[u8], A>
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.45.0 · source§impl From<Cow<'_, str>> for Box<str>
impl From<Cow<'_, str>> for Box<str>
source§fn from(cow: Cow<'_, str>) -> Box<str>
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, 'b> From<Cow<'b, str>> for Box<dyn Error + 'a>
impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + 'a>
1.22.0 · source§impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + Sync + Send + 'a>
impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + Sync + Send + 'a>
source§fn from(err: Cow<'b, str>) -> Box<dyn Error + Sync + Send + 'a>
fn from(err: Cow<'b, str>) -> Box<dyn Error + Sync + Send + '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))
1.0.0 · source§impl<'a, E> From<E> for Box<dyn Error + 'a>where
E: Error + 'a,
impl<'a, E> From<E> for Box<dyn Error + 'a>where
E: Error + 'a,
source§fn from(err: E) -> Box<dyn Error + 'a>
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))
1.0.0 · source§impl<'a, E> From<E> for Box<dyn Error + Sync + Send + 'a>
impl<'a, E> From<E> for Box<dyn Error + Sync + Send + 'a>
source§fn from(err: E) -> Box<dyn Error + Sync + Send + 'a>
fn from(err: E) -> Box<dyn Error + Sync + Send + '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))
1.6.0 · source§impl<'a> From<String> for Box<dyn Error + 'a>
impl<'a> From<String> for Box<dyn Error + 'a>
1.0.0 · source§impl<'a> From<String> for Box<dyn Error + Sync + Send + 'a>
impl<'a> From<String> for Box<dyn Error + Sync + Send + 'a>
source§fn from(err: String) -> Box<dyn Error + Sync + Send + 'a>
fn from(err: String) -> Box<dyn Error + Sync + Send + 'a>
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<T, A> From<Vec<T, A>> for Box<[T], A>where
A: Allocator,
impl<T, A> From<Vec<T, A>> for Box<[T], A>where
A: Allocator,
source§fn from(v: Vec<T, A>) -> Box<[T], A>
fn from(v: Vec<T, A>) -> Box<[T], A>
Converts 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.32.0 · source§impl<I> FromIterator<I> for Box<[I]>
impl<I> FromIterator<I> for Box<[I]>
1.22.0 · source§impl<T, A> Hasher for Box<T, A>
impl<T, A> Hasher for Box<T, A>
source§fn write_u128(&mut self, i: u128)
fn write_u128(&mut self, i: u128)
u128
into this hasher.source§fn write_usize(&mut self, i: usize)
fn write_usize(&mut self, i: usize)
usize
into this hasher.source§fn write_i128(&mut self, i: i128)
fn write_i128(&mut self, i: i128)
i128
into this hasher.source§fn write_isize(&mut self, i: isize)
fn write_isize(&mut self, i: isize)
isize
into this hasher.source§fn write_length_prefix(&mut self, len: usize)
fn write_length_prefix(&mut self, len: usize)
hasher_prefixfree_extras
)§impl<K, V> IntoIterator for Box<Slice<K, V>>
impl<K, V> IntoIterator for Box<Slice<K, V>>
§impl<T> IntoIterator for Box<Slice<T>>
impl<T> IntoIterator for Box<Slice<T>>
1.0.0 · source§impl<I, A> Iterator for Box<I, A>
impl<I, A> Iterator for Box<I, A>
source§fn next(&mut self) -> Option<<I as Iterator>::Item>
fn next(&mut self) -> Option<<I as Iterator>::Item>
source§fn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
source§fn nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>
fn nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>
n
th element of the iterator. Read moresource§fn last(self) -> Option<<I as Iterator>::Item>
fn last(self) -> Option<<I as Iterator>::Item>
source§fn next_chunk<const N: usize>(
&mut self,
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
fn next_chunk<const N: usize>(
&mut self,
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
iter_next_chunk
)N
values. Read more1.0.0 · source§fn count(self) -> usizewhere
Self: Sized,
fn count(self) -> usizewhere
Self: Sized,
source§fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
iter_advance_by
)n
elements. Read more1.28.0 · source§fn step_by(self, step: usize) -> StepBy<Self> ⓘwhere
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self> ⓘwhere
Self: Sized,
1.0.0 · source§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> ⓘ
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> ⓘ
1.0.0 · source§fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> ⓘwhere
Self: Sized,
U: IntoIterator,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> ⓘwhere
Self: Sized,
U: IntoIterator,
source§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
iter_intersperse
)separator
between adjacent items of the original iterator. Read more1.0.0 · source§fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
1.0.0 · source§fn filter<P>(self, predicate: P) -> Filter<Self, P> ⓘ
fn filter<P>(self, predicate: P) -> Filter<Self, P> ⓘ
1.0.0 · source§fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> ⓘ
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> ⓘ
1.0.0 · source§fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
1.0.0 · source§fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> ⓘ
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> ⓘ
1.0.0 · source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> ⓘ
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> ⓘ
1.57.0 · source§fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> ⓘ
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> ⓘ
1.0.0 · source§fn skip(self, n: usize) -> Skip<Self> ⓘwhere
Self: Sized,
fn skip(self, n: usize) -> Skip<Self> ⓘwhere
Self: Sized,
n
elements. Read more1.0.0 · source§fn take(self, n: usize) -> Take<Self> ⓘwhere
Self: Sized,
fn take(self, n: usize) -> Take<Self> ⓘwhere
Self: Sized,
n
elements, or fewer
if the underlying iterator ends sooner. Read more1.0.0 · source§fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> ⓘ
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> ⓘ
source§fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N> ⓘ
fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N> ⓘ
iter_map_windows
)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 more1.0.0 · source§fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
1.0.0 · source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
source§fn collect_into<E>(self, collection: &mut E) -> &mut E
fn collect_into<E>(self, collection: &mut E) -> &mut E
iter_collect_into
)1.0.0 · source§fn partition<B, F>(self, f: F) -> (B, B)
fn partition<B, F>(self, f: F) -> (B, B)
source§fn is_partitioned<P>(self, predicate: P) -> bool
fn is_partitioned<P>(self, predicate: P) -> bool
iter_is_partitioned
)true
precede all those that return false
. Read more1.27.0 · source§fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
1.27.0 · source§fn try_for_each<F, R>(&mut self, f: F) -> R
fn try_for_each<F, R>(&mut self, f: F) -> R
1.0.0 · source§fn fold<B, F>(self, init: B, f: F) -> B
fn fold<B, F>(self, init: B, f: F) -> B
1.51.0 · source§fn reduce<F>(self, f: F) -> Option<Self::Item>
fn reduce<F>(self, f: F) -> Option<Self::Item>
source§fn try_reduce<R>(
&mut self,
f: impl FnMut(Self::Item, Self::Item) -> R,
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
iterator_try_reduce
)1.0.0 · source§fn all<F>(&mut self, f: F) -> bool
fn all<F>(&mut self, f: F) -> bool
1.0.0 · source§fn any<F>(&mut self, f: F) -> bool
fn any<F>(&mut self, f: F) -> bool
1.0.0 · source§fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
1.30.0 · source§fn find_map<B, F>(&mut self, f: F) -> Option<B>
fn find_map<B, F>(&mut self, f: F) -> Option<B>
source§fn try_find<R>(
&mut self,
f: impl FnMut(&Self::Item) -> R,
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
try_find
)1.0.0 · source§fn position<P>(&mut self, predicate: P) -> Option<usize>
fn position<P>(&mut self, predicate: P) -> Option<usize>
1.6.0 · source§fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
1.15.0 · source§fn max_by<F>(self, compare: F) -> Option<Self::Item>
fn max_by<F>(self, compare: F) -> Option<Self::Item>
1.6.0 · source§fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
1.15.0 · source§fn min_by<F>(self, compare: F) -> Option<Self::Item>
fn min_by<F>(self, compare: F) -> Option<Self::Item>
1.0.0 · source§fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
1.36.0 · source§fn copied<'a, T>(self) -> Copied<Self> ⓘ
fn copied<'a, T>(self) -> Copied<Self> ⓘ
source§fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N> ⓘwhere
Self: Sized,
fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N> ⓘwhere
Self: Sized,
iter_array_chunks
)N
elements of the iterator at a time. Read more1.11.0 · source§fn product<P>(self) -> P
fn product<P>(self) -> P
source§fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
iter_order_by
)Iterator
with those
of another with respect to the specified comparison function. Read more1.5.0 · source§fn partial_cmp<I>(self, other: I) -> Option<Ordering>
fn partial_cmp<I>(self, other: I) -> Option<Ordering>
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 moresource§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>,
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>,
iter_order_by
)Iterator
with those
of another with respect to the specified comparison function. Read moresource§fn eq_by<I, F>(self, other: I, eq: F) -> bool
fn eq_by<I, F>(self, other: I, eq: F) -> bool
iter_order_by
)1.5.0 · source§fn lt<I>(self, other: I) -> bool
fn lt<I>(self, other: I) -> bool
Iterator
are lexicographically
less than those of another. Read more1.5.0 · source§fn le<I>(self, other: I) -> bool
fn le<I>(self, other: I) -> bool
Iterator
are lexicographically
less or equal to those of another. Read more1.5.0 · source§fn gt<I>(self, other: I) -> bool
fn gt<I>(self, other: I) -> bool
Iterator
are lexicographically
greater than those of another. Read more1.5.0 · source§fn ge<I>(self, other: I) -> bool
fn ge<I>(self, other: I) -> bool
Iterator
are lexicographically
greater than or equal to those of another. Read more1.82.0 · source§fn is_sorted_by<F>(self, compare: F) -> bool
fn is_sorted_by<F>(self, compare: F) -> bool
1.82.0 · source§fn is_sorted_by_key<F, K>(self, f: F) -> bool
fn is_sorted_by_key<F, K>(self, f: F) -> bool
1.0.0 · source§impl<T, A> Ord for Box<T, A>
impl<T, A> Ord for Box<T, A>
1.0.0 · source§impl<T, A> PartialOrd for Box<T, A>
impl<T, A> PartialOrd for Box<T, A>
1.0.0 · source§impl<R> Read for Box<R>
impl<R> Read for Box<R>
source§fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>
fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>
source§fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
read_buf
)source§fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>
fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>
read
, except that it reads into a slice of buffers. Read moresource§fn is_read_vectored(&self) -> bool
fn is_read_vectored(&self) -> bool
can_vector
)source§fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>
fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>
buf
. Read moresource§fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>
fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>
buf
. Read moresource§fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>
fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>
buf
. Read moresource§fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
read_buf
)cursor
. Read more1.0.0 · source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
Read
. Read more§impl<T> Read for Box<T>where
T: Read + ?Sized,
impl<T> Read for Box<T>where
T: Read + ?Sized,
§fn read(&mut self, buf: &mut [u8]) -> Result<usize, <Box<T> as Io>::Error>
fn read(&mut self, buf: &mut [u8]) -> Result<usize, <Box<T> as Io>::Error>
§fn read_exact(
&mut self,
buf: &mut [u8],
) -> Result<(), ReadExactError<Self::Error>>
fn read_exact( &mut self, buf: &mut [u8], ) -> Result<(), ReadExactError<Self::Error>>
buf
.1.0.0 · source§impl<S> Seek for Box<S>
impl<S> Seek for Box<S>
source§fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>
fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>
source§fn stream_position(&mut self) -> Result<u64, Error>
fn stream_position(&mut self) -> Result<u64, Error>
1.55.0 · source§fn rewind(&mut self) -> Result<(), Error>
fn rewind(&mut self) -> Result<(), Error>
§impl<T> Seek for Box<T>where
T: Seek + ?Sized,
impl<T> Seek for Box<T>where
T: Seek + ?Sized,
source§impl<T> Serialize for Box<T>
impl<T> Serialize for Box<T>
source§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
1.43.0 · source§impl<T, const N: usize> TryFrom<Box<[T]>> for Box<[T; N]>
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>
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
.
1.66.0 · source§impl<T, const N: usize> TryFrom<Vec<T>> for Box<[T; N]>
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>
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);
§impl<'a, V> VisitOperator<'a> for Box<V>where
V: VisitOperator<'a> + ?Sized,
impl<'a, V> VisitOperator<'a> for Box<V>where
V: VisitOperator<'a> + ?Sized,
§fn visit_operator(
&mut self,
op: &Operator<'a>,
) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_operator( &mut self, op: &Operator<'a>, ) -> <Box<V> as VisitOperator<'a>>::Output
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_table( &mut self, try_table: TryTable, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_throw( &mut self, tag_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_throw_ref(&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_rethrow( &mut self, relative_depth: 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_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, ) -> <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_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, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_memory_grow( &mut self, mem: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32_const( &mut self, value: i32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64_const( &mut self, value: i64, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32_const( &mut self, value: Ieee32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64_const( &mut self, value: Ieee64, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_null( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_is_null(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_func( &mut self, function_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_eq(&mut self) -> <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_struct_new( &mut self, struct_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_new_default( &mut self, struct_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_get( &mut self, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_get_s( &mut self, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_get_u( &mut self, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_set( &mut self, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_new( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_new_default( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_new_fixed( &mut self, array_type_index: u32, array_size: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_new_data( &mut self, array_type_index: u32, array_data_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_new_elem( &mut self, array_type_index: u32, array_elem_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_get( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_get_s( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_get_u( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_set( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_len(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_fill( &mut self, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_copy( &mut self, array_type_index_dst: u32, array_type_index_src: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_init_data( &mut self, array_type_index: u32, array_data_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_init_elem( &mut self, array_type_index: u32, array_elem_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_test_non_null( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_test_nullable( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_cast_non_null( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_cast_nullable( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_br_on_cast( &mut self, relative_depth: u32, from_ref_type: RefType, to_ref_type: RefType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_br_on_cast_fail( &mut self, relative_depth: u32, from_ref_type: RefType, to_ref_type: RefType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_any_convert_extern(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_extern_convert_any(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_i31(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i31_get_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i31_get_u(&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_global_atomic_get( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_set( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_add( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_sub( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_and( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_or( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_xor( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_xchg( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_global_atomic_rmw_cmpxchg( &mut self, ordering: Ordering, global_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_table_atomic_get( &mut self, ordering: Ordering, table_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_table_atomic_set( &mut self, ordering: Ordering, table_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_table_atomic_rmw_xchg( &mut self, ordering: Ordering, table_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_table_atomic_rmw_cmpxchg( &mut self, ordering: Ordering, table_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_get( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_get_s( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_get_u( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_set( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_add( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_sub( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_and( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_or( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_xor( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_xchg( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_atomic_rmw_cmpxchg( &mut self, ordering: Ordering, struct_type_index: u32, field_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_get( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_get_s( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_get_u( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_set( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_add( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_sub( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_and( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_or( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_xor( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_xchg( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_array_atomic_rmw_cmpxchg( &mut self, ordering: Ordering, array_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load8x8_s( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load8x8_u( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load16x4_s( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load16x4_u( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load32x2_s( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load32x2_u( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load8_splat( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load16_splat( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load32_splat( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load64_splat( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load32_zero( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load64_zero( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_store( &mut self, memarg: MemArg, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load8_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load16_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load32_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_load64_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_store8_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_store16_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_store32_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_store64_lane( &mut self, memarg: MemArg, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_const( &mut self, value: V128, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_shuffle( &mut self, lanes: [u8; 16], ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_extract_lane_s( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_extract_lane_u( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_replace_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extract_lane_s( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extract_lane_u( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_replace_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extract_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_replace_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extract_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_replace_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_extract_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_replace_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_extract_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_replace_lane( &mut self, lane: u8, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_swizzle(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_splat(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_lt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_gt_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_le_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_ge_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_lt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_gt_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_le_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_ge_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_lt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_gt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_le(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_ge(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_eq(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_ne(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_lt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_gt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_le(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_ge(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_not(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_and(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_andnot(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_or(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_xor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_bitselect(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_v128_any_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_popcnt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_narrow_i16x8_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_narrow_i16x8_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_add_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_add_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_sub_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_sub_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_min_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_min_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_max_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_max_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_avgr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extadd_pairwise_i8x16_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extadd_pairwise_i8x16_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_q15mulr_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_narrow_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_narrow_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extend_low_i8x16_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extend_high_i8x16_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extend_low_i8x16_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extend_high_i8x16_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_add_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_add_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_sub_sat_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_sub_sat_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_min_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_min_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_max_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_max_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_avgr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extmul_low_i8x16_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extmul_high_i8x16_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extmul_low_i8x16_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_extmul_high_i8x16_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extadd_pairwise_i16x8_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extadd_pairwise_i16x8_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extend_low_i16x8_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extend_high_i16x8_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extend_low_i16x8_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extend_high_i16x8_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_min_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_min_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_max_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_max_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_dot_i16x8_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extmul_low_i16x8_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extmul_high_i16x8_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extmul_low_i16x8_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_extmul_high_i16x8_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_all_true(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_bitmask(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extend_low_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extend_high_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extend_low_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extend_high_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_shl(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_shr_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_shr_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extmul_low_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extmul_high_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extmul_low_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_extmul_high_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_ceil(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_floor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_trunc(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_nearest(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_sqrt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_div(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_pmin(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_pmax(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_ceil(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_floor(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_trunc(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_nearest(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_abs(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_neg(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_sqrt(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_add(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_sub(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_mul(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_div(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_pmin(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_pmax(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_trunc_sat_f32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_trunc_sat_f32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_convert_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_convert_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_trunc_sat_f64x2_s_zero( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_trunc_sat_f64x2_u_zero( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_convert_low_i32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_convert_low_i32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_demote_f64x2_zero( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_promote_low_f32x4( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_relaxed_swizzle( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_relaxed_trunc_f32x4_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_relaxed_trunc_f32x4_u( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_relaxed_trunc_f64x2_s_zero( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_relaxed_trunc_f64x2_u_zero( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_relaxed_madd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_relaxed_nmadd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_relaxed_madd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_relaxed_nmadd(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i8x16_relaxed_laneselect( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_relaxed_laneselect( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_relaxed_laneselect( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64x2_relaxed_laneselect( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_relaxed_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f32x4_relaxed_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_relaxed_min(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_f64x2_relaxed_max(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_relaxed_q15mulr_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i16x8_relaxed_dot_i8x16_i7x16_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i32x4_relaxed_dot_i8x16_i7x16_add_s( &mut self, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_call_ref( &mut self, type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_return_call_ref( &mut self, type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_as_non_null(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_br_on_null( &mut self, relative_depth: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_br_on_non_null( &mut self, relative_depth: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_cont_new( &mut self, cont_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_cont_bind( &mut self, argument_index: u32, result_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_suspend( &mut self, tag_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_resume( &mut self, cont_type_index: u32, resume_table: ResumeTable, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_resume_throw( &mut self, cont_type_index: u32, tag_index: u32, resume_table: ResumeTable, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_switch( &mut self, cont_type_index: u32, tag_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64_add128(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64_sub128(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64_mul_wide_s(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_i64_mul_wide_u(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
§impl<T> Write for Box<T>where
T: Write + ?Sized,
impl<T> Write for Box<T>where
T: Write + ?Sized,
§fn write(&mut self, buf: &[u8]) -> Result<usize, <Box<T> as Io>::Error>
fn write(&mut self, buf: &[u8]) -> Result<usize, <Box<T> as Io>::Error>
§fn flush(&mut self) -> Result<(), <Box<T> as Io>::Error>
fn flush(&mut self) -> Result<(), <Box<T> as Io>::Error>
1.0.0 · source§impl<W> Write for Box<W>
impl<W> Write for Box<W>
source§fn write(&mut self, buf: &[u8]) -> Result<usize, Error>
fn write(&mut self, buf: &[u8]) -> Result<usize, Error>
source§fn is_write_vectored(&self) -> bool
fn is_write_vectored(&self) -> bool
can_vector
)source§fn flush(&mut self) -> Result<(), Error>
fn flush(&mut self) -> Result<(), Error>
source§fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>
fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>
source§fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>
fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>
§impl<T> WriteColor for Box<T>where
T: WriteColor + ?Sized,
impl<T> WriteColor for Box<T>where
T: WriteColor + ?Sized,
§fn supports_color(&self) -> bool
fn supports_color(&self) -> bool
§fn supports_hyperlinks(&self) -> bool
fn supports_hyperlinks(&self) -> bool
§fn set_color(&mut self, spec: &ColorSpec) -> Result<(), Error>
fn set_color(&mut self, spec: &ColorSpec) -> Result<(), Error>
§fn set_hyperlink(&mut self, link: &HyperlinkSpec<'_>) -> Result<(), Error>
fn set_hyperlink(&mut self, link: &HyperlinkSpec<'_>) -> Result<(), Error>
§fn reset(&mut self) -> Result<(), Error>
fn reset(&mut self) -> Result<(), Error>
§fn is_synchronous(&self) -> bool
fn is_synchronous(&self) -> bool
false
. Read moreimpl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
impl<T, A> DerefPure for Box<T, A>
impl<T, U> DispatchFromDyn<Box<U>> for Box<T>
impl<T, A> Eq for Box<T, A>
impl<I, A> FusedIterator for Box<I, A>
impl<'a, I, A> !Iterator for &'a Box<[I], A>where
A: Allocator,
This implementation is required to make sure that the &Box<[I]>: IntoIterator
implementation doesn’t overlap with IntoIterator for T where T: Iterator
blanket.
impl<'a, I, A> !Iterator for &'a mut Box<[I], A>where
A: Allocator,
This implementation is required to make sure that the &mut Box<[I]>: IntoIterator
implementation doesn’t overlap with IntoIterator for T where T: Iterator
blanket.
impl<I, A> !Iterator for Box<[I], A>where
A: Allocator,
This implementation is required to make sure that the Box<[I]>: IntoIterator
implementation doesn’t overlap with IntoIterator for T where T: Iterator
blanket.
impl<T, A> PinCoerceUnsized for Box<T, A>
impl<T, A> Unpin for Box<T, A>
Auto Trait Implementations§
impl<T, A> Freeze for Box<T, A>
impl<T, A> RefUnwindSafe for Box<T, A>
impl<T, A> Send for Box<T, A>
impl<T, A> Sync for Box<T, A>
impl<T, A> UnwindSafe for Box<T, A>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<T> IntoAnyhow for T
impl<T> IntoAnyhow for T
source§fn into_anyhow(self) -> Error
fn into_anyhow(self) -> Error
self
into an anyhow::Error
.source§impl<I> IntoAsyncIterator for Iwhere
I: AsyncIterator,
impl<I> IntoAsyncIterator for Iwhere
I: AsyncIterator,
source§type Item = <I as AsyncIterator>::Item
type Item = <I as AsyncIterator>::Item
async_iterator
)source§type IntoAsyncIter = I
type IntoAsyncIter = I
async_iterator
)source§fn into_async_iter(self) -> <I as IntoAsyncIterator>::IntoAsyncIter
fn into_async_iter(self) -> <I as IntoAsyncIterator>::IntoAsyncIter
async_iterator
)self
into an async iteratorsource§impl<F> IntoFuture for Fwhere
F: Future,
impl<F> IntoFuture for Fwhere
F: Future,
source§type IntoFuture = F
type IntoFuture = F
source§fn into_future(self) -> <F as IntoFuture>::IntoFuture
fn into_future(self) -> <F as IntoFuture>::IntoFuture
source§impl<I> IntoIterator for Iwhere
I: Iterator,
impl<I> IntoIterator for Iwhere
I: Iterator,
source§impl<F> Pattern for F
impl<F> Pattern for F
source§type Searcher<'a> = CharPredicateSearcher<'a, F>
type Searcher<'a> = CharPredicateSearcher<'a, F>
pattern
)source§fn into_searcher<'a>(self, haystack: &'a str) -> CharPredicateSearcher<'a, F>
fn into_searcher<'a>(self, haystack: &'a str) -> CharPredicateSearcher<'a, F>
pattern
)self
and the haystack
to search in.source§fn is_contained_in<'a>(self, haystack: &'a str) -> bool
fn is_contained_in<'a>(self, haystack: &'a str) -> bool
pattern
)source§fn is_prefix_of<'a>(self, haystack: &'a str) -> bool
fn is_prefix_of<'a>(self, haystack: &'a str) -> bool
pattern
)source§fn strip_prefix_of<'a>(self, haystack: &'a str) -> Option<&'a str>
fn strip_prefix_of<'a>(self, haystack: &'a str) -> Option<&'a str>
pattern
)source§fn is_suffix_of<'a>(self, haystack: &'a str) -> boolwhere
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>,
fn is_suffix_of<'a>(self, haystack: &'a str) -> boolwhere
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>,
pattern
)source§fn strip_suffix_of<'a>(self, haystack: &'a str) -> Option<&'a str>where
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>,
fn strip_suffix_of<'a>(self, haystack: &'a str) -> Option<&'a str>where
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>,
pattern
)source§fn as_utf8_pattern(&self) -> Option<Utf8Pattern<'_>>
fn as_utf8_pattern(&self) -> Option<Utf8Pattern<'_>>
pattern
)