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<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,
Available on crate features metrics and opentelemetry only.
pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any, A>>where
T: Any,
metrics and opentelemetry only.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)Available on crate features metrics and opentelemetry only.
pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
downcast_unchecked)metrics and opentelemetry only.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,
Available on crate features metrics and opentelemetry only.
pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send, A>>where
T: Any,
metrics and opentelemetry only.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)Available on crate features metrics and opentelemetry only.
pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
downcast_unchecked)metrics and opentelemetry only.Downcasts the box to a concrete type.
For a safe alternative see downcast.
§Examples
#![feature(downcast_unchecked)]
use std::any::Any;
let x: Box<dyn Any + Send> = Box::new(1_usize);
unsafe {
assert_eq!(*x.downcast_unchecked::<usize>(), 1);
}§Safety
The contained value must be of type T. Calling this method
with the incorrect type is undefined behavior.
Source§impl<A> Box<dyn Any + Send + Sync, A>where
A: Allocator,
impl<A> Box<dyn Any + Send + Sync, A>where
A: Allocator,
1.51.0 · Sourcepub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send + Sync, A>>where
T: Any,
Available on crate features metrics and opentelemetry only.
pub fn downcast<T>(self) -> Result<Box<T, A>, Box<dyn Any + Send + Sync, A>>where
T: Any,
metrics and opentelemetry only.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)Available on crate features metrics and opentelemetry only.
pub unsafe fn downcast_unchecked<T>(self) -> Box<T, A>where
T: Any,
downcast_unchecked)metrics and opentelemetry only.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.
Source§impl<T> Box<T>
impl<T> Box<T>
1.0.0 · Sourcepub fn new(x: T) -> Box<T>
Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new(x: T) -> Box<T>
metrics and crate feature opentelemetry and non-no_global_oom_handling only.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 (const: unstable) · Sourcepub fn new_uninit() -> Box<MaybeUninit<T>>
Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_uninit() -> Box<MaybeUninit<T>>
metrics and crate feature opentelemetry and non-no_global_oom_handling only.Constructs a new box with uninitialized contents.
§Examples
let mut five = Box::<u32>::new_uninit();
// Deferred initialization:
five.write(5);
let five = unsafe { five.assume_init() };
assert_eq!(*five, 5)1.92.0 · Sourcepub fn new_zeroed() -> Box<MaybeUninit<T>>
Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_zeroed() -> Box<MaybeUninit<T>>
metrics and crate feature opentelemetry and non-no_global_oom_handling only.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
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>>
Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn pin(x: T) -> Pin<Box<T>>
metrics and crate feature opentelemetry and non-no_global_oom_handling only.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)Available on crate features metrics and opentelemetry only.
pub fn try_new(x: T) -> Result<Box<T>, AllocError>
allocator_api)metrics and opentelemetry only.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)Available on crate features metrics and opentelemetry only.
pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
allocator_api)metrics and opentelemetry only.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()?;
// Deferred initialization:
five.write(5);
let five = unsafe { 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)Available on crate features metrics and opentelemetry only.
pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
allocator_api)metrics and opentelemetry only.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);Sourcepub fn map<U>(this: Box<T>, f: impl FnOnce(T) -> U) -> Box<U>
🔬This is a nightly-only experimental API. (smart_pointer_try_map)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn map<U>(this: Box<T>, f: impl FnOnce(T) -> U) -> Box<U>
smart_pointer_try_map)metrics and crate feature opentelemetry and non-no_global_oom_handling only.Maps the value in a box, reusing the allocation if possible.
f is called on the value in the box, and the result is returned, also boxed.
Note: this is an associated function, which means that you have
to call it as Box::map(b, f) instead of b.map(f). This
is so that there is no conflict with a method on the inner type.
§Examples
#![feature(smart_pointer_try_map)]
let b = Box::new(7);
let new = Box::map(b, |i| i + 7);
assert_eq!(*new, 14);Sourcepub fn try_map<R>(
this: Box<T>,
f: impl FnOnce(T) -> R,
) -> <<R as Try>::Residual as Residual<Box<<R as Try>::Output>>>::TryType
🔬This is a nightly-only experimental API. (smart_pointer_try_map)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn try_map<R>( this: Box<T>, f: impl FnOnce(T) -> R, ) -> <<R as Try>::Residual as Residual<Box<<R as Try>::Output>>>::TryType
smart_pointer_try_map)metrics and crate feature opentelemetry and non-no_global_oom_handling only.Attempts to map the value in a box, reusing the allocation if possible.
f is called on the value in the box, and if the operation succeeds, the result is
returned, also boxed.
Note: this is an associated function, which means that you have
to call it as Box::try_map(b, f) instead of b.try_map(f). This
is so that there is no conflict with a method on the inner type.
§Examples
#![feature(smart_pointer_try_map)]
let b = Box::new(7);
let new = Box::try_map(b, u32::try_from).unwrap();
assert_eq!(*new, 7);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)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_in(x: T, alloc: A) -> Box<T, A>where
A: Allocator,
allocator_api)metrics and crate feature opentelemetry and non-no_global_oom_handling only.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)Available on crate features metrics and opentelemetry only.
pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>where
A: Allocator,
allocator_api)metrics and opentelemetry only.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)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>where
A: Allocator,
allocator_api)metrics and crate feature opentelemetry and non-no_global_oom_handling only.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);
// Deferred initialization:
five.write(5);
let five = unsafe { 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)Available on crate features metrics and opentelemetry only.
pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>where
A: Allocator,
allocator_api)metrics and opentelemetry only.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)?;
// Deferred initialization:
five.write(5);
let five = unsafe { 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)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>where
A: Allocator,
allocator_api)metrics and crate feature opentelemetry and non-no_global_oom_handling only.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)Available on crate features metrics and opentelemetry only.
pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>where
A: Allocator,
allocator_api)metrics and opentelemetry only.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)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>where
A: 'static + Allocator,
allocator_api)metrics and crate feature opentelemetry and non-no_global_oom_handling only.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.
§Examples
#![feature(allocator_api)]
use std::alloc::System;
let x = Box::pin_in(1, System);Sourcepub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
🔬This is a nightly-only experimental API. (box_into_boxed_slice)Available on crate features metrics and opentelemetry only.
pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
box_into_boxed_slice)metrics and opentelemetry only.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)Available on crate features metrics and opentelemetry only.
pub fn into_inner(boxed: Box<T, A>) -> T
box_into_inner)metrics and opentelemetry only.Consumes the Box, returning the wrapped value.
§Examples
#![feature(box_into_inner)]
let c = Box::new(5);
assert_eq!(Box::into_inner(c), 5);Sourcepub fn take(boxed: Box<T, A>) -> (T, Box<MaybeUninit<T>, A>)
🔬This is a nightly-only experimental API. (box_take)Available on crate features metrics and opentelemetry only.
pub fn take(boxed: Box<T, A>) -> (T, Box<MaybeUninit<T>, A>)
box_take)metrics and opentelemetry only.Consumes the Box without consuming its allocation, returning the wrapped value and a Box
to the uninitialized memory where the wrapped value used to live.
This can be used together with write to reuse the allocation for multiple
boxed values.
§Examples
#![feature(box_take)]
let c = Box::new(5);
// take the value out of the box
let (value, uninit) = Box::take(c);
assert_eq!(value, 5);
// reuse the box for a second value
let c = Box::write(uninit, 6);
assert_eq!(*c, 6);Source§impl<T> Box<T>where
T: CloneToUninit + ?Sized,
impl<T> Box<T>where
T: CloneToUninit + ?Sized,
Sourcepub fn clone_from_ref(src: &T) -> Box<T>
🔬This is a nightly-only experimental API. (clone_from_ref)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn clone_from_ref(src: &T) -> Box<T>
clone_from_ref)metrics and crate feature opentelemetry and non-no_global_oom_handling only.Allocates memory on the heap then clones src into it.
This doesn’t actually allocate if src is zero-sized.
§Examples
#![feature(clone_from_ref)]
let hello: Box<str> = Box::clone_from_ref("hello");Sourcepub fn try_clone_from_ref(src: &T) -> Result<Box<T>, AllocError>
🔬This is a nightly-only experimental API. (clone_from_ref)Available on crate features metrics and opentelemetry only.
pub fn try_clone_from_ref(src: &T) -> Result<Box<T>, AllocError>
clone_from_ref)metrics and opentelemetry only.Allocates memory on the heap then clones src into it, returning an error if allocation fails.
This doesn’t actually allocate if src is zero-sized.
§Examples
#![feature(clone_from_ref)]
#![feature(allocator_api)]
let hello: Box<str> = Box::try_clone_from_ref("hello")?;Source§impl<T, A> Box<T, A>
impl<T, A> Box<T, A>
Sourcepub fn clone_from_ref_in(src: &T, alloc: A) -> Box<T, A>
🔬This is a nightly-only experimental API. (clone_from_ref)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn clone_from_ref_in(src: &T, alloc: A) -> Box<T, A>
clone_from_ref)metrics and crate feature opentelemetry and non-no_global_oom_handling only.Allocates memory in the given allocator then clones src into it.
This doesn’t actually allocate if src is zero-sized.
§Examples
#![feature(clone_from_ref)]
#![feature(allocator_api)]
use std::alloc::System;
let hello: Box<str, System> = Box::clone_from_ref_in("hello", System);Sourcepub fn try_clone_from_ref_in(src: &T, alloc: A) -> Result<Box<T, A>, AllocError>
🔬This is a nightly-only experimental API. (clone_from_ref)Available on crate features metrics and opentelemetry only.
pub fn try_clone_from_ref_in(src: &T, alloc: A) -> Result<Box<T, A>, AllocError>
clone_from_ref)metrics and opentelemetry only.Allocates memory in the given allocator then clones src into it, returning an error if allocation fails.
This doesn’t actually allocate if src is zero-sized.
§Examples
#![feature(clone_from_ref)]
#![feature(allocator_api)]
use std::alloc::System;
let hello: Box<str, System> = Box::try_clone_from_ref_in("hello", System)?;Source§impl<T> Box<[T]>
impl<T> Box<[T]>
1.82.0 · Sourcepub fn new_uninit_slice(len: usize) -> Box<[MaybeUninit<T>]>
Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_uninit_slice(len: usize) -> Box<[MaybeUninit<T>]>
metrics and crate feature opentelemetry and non-no_global_oom_handling only.Constructs a new boxed slice with uninitialized contents.
§Examples
let mut values = Box::<[u32]>::new_uninit_slice(3);
// Deferred initialization:
values[0].write(1);
values[1].write(2);
values[2].write(3);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [1, 2, 3])1.92.0 · Sourcepub fn new_zeroed_slice(len: usize) -> Box<[MaybeUninit<T>]>
Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_zeroed_slice(len: usize) -> Box<[MaybeUninit<T>]>
metrics and crate feature opentelemetry and non-no_global_oom_handling only.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
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)Available on crate features metrics and opentelemetry only.
pub fn try_new_uninit_slice( len: usize, ) -> Result<Box<[MaybeUninit<T>]>, AllocError>
allocator_api)metrics and opentelemetry only.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)?;
// Deferred initialization:
values[0].write(1);
values[1].write(2);
values[2].write(3);
let values = unsafe { 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)Available on crate features metrics and opentelemetry only.
pub fn try_new_zeroed_slice( len: usize, ) -> Result<Box<[MaybeUninit<T>]>, AllocError>
allocator_api)metrics and opentelemetry only.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)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_uninit_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>
allocator_api)metrics and crate feature opentelemetry and non-no_global_oom_handling only.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);
// Deferred initialization:
values[0].write(1);
values[1].write(2);
values[2].write(3);
let values = unsafe { 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)Available on crate feature metrics and crate feature opentelemetry and non-no_global_oom_handling only.
pub fn new_zeroed_slice_in(len: usize, alloc: A) -> Box<[MaybeUninit<T>], A>
allocator_api)metrics and crate feature opentelemetry and non-no_global_oom_handling only.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)Available on crate features metrics and opentelemetry only.
pub fn try_new_uninit_slice_in( len: usize, alloc: A, ) -> Result<Box<[MaybeUninit<T>], A>, AllocError>
allocator_api)metrics and opentelemetry only.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)?;
// Deferred initialization:
values[0].write(1);
values[1].write(2);
values[2].write(3);
let values = unsafe { 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)Available on crate features metrics and opentelemetry only.
pub fn try_new_zeroed_slice_in( len: usize, alloc: A, ) -> Result<Box<[MaybeUninit<T>], A>, AllocError>
allocator_api)metrics and opentelemetry only.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]);Sourcepub fn into_array<const N: usize>(self) -> Result<Box<[T; N], A>, Box<[T], A>>
🔬This is a nightly-only experimental API. (alloc_slice_into_array)Available on crate features metrics and opentelemetry only.
pub fn into_array<const N: usize>(self) -> Result<Box<[T; N], A>, Box<[T], A>>
alloc_slice_into_array)metrics and opentelemetry only.Converts the boxed slice into a boxed array.
This operation does not reallocate; the underlying array of the slice is simply reinterpreted as an array type.
§Errors
Returns the original Box<[T]> in the Err variant if self.len() does not equal N.
§Examples
#![feature(alloc_slice_into_array)]
let box_slice: Box<[i32]> = Box::new([1, 2, 3]);
let box_array: Box<[i32; 3]> = box_slice.into_array().unwrap();Source§impl<T, A> Box<MaybeUninit<T>, A>where
A: Allocator,
impl<T, A> Box<MaybeUninit<T>, A>where
A: Allocator,
1.82.0 (const: unstable) · Sourcepub unsafe fn assume_init(self) -> Box<T, A>
Available on crate features metrics and opentelemetry only.
pub unsafe fn assume_init(self) -> Box<T, A>
metrics and opentelemetry only.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();
// Deferred initialization:
five.write(5);
let five: Box<u32> = unsafe { five.assume_init() };
assert_eq!(*five, 5)1.87.0 · Sourcepub fn write(boxed: Box<MaybeUninit<T>, A>, value: T) -> Box<T, A>
Available on crate features metrics and opentelemetry only.
pub fn write(boxed: Box<MaybeUninit<T>, A>, value: T) -> Box<T, A>
metrics and opentelemetry only.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
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>
Available on crate features metrics and opentelemetry only.
pub unsafe fn assume_init(self) -> Box<[T], A>
metrics and opentelemetry only.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);
// Deferred initialization:
values[0].write(1);
values[1].write(2);
values[2].write(3);
let values = unsafe { 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>
Available on crate features metrics and opentelemetry only.
pub unsafe fn from_raw(raw: *mut T) -> Box<T>
metrics and opentelemetry only.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 raw pointer must point to a block of memory allocated by the global allocator.
The safety conditions are described in the memory layout section.
Note that the considerations for unsafe code apply to all Box<T> values.
§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);
}1.99.0 · Sourcepub unsafe fn from_non_null(ptr: NonNull<T>) -> Box<T>
Available on crate features metrics and opentelemetry only.
pub unsafe fn from_non_null(ptr: NonNull<T>) -> Box<T>
metrics and opentelemetry only.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 non-null pointer must point to a block of memory allocated by the global allocator.
The safety conditions are described in the memory layout section.
Note that the considerations for unsafe code apply to all Box<T> values.
§Examples
Recreate a Box which was previously converted to a NonNull
pointer using Box::into_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:
use std::alloc::{alloc, Layout};
use std::ptr::NonNull;
unsafe {
let non_null = NonNull::new(alloc(Layout::new::<i32>()).cast::<i32>())
.expect("alloc should have successfully allocated memory");
// 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);
}1.4.0 · Sourcepub fn into_raw(b: Box<T>) -> *mut T
Available on crate features metrics and opentelemetry only.
pub fn into_raw(b: Box<T>) -> *mut T
metrics and opentelemetry only.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));
}1.99.0 · Sourcepub fn into_non_null(b: Box<T>) -> NonNull<T>
Available on crate features metrics and opentelemetry only.
pub fn into_non_null(b: Box<T>) -> NonNull<T>
metrics and opentelemetry only.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:
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:
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:
let x = Box::new(String::from("Hello"));
let non_null = Box::into_non_null(x);
unsafe {
drop(Box::from_non_null(non_null));
}Source§impl<T, A> Box<T, A>
impl<T, A> Box<T, A>
Sourcepub unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
🔬This is a nightly-only experimental API. (allocator_api)Available on crate features metrics and opentelemetry only.
pub unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
allocator_api)metrics and opentelemetry only.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.
The raw pointer must point to a block of memory allocated by alloc.
The safety conditions are described in the memory layout section.
Note that the considerations for unsafe code apply to all Box<T, A> values.
§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 unsafe fn from_non_null_in(raw: NonNull<T>, alloc: A) -> Box<T, A>
🔬This is a nightly-only experimental API. (allocator_api)Available on crate features metrics and opentelemetry only.
pub unsafe fn from_non_null_in(raw: NonNull<T>, alloc: A) -> Box<T, A>
allocator_api)metrics and opentelemetry only.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.
The non-null pointer must point to a block of memory allocated by alloc.
The safety conditions are described in the memory layout section.
Note that the considerations for unsafe code apply to all Box<T, A> values.
§Examples
Recreate a Box which was previously converted to a NonNull pointer
using Box::into_non_null_with_allocator:
#![feature(allocator_api)]
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)]
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);
}Sourcepub const fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
🔬This is a nightly-only experimental API. (allocator_api)Available on crate features metrics and opentelemetry only.
pub const fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
allocator_api)metrics and opentelemetry only.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)Available on crate features metrics and opentelemetry only.
pub fn into_non_null_with_allocator(b: Box<T, A>) -> (NonNull<T>, A)
allocator_api)metrics and opentelemetry only.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)]
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)]
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>());
}1.98.0 · Sourcepub fn as_mut_ptr(b: &mut Box<T, A>) -> *mut T
Available on crate features metrics and opentelemetry only.
pub fn as_mut_ptr(b: &mut Box<T, A>) -> *mut T
metrics and opentelemetry only.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, as_mut_ptr, and as_non_null.
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:
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);
}1.98.0 · Sourcepub fn as_ptr(b: &Box<T, A>) -> *const T
Available on crate features metrics and opentelemetry only.
pub fn as_ptr(b: &Box<T, A>) -> *const T
metrics and opentelemetry only.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, as_mut_ptr, and as_non_null.
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:
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 fn as_non_null(b: &mut Box<T, A>) -> NonNull<T>
🔬This is a nightly-only experimental API. (box_as_non_null)Available on crate features metrics and opentelemetry only.
pub fn as_non_null(b: &mut Box<T, A>) -> NonNull<T>
box_as_non_null)metrics and opentelemetry only.Returns a NonNull 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, as_mut_ptr, and as_non_null.
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_non_null)]
unsafe {
let mut b = Box::new(0);
let ptr1 = Box::as_non_null(&mut b);
ptr1.write(1);
let ptr2 = Box::as_non_null(&mut b);
ptr2.write(2);
// Notably, the write to `ptr2` did *not* invalidate `ptr1`:
ptr1.write(3);
}Sourcepub fn allocator(b: &Box<T, A>) -> &A
🔬This is a nightly-only experimental API. (allocator_api)Available on crate features metrics and opentelemetry only.
pub fn allocator(b: &Box<T, A>) -> &A
allocator_api)metrics and opentelemetry only.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,
Available on crate features metrics and opentelemetry only.
pub fn leak<'a>(b: Box<T, A>) -> &'a mut Twhere
A: 'a,
metrics and opentelemetry only.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,
i.e., memory that is meant to leak. Reconstructing (“unleaking”) a Box from the mutable
reference returned here (e.g. via Box::from_raw) is a grey area (meaning it is possible
under specific circumstances but many seemingly harmless ways of doing it are undefined
behavior) and should be avoided. If the memory should eventually be freed, prefer to use
Box::into_raw or Box::into_non_null instead.
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 · Sourcepub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>where
A: 'static,
Available on crate features metrics and opentelemetry only.
pub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>where
A: 'static,
metrics and opentelemetry only.Converts a Box<T> into a Pin<Box<T>>. If T does not implement Unpin, then
*boxed will be pinned in memory and unable to be moved.
This conversion does not allocate on the heap and happens in place.
This is also available via From.
Constructing and pinning a Box with Box::into_pin(Box::new(x))
can also be written more concisely using Box::pin(x).
This into_pin method is useful if you already have a Box<T>, or you are
constructing a (pinned) Box in a different way than with Box::new.
§Notes
It’s not recommended that crates add an impl like From<Box<T>> for Pin<T>,
as it’ll introduce an ambiguity when calling Pin::from.
A demonstration of such a poor impl is shown below.
struct Foo; // A type defined in this crate.
impl From<Box<()>> for Pin<Foo> {
fn from(_: Box<()>) -> Pin<Foo> {
Pin::new(Foo)
}
}
let foo = Box::new(());
let bar = Pin::from(foo);Trait Implementations§
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<'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, const N: usize, A> !Iterator for Box<[I; N], A>where
A: Allocator,
This implementation is required to make sure that the Box<[I; N]>: IntoIterator
implementation doesn’t overlap with IntoIterator for T where T: Iterator blanket.
impl<'a, const N: usize, I, A> !Iterator for &'a Box<[I; N], A>where
A: Allocator,
This implementation is required to make sure that the &Box<[I; N]>: IntoIterator
implementation doesn’t overlap with IntoIterator for T where T: Iterator blanket.
impl<'a, const N: usize, I, A> !Iterator for &'a mut Box<[I; N], A>where
A: Allocator,
This implementation is required to make sure that the &mut Box<[I; N]>: IntoIterator
implementation doesn’t overlap with IntoIterator for T where T: Iterator blanket.
Source§impl<T, A> Allocator for Box<T, A>
impl<T, A> Allocator for Box<T, A>
Source§fn allocate(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError>
fn allocate(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError>
allocator_api)Source§fn allocate_zeroed(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError>
fn allocate_zeroed(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError>
allocator_api)allocate, but also ensures that the returned memory is zero-initialized. Read moreSource§unsafe fn deallocate(&self, ptr: NonNull<u8>, layout: Layout)
unsafe fn deallocate(&self, ptr: NonNull<u8>, layout: Layout)
allocator_api)ptr. Read moreSource§unsafe fn grow(
&self,
ptr: NonNull<u8>,
old_layout: Layout,
new_layout: Layout,
) -> Result<NonNull<[u8]>, AllocError>
unsafe fn grow( &self, ptr: NonNull<u8>, old_layout: Layout, new_layout: Layout, ) -> Result<NonNull<[u8]>, AllocError>
allocator_api)Source§unsafe fn grow_zeroed(
&self,
ptr: NonNull<u8>,
old_layout: Layout,
new_layout: Layout,
) -> Result<NonNull<[u8]>, AllocError>
unsafe fn grow_zeroed( &self, ptr: NonNull<u8>, old_layout: Layout, new_layout: Layout, ) -> Result<NonNull<[u8]>, AllocError>
allocator_api)grow, but also ensures that the new contents are set to zero before being
returned. 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 try_size_hint(
depth: usize,
) -> Result<(usize, Option<usize>), MaxRecursionReached>
fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>
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 arbitrary_take_rest(u: Unstructured<'a>) -> Result<Box<[A]>, Error>
fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Box<[A]>, 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<'_>
§impl<T> AsyncBufRead for Box<T>
impl<T> AsyncBufRead for Box<T>
§impl<T> AsyncBufRead for Box<T>
impl<T> AsyncBufRead for Box<T>
1.85.0 · 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.1.85.0 · 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.1.85.0 · 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 more§impl<T> AsyncRead for Box<T>
impl<T> AsyncRead for Box<T>
§impl<T> AsyncWrite for Box<T>
impl<T> AsyncWrite for Box<T>
§fn poll_write(
self: Pin<&mut Box<T>>,
cx: &mut Context<'_>,
buf: &[u8],
) -> Poll<Result<usize, Error>>
fn poll_write( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, buf: &[u8], ) -> Poll<Result<usize, Error>>
buf into the object. Read more§fn poll_write_vectored(
self: Pin<&mut Box<T>>,
cx: &mut Context<'_>,
bufs: &[IoSlice<'_>],
) -> Poll<Result<usize, Error>>
fn poll_write_vectored( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, bufs: &[IoSlice<'_>], ) -> Poll<Result<usize, Error>>
poll_write, except that it writes from a slice of buffers. Read more§fn is_write_vectored(&self) -> bool
fn is_write_vectored(&self) -> bool
poll_write_vectored
implementation. Read more§impl<T> AsyncWrite for Box<T>
impl<T> AsyncWrite for Box<T>
§fn poll_write(
self: Pin<&mut Box<T>>,
cx: &mut Context<'_>,
buf: &[u8],
) -> Poll<Result<usize, Error>>
fn poll_write( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, buf: &[u8], ) -> Poll<Result<usize, Error>>
buf into the object. Read more§fn poll_write_vectored(
self: Pin<&mut Box<T>>,
cx: &mut Context<'_>,
bufs: &[IoSlice<'_>],
) -> Poll<Result<usize, Error>>
fn poll_write_vectored( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, bufs: &[IoSlice<'_>], ) -> Poll<Result<usize, Error>>
bufs into the object using vectored
IO operations. Read more§impl<T> Body for Box<T>
impl<T> Body for Box<T>
§fn poll_frame(
self: Pin<&mut Box<T>>,
cx: &mut Context<'_>,
) -> Poll<Option<Result<Frame<<Box<T> as Body>::Data>, <Box<T> as Body>::Error>>>
fn poll_frame( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, ) -> Poll<Option<Result<Frame<<Box<T> as Body>::Data>, <Box<T> as Body>::Error>>>
§fn is_end_stream(&self) -> bool
fn is_end_stream(&self) -> bool
true when the end of stream has been reached. Read more§impl<T> Body for Box<T>
impl<T> Body for Box<T>
§fn poll_frame(
self: Pin<&mut Box<T>>,
cx: &mut Context<'_>,
) -> Poll<Option<Result<Frame<<Box<T> as Body>::Data>, <Box<T> as Body>::Error>>>
fn poll_frame( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, ) -> Poll<Option<Result<Frame<<Box<T> as Body>::Data>, <Box<T> as Body>::Error>>>
§fn is_end_stream(&self) -> bool
fn is_end_stream(&self) -> bool
true when the end of stream has been reached. 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
§impl<T> Buf for Box<T>
impl<T> Buf for Box<T>
§fn remaining(&self) -> usize
fn remaining(&self) -> usize
§fn chunk(&self) -> &[u8] ⓘ
fn chunk(&self) -> &[u8] ⓘ
Buf::remaining(). Note that this can return a shorter slice (this
allows non-continuous internal representation). Read more§fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize
fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize
std only.§fn has_remaining(&self) -> bool
fn has_remaining(&self) -> bool
§fn copy_to_slice(&mut self, dst: &mut [u8])
fn copy_to_slice(&mut self, dst: &mut [u8])
§fn get_u16(&mut self) -> u16
fn get_u16(&mut self) -> u16
self in big-endian byte order. Read more§fn get_u16_le(&mut self) -> u16
fn get_u16_le(&mut self) -> u16
self in little-endian byte order. Read more§fn get_u16_ne(&mut self) -> u16
fn get_u16_ne(&mut self) -> u16
self in native-endian byte order. Read more§fn get_i16(&mut self) -> i16
fn get_i16(&mut self) -> i16
self in big-endian byte order. Read more§fn get_i16_le(&mut self) -> i16
fn get_i16_le(&mut self) -> i16
self in little-endian byte order. Read more§fn get_i16_ne(&mut self) -> i16
fn get_i16_ne(&mut self) -> i16
self in native-endian byte order. Read more§fn get_u32(&mut self) -> u32
fn get_u32(&mut self) -> u32
self in the big-endian byte order. Read more§fn get_u32_le(&mut self) -> u32
fn get_u32_le(&mut self) -> u32
self in the little-endian byte order. Read more§fn get_u32_ne(&mut self) -> u32
fn get_u32_ne(&mut self) -> u32
self in native-endian byte order. Read more§fn get_i32(&mut self) -> i32
fn get_i32(&mut self) -> i32
self in big-endian byte order. Read more§fn get_i32_le(&mut self) -> i32
fn get_i32_le(&mut self) -> i32
self in little-endian byte order. Read more§fn get_i32_ne(&mut self) -> i32
fn get_i32_ne(&mut self) -> i32
self in native-endian byte order. Read more§fn get_u64(&mut self) -> u64
fn get_u64(&mut self) -> u64
self in big-endian byte order. Read more§fn get_u64_le(&mut self) -> u64
fn get_u64_le(&mut self) -> u64
self in little-endian byte order. Read more§fn get_u64_ne(&mut self) -> u64
fn get_u64_ne(&mut self) -> u64
self in native-endian byte order. Read more§fn get_i64(&mut self) -> i64
fn get_i64(&mut self) -> i64
self in big-endian byte order. Read more§fn get_i64_le(&mut self) -> i64
fn get_i64_le(&mut self) -> i64
self in little-endian byte order. Read more§fn get_i64_ne(&mut self) -> i64
fn get_i64_ne(&mut self) -> i64
self in native-endian byte order. Read more§fn get_u128(&mut self) -> u128
fn get_u128(&mut self) -> u128
self in big-endian byte order. Read more§fn get_u128_le(&mut self) -> u128
fn get_u128_le(&mut self) -> u128
self in little-endian byte order. Read more§fn get_u128_ne(&mut self) -> u128
fn get_u128_ne(&mut self) -> u128
self in native-endian byte order. Read more§fn get_i128(&mut self) -> i128
fn get_i128(&mut self) -> i128
self in big-endian byte order. Read more§fn get_i128_le(&mut self) -> i128
fn get_i128_le(&mut self) -> i128
self in little-endian byte order. Read more§fn get_i128_ne(&mut self) -> i128
fn get_i128_ne(&mut self) -> i128
self in native-endian byte order. Read more§fn get_uint(&mut self, nbytes: usize) -> u64
fn get_uint(&mut self, nbytes: usize) -> u64
self in big-endian byte order. Read more§fn get_uint_le(&mut self, nbytes: usize) -> u64
fn get_uint_le(&mut self, nbytes: usize) -> u64
self in little-endian byte order. Read more§fn get_uint_ne(&mut self, nbytes: usize) -> u64
fn get_uint_ne(&mut self, nbytes: usize) -> u64
self in native-endian byte order. Read more§fn get_int(&mut self, nbytes: usize) -> i64
fn get_int(&mut self, nbytes: usize) -> i64
self in big-endian byte order. Read more§fn get_int_le(&mut self, nbytes: usize) -> i64
fn get_int_le(&mut self, nbytes: usize) -> i64
self in little-endian byte order. Read more§fn get_int_ne(&mut self, nbytes: usize) -> i64
fn get_int_ne(&mut self, nbytes: usize) -> i64
self in native-endian byte order. Read more§fn get_f32(&mut self) -> f32
fn get_f32(&mut self) -> f32
self in big-endian byte order. Read more§fn get_f32_le(&mut self) -> f32
fn get_f32_le(&mut self) -> f32
self in little-endian byte order. Read more§fn get_f32_ne(&mut self) -> f32
fn get_f32_ne(&mut self) -> f32
self in native-endian byte order. Read more§fn get_f64(&mut self) -> f64
fn get_f64(&mut self) -> f64
self in big-endian byte order. Read more§fn get_f64_le(&mut self) -> f64
fn get_f64_le(&mut self) -> f64
self in little-endian byte order. Read more§fn get_f64_ne(&mut self) -> f64
fn get_f64_ne(&mut self) -> f64
self in native-endian byte order. Read more§fn try_copy_to_slice(&mut self, dst: &mut [u8]) -> Result<(), TryGetError>
fn try_copy_to_slice(&mut self, dst: &mut [u8]) -> Result<(), TryGetError>
§fn try_get_u8(&mut self) -> Result<u8, TryGetError>
fn try_get_u8(&mut self) -> Result<u8, TryGetError>
self. Read more§fn try_get_i8(&mut self) -> Result<i8, TryGetError>
fn try_get_i8(&mut self) -> Result<i8, TryGetError>
self. Read more§fn try_get_u16(&mut self) -> Result<u16, TryGetError>
fn try_get_u16(&mut self) -> Result<u16, TryGetError>
self in big-endian byte order. Read more§fn try_get_u16_le(&mut self) -> Result<u16, TryGetError>
fn try_get_u16_le(&mut self) -> Result<u16, TryGetError>
self in little-endian byte order. Read more§fn try_get_u16_ne(&mut self) -> Result<u16, TryGetError>
fn try_get_u16_ne(&mut self) -> Result<u16, TryGetError>
self in native-endian byte order. Read more§fn try_get_i16(&mut self) -> Result<i16, TryGetError>
fn try_get_i16(&mut self) -> Result<i16, TryGetError>
self in big-endian byte order. Read more§fn try_get_i16_le(&mut self) -> Result<i16, TryGetError>
fn try_get_i16_le(&mut self) -> Result<i16, TryGetError>
self in little-endian byte order. Read more§fn try_get_i16_ne(&mut self) -> Result<i16, TryGetError>
fn try_get_i16_ne(&mut self) -> Result<i16, TryGetError>
self in native-endian byte order. Read more§fn try_get_u32(&mut self) -> Result<u32, TryGetError>
fn try_get_u32(&mut self) -> Result<u32, TryGetError>
self in big-endian byte order. Read more§fn try_get_u32_le(&mut self) -> Result<u32, TryGetError>
fn try_get_u32_le(&mut self) -> Result<u32, TryGetError>
self in little-endian byte order. Read more§fn try_get_u32_ne(&mut self) -> Result<u32, TryGetError>
fn try_get_u32_ne(&mut self) -> Result<u32, TryGetError>
self in native-endian byte order. Read more§fn try_get_i32(&mut self) -> Result<i32, TryGetError>
fn try_get_i32(&mut self) -> Result<i32, TryGetError>
self in big-endian byte order. Read more§fn try_get_i32_le(&mut self) -> Result<i32, TryGetError>
fn try_get_i32_le(&mut self) -> Result<i32, TryGetError>
self in little-endian byte order. Read more§fn try_get_i32_ne(&mut self) -> Result<i32, TryGetError>
fn try_get_i32_ne(&mut self) -> Result<i32, TryGetError>
self in native-endian byte order. Read more§fn try_get_u64(&mut self) -> Result<u64, TryGetError>
fn try_get_u64(&mut self) -> Result<u64, TryGetError>
self in big-endian byte order. Read more§fn try_get_u64_le(&mut self) -> Result<u64, TryGetError>
fn try_get_u64_le(&mut self) -> Result<u64, TryGetError>
self in little-endian byte order. Read more§fn try_get_u64_ne(&mut self) -> Result<u64, TryGetError>
fn try_get_u64_ne(&mut self) -> Result<u64, TryGetError>
self in native-endian byte order. Read more§fn try_get_i64(&mut self) -> Result<i64, TryGetError>
fn try_get_i64(&mut self) -> Result<i64, TryGetError>
self in big-endian byte order. Read more§fn try_get_i64_le(&mut self) -> Result<i64, TryGetError>
fn try_get_i64_le(&mut self) -> Result<i64, TryGetError>
self in little-endian byte order. Read more§fn try_get_i64_ne(&mut self) -> Result<i64, TryGetError>
fn try_get_i64_ne(&mut self) -> Result<i64, TryGetError>
self in native-endian byte order. Read more§fn try_get_u128(&mut self) -> Result<u128, TryGetError>
fn try_get_u128(&mut self) -> Result<u128, TryGetError>
self in big-endian byte order. Read more§fn try_get_u128_le(&mut self) -> Result<u128, TryGetError>
fn try_get_u128_le(&mut self) -> Result<u128, TryGetError>
self in little-endian byte order. Read more§fn try_get_u128_ne(&mut self) -> Result<u128, TryGetError>
fn try_get_u128_ne(&mut self) -> Result<u128, TryGetError>
self in native-endian byte order. Read more§fn try_get_i128(&mut self) -> Result<i128, TryGetError>
fn try_get_i128(&mut self) -> Result<i128, TryGetError>
self in big-endian byte order. Read more§fn try_get_i128_le(&mut self) -> Result<i128, TryGetError>
fn try_get_i128_le(&mut self) -> Result<i128, TryGetError>
self in little-endian byte order. Read more§fn try_get_i128_ne(&mut self) -> Result<i128, TryGetError>
fn try_get_i128_ne(&mut self) -> Result<i128, TryGetError>
self in native-endian byte order. Read more§fn try_get_uint(&mut self, nbytes: usize) -> Result<u64, TryGetError>
fn try_get_uint(&mut self, nbytes: usize) -> Result<u64, TryGetError>
self in big-endian byte order. Read more§fn try_get_uint_le(&mut self, nbytes: usize) -> Result<u64, TryGetError>
fn try_get_uint_le(&mut self, nbytes: usize) -> Result<u64, TryGetError>
self in little-endian byte order. Read more§fn try_get_uint_ne(&mut self, nbytes: usize) -> Result<u64, TryGetError>
fn try_get_uint_ne(&mut self, nbytes: usize) -> Result<u64, TryGetError>
self in native-endian byte order. Read more§fn try_get_int(&mut self, nbytes: usize) -> Result<i64, TryGetError>
fn try_get_int(&mut self, nbytes: usize) -> Result<i64, TryGetError>
self in big-endian byte order. Read more§fn try_get_int_le(&mut self, nbytes: usize) -> Result<i64, TryGetError>
fn try_get_int_le(&mut self, nbytes: usize) -> Result<i64, TryGetError>
self in little-endian byte order. Read more§fn try_get_int_ne(&mut self, nbytes: usize) -> Result<i64, TryGetError>
fn try_get_int_ne(&mut self, nbytes: usize) -> Result<i64, TryGetError>
self in native-endian byte order. Read more§fn try_get_f32(&mut self) -> Result<f32, TryGetError>
fn try_get_f32(&mut self) -> Result<f32, TryGetError>
self in big-endian byte order. Read more§fn try_get_f32_le(&mut self) -> Result<f32, TryGetError>
fn try_get_f32_le(&mut self) -> Result<f32, TryGetError>
self in little-endian byte order. Read more§fn try_get_f32_ne(&mut self) -> Result<f32, TryGetError>
fn try_get_f32_ne(&mut self) -> Result<f32, TryGetError>
self in native-endian byte order. Read more§fn try_get_f64(&mut self) -> Result<f64, TryGetError>
fn try_get_f64(&mut self) -> Result<f64, TryGetError>
self in big-endian byte order. Read more§fn try_get_f64_le(&mut self) -> Result<f64, TryGetError>
fn try_get_f64_le(&mut self) -> Result<f64, TryGetError>
self in little-endian byte order. Read more§fn try_get_f64_ne(&mut self) -> Result<f64, TryGetError>
fn try_get_f64_ne(&mut self) -> Result<f64, TryGetError>
self in native-endian byte order. Read more§fn copy_to_bytes(&mut self, len: usize) -> Bytes
fn copy_to_bytes(&mut self, len: usize) -> Bytes
§impl<T> BufMut for Box<T>
impl<T> BufMut for Box<T>
§fn remaining_mut(&self) -> usize
fn remaining_mut(&self) -> usize
§fn chunk_mut(&mut self) -> &mut UninitSlice
fn chunk_mut(&mut self) -> &mut UninitSlice
BufMut::remaining_mut(). Note that this can be shorter than the
whole remainder of the buffer (this allows non-continuous implementation). Read more§unsafe fn advance_mut(&mut self, cnt: usize)
unsafe fn advance_mut(&mut self, cnt: usize)
§fn put_u16(&mut self, n: u16)
fn put_u16(&mut self, n: u16)
self in big-endian byte order. Read more§fn put_u16_le(&mut self, n: u16)
fn put_u16_le(&mut self, n: u16)
self in little-endian byte order. Read more§fn put_u16_ne(&mut self, n: u16)
fn put_u16_ne(&mut self, n: u16)
self in native-endian byte order. Read more§fn put_i16(&mut self, n: i16)
fn put_i16(&mut self, n: i16)
self in big-endian byte order. Read more§fn put_i16_le(&mut self, n: i16)
fn put_i16_le(&mut self, n: i16)
self in little-endian byte order. Read more§fn put_i16_ne(&mut self, n: i16)
fn put_i16_ne(&mut self, n: i16)
self in native-endian byte order. Read more§fn put_u32(&mut self, n: u32)
fn put_u32(&mut self, n: u32)
self in big-endian byte order. Read more§fn put_u32_le(&mut self, n: u32)
fn put_u32_le(&mut self, n: u32)
self in little-endian byte order. Read more§fn put_u32_ne(&mut self, n: u32)
fn put_u32_ne(&mut self, n: u32)
self in native-endian byte order. Read more§fn put_i32(&mut self, n: i32)
fn put_i32(&mut self, n: i32)
self in big-endian byte order. Read more§fn put_i32_le(&mut self, n: i32)
fn put_i32_le(&mut self, n: i32)
self in little-endian byte order. Read more§fn put_i32_ne(&mut self, n: i32)
fn put_i32_ne(&mut self, n: i32)
self in native-endian byte order. Read more§fn put_u64(&mut self, n: u64)
fn put_u64(&mut self, n: u64)
self in the big-endian byte order. Read more§fn put_u64_le(&mut self, n: u64)
fn put_u64_le(&mut self, n: u64)
self in little-endian byte order. Read more§fn put_u64_ne(&mut self, n: u64)
fn put_u64_ne(&mut self, n: u64)
self in native-endian byte order. Read more§fn put_i64(&mut self, n: i64)
fn put_i64(&mut self, n: i64)
self in the big-endian byte order. Read more§fn put_i64_le(&mut self, n: i64)
fn put_i64_le(&mut self, n: i64)
self in little-endian byte order. Read more§fn put_i64_ne(&mut self, n: i64)
fn put_i64_ne(&mut self, n: i64)
self in native-endian byte order. Read more§fn has_remaining_mut(&self) -> bool
fn has_remaining_mut(&self) -> bool
self for more bytes. Read more§fn put_u128(&mut self, n: u128)
fn put_u128(&mut self, n: u128)
self in the big-endian byte order. Read more§fn put_u128_le(&mut self, n: u128)
fn put_u128_le(&mut self, n: u128)
self in little-endian byte order. Read more§fn put_u128_ne(&mut self, n: u128)
fn put_u128_ne(&mut self, n: u128)
self in native-endian byte order. Read more§fn put_i128(&mut self, n: i128)
fn put_i128(&mut self, n: i128)
self in the big-endian byte order. Read more§fn put_i128_le(&mut self, n: i128)
fn put_i128_le(&mut self, n: i128)
self in little-endian byte order. Read more§fn put_i128_ne(&mut self, n: i128)
fn put_i128_ne(&mut self, n: i128)
self in native-endian byte order. Read more§fn put_uint(&mut self, n: u64, nbytes: usize)
fn put_uint(&mut self, n: u64, nbytes: usize)
self in big-endian byte order. Read more§fn put_uint_le(&mut self, n: u64, nbytes: usize)
fn put_uint_le(&mut self, n: u64, nbytes: usize)
self in the little-endian byte order. Read more§fn put_uint_ne(&mut self, n: u64, nbytes: usize)
fn put_uint_ne(&mut self, n: u64, nbytes: usize)
self in the native-endian byte order. Read more§fn put_int_le(&mut self, n: i64, nbytes: usize)
fn put_int_le(&mut self, n: i64, nbytes: usize)
§fn put_int_ne(&mut self, n: i64, nbytes: usize)
fn put_int_ne(&mut self, n: i64, nbytes: usize)
§fn put_f32(&mut self, n: f32)
fn put_f32(&mut self, n: f32)
self in big-endian byte order. Read more§fn put_f32_le(&mut self, n: f32)
fn put_f32_le(&mut self, n: f32)
self in little-endian byte order. Read more§fn put_f32_ne(&mut self, n: f32)
fn put_f32_ne(&mut self, n: f32)
self in native-endian byte order. Read more§fn put_f64(&mut self, n: f64)
fn put_f64(&mut self, n: f64)
self in big-endian byte order. Read more§fn put_f64_le(&mut self, n: f64)
fn put_f64_le(&mut self, n: f64)
self in little-endian byte order. Read more§fn put_f64_ne(&mut self, n: f64)
fn put_f64_ne(&mut self, n: f64)
self in native-endian byte order. Read more1.0.0 · Source§impl<B> BufRead for Box<B>
impl<B> BufRead for Box<B>
Source§fn consume(&mut self, amt: usize)
fn consume(&mut self, amt: usize)
amount of additional bytes from the internal buffer as having been read.
Subsequent calls to read only return bytes that have not been marked as read. 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. Read moreSource§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 more1.0.0 · Source§impl<T, A> Clone for Box<T, A>
Available on non-no_global_oom_handling only.
impl<T, A> Clone for Box<T, A>
no_global_oom_handling only.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);1.3.0 · Source§impl<T, A> Clone for Box<[T], A>
Available on non-no_global_oom_handling only.
impl<T, A> Clone for Box<[T], A>
no_global_oom_handling only.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);§impl Clone for Box<dyn ShouldSample>
impl Clone for Box<dyn ShouldSample>
§fn clone(&self) -> Box<dyn ShouldSample>
fn clone(&self) -> Box<dyn ShouldSample>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreimpl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
impl<T> ComponentType for Box<T>where
T: ComponentType + ?Sized,
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)1.0.0 · Source§impl<T> Default for Box<T>where
T: Default,
Available on non-no_global_oom_handling only.
impl<T> Default for Box<T>where
T: Default,
no_global_oom_handling only.impl<T, A> DerefPure for Box<T, A>
Source§impl<'de> Deserialize<'de> for Box<CStr>
Available on crate feature std, or crate feature alloc and non-no_core_cstr only.
impl<'de> Deserialize<'de> for Box<CStr>
std, or crate feature alloc and non-no_core_cstr only.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<Path>
Available on crate feature std only.
impl<'de> Deserialize<'de> for Box<Path>
std only.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>,
Available on crate features alloc or std only.
impl<'de, T> Deserialize<'de> for Box<T>where
T: Deserialize<'de>,
alloc or std only.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, T> Deserialize<'de> for Box<[T]>where
T: Deserialize<'de>,
Available on crate features alloc or std only.
impl<'de, T> Deserialize<'de> for Box<[T]>where
T: Deserialize<'de>,
alloc or std only.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>
Available on crate features alloc or std only.
impl<'de> Deserialize<'de> for Box<str>
alloc or std only.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>,
Source§impl<'de> Deserialize<'de> for Box<OsStr>
Available on crate feature std and (Unix or Windows) only.
impl<'de> Deserialize<'de> for Box<OsStr>
std and (Unix or Windows) only.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>,
impl<T, U> DispatchFromDyn<Box<U>> for Box<T>
§impl<T> DnsIpPicker for Box<T>where
T: DnsIpPicker,
impl<T> DnsIpPicker for Box<T>where
T: DnsIpPicker,
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>
nth element from the end of the iterator. Read moreSource§fn next_chunk_back<const N: usize>(
&mut self,
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
fn next_chunk_back<const N: usize>(
&mut self,
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
Self: Sized,
iter_next_chunk)N values in sequence. 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 (const: unstable) · 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 more§impl<T> Entry for Box<T>where
T: Entry + ?Sized,
impl<T> Entry for Box<T>where
T: Entry + ?Sized,
§fn write<'a>(&'a self, writer: &mut impl EntryWriter<'a>)
fn write<'a>(&'a self, writer: &mut impl EntryWriter<'a>)
EntryWriter]. The writer corresponds
to an atomic entry written to the metrics consumer, like CloudWatch.§fn sample_group(
&self,
) -> impl Iterator<Item = (Cow<'static, str>, Cow<'static, str>)>
fn sample_group( &self, ) -> impl Iterator<Item = (Cow<'static, str>, Cow<'static, str>)>
§fn descriptors(&self) -> Descriptors<'_>
fn descriptors(&self) -> Descriptors<'_>
metrique_require_explicit_impls only.§fn merge<E>(self, other: E) -> Merged<Self, E>where
Self: Sized,
fn merge<E>(self, other: E) -> Merged<Self, E>where
Self: Sized,
other. Read more§fn merge_by_ref<'a, E>(&'a self, other: &'a E) -> MergedRef<'a, Self, E>where
E: 'a + Entry,
fn merge_by_ref<'a, E>(&'a self, other: &'a E) -> MergedRef<'a, Self, E>where
E: 'a + Entry,
Entry::merge], but does so by reference.impl<T, A> Eq for Box<T, A>
1.8.0 · Source§impl<E> Error for Box<E>where
E: Error,
impl<E> Error for Box<E>where
E: Error,
Source§fn cause(&self) -> Option<&dyn Error>
fn cause(&self) -> Option<&dyn Error>
replaced by Error::source, which can support downcasting
Source§fn source(&self) -> Option<&(dyn Error + 'static)>
fn source(&self) -> Option<&(dyn Error + 'static)>
Source§fn provide<'b>(&'b self, request: &mut Request<'b>)
fn provide<'b>(&'b self, request: &mut Request<'b>)
error_generic_member_access)1.0.0 · Source§fn description(&self) -> &str
fn description(&self) -> &str
use the Display impl or to_string()
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,
Available on non-no_global_oom_handling only.
impl<A> Extend<Box<str, A>> for Stringwhere
A: Allocator,
no_global_oom_handling only.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)§impl<T> ExtensionsRef for Box<T>where
T: ExtensionsRef,
impl<T> ExtensionsRef for Box<T>where
T: ExtensionsRef,
§fn extensions(&self) -> &Extensions
fn extensions(&self) -> &Extensions
Extensions store§impl<T> ExtensionsRef for Pin<Box<T>>where
T: ExtensionsRef,
impl<T> ExtensionsRef for Pin<Box<T>>where
T: ExtensionsRef,
§fn extensions(&self) -> &Extensions
fn extensions(&self) -> &Extensions
Extensions store§impl<S> Filter<S> for Box<dyn Filter<S> + Send + Sync>
Available on crate feature registry only.
impl<S> Filter<S> for Box<dyn Filter<S> + Send + Sync>
registry only.§fn enabled(&self, meta: &Metadata<'_>, cx: &Context<'_, S>) -> bool
fn enabled(&self, meta: &Metadata<'_>, cx: &Context<'_, S>) -> bool
true if this layer is interested in a span or event with the
given Metadata in the current [Context], similarly to
Subscriber::enabled. Read more§fn callsite_enabled(&self, meta: &'static Metadata<'static>) -> Interest
fn callsite_enabled(&self, meta: &'static Metadata<'static>) -> Interest
§fn max_level_hint(&self) -> Option<LevelFilter>
fn max_level_hint(&self) -> Option<LevelFilter>
§fn event_enabled(&self, event: &Event<'_>, cx: &Context<'_, S>) -> bool
fn event_enabled(&self, event: &Event<'_>, cx: &Context<'_, S>) -> bool
Layer]'s [on_event], to determine if on_event` should be called. Read more§fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)
fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)
§fn on_enter(&self, id: &Id, ctx: Context<'_, S>)
fn on_enter(&self, id: &Id, ctx: Context<'_, S>)
§impl<S> From<&RiAbsoluteStr<S>> for Box<RiAbsoluteStr<S>>where
S: Spec,
Available on crate feature alloc only.
impl<S> From<&RiAbsoluteStr<S>> for Box<RiAbsoluteStr<S>>where
S: Spec,
alloc only.§impl<S> From<&RiFragmentStr<S>> for Box<RiFragmentStr<S>>where
S: Spec,
Available on crate feature alloc only.
impl<S> From<&RiFragmentStr<S>> for Box<RiFragmentStr<S>>where
S: Spec,
alloc only.§impl<S> From<&RiQueryStr<S>> for Box<RiQueryStr<S>>where
S: Spec,
Available on crate feature alloc only.
impl<S> From<&RiQueryStr<S>> for Box<RiQueryStr<S>>where
S: Spec,
alloc only.§impl<S> From<&RiReferenceStr<S>> for Box<RiReferenceStr<S>>where
S: Spec,
Available on crate feature alloc only.
impl<S> From<&RiReferenceStr<S>> for Box<RiReferenceStr<S>>where
S: Spec,
alloc only.§impl<S> From<&RiRelativeStr<S>> for Box<RiRelativeStr<S>>where
S: Spec,
Available on crate feature alloc only.
impl<S> From<&RiRelativeStr<S>> for Box<RiRelativeStr<S>>where
S: Spec,
alloc only.1.17.0 · Source§impl<T> From<&[T]> for Box<[T]>where
T: Clone,
Available on non-no_global_oom_handling only.
impl<T> From<&[T]> for Box<[T]>where
T: Clone,
no_global_oom_handling only.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.84.0 · Source§impl<T> From<&mut [T]> for Box<[T]>where
T: Clone,
Available on non-no_global_oom_handling only.
impl<T> From<&mut [T]> for Box<[T]>where
T: Clone,
no_global_oom_handling only.Source§fn from(slice: &mut [T]) -> Box<[T]>
fn from(slice: &mut [T]) -> Box<[T]>
Converts a &mut [T] into a Box<[T]>
This conversion allocates on the heap
and performs a copy of slice and its contents.
§Examples
// create a &mut [u8] which will be used to create a Box<[u8]>
let mut array = [104, 101, 108, 108, 111];
let slice: &mut [u8] = &mut array;
let boxed_slice: Box<[u8]> = Box::from(slice);
println!("{boxed_slice:?}");1.0.0 · Source§impl<'a> From<&str> for Box<dyn Error + Send + Sync + 'a>
Available on non-no_global_oom_handling only.
impl<'a> From<&str> for Box<dyn Error + Send + Sync + 'a>
no_global_oom_handling only.1.6.0 · Source§impl<'a> From<&str> for Box<dyn Error + 'a>
Available on non-no_global_oom_handling only.
impl<'a> From<&str> for Box<dyn Error + 'a>
no_global_oom_handling only.§impl<'a, F> From<Box<F>> for LocalFutureObj<'a, ()>
impl<'a, F> From<Box<F>> for LocalFutureObj<'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.21.0 · Source§impl<T, A> From<Box<T, A>> for Rc<T, A>
Available on non-no_global_oom_handling only.
impl<T, A> From<Box<T, A>> for Rc<T, A>
no_global_oom_handling only.1.21.0 · Source§impl<T, A> From<Box<T, A>> for Arc<T, A>
Available on non-no_global_oom_handling only.
impl<T, A> From<Box<T, A>> for Arc<T, A>
no_global_oom_handling only.§impl From<Box<[ProxyRoute]>> for ProxyRoutes
impl From<Box<[ProxyRoute]>> for ProxyRoutes
§fn from(value: Box<[ProxyRoute]>) -> ProxyRoutes
fn from(value: Box<[ProxyRoute]>) -> ProxyRoutes
§impl<T> From<Box<[T]>> for MaybeStaticSlice<T>where
T: 'static,
Available on crate feature alloc only.
impl<T> From<Box<[T]>> for MaybeStaticSlice<T>where
T: 'static,
alloc only.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);§impl<const ARRAY_CAPACITY_MAX: usize> From<Box<str>> for SmallStr<ARRAY_CAPACITY_MAX>
Available on crate feature alloc only.Return a SmallStr that is guaranteed to live on the heap.
impl<const ARRAY_CAPACITY_MAX: usize> From<Box<str>> for SmallStr<ARRAY_CAPACITY_MAX>
alloc only.Return a SmallStr that is guaranteed to live on the heap.
1.45.0 · Source§impl<T> From<Cow<'_, [T]>> for Box<[T]>where
T: Clone,
Available on non-no_global_oom_handling only.
impl<T> From<Cow<'_, [T]>> for Box<[T]>where
T: Clone,
no_global_oom_handling only.1.45.0 · Source§impl From<Cow<'_, str>> for Box<str>
Available on non-no_global_oom_handling only.
impl From<Cow<'_, str>> for Box<str>
no_global_oom_handling only.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 + Send + Sync + 'a>
Available on non-no_global_oom_handling only.
impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + Send + Sync + 'a>
no_global_oom_handling only.Source§fn from(err: Cow<'b, str>) -> Box<dyn Error + Send + Sync + 'a>
fn from(err: Cow<'b, str>) -> Box<dyn Error + Send + Sync + 'a>
Converts a Cow into a box of dyn Error + Send + Sync.
§Examples
use std::error::Error;
use std::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!(
size_of::<Box<dyn Error + Send + Sync>>() == size_of_val(&a_boxed_error))1.22.0 · Source§impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + 'a>
Available on non-no_global_oom_handling only.
impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + 'a>
no_global_oom_handling only.1.0.0 · Source§impl<'a, E> From<E> for Box<dyn Error + 'a>where
E: Error + 'a,
Available on non-no_global_oom_handling only.
impl<'a, E> From<E> for Box<dyn Error + 'a>where
E: Error + 'a,
no_global_oom_handling only.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;
#[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 == size_of_val(&an_error));
let a_boxed_error = Box::<dyn Error>::from(an_error);
assert!(size_of::<Box<dyn Error>>() == size_of_val(&a_boxed_error))1.0.0 · Source§impl<'a, E> From<E> for Box<dyn Error + Send + Sync + 'a>
Available on non-no_global_oom_handling only.
impl<'a, E> From<E> for Box<dyn Error + Send + Sync + 'a>
no_global_oom_handling only.Source§fn from(err: E) -> Box<dyn Error + Send + Sync + 'a>
fn from(err: E) -> Box<dyn Error + Send + Sync + 'a>
Converts a type of Error + Send + Sync into a box of
dyn Error + Send + Sync.
§Examples
use std::error::Error;
use std::fmt;
#[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 == size_of_val(&an_error));
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(an_error);
assert!(
size_of::<Box<dyn Error + Send + Sync>>() == size_of_val(&a_boxed_error))Source§impl From<Error> for Box<dyn Error + Send + Sync>
Available on crate feature std or non-anyhow_no_core_error only.
impl From<Error> for Box<dyn Error + Send + Sync>
std or non-anyhow_no_core_error only.Source§impl From<Error> for Box<dyn Error + Send>
Available on crate feature std or non-anyhow_no_core_error only.
impl From<Error> for Box<dyn Error + Send>
std or non-anyhow_no_core_error only.Source§impl From<Error> for Box<dyn Error>
Available on crate feature std or non-anyhow_no_core_error only.
impl From<Error> for Box<dyn Error>
std or non-anyhow_no_core_error only.§impl<F> From<Pin<Box<F>>> for DnsResponseStream
impl<F> From<Pin<Box<F>>> for DnsResponseStream
§fn from(f: Pin<Box<F>>) -> DnsResponseStream
fn from(f: Pin<Box<F>>) -> DnsResponseStream
§impl From<Pin<Box<dyn Future<Output = Result<Result<DnsResponse, NetError>, Error>> + Send>>> for DnsResponseStream
impl From<Pin<Box<dyn Future<Output = Result<Result<DnsResponse, NetError>, Error>> + Send>>> for DnsResponseStream
1.0.0 · Source§impl<'a> From<String> for Box<dyn Error + Send + Sync + 'a>
Available on non-no_global_oom_handling only.
impl<'a> From<String> for Box<dyn Error + Send + Sync + 'a>
no_global_oom_handling only.1.6.0 · Source§impl<'a> From<String> for Box<dyn Error + 'a>
Available on non-no_global_oom_handling only.
impl<'a> From<String> for Box<dyn Error + 'a>
no_global_oom_handling only.§impl<T> From<T> for Box<dyn ShouldSample>where
T: ShouldSample + 'static,
impl<T> From<T> for Box<dyn ShouldSample>where
T: ShouldSample + 'static,
§fn from(value: T) -> Box<dyn ShouldSample>
fn from(value: T) -> Box<dyn ShouldSample>
1.20.0 · Source§impl<T, A> From<Vec<T, A>> for Box<[T], A>where
A: Allocator,
Available on non-no_global_oom_handling only.
impl<T, A> From<Vec<T, A>> for Box<[T], A>where
A: Allocator,
no_global_oom_handling only.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.45.0 · Source§impl<T, const N: usize> From<[T; N]> for Box<[T]>
Available on non-no_global_oom_handling only.
impl<T, const N: usize> From<[T; N]> for Box<[T]>
no_global_oom_handling only.1.80.0 · Source§impl<'a> FromIterator<&'a char> for Box<str>
Available on non-no_global_oom_handling only.
impl<'a> FromIterator<&'a char> for Box<str>
no_global_oom_handling only.1.80.0 · Source§impl<'a> FromIterator<&'a str> for Box<str>
Available on non-no_global_oom_handling only.
impl<'a> FromIterator<&'a str> for Box<str>
no_global_oom_handling only.1.80.0 · Source§impl<A> FromIterator<Box<str, A>> for Box<str>where
A: Allocator,
Available on non-no_global_oom_handling only.
impl<A> FromIterator<Box<str, A>> for Box<str>where
A: Allocator,
no_global_oom_handling only.1.45.0 · Source§impl<A> FromIterator<Box<str, A>> for Stringwhere
A: Allocator,
Available on non-no_global_oom_handling only.
impl<A> FromIterator<Box<str, A>> for Stringwhere
A: Allocator,
no_global_oom_handling only.1.80.0 · Source§impl<'a> FromIterator<Cow<'a, str>> for Box<str>
Available on non-no_global_oom_handling only.
impl<'a> FromIterator<Cow<'a, str>> for Box<str>
no_global_oom_handling only.1.32.0 · Source§impl<I> FromIterator<I> for Box<[I]>
Available on non-no_global_oom_handling only.
impl<I> FromIterator<I> for Box<[I]>
no_global_oom_handling only.§impl<'a> FromParallelIterator<&'a char> for Box<str>
Collects characters from a parallel iterator into a boxed string.
impl<'a> FromParallelIterator<&'a char> for Box<str>
Collects characters from a parallel iterator into a boxed string.
§impl<'a> FromParallelIterator<&'a str> for Box<str>
Collects string slices from a parallel iterator into a boxed string.
impl<'a> FromParallelIterator<&'a str> for Box<str>
Collects string slices from a parallel iterator into a boxed string.
§impl FromParallelIterator<Box<str>> for String
Collects boxed strings from a parallel iterator into a string.
impl FromParallelIterator<Box<str>> for String
Collects boxed strings from a parallel iterator into a string.
§impl FromParallelIterator<Box<str>> for Box<str>
Collects boxed strings from a parallel iterator into a boxed string.
impl FromParallelIterator<Box<str>> for Box<str>
Collects boxed strings from a parallel iterator into a boxed string.
§impl<'a> FromParallelIterator<Cow<'a, str>> for Box<str>
Collects string slices from a parallel iterator into a boxed string.
impl<'a> FromParallelIterator<Cow<'a, str>> for Box<str>
Collects string slices from a parallel iterator into a boxed string.
§impl FromParallelIterator<String> for Box<str>
Collects strings from a parallel iterator into a boxed string.
impl FromParallelIterator<String> for Box<str>
Collects strings from a parallel iterator into a boxed string.
§impl<T> FromParallelIterator<T> for Box<[T]>where
T: Send,
Collects items from a parallel iterator into a boxed slice.
impl<T> FromParallelIterator<T> for Box<[T]>where
T: Send,
Collects items from a parallel iterator into a boxed slice.
§fn from_par_iter<I>(par_iter: I) -> Box<[T]>where
I: IntoParallelIterator<Item = T>,
fn from_par_iter<I>(par_iter: I) -> Box<[T]>where
I: IntoParallelIterator<Item = T>,
par_iter. Read more§impl FromParallelIterator<char> for Box<str>
Collects characters from a parallel iterator into a boxed string.
impl FromParallelIterator<char> for Box<str>
Collects characters from a parallel iterator into a boxed string.
impl<T> FromStream<T> for Box<[T]>
§impl<F> FusedFuture for Box<F>
impl<F> FusedFuture for Box<F>
§fn is_terminated(&self) -> bool
fn is_terminated(&self) -> bool
true if the underlying future should no longer be polled.impl<I, A> FusedIterator for Box<I, A>
§impl<S> FusedStream for Box<S>
impl<S> FusedStream for Box<S>
§fn is_terminated(&self) -> bool
fn is_terminated(&self) -> bool
true if the stream should no longer be polled.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 IntoHtml for Box<str>
impl IntoHtml for Box<str>
§fn into_html(self) -> impl IntoHtml
fn into_html(self) -> impl IntoHtml
IntoHtml value. Used for
composition; leaf types should return self.§fn escape_and_write(self, buf: &mut String)
fn escape_and_write(self, buf: &mut String)
buf.§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
§fn into_string(self) -> Stringwhere
Self: Sized,
fn into_string(self) -> Stringwhere
Self: Sized,
String.1.99.0 · Source§impl<'a, T, const N: usize, A> IntoIterator for &'a Box<[T; N], A>where
A: Allocator,
impl<'a, T, const N: usize, A> IntoIterator for &'a Box<[T; N], A>where
A: Allocator,
1.99.0 · Source§impl<'a, T, const N: usize, A> IntoIterator for &'a mut Box<[T; N], A>where
A: Allocator,
impl<'a, T, const N: usize, A> IntoIterator for &'a mut Box<[T; N], A>where
A: Allocator,
§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>>
§impl<'data, T> IntoParallelIterator for &'data mut Box<[T]>where
T: Send,
impl<'data, T> IntoParallelIterator for &'data mut Box<[T]>where
T: Send,
§type Item = &'data mut T
type Item = &'data mut T
§fn into_par_iter(self) -> <&'data mut Box<[T]> as IntoParallelIterator>::Iter
fn into_par_iter(self) -> <&'data mut Box<[T]> as IntoParallelIterator>::Iter
self into a parallel iterator. Read more§impl IntoResponse for Box<dyn Error + Send + Sync>
impl IntoResponse for Box<dyn Error + Send + Sync>
§fn into_response(self) -> Response
fn into_response(self) -> Response
§impl IntoResponse for Box<str>
impl IntoResponse for Box<str>
§fn into_response(self) -> Response
fn into_response(self) -> Response
§impl IntoResponse for Box<[u8]>
impl IntoResponse for Box<[u8]>
§fn into_response(self) -> Response
fn into_response(self) -> Response
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>
nth 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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(self, separator: Self::Item) -> Intersperse<Self> ⓘ
fn intersperse(self, separator: Self::Item) -> Intersperse<Self> ⓘ
iter_intersperse)separator between items
of the original iterator. Read moreSource§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
iter_intersperse)separator
between items of the original iterator. Read more1.0.0 (const: unstable) · Source§fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
fn map<B, F>(self, f: F) -> Map<Self, F> ⓘ
1.21.0 (const: unstable) · Source§fn for_each<F>(self, f: F)
fn for_each<F>(self, f: F)
1.0.0 (const: unstable) · Source§fn filter<P>(self, predicate: P) -> Filter<Self, P> ⓘ
fn filter<P>(self, predicate: P) -> Filter<Self, P> ⓘ
1.0.0 (const: unstable) · 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 (const: unstable) · Source§fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
fn enumerate(self) -> Enumerate<Self> ⓘwhere
Self: Sized,
1.0.0 (const: unstable) · Source§fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> ⓘ
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> ⓘ
1.57.0 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · Source§fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> ⓘ
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> ⓘ
1.0.0 (const: unstable) · 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> ⓘ
1.29.0 (const: unstable) · Source§fn flatten(self) -> Flatten<Self> ⓘ
fn flatten(self) -> Flatten<Self> ⓘ
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 (const: unstable) · Source§fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
1.0.0 (const: unstable) · Source§fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
fn by_ref(&mut self) -> &mut Selfwhere
Self: Sized,
Iterator. Read more1.0.0 (const: unstable) · Source§fn collect<B>(self) -> B
fn collect<B>(self) -> B
Source§fn try_collect<B>(
&mut self,
) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType
fn try_collect<B>( &mut self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType
iterator_try_collect)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 (const: unstable) · Source§fn partition<B, F>(self, f: F) -> (B, B)
fn partition<B, F>(self, f: F) -> (B, B)
Source§fn partition_in_place<'a, T, P>(self, predicate: P) -> usize
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize
iter_partition_in_place)true precede all those that return false.
Returns the number of true elements found. Read moreSource§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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · Source§fn fold<B, F>(self, init: B, f: F) -> B
fn fold<B, F>(self, init: B, f: F) -> B
1.51.0 (const: unstable) · 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 (const: unstable) · Source§fn all<F>(&mut self, f: F) -> bool
fn all<F>(&mut self, f: F) -> bool
1.0.0 (const: unstable) · Source§fn any<F>(&mut self, f: F) -> bool
fn any<F>(&mut self, f: F) -> bool
1.0.0 (const: unstable) · Source§fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
1.30.0 (const: unstable) · 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 (const: unstable) · Source§fn position<P>(&mut self, predicate: P) -> Option<usize>
fn position<P>(&mut self, predicate: P) -> Option<usize>
1.0.0 (const: unstable) · Source§fn rposition<P>(&mut self, predicate: P) -> Option<usize>
fn rposition<P>(&mut self, predicate: P) -> Option<usize>
1.0.0 (const: unstable) · Source§fn max(self) -> Option<Self::Item>
fn max(self) -> Option<Self::Item>
1.0.0 (const: unstable) · Source§fn min(self) -> Option<Self::Item>
fn min(self) -> Option<Self::Item>
1.6.0 (const: unstable) · 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 (const: unstable) · Source§fn max_by<F>(self, compare: F) -> Option<Self::Item>
fn max_by<F>(self, compare: F) -> Option<Self::Item>
1.6.0 (const: unstable) · 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 (const: unstable) · Source§fn min_by<F>(self, compare: F) -> Option<Self::Item>
fn min_by<F>(self, compare: F) -> Option<Self::Item>
1.0.0 (const: unstable) · Source§fn rev(self) -> Rev<Self> ⓘwhere
Self: Sized + DoubleEndedIterator,
fn rev(self) -> Rev<Self> ⓘwhere
Self: Sized + DoubleEndedIterator,
1.0.0 (const: unstable) · Source§fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
1.36.0 (const: unstable) · Source§fn copied<'a, T>(self) -> Copied<Self> ⓘ
fn copied<'a, T>(self) -> Copied<Self> ⓘ
1.0.0 (const: unstable) · Source§fn cycle(self) -> Cycle<Self> ⓘ
fn cycle(self) -> Cycle<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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · 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 (const: unstable) · Source§fn is_sorted(self) -> bool
fn is_sorted(self) -> bool
1.82.0 (const: unstable) · Source§fn is_sorted_by<F>(self, compare: F) -> bool
fn is_sorted_by<F>(self, compare: F) -> bool
§impl JsonWritable for Box<str>
impl JsonWritable for Box<str>
§impl<L, S> Layer<S> for Box<L>where
L: Layer<S>,
S: Subscriber,
Available on crate features alloc or std only.
impl<L, S> Layer<S> for Box<L>where
L: Layer<S>,
S: Subscriber,
alloc or std only.§fn on_register_dispatch(&self, subscriber: &Dispatch)
fn on_register_dispatch(&self, subscriber: &Dispatch)
Subscriber. Read more§fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)
fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)
Attributes and Id.§fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
Subscriber::register_callsite. Read more§fn enabled(&self, metadata: &Metadata<'_>, ctx: Context<'_, S>) -> bool
fn enabled(&self, metadata: &Metadata<'_>, ctx: Context<'_, S>) -> bool
true if this layer is interested in a span or event with the
given metadata in the current [Context], similarly to
Subscriber::enabled. Read more§fn on_record(&self, span: &Id, values: &Record<'_>, ctx: Context<'_, S>)
fn on_record(&self, span: &Id, values: &Record<'_>, ctx: Context<'_, S>)
Id recorded the given
values.§fn on_follows_from(&self, span: &Id, follows: &Id, ctx: Context<'_, S>)
fn on_follows_from(&self, span: &Id, follows: &Id, ctx: Context<'_, S>)
span recorded that it
follows from the span with the ID follows.§fn event_enabled(&self, event: &Event<'_>, ctx: Context<'_, S>) -> bool
fn event_enabled(&self, event: &Event<'_>, ctx: Context<'_, S>) -> bool
§fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)
fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)
§fn on_enter(&self, id: &Id, ctx: Context<'_, S>)
fn on_enter(&self, id: &Id, ctx: Context<'_, S>)
§fn on_exit(&self, id: &Id, ctx: Context<'_, S>)
fn on_exit(&self, id: &Id, ctx: Context<'_, S>)
§fn on_close(&self, id: Id, ctx: Context<'_, S>)
fn on_close(&self, id: Id, ctx: Context<'_, S>)
§fn on_id_change(&self, old: &Id, new: &Id, ctx: Context<'_, S>)
fn on_id_change(&self, old: &Id, new: &Id, ctx: Context<'_, S>)
§fn and_then<L>(self, layer: L) -> Layered<L, Self, S>where
L: Layer<S>,
Self: Sized,
fn and_then<L>(self, layer: L) -> Layered<L, Self, S>where
L: Layer<S>,
Self: Sized,
Layer, returning a Layered
struct implementing Layer. Read more§fn with_subscriber(self, inner: S) -> Layered<Self, S>where
Self: Sized,
fn with_subscriber(self, inner: S) -> Layered<Self, S>where
Self: Sized,
Layer with the given Subscriber, returning a
Layered struct that implements Subscriber. Read more§fn with_filter<F>(self, filter: F) -> Filtered<Self, F, S>where
Self: Sized,
F: Filter<S>,
fn with_filter<F>(self, filter: F) -> Filtered<Self, F, S>where
Self: Sized,
F: Filter<S>,
registry and std only.§impl<S> Layer<S> for Box<dyn Layer<S> + Send + Sync>where
S: Subscriber,
Available on crate features alloc or std only.
impl<S> Layer<S> for Box<dyn Layer<S> + Send + Sync>where
S: Subscriber,
alloc or std only.§fn on_register_dispatch(&self, subscriber: &Dispatch)
fn on_register_dispatch(&self, subscriber: &Dispatch)
Subscriber. Read more§fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)
fn on_new_span(&self, attrs: &Attributes<'_>, id: &Id, ctx: Context<'_, S>)
Attributes and Id.§fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
Subscriber::register_callsite. Read more§fn enabled(&self, metadata: &Metadata<'_>, ctx: Context<'_, S>) -> bool
fn enabled(&self, metadata: &Metadata<'_>, ctx: Context<'_, S>) -> bool
true if this layer is interested in a span or event with the
given metadata in the current [Context], similarly to
Subscriber::enabled. Read more§fn on_record(&self, span: &Id, values: &Record<'_>, ctx: Context<'_, S>)
fn on_record(&self, span: &Id, values: &Record<'_>, ctx: Context<'_, S>)
Id recorded the given
values.§fn on_follows_from(&self, span: &Id, follows: &Id, ctx: Context<'_, S>)
fn on_follows_from(&self, span: &Id, follows: &Id, ctx: Context<'_, S>)
span recorded that it
follows from the span with the ID follows.§fn event_enabled(&self, event: &Event<'_>, ctx: Context<'_, S>) -> bool
fn event_enabled(&self, event: &Event<'_>, ctx: Context<'_, S>) -> bool
§fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)
fn on_event(&self, event: &Event<'_>, ctx: Context<'_, S>)
§fn on_enter(&self, id: &Id, ctx: Context<'_, S>)
fn on_enter(&self, id: &Id, ctx: Context<'_, S>)
§fn on_exit(&self, id: &Id, ctx: Context<'_, S>)
fn on_exit(&self, id: &Id, ctx: Context<'_, S>)
§fn on_close(&self, id: Id, ctx: Context<'_, S>)
fn on_close(&self, id: Id, ctx: Context<'_, S>)
§fn on_id_change(&self, old: &Id, new: &Id, ctx: Context<'_, S>)
fn on_id_change(&self, old: &Id, new: &Id, ctx: Context<'_, S>)
§fn and_then<L>(self, layer: L) -> Layered<L, Self, S>where
L: Layer<S>,
Self: Sized,
fn and_then<L>(self, layer: L) -> Layered<L, Self, S>where
L: Layer<S>,
Self: Sized,
Layer, returning a Layered
struct implementing Layer. Read more§fn with_subscriber(self, inner: S) -> Layered<Self, S>where
Self: Sized,
fn with_subscriber(self, inner: S) -> Layered<Self, S>where
Self: Sized,
Layer with the given Subscriber, returning a
Layered struct that implements Subscriber. Read more§fn with_filter<F>(self, filter: F) -> Filtered<Self, F, S>where
Self: Sized,
F: Filter<S>,
fn with_filter<F>(self, filter: F) -> Filtered<Self, F, S>where
Self: Sized,
F: Filter<S>,
registry and std only.impl Lift for Box<str>
impl<T> Lift for Box<[T]>where
T: Lift,
§impl<Sp> LocalSpawn for Box<Sp>where
Sp: LocalSpawn + ?Sized,
impl<Sp> LocalSpawn for Box<Sp>where
Sp: LocalSpawn + ?Sized,
§fn spawn_local_obj(
&self,
future: LocalFutureObj<'static, ()>,
) -> Result<(), SpawnError>
fn spawn_local_obj( &self, future: LocalFutureObj<'static, ()>, ) -> Result<(), SpawnError>
§fn status_local(&self) -> Result<(), SpawnError>
fn status_local(&self) -> Result<(), SpawnError>
impl<T> Lower for Box<T>where
T: Lower + ?Sized,
§impl<Input, T> Matcher<Input> for Box<T>where
T: Matcher<Input>,
impl<Input, T> Matcher<Input> for Box<T>where
T: Matcher<Input>,
§fn matches(&self, ext: Option<&Extensions>, input: &Input) -> bool
fn matches(&self, ext: Option<&Extensions>, input: &Input) -> bool
§fn or<M>(self, other: M) -> impl Matcher<Input>
fn or<M>(self, other: M) -> impl Matcher<Input>
§impl<Input> Matcher<Input> for Box<dyn Matcher<Input>>where
Input: Send + 'static,
impl<Input> Matcher<Input> for Box<dyn Matcher<Input>>where
Input: Send + 'static,
§fn matches(&self, ext: Option<&Extensions>, input: &Input) -> bool
fn matches(&self, ext: Option<&Extensions>, input: &Input) -> bool
§fn or<M>(self, other: M) -> impl Matcher<Input>
fn or<M>(self, other: M) -> impl Matcher<Input>
Source§impl<M> Message for Box<M>where
M: Message,
impl<M> Message for Box<M>where
M: Message,
Source§fn encoded_len(&self) -> usize
fn encoded_len(&self) -> usize
Source§fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>where
Self: Sized,
fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>where
Self: Sized,
Source§fn encode_to_vec(&self) -> Vec<u8> ⓘwhere
Self: Sized,
fn encode_to_vec(&self) -> Vec<u8> ⓘwhere
Self: Sized,
Source§fn encode_length_delimited(
&self,
buf: &mut impl BufMut,
) -> Result<(), EncodeError>where
Self: Sized,
fn encode_length_delimited(
&self,
buf: &mut impl BufMut,
) -> Result<(), EncodeError>where
Self: Sized,
Source§fn encode_length_delimited_to_vec(&self) -> Vec<u8> ⓘwhere
Self: Sized,
fn encode_length_delimited_to_vec(&self) -> Vec<u8> ⓘwhere
Self: Sized,
Source§fn decode(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
fn decode(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
Source§fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
Source§fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
self. Read moreSource§fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
self.§impl<T> MetricValue for Box<T>where
T: MetricValue,
impl<T> MetricValue for Box<T>where
T: MetricValue,
§fn with_unit<U>(self) -> WithUnit<Self, U>where
U: UnitTag,
Self: Sized,
Self::Unit: Convert<U>,
fn with_unit<U>(self) -> WithUnit<Self, U>where
U: UnitTag,
Self: Sized,
Self::Unit: Convert<U>,
Unit] when being written.1.0.0 · Source§impl<T, A> Ord for Box<T, A>
impl<T, A> Ord for Box<T, A>
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
§impl ParallelExtend<Box<str>> for String
Extends a string with boxed strings from a parallel iterator.
impl ParallelExtend<Box<str>> for String
Extends a string with boxed strings from a parallel iterator.
§fn par_extend<I>(&mut self, par_iter: I)
fn par_extend<I>(&mut self, par_iter: I)
par_iter. Read more§impl<I, O, E> Parser<I, O, E> for Box<dyn Parser<I, O, E> + '_>
Available on crate feature alloc only.
impl<I, O, E> Parser<I, O, E> for Box<dyn Parser<I, O, E> + '_>
alloc only.§fn parse_next(&mut self, i: &mut I) -> Result<O, E>
fn parse_next(&mut self, i: &mut I) -> Result<O, E>
Stream], turning it into the output Read more§fn parse(
&mut self,
input: I,
) -> Result<O, ParseError<I, <E as ParserError<I>>::Inner>>where
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
fn parse(
&mut self,
input: I,
) -> Result<O, ParseError<I, <E as ParserError<I>>::Inner>>where
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
§fn parse_iter(&mut self, input: I) -> ParseIter<'_, Self, I, O, E> ⓘwhere
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
fn parse_iter(&mut self, input: I) -> ParseIter<'_, Self, I, O, E> ⓘwhere
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
§fn parse_peek(&mut self, input: I) -> Result<(I, O), E>
fn parse_peek(&mut self, input: I) -> Result<(I, O), E>
Stream], turning it into the output Read more§fn by_ref(&mut self) -> ByRef<'_, Self, I, O, E>where
Self: Sized,
fn by_ref(&mut self) -> ByRef<'_, Self, I, O, E>where
Self: Sized,
&mut Self as a parser Read more§fn default_value<O2>(self) -> DefaultValue<Self, I, O, O2, E>
fn default_value<O2>(self) -> DefaultValue<Self, I, O, O2, E>
§fn output_into<O2>(self) -> OutputInto<Self, I, O, O2, E>
fn output_into<O2>(self) -> OutputInto<Self, I, O, O2, E>
std::convert::From Read more§fn take(self) -> Take<Self, I, O, E>where
Self: Sized,
I: Stream,
fn take(self) -> Take<Self, I, O, E>where
Self: Sized,
I: Stream,
§fn with_taken(self) -> WithTaken<Self, I, O, E>where
Self: Sized,
I: Stream,
fn with_taken(self) -> WithTaken<Self, I, O, E>where
Self: Sized,
I: Stream,
§fn span(self) -> Span<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
fn span(self) -> Span<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
§fn with_span(self) -> WithSpan<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
fn with_span(self) -> WithSpan<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
§fn map<G, O2>(self, map: G) -> Map<Self, G, I, O, O2, E>
fn map<G, O2>(self, map: G) -> Map<Self, G, I, O, O2, E>
§fn try_map<G, O2, E2>(self, map: G) -> TryMap<Self, G, I, O, O2, E, E2>
fn try_map<G, O2, E2>(self, map: G) -> TryMap<Self, G, I, O, O2, E, E2>
Result over the output of a parser. Read more§fn verify_map<G, O2>(self, map: G) -> VerifyMap<Self, G, I, O, O2, E>
fn verify_map<G, O2>(self, map: G) -> VerifyMap<Self, G, I, O, O2, E>
§fn flat_map<G, H, O2>(self, map: G) -> FlatMap<Self, G, H, I, O, O2, E>
fn flat_map<G, H, O2>(self, map: G) -> FlatMap<Self, G, H, I, O, O2, E>
§fn and_then<G, O2>(self, inner: G) -> AndThen<Self, G, I, O, O2, E>where
Self: Sized,
G: Parser<O, O2, E>,
O: StreamIsPartial,
I: Stream,
fn and_then<G, O2>(self, inner: G) -> AndThen<Self, G, I, O, O2, E>where
Self: Sized,
G: Parser<O, O2, E>,
O: StreamIsPartial,
I: Stream,
§fn parse_to<O2>(self) -> ParseTo<Self, I, O, O2, E>where
Self: Sized,
I: Stream,
O: ParseSlice<O2>,
E: ParserError<I>,
fn parse_to<O2>(self) -> ParseTo<Self, I, O, O2, E>where
Self: Sized,
I: Stream,
O: ParseSlice<O2>,
E: ParserError<I>,
std::str::FromStr to the output of the parser Read more§fn verify<G, O2>(self, filter: G) -> Verify<Self, G, I, O, O2, E>
fn verify<G, O2>(self, filter: G) -> Verify<Self, G, I, O, O2, E>
§fn context<C>(self, context: C) -> Context<Self, I, O, E, C>
fn context<C>(self, context: C) -> Context<Self, I, O, E, C>
§fn context_with<F, C, FI>(
self,
context: F,
) -> ContextWith<Self, I, O, E, F, C, FI>
fn context_with<F, C, FI>( self, context: F, ) -> ContextWith<Self, I, O, E, F, C, FI>
§fn map_err<G, E2>(self, map: G) -> MapErr<Self, G, I, O, E, E2>
fn map_err<G, E2>(self, map: G) -> MapErr<Self, G, I, O, E, E2>
§fn complete_err(self) -> CompleteErr<Self, I, O, E>where
Self: Sized,
fn complete_err(self) -> CompleteErr<Self, I, O, E>where
Self: Sized,
Incomplete][crate::error::ErrMode::Incomplete] into [Backtrack][crate::error::ErrMode::Backtrack] Read more§fn err_into<E2>(self) -> ErrInto<Self, I, O, E, E2>
fn err_into<E2>(self) -> ErrInto<Self, I, O, E, E2>
std::convert::From§impl<'a, I, O, E> Parser<I, O, E> for Box<dyn Parser<I, O, E> + 'a>
Available on crate feature alloc only.
impl<'a, I, O, E> Parser<I, O, E> for Box<dyn Parser<I, O, E> + 'a>
alloc only.§fn parse(&mut self, input: I) -> Result<(I, O), Err<E>>
fn parse(&mut self, input: I) -> Result<(I, O), Err<E>>
Result containing
either the remaining input and the output value, or an error§fn flat_map<G, H, O2>(self, g: G) -> FlatMap<Self, G, O>
fn flat_map<G, H, O2>(self, g: G) -> FlatMap<Self, G, O>
§fn and_then<G, O2>(self, g: G) -> AndThen<Self, G, O>
fn and_then<G, O2>(self, g: G) -> AndThen<Self, G, O>
§fn and<G, O2>(self, g: G) -> And<Self, G>
fn and<G, O2>(self, g: G) -> And<Self, G>
1.0.0 · Source§impl<T, A> PartialOrd for Box<T, A>
impl<T, A> PartialOrd for Box<T, A>
impl<T, A> PinSafePointer for Box<T, A>
§impl<B, E, P> Policy<B, E> for Box<P>
impl<B, E, P> Policy<B, E> for Box<P>
§fn redirect(&mut self, attempt: &Attempt<'_>) -> Result<Action, E>
fn redirect(&mut self, attempt: &Attempt<'_>) -> Result<Action, E>
3xx). Read more§fn on_request(&mut self, request: &mut Request<B>)
fn on_request(&mut self, request: &mut Request<B>)
§fn clone_body(&mut self, body: &B) -> Option<B>
fn clone_body(&mut self, body: &B) -> Option<B>
§impl<Input, P> Policy<Input> for Box<P>
impl<Input, P> Policy<Input> for Box<P>
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<'_, u8>) -> Result<(), Error>
fn read_buf(&mut self, cursor: BorrowedCursor<'_, u8>) -> 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<'_, u8>,
) -> Result<(), Error>
fn read_buf_exact( &mut self, cursor: BorrowedCursor<'_, u8>, ) -> 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 more1.0.0 · Source§fn chain<R>(self, next: R) -> Chain<Self, R> ⓘ
fn chain<R>(self, next: R) -> Chain<Self, R> ⓘ
1.0.0 · Source§fn take(self, limit: u64) -> Take<Self> ⓘwhere
Self: Sized,
fn take(self, limit: u64) -> Take<Self> ⓘwhere
Self: Sized,
limit bytes from it. Read moreSource§fn read_array<const N: usize>(&mut self) -> Result<[u8; N], Error>where
Self: Sized,
fn read_array<const N: usize>(&mut self) -> Result<[u8; N], Error>where
Self: Sized,
read_array)§impl<T> Recorder for Box<T>where
T: Recorder + ?Sized,
impl<T> Recorder for Box<T>where
T: Recorder + ?Sized,
§fn describe_counter(
&self,
key: KeyName,
unit: Option<Unit>,
description: Cow<'static, str>,
)
fn describe_counter( &self, key: KeyName, unit: Option<Unit>, description: Cow<'static, str>, )
§fn describe_gauge(
&self,
key: KeyName,
unit: Option<Unit>,
description: Cow<'static, str>,
)
fn describe_gauge( &self, key: KeyName, unit: Option<Unit>, description: Cow<'static, str>, )
§fn describe_histogram(
&self,
key: KeyName,
unit: Option<Unit>,
description: Cow<'static, str>,
)
fn describe_histogram( &self, key: KeyName, unit: Option<Unit>, description: Cow<'static, str>, )
§fn register_counter(&self, key: &Key, metadata: &Metadata<'_>) -> Counter
fn register_counter(&self, key: &Key, metadata: &Metadata<'_>) -> Counter
§fn register_gauge(&self, key: &Key, metadata: &Metadata<'_>) -> Gauge
fn register_gauge(&self, key: &Key, metadata: &Metadata<'_>) -> Gauge
§fn register_histogram(&self, key: &Key, metadata: &Metadata<'_>) -> Histogram
fn register_histogram(&self, key: &Key, metadata: &Metadata<'_>) -> Histogram
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_len(&mut self) -> Result<u64, Error>
fn stream_len(&mut self) -> Result<u64, Error>
seek_stream_len)Source§impl<T> Serialize for Box<T>
Available on crate features alloc or std only.
impl<T> Serialize for Box<T>
alloc or std only.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,
§impl<S, Input> Service<Input> for Box<S>where
S: Service<Input>,
impl<S, Input> Service<Input> for Box<S>where
S: Service<Input>,
§fn serve(
&self,
input: Input,
) -> impl Future<Output = Result<<Box<S> as Service<Input>>::Output, <Box<S> as Service<Input>>::Error>> + Send
fn serve( &self, input: Input, ) -> impl Future<Output = Result<<Box<S> as Service<Input>>::Output, <Box<S> as Service<Input>>::Error>> + Send
§fn boxed(self) -> BoxService<Input, Self::Output, Self::Error>
fn boxed(self) -> BoxService<Input, Self::Output, Self::Error>
§impl<S, Request> Service<Request> for Box<S>
impl<S, Request> Service<Request> for Box<S>
§impl<S, Item> Sink<Item> for Box<S>
impl<S, Item> Sink<Item> for Box<S>
§fn poll_ready(
self: Pin<&mut Box<S>>,
cx: &mut Context<'_>,
) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
fn poll_ready( self: Pin<&mut Box<S>>, cx: &mut Context<'_>, ) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
Sink to receive a value. Read more§fn start_send(
self: Pin<&mut Box<S>>,
item: Item,
) -> Result<(), <Box<S> as Sink<Item>>::Error>
fn start_send( self: Pin<&mut Box<S>>, item: Item, ) -> Result<(), <Box<S> as Sink<Item>>::Error>
poll_ready which returned Poll::Ready(Ok(())). Read more§impl<T> Source for Box<T>where
T: Source + ?Sized,
impl<T> Source for Box<T>where
T: Source + ?Sized,
§impl<S> Stream for Box<S>
impl<S> Stream for Box<S>
§impl<S> Subscriber for Box<S>where
S: Subscriber + ?Sized,
impl<S> Subscriber for Box<S>where
S: Subscriber + ?Sized,
§fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
§fn max_level_hint(&self) -> Option<LevelFilter>
fn max_level_hint(&self) -> Option<LevelFilter>
Subscriber will
enable, or None, if the subscriber does not implement level-based
filtering or chooses not to implement this method. Read more§fn new_span(&self, span: &Attributes<'_>) -> Id
fn new_span(&self, span: &Attributes<'_>) -> Id
§fn record_follows_from(&self, span: &Id, follows: &Id)
fn record_follows_from(&self, span: &Id, follows: &Id)
§fn event_enabled(&self, event: &Event<'_>) -> bool
fn event_enabled(&self, event: &Event<'_>) -> bool
§fn clone_span(&self, id: &Id) -> Id
fn clone_span(&self, id: &Id) -> Id
§fn drop_span(&self, id: Id)
fn drop_span(&self, id: Id)
use Subscriber::try_close instead
§fn current_span(&self) -> Current
fn current_span(&self) -> Current
§unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>
unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>
self is the same type as the provided TypeId, returns an untyped
*const pointer to that type. Otherwise, returns None. Read more§fn on_register_dispatch(&self, subscriber: &Dispatch)
fn on_register_dispatch(&self, subscriber: &Dispatch)
Source§impl<T> ToTokens for Box<T>
impl<T> ToTokens for Box<T>
Source§fn to_tokens(&self, tokens: &mut TokenStream)
fn to_tokens(&self, tokens: &mut TokenStream)
proc_macro_totokens)Source§fn to_token_stream(&self) -> TokenStream
fn to_token_stream(&self) -> TokenStream
proc_macro_totokens)Source§fn into_token_stream(self) -> TokenStreamwhere
Self: Sized,
fn into_token_stream(self) -> TokenStreamwhere
Self: Sized,
proc_macro_totokens)Source§impl<T> ToTokens for Box<T>
impl<T> ToTokens for Box<T>
Source§fn to_tokens(&self, tokens: &mut TokenStream)
fn to_tokens(&self, tokens: &mut TokenStream)
Source§fn to_token_stream(&self) -> TokenStream
fn to_token_stream(&self) -> TokenStream
Source§fn into_token_stream(self) -> TokenStreamwhere
Self: Sized,
fn into_token_stream(self) -> TokenStreamwhere
Self: Sized,
§impl<W> TraceWriter for Box<W>where
W: TraceWriter + ?Sized,
impl<W> TraceWriter for Box<W>where
W: TraceWriter + ?Sized,
§fn take_rotated(&mut self) -> bool
fn take_rotated(&mut self) -> bool
§fn finalize(&mut self) -> Result<(), Error>
fn finalize(&mut self) -> Result<(), Error>
.active → .bin, and prevent
further writes. This is a terminal operation — the writer becomes
inert afterward.§fn write_encoded_batch(&mut self, batch: &Batch) -> Result<(), Error>
fn write_encoded_batch(&mut self, batch: &Batch) -> Result<(), Error>
§fn segment_metadata(&self) -> &[(String, String)]
fn segment_metadata(&self) -> &[(String, String)]
§fn update_segment_metadata(&mut self, entries: Vec<(String, String)>)
fn update_segment_metadata(&mut self, entries: Vec<(String, String)>)
§fn write_current_segment_metadata(&mut self) -> Result<(), Error>
fn write_current_segment_metadata(&mut self) -> Result<(), Error>
SegmentMetadataEvent into the current segment. Called before
finalize so that single-segment traces contain runtime→worker mappings.
Default is a no-op.§fn should_drain(&self) -> bool
fn should_drain(&self) -> bool
true when the flush loop should drain all thread-local
buffers before the next step. For RotatingWriter this fires when the
rotation period has elapsed since the last rotation or when a periodic
drain interval elapses (whichever comes first). Default returns false.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]>
Available on non-no_global_oom_handling only.
impl<T, const N: usize> TryFrom<Vec<T>> for Box<[T; N]>
no_global_oom_handling only.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<T, A> Unpin for Box<T, A>
§impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>where
F: Future<Output = T> + 'a,
impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>where
F: Future<Output = T> + 'a,
§impl<'a, T> UnsafeFutureObj<'a, T> for Box<dyn Future<Output = T> + 'a>where
T: 'a,
impl<'a, T> UnsafeFutureObj<'a, T> for Box<dyn Future<Output = T> + 'a>where
T: 'a,
§impl<'a, T> UnsafeFutureObj<'a, T> for Box<dyn Future<Output = T> + Send + 'a>where
T: 'a,
impl<'a, T> UnsafeFutureObj<'a, T> for Box<dyn Future<Output = T> + Send + 'a>where
T: 'a,
§impl<'a, T, F> UnsafeFutureObj<'a, T> for Pin<Box<F>>where
F: Future<Output = T> + 'a,
impl<'a, T, F> UnsafeFutureObj<'a, T> for Pin<Box<F>>where
F: Future<Output = T> + 'a,
§impl<'a, T> UnsafeFutureObj<'a, T> for Pin<Box<dyn Future<Output = T> + 'a>>where
T: 'a,
impl<'a, T> UnsafeFutureObj<'a, T> for Pin<Box<dyn Future<Output = T> + 'a>>where
T: 'a,
§impl UriMatchReplace for Box<dyn UriMatchReplace>
impl UriMatchReplace for Box<dyn UriMatchReplace>
§fn match_replace_uri<'a>(
&self,
uri: Cow<'a, Uri>,
) -> Result<Cow<'a, Uri>, UriMatchError<'a>>
fn match_replace_uri<'a>( &self, uri: Cow<'a, Uri>, ) -> Result<Cow<'a, Uri>, UriMatchError<'a>>
uri against the rule’s pattern and, on success,
returns the same Uri or a new reformatted Uri. Read more§impl<P> UserAgentProvider for Box<P>where
P: UserAgentProvider,
impl<P> UserAgentProvider for Box<P>where
P: UserAgentProvider,
§fn select_user_agent_profile(
&self,
extensions: &Extensions,
) -> Option<&UserAgentProfile>
fn select_user_agent_profile( &self, extensions: &Extensions, ) -> Option<&UserAgentProfile>
§impl<T> Value for Box<T>where
T: Value,
impl<T> Value for Box<T>where
T: Value,
§const SHAPE: FieldShape<'static> = T::SHAPE
const SHAPE: FieldShape<'static> = T::SHAPE
metrique_require_explicit_impls only.§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 simd_visitor(
&mut self,
) -> Option<&mut dyn VisitSimdOperator<'a, Output = <V as VisitOperator<'a>>::Output>>
fn simd_visitor( &mut self, ) -> Option<&mut dyn VisitSimdOperator<'a, Output = <V as VisitOperator<'a>>::Output>>
simd only.VisitSimdOperator] visitor. Read morefn 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_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_drop(&mut self) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_select(&mut self) -> <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_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_ref_eq(&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_struct_new_desc( &mut self, struct_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_struct_new_default_desc( &mut self, struct_type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_get_desc( &mut self, type_index: u32, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_cast_desc_eq_non_null( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_ref_cast_desc_eq_nullable( &mut self, hty: HeapType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_br_on_cast_desc_eq( &mut self, relative_depth: u32, from_ref_type: RefType, to_ref_type: RefType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_br_on_cast_desc_eq_fail( &mut self, relative_depth: u32, from_ref_type: RefType, to_ref_type: RefType, ) -> <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_typed_select( &mut self, ty: ValType, ) -> <Box<V> as VisitOperator<'a>>::Output
fn visit_typed_select_multi( &mut self, tys: Vec<ValType>, ) -> <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_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_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_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_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_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_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_resume_throw_ref( &mut self, cont_type_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<'a, V> VisitSimdOperator<'a> for Box<V>where
V: VisitSimdOperator<'a> + ?Sized,
Available on crate feature simd only.
impl<'a, V> VisitSimdOperator<'a> for Box<V>where
V: VisitSimdOperator<'a> + ?Sized,
simd only.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
§impl VisitValueNaive for Box<str>
impl VisitValueNaive for Box<str>
§fn visit_value<V>(&self, visitor: V) -> <V as Visitor>::Resultwhere
V: Visitor,
fn visit_value<V>(&self, visitor: V) -> <V as Visitor>::Resultwhere
V: Visitor,
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_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>
fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>
write_all_vectored)§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<Z> ZeroizeOnDrop for Box<[Z]>where
Z: ZeroizeOnDrop,
alloc only.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> UnsafeUnpin for Box<T, A>where
A: UnsafeUnpin,
T: ?Sized,
impl<T, A> UnwindSafe for Box<T, A>
Blanket Implementations§
§impl<T, A, P> Access<T> for P
impl<T, A, P> Access<T> for P
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
§impl<R> AsyncBufReadExt for Rwhere
R: AsyncBufRead + ?Sized,
impl<R> AsyncBufReadExt for Rwhere
R: AsyncBufRead + ?Sized,
§fn read_until<'a>(
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>,
) -> ReadUntil<'a, Self>where
Self: Unpin,
fn read_until<'a>(
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>,
) -> ReadUntil<'a, Self>where
Self: Unpin,
§fn read_line<'a>(&'a mut self, buf: &'a mut String) -> ReadLine<'a, Self>where
Self: Unpin,
fn read_line<'a>(&'a mut self, buf: &'a mut String) -> ReadLine<'a, Self>where
Self: Unpin,
§fn split(self, byte: u8) -> Split<Self>
fn split(self, byte: u8) -> Split<Self>
byte. Read more§fn fill_buf(&mut self) -> FillBuf<'_, Self>where
Self: Unpin,
fn fill_buf(&mut self) -> FillBuf<'_, Self>where
Self: Unpin,
§fn lines(self) -> Lines<Self>where
Self: Sized,
fn lines(self) -> Lines<Self>where
Self: Sized,
BufRead::lines. Read more§impl<R> AsyncBufReadExt for Rwhere
R: AsyncBufRead + ?Sized,
impl<R> AsyncBufReadExt for Rwhere
R: AsyncBufRead + ?Sized,
§fn fill_buf(&mut self) -> FillBuf<'_, Self> ⓘwhere
Self: Unpin,
fn fill_buf(&mut self) -> FillBuf<'_, Self> ⓘwhere
Self: Unpin,
§fn consume_unpin(&mut self, amt: usize)where
Self: Unpin,
fn consume_unpin(&mut self, amt: usize)where
Self: Unpin,
§fn read_until<'a>(
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>,
) -> ReadUntil<'a, Self> ⓘwhere
Self: Unpin,
fn read_until<'a>(
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>,
) -> ReadUntil<'a, Self> ⓘwhere
Self: Unpin,
buf until the delimiter byte or EOF is reached.
This method is the async equivalent to BufRead::read_until. Read more§fn read_line<'a>(&'a mut self, buf: &'a mut String) -> ReadLine<'a, Self> ⓘwhere
Self: Unpin,
fn read_line<'a>(&'a mut self, buf: &'a mut String) -> ReadLine<'a, Self> ⓘwhere
Self: Unpin,
buf until a newline (the 0xA byte) or EOF is reached,
This method is the async equivalent to BufRead::read_line. Read more§impl<R> AsyncReadExt for Rwhere
R: AsyncRead + ?Sized,
impl<R> AsyncReadExt for Rwhere
R: AsyncRead + ?Sized,
§fn read<'a>(&'a mut self, buf: &'a mut [u8]) -> Read<'a, Self>where
Self: Unpin,
fn read<'a>(&'a mut self, buf: &'a mut [u8]) -> Read<'a, Self>where
Self: Unpin,
§fn read_buf<'a, B>(&'a mut self, buf: &'a mut B) -> ReadBuf<'a, Self, B>
fn read_buf<'a, B>(&'a mut self, buf: &'a mut B) -> ReadBuf<'a, Self, B>
§fn read_exact<'a>(&'a mut self, buf: &'a mut [u8]) -> ReadExact<'a, Self>where
Self: Unpin,
fn read_exact<'a>(&'a mut self, buf: &'a mut [u8]) -> ReadExact<'a, Self>where
Self: Unpin,
buf. Read more§fn read_u8(&mut self) -> ReadU8<&mut Self>where
Self: Unpin,
fn read_u8(&mut self) -> ReadU8<&mut Self>where
Self: Unpin,
§fn read_i8(&mut self) -> ReadI8<&mut Self>where
Self: Unpin,
fn read_i8(&mut self) -> ReadI8<&mut Self>where
Self: Unpin,
§fn read_u16(&mut self) -> ReadU16<&mut Self>where
Self: Unpin,
fn read_u16(&mut self) -> ReadU16<&mut Self>where
Self: Unpin,
§fn read_i16(&mut self) -> ReadI16<&mut Self>where
Self: Unpin,
fn read_i16(&mut self) -> ReadI16<&mut Self>where
Self: Unpin,
§fn read_u32(&mut self) -> ReadU32<&mut Self>where
Self: Unpin,
fn read_u32(&mut self) -> ReadU32<&mut Self>where
Self: Unpin,
§fn read_i32(&mut self) -> ReadI32<&mut Self>where
Self: Unpin,
fn read_i32(&mut self) -> ReadI32<&mut Self>where
Self: Unpin,
§fn read_u64(&mut self) -> ReadU64<&mut Self>where
Self: Unpin,
fn read_u64(&mut self) -> ReadU64<&mut Self>where
Self: Unpin,
§fn read_i64(&mut self) -> ReadI64<&mut Self>where
Self: Unpin,
fn read_i64(&mut self) -> ReadI64<&mut Self>where
Self: Unpin,
§fn read_u128(&mut self) -> ReadU128<&mut Self>where
Self: Unpin,
fn read_u128(&mut self) -> ReadU128<&mut Self>where
Self: Unpin,
§fn read_i128(&mut self) -> ReadI128<&mut Self>where
Self: Unpin,
fn read_i128(&mut self) -> ReadI128<&mut Self>where
Self: Unpin,
§fn read_f32(&mut self) -> ReadF32<&mut Self>where
Self: Unpin,
fn read_f32(&mut self) -> ReadF32<&mut Self>where
Self: Unpin,
§fn read_f64(&mut self) -> ReadF64<&mut Self>where
Self: Unpin,
fn read_f64(&mut self) -> ReadF64<&mut Self>where
Self: Unpin,
§fn read_u16_le(&mut self) -> ReadU16Le<&mut Self>where
Self: Unpin,
fn read_u16_le(&mut self) -> ReadU16Le<&mut Self>where
Self: Unpin,
§fn read_i16_le(&mut self) -> ReadI16Le<&mut Self>where
Self: Unpin,
fn read_i16_le(&mut self) -> ReadI16Le<&mut Self>where
Self: Unpin,
§fn read_u32_le(&mut self) -> ReadU32Le<&mut Self>where
Self: Unpin,
fn read_u32_le(&mut self) -> ReadU32Le<&mut Self>where
Self: Unpin,
§fn read_i32_le(&mut self) -> ReadI32Le<&mut Self>where
Self: Unpin,
fn read_i32_le(&mut self) -> ReadI32Le<&mut Self>where
Self: Unpin,
§fn read_u64_le(&mut self) -> ReadU64Le<&mut Self>where
Self: Unpin,
fn read_u64_le(&mut self) -> ReadU64Le<&mut Self>where
Self: Unpin,
§fn read_i64_le(&mut self) -> ReadI64Le<&mut Self>where
Self: Unpin,
fn read_i64_le(&mut self) -> ReadI64Le<&mut Self>where
Self: Unpin,
§fn read_u128_le(&mut self) -> ReadU128Le<&mut Self>where
Self: Unpin,
fn read_u128_le(&mut self) -> ReadU128Le<&mut Self>where
Self: Unpin,
§fn read_i128_le(&mut self) -> ReadI128Le<&mut Self>where
Self: Unpin,
fn read_i128_le(&mut self) -> ReadI128Le<&mut Self>where
Self: Unpin,
§fn read_f32_le(&mut self) -> ReadF32Le<&mut Self>where
Self: Unpin,
fn read_f32_le(&mut self) -> ReadF32Le<&mut Self>where
Self: Unpin,
§fn read_f64_le(&mut self) -> ReadF64Le<&mut Self>where
Self: Unpin,
fn read_f64_le(&mut self) -> ReadF64Le<&mut Self>where
Self: Unpin,
§fn read_to_end<'a>(&'a mut self, buf: &'a mut Vec<u8>) -> ReadToEnd<'a, Self>where
Self: Unpin,
fn read_to_end<'a>(&'a mut self, buf: &'a mut Vec<u8>) -> ReadToEnd<'a, Self>where
Self: Unpin,
buf. Read more§fn read_to_string<'a>(
&'a mut self,
dst: &'a mut String,
) -> ReadToString<'a, Self>where
Self: Unpin,
fn read_to_string<'a>(
&'a mut self,
dst: &'a mut String,
) -> ReadToString<'a, Self>where
Self: Unpin,
buf. Read more§impl<R> AsyncReadExt for R
impl<R> AsyncReadExt for R
§fn chain<R>(self, next: R) -> Chain<Self, R>
fn chain<R>(self, next: R) -> Chain<Self, R>
§fn read<'a>(&'a mut self, buf: &'a mut [u8]) -> Read<'a, Self> ⓘwhere
Self: Unpin,
fn read<'a>(&'a mut self, buf: &'a mut [u8]) -> Read<'a, Self> ⓘwhere
Self: Unpin,
buf in asynchronous
manner, returning a future type. Read more§fn read_vectored<'a>(
&'a mut self,
bufs: &'a mut [IoSliceMut<'a>],
) -> ReadVectored<'a, Self> ⓘwhere
Self: Unpin,
fn read_vectored<'a>(
&'a mut self,
bufs: &'a mut [IoSliceMut<'a>],
) -> ReadVectored<'a, Self> ⓘwhere
Self: Unpin,
AsyncRead into bufs using vectored
IO operations. Read more§fn read_exact<'a>(&'a mut self, buf: &'a mut [u8]) -> ReadExact<'a, Self> ⓘwhere
Self: Unpin,
fn read_exact<'a>(&'a mut self, buf: &'a mut [u8]) -> ReadExact<'a, Self> ⓘwhere
Self: Unpin,
buf,
returning an error if end of file (EOF) is hit sooner. Read more§fn read_to_end<'a>(&'a mut self, buf: &'a mut Vec<u8>) -> ReadToEnd<'a, Self> ⓘwhere
Self: Unpin,
fn read_to_end<'a>(&'a mut self, buf: &'a mut Vec<u8>) -> ReadToEnd<'a, Self> ⓘwhere
Self: Unpin,
AsyncRead. Read more§fn read_to_string<'a>(
&'a mut self,
buf: &'a mut String,
) -> ReadToString<'a, Self> ⓘwhere
Self: Unpin,
fn read_to_string<'a>(
&'a mut self,
buf: &'a mut String,
) -> ReadToString<'a, Self> ⓘwhere
Self: Unpin,
AsyncRead. Read more§impl<T> AsyncReadOwned for T
impl<T> AsyncReadOwned for T
§fn poll_read_owned<B>(
&mut self,
cx: &mut Context<'_>,
slot: &mut BufSlot<B>,
) -> Poll<Result<usize, Error>>where
B: IoBufMut,
fn poll_read_owned<B>(
&mut self,
cx: &mut Context<'_>,
slot: &mut BufSlot<B>,
) -> Poll<Result<usize, Error>>where
B: IoBufMut,
slot, returning
the bytes read (0 = EOF). The buffer is moved through the read op: Read more§fn read_owned<B>(
&mut self,
buf: B,
) -> impl Future<Output = (Result<usize, Error>, B)> + Send
fn read_owned<B>( &mut self, buf: B, ) -> impl Future<Output = (Result<usize, Error>, B)> + Send
poll_read_owned:
move buf in, drive to completion, hand it back filled. Not a second
impl: every owned reader gets it for free, relays and read_exact_into
use it. Read more§impl<S> AsyncSeekExt for Swhere
S: AsyncSeek + ?Sized,
impl<S> AsyncSeekExt for Swhere
S: AsyncSeek + ?Sized,
§fn seek(&mut self, pos: SeekFrom) -> Seek<'_, Self>where
Self: Unpin,
fn seek(&mut self, pos: SeekFrom) -> Seek<'_, Self>where
Self: Unpin,
§fn rewind(&mut self) -> Seek<'_, Self>where
Self: Unpin,
fn rewind(&mut self) -> Seek<'_, Self>where
Self: Unpin,
§fn stream_position(&mut self) -> Seek<'_, Self>where
Self: Unpin,
fn stream_position(&mut self) -> Seek<'_, Self>where
Self: Unpin,
§impl<S> AsyncSeekExt for S
impl<S> AsyncSeekExt for S
§impl<W> AsyncWriteExt for Wwhere
W: AsyncWrite + ?Sized,
impl<W> AsyncWriteExt for Wwhere
W: AsyncWrite + ?Sized,
§fn write<'a>(&'a mut self, src: &'a [u8]) -> Write<'a, Self>where
Self: Unpin,
fn write<'a>(&'a mut self, src: &'a [u8]) -> Write<'a, Self>where
Self: Unpin,
§fn write_vectored<'a, 'b>(
&'a mut self,
bufs: &'a [IoSlice<'b>],
) -> WriteVectored<'a, 'b, Self>where
Self: Unpin,
fn write_vectored<'a, 'b>(
&'a mut self,
bufs: &'a [IoSlice<'b>],
) -> WriteVectored<'a, 'b, Self>where
Self: Unpin,
§fn write_buf<'a, B>(&'a mut self, src: &'a mut B) -> WriteBuf<'a, Self, B>
fn write_buf<'a, B>(&'a mut self, src: &'a mut B) -> WriteBuf<'a, Self, B>
§fn write_all_buf<'a, B>(
&'a mut self,
src: &'a mut B,
) -> WriteAllBuf<'a, Self, B>
fn write_all_buf<'a, B>( &'a mut self, src: &'a mut B, ) -> WriteAllBuf<'a, Self, B>
§fn write_all<'a>(&'a mut self, src: &'a [u8]) -> WriteAll<'a, Self>where
Self: Unpin,
fn write_all<'a>(&'a mut self, src: &'a [u8]) -> WriteAll<'a, Self>where
Self: Unpin,
§fn write_u8(&mut self, n: u8) -> WriteU8<&mut Self>where
Self: Unpin,
fn write_u8(&mut self, n: u8) -> WriteU8<&mut Self>where
Self: Unpin,
§fn write_i8(&mut self, n: i8) -> WriteI8<&mut Self>where
Self: Unpin,
fn write_i8(&mut self, n: i8) -> WriteI8<&mut Self>where
Self: Unpin,
§fn write_u16(&mut self, n: u16) -> WriteU16<&mut Self>where
Self: Unpin,
fn write_u16(&mut self, n: u16) -> WriteU16<&mut Self>where
Self: Unpin,
§fn write_i16(&mut self, n: i16) -> WriteI16<&mut Self>where
Self: Unpin,
fn write_i16(&mut self, n: i16) -> WriteI16<&mut Self>where
Self: Unpin,
§fn write_u32(&mut self, n: u32) -> WriteU32<&mut Self>where
Self: Unpin,
fn write_u32(&mut self, n: u32) -> WriteU32<&mut Self>where
Self: Unpin,
§fn write_i32(&mut self, n: i32) -> WriteI32<&mut Self>where
Self: Unpin,
fn write_i32(&mut self, n: i32) -> WriteI32<&mut Self>where
Self: Unpin,
§fn write_u64(&mut self, n: u64) -> WriteU64<&mut Self>where
Self: Unpin,
fn write_u64(&mut self, n: u64) -> WriteU64<&mut Self>where
Self: Unpin,
§fn write_i64(&mut self, n: i64) -> WriteI64<&mut Self>where
Self: Unpin,
fn write_i64(&mut self, n: i64) -> WriteI64<&mut Self>where
Self: Unpin,
§fn write_u128(&mut self, n: u128) -> WriteU128<&mut Self>where
Self: Unpin,
fn write_u128(&mut self, n: u128) -> WriteU128<&mut Self>where
Self: Unpin,
§fn write_i128(&mut self, n: i128) -> WriteI128<&mut Self>where
Self: Unpin,
fn write_i128(&mut self, n: i128) -> WriteI128<&mut Self>where
Self: Unpin,
§fn write_f32(&mut self, n: f32) -> WriteF32<&mut Self>where
Self: Unpin,
fn write_f32(&mut self, n: f32) -> WriteF32<&mut Self>where
Self: Unpin,
§fn write_f64(&mut self, n: f64) -> WriteF64<&mut Self>where
Self: Unpin,
fn write_f64(&mut self, n: f64) -> WriteF64<&mut Self>where
Self: Unpin,
§fn write_u16_le(&mut self, n: u16) -> WriteU16Le<&mut Self>where
Self: Unpin,
fn write_u16_le(&mut self, n: u16) -> WriteU16Le<&mut Self>where
Self: Unpin,
§fn write_i16_le(&mut self, n: i16) -> WriteI16Le<&mut Self>where
Self: Unpin,
fn write_i16_le(&mut self, n: i16) -> WriteI16Le<&mut Self>where
Self: Unpin,
§fn write_u32_le(&mut self, n: u32) -> WriteU32Le<&mut Self>where
Self: Unpin,
fn write_u32_le(&mut self, n: u32) -> WriteU32Le<&mut Self>where
Self: Unpin,
§fn write_i32_le(&mut self, n: i32) -> WriteI32Le<&mut Self>where
Self: Unpin,
fn write_i32_le(&mut self, n: i32) -> WriteI32Le<&mut Self>where
Self: Unpin,
§fn write_u64_le(&mut self, n: u64) -> WriteU64Le<&mut Self>where
Self: Unpin,
fn write_u64_le(&mut self, n: u64) -> WriteU64Le<&mut Self>where
Self: Unpin,
§fn write_i64_le(&mut self, n: i64) -> WriteI64Le<&mut Self>where
Self: Unpin,
fn write_i64_le(&mut self, n: i64) -> WriteI64Le<&mut Self>where
Self: Unpin,
§fn write_u128_le(&mut self, n: u128) -> WriteU128Le<&mut Self>where
Self: Unpin,
fn write_u128_le(&mut self, n: u128) -> WriteU128Le<&mut Self>where
Self: Unpin,
§fn write_i128_le(&mut self, n: i128) -> WriteI128Le<&mut Self>where
Self: Unpin,
fn write_i128_le(&mut self, n: i128) -> WriteI128Le<&mut Self>where
Self: Unpin,
§fn write_f32_le(&mut self, n: f32) -> WriteF32Le<&mut Self>where
Self: Unpin,
fn write_f32_le(&mut self, n: f32) -> WriteF32Le<&mut Self>where
Self: Unpin,
§fn write_f64_le(&mut self, n: f64) -> WriteF64Le<&mut Self>where
Self: Unpin,
fn write_f64_le(&mut self, n: f64) -> WriteF64Le<&mut Self>where
Self: Unpin,
§impl<W> AsyncWriteExt for Wwhere
W: AsyncWrite + ?Sized,
impl<W> AsyncWriteExt for Wwhere
W: AsyncWrite + ?Sized,
§fn flush(&mut self) -> Flush<'_, Self> ⓘwhere
Self: Unpin,
fn flush(&mut self) -> Flush<'_, Self> ⓘwhere
Self: Unpin,
AsyncWrite. Read more§fn close(&mut self) -> Close<'_, Self> ⓘwhere
Self: Unpin,
fn close(&mut self) -> Close<'_, Self> ⓘwhere
Self: Unpin,
AsyncWrite.§fn write<'a>(&'a mut self, buf: &'a [u8]) -> Write<'a, Self> ⓘwhere
Self: Unpin,
fn write<'a>(&'a mut self, buf: &'a [u8]) -> Write<'a, Self> ⓘwhere
Self: Unpin,
buf into the object. Read more§fn write_vectored<'a>(
&'a mut self,
bufs: &'a [IoSlice<'a>],
) -> WriteVectored<'a, Self> ⓘwhere
Self: Unpin,
fn write_vectored<'a>(
&'a mut self,
bufs: &'a [IoSlice<'a>],
) -> WriteVectored<'a, Self> ⓘwhere
Self: Unpin,
bufs into the object using vectored
IO operations. Read more§impl<T> AsyncWriteOwned for T
impl<T> AsyncWriteOwned for T
§fn poll_write_owned<B>(
&mut self,
cx: &mut Context<'_>,
slot: &mut BufSlot<B>,
) -> Poll<Result<usize, Error>>where
B: IoBuf,
fn poll_write_owned<B>(
&mut self,
cx: &mut Context<'_>,
slot: &mut BufSlot<B>,
) -> Poll<Result<usize, Error>>where
B: IoBuf,
[0, buf_len)
of the buffer in slot, returning the bytes written. The buffer is moved
through the write op (readiness: borrowed-then-restored; completion /
SEND_ZC: moved into the op, slot left InFlight, returned on the NOTIF) and
left back in slot on Ready. The caller advances its own cursor by the
returned count.§fn poll_flush_owned(&mut self, cx: &mut Context<'_>) -> Poll<Result<(), Error>>
fn poll_flush_owned(&mut self, cx: &mut Context<'_>) -> Poll<Result<(), Error>>
§fn poll_shutdown_owned(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Error>>
fn poll_shutdown_owned( &mut self, cx: &mut Context<'_>, ) -> Poll<Result<(), Error>>
§fn is_write_vectored_owned(&self) -> bool
fn is_write_vectored_owned(&self) -> bool
tokio::io::AsyncWrite::is_write_vectored]), lets a frame encoder pick a
chain threshold. Defaults to false, the blanket-over-tokio impl and thin
adapters forward the underlying writer’s answer.§fn write_owned<B>(
&mut self,
buf: B,
) -> impl Future<Output = (Result<usize, Error>, B)> + Send
fn write_owned<B>( &mut self, buf: B, ) -> impl Future<Output = (Result<usize, Error>, B)> + Send
poll_write_owned:
move buf in, issue one write, hand it back with the bytes written. Not
a second impl: every owned writer gets it for free. Read more§fn flush_owned(&mut self) -> impl Future<Output = Result<(), Error>> + Sendwhere
Self: Send,
fn flush_owned(&mut self) -> impl Future<Output = Result<(), Error>> + Sendwhere
Self: Send,
poll_flush_owned.§fn shutdown_owned(&mut self) -> impl Future<Output = Result<(), Error>> + Sendwhere
Self: Send,
fn shutdown_owned(&mut self) -> impl Future<Output = Result<(), Error>> + Sendwhere
Self: Send,
poll_shutdown_owned.§impl<F> AttributesFactory for F
impl<F> AttributesFactory for F
§fn attributes(&self, size_hint: usize, ext: &Extensions) -> Vec<KeyValue>
fn attributes(&self, size_hint: usize, ext: &Extensions) -> Vec<KeyValue>
§impl<F, Fut, E, C> Authorizer<C> for F
impl<F, Fut, E, C> Authorizer<C> for F
§impl<F> BackgroundQueueObserver for F
impl<F> BackgroundQueueObserver for F
§impl<F, Fut> BodyCaptureSink for F
impl<F, Fut> BodyCaptureSink for F
§impl<T> BodyExt for T
impl<T> BodyExt for T
§fn frame(&mut self) -> Frame<'_, Self> ⓘwhere
Self: Unpin,
fn frame(&mut self) -> Frame<'_, Self> ⓘwhere
Self: Unpin,
Frame, if any.§fn inspect_frame<F>(self, f: F) -> InspectFrame<Self, F>
fn inspect_frame<F>(self, f: F) -> InspectFrame<Self, F>
§fn capture<S>(self, sink: S) -> CaptureBody<Self, S>
fn capture<S>(self, sink: S) -> CaptureBody<Self, S>
§fn capture_buffered(
self,
limit: CaptureLimit,
) -> (CaptureBody<Self, BufferedBodyCapture>, CaptureHandle)
fn capture_buffered( self, limit: CaptureLimit, ) -> (CaptureBody<Self, BufferedBodyCapture>, CaptureHandle)
§fn inspect_err<F>(self, f: F) -> InspectErr<Self, F>
fn inspect_err<F>(self, f: F) -> InspectErr<Self, F>
§fn boxed_unsync(self) -> UnsyncBoxBody<Self::Data, Self::Error>
fn boxed_unsync(self) -> UnsyncBoxBody<Self::Data, Self::Error>
§fn collect_with(self, opts: CollectOptions) -> CollectWith<Self> ⓘ
fn collect_with(self, opts: CollectOptions) -> CollectWith<Self> ⓘ
CollectOptions. Read more§fn with_trailers<F>(self, trailers: F) -> WithTrailers<Self, F>
fn with_trailers<F>(self, trailers: F) -> WithTrailers<Self, F>
§fn into_data_stream(self) -> BodyDataStream<Self>where
Self: Sized,
fn into_data_stream(self) -> BodyDataStream<Self>where
Self: Sized,
BodyDataStream.§fn into_stream(self) -> BodyStream<Self>where
Self: Sized,
fn into_stream(self) -> BodyStream<Self>where
Self: Sized,
BodyStream. Read moreSource§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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> ClientExt for T
impl<T> ClientExt for T
fn with_metadata(&self, metadata: impl Into<Metadata>) -> Self
fn with_timeout(&self, timeout: impl Into<Timeout>) -> Self
fn with_context(&self, context: impl Into<Context>) -> Self
§impl<T, M1, M2> ClientStreamingService<M1> for T
impl<T, M1, M2> ClientStreamingService<M1> for T
§impl<F> CloneInput for F
impl<F> CloneInput for F
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<S, Input, Connection> ConnectorService<Input> for Swhere
S: Service<Input, Output = EstablishedClientConnection<Connection, Input>>,
<S as Service<Input>>::Error: Into<ConnectionError>,
Connection: Send + ExtensionsRef,
impl<S, Input, Connection> ConnectorService<Input> for Swhere
S: Service<Input, Output = EstablishedClientConnection<Connection, Input>>,
<S as Service<Input>>::Error: Into<ConnectionError>,
Connection: Send + ExtensionsRef,
§type Connection = Connection
type Connection = Connection
ConnectorService§fn connect(
&self,
input: Input,
) -> impl Future<Output = Result<EstablishedClientConnection<<S as ConnectorService<Input>>::Connection, Input>, ConnectionError>> + Send
fn connect( &self, input: Input, ) -> impl Future<Output = Result<EstablishedClientConnection<<S as ConnectorService<Input>>::Connection, Input>, ConnectionError>> + Send
§impl<C, F> ContainsToken<C> for F
impl<C, F> ContainsToken<C> for F
§fn contains_token(&self, token: C) -> bool
fn contains_token(&self, token: C) -> bool
§impl<C, F> ContainsToken<C> for F
impl<C, F> ContainsToken<C> for F
§fn contains_token(&self, token: C) -> bool
fn contains_token(&self, token: C) -> bool
impl<T> CryptoRng for T
impl<R> CryptoRng for Rwhere
R: TryCryptoRng<Error = Infallible> + ?Sized,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
Source§impl<N, E, I> ElementIterator<N, E> for I
impl<N, E, I> ElementIterator<N, E> for I
§impl<'e, I, E> EmitAndCount for I
impl<'e, I, E> EmitAndCount for I
§fn emit(&mut self, encoder: &mut BinEncoder<'_>) -> Result<usize, ProtoError>
fn emit(&mut self, encoder: &mut BinEncoder<'_>) -> Result<usize, ProtoError>
impl<F, R, O, E, State> EndpointServiceFn<(((), ()), ()), State> for F
impl<F, R, O, State> EndpointServiceFn<(((), ()), Infallible), State> for F
impl<F, R, O, E, I, State> EndpointServiceFn<(((), I), ()), State> for F
impl<F, R, O, I, State> EndpointServiceFn<(((), I), Infallible), State> for Fwhere
F: Fn(I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection>,
State: Send + Sync + 'static,
impl<F, R, O, E, P, I, State> EndpointServiceFn<(((), P, I), ()), State> for Fwhere
F: Fn(P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
State: Send + Sync + 'static,
impl<F, R, O, P, I, State> EndpointServiceFn<(((), P, I), Infallible), State> for Fwhere
F: Fn(P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection>,
State: Send + Sync + 'static,
impl<F, R, O, E, State, T1, T2> EndpointServiceFn<(((T1, T2), ()), ()), State> for Fwhere
F: Fn(T1, T2) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2> EndpointServiceFn<(((T1, T2), ()), Infallible), State> for Fwhere
F: Fn(T1, T2) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, I> EndpointServiceFn<(((T1, T2), I), ()), State> for Fwhere
F: Fn(T1, T2, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, I> EndpointServiceFn<(((T1, T2), I), Infallible), State> for Fwhere
F: Fn(T1, T2, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2> EndpointServiceFn<(((T1, T2), P, I), ()), State> for Fwhere
F: Fn(T1, T2, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2> EndpointServiceFn<(((T1, T2), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3> EndpointServiceFn<(((T1, T2, T3), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3> EndpointServiceFn<(((T1, T2, T3), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, I> EndpointServiceFn<(((T1, T2, T3), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, I> EndpointServiceFn<(((T1, T2, T3), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3> EndpointServiceFn<(((T1, T2, T3), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3> EndpointServiceFn<(((T1, T2, T3), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4> EndpointServiceFn<(((T1, T2, T3, T4), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4> EndpointServiceFn<(((T1, T2, T3, T4), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, I> EndpointServiceFn<(((T1, T2, T3, T4), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, I> EndpointServiceFn<(((T1, T2, T3, T4), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4> EndpointServiceFn<(((T1, T2, T3, T4), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4> EndpointServiceFn<(((T1, T2, T3, T4), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5> EndpointServiceFn<(((T1, T2, T3, T4, T5), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5> EndpointServiceFn<(((T1, T2, T3, T4, T5), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, I> EndpointServiceFn<(((T1, T2, T3, T4, T5), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, I> EndpointServiceFn<(((T1, T2, T3, T4, T5), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5> EndpointServiceFn<(((T1, T2, T3, T4, T5), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5> EndpointServiceFn<(((T1, T2, T3, T4, T5), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5, T6> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5, T6> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5, T6, T7> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5, T6, T7> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8, T9> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8, T9> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), P, I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), P, I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12), ()), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection> + From<<T12 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
T12: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12), ()), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
T12: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection> + From<<T12 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12), I), ()), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection> + From<<T12 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
T12: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, I> EndpointServiceFn<(((T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12), I), Infallible), State> for Fwhere
F: Fn(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection> + From<<T2 as FromPartsStateRefPair<State>>::Rejection> + From<<T3 as FromPartsStateRefPair<State>>::Rejection> + From<<T4 as FromPartsStateRefPair<State>>::Rejection> + From<<T5 as FromPartsStateRefPair<State>>::Rejection> + From<<T6 as FromPartsStateRefPair<State>>::Rejection> + From<<T7 as FromPartsStateRefPair<State>>::Rejection> + From<<T8 as FromPartsStateRefPair<State>>::Rejection> + From<<T9 as FromPartsStateRefPair<State>>::Rejection> + From<<T10 as FromPartsStateRefPair<State>>::Rejection> + From<<T11 as FromPartsStateRefPair<State>>::Rejection> + From<<T12 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
T2: FromPartsStateRefPair<State>,
T3: FromPartsStateRefPair<State>,
T4: FromPartsStateRefPair<State>,
T5: FromPartsStateRefPair<State>,
T6: FromPartsStateRefPair<State>,
T7: FromPartsStateRefPair<State>,
T8: FromPartsStateRefPair<State>,
T9: FromPartsStateRefPair<State>,
T10: FromPartsStateRefPair<State>,
T11: FromPartsStateRefPair<State>,
T12: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, T1> EndpointServiceFn<(((T1,), ()), ()), State> for F
impl<F, R, O, State, T1> EndpointServiceFn<(((T1,), ()), Infallible), State> for Fwhere
F: Fn(T1) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
T1: FromPartsStateRefPair<State>,
ErrorResponse: From<<T1 as FromPartsStateRefPair<State>>::Rejection>,
impl<F, R, O, E, State, T1, I> EndpointServiceFn<(((T1,), I), ()), State> for Fwhere
F: Fn(T1, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + 'static + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
I: FromRequest,
T1: FromPartsStateRefPair<State>,
impl<F, R, O, State, T1, I> EndpointServiceFn<(((T1,), I), Infallible), State> for Fwhere
F: Fn(T1, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
I: FromRequest,
ErrorResponse: From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
impl<F, R, O, E, State, P, I, T1> EndpointServiceFn<(((T1,), P, I), ()), State> for Fwhere
F: Fn(T1, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = Result<O, E>> + Send + 'static,
O: Send + 'static,
E: Send + From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + 'static + From<<T1 as FromPartsStateRefPair<State>>::Rejection>,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
T1: FromPartsStateRefPair<State>,
impl<F, R, O, State, P, I, T1> EndpointServiceFn<(((T1,), P, I), Infallible), State> for Fwhere
F: Fn(T1, P, I) -> R + Clone + Send + Sync + 'static,
R: Future<Output = O> + Send + 'static,
O: IntoResponse + Send + 'static,
State: Send + Sync + 'static,
P: FromOwnedRequestParts,
I: FromRequestBody,
ErrorResponse: From<<P as FromOwnedRequestParts>::Rejection> + From<<I as FromRequest>::Rejection> + From<<T1 as FromPartsStateRefPair<State>>::Rejection>,
T1: FromPartsStateRefPair<State>,
§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.§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<Error> ErrorExt for Error
impl<Error> ErrorExt for Error
§fn into_box_error(self) -> Box<dyn Error + Send + Sync>
fn into_box_error(self) -> Box<dyn Error + Send + Sync>
BoxError without additional context.§fn into_opaque_error(self) -> OpaqueError
fn into_opaque_error(self) -> OpaqueError
OpaqueError without additional context. Read more§fn context_debug<M>(self, value: M) -> Box<dyn Error + Send + Sync>
fn context_debug<M>(self, value: M) -> Box<dyn Error + Send + Sync>
fmt::Debug as fmt::Display.§fn context_field<M>(
self,
key: &'static str,
value: M,
) -> Box<dyn Error + Send + Sync>
fn context_field<M>( self, key: &'static str, value: M, ) -> Box<dyn Error + Send + Sync>
§fn context_str_field<M>(
self,
key: &'static str,
value: M,
) -> Box<dyn Error + Send + Sync>
fn context_str_field<M>( self, key: &'static str, value: M, ) -> Box<dyn Error + Send + Sync>
Self::context_field but using a string-like value,
this is useful in case you need to pass a string slice which is borrowed
and thus cannot be passed as part of ’static error.§fn context_debug_field<M>(
self,
key: &'static str,
value: M,
) -> Box<dyn Error + Send + Sync>
fn context_debug_field<M>( self, key: &'static str, value: M, ) -> Box<dyn Error + Send + Sync>
fmt::Debug as fmt::Display.§fn with_context<C, F>(self, cb: F) -> Box<dyn Error + Send + Sync>
fn with_context<C, F>(self, cb: F) -> Box<dyn Error + Send + Sync>
§fn with_context_debug<C, F>(self, cb: F) -> Box<dyn Error + Send + Sync>
fn with_context_debug<C, F>(self, cb: F) -> Box<dyn Error + Send + Sync>
fmt::Debug as fmt::Display.§fn with_context_field<C, F>(
self,
key: &'static str,
cb: F,
) -> Box<dyn Error + Send + Sync>
fn with_context_field<C, F>( self, key: &'static str, cb: F, ) -> Box<dyn Error + Send + Sync>
§fn with_context_str_field<C, F>(
self,
key: &'static str,
cb: F,
) -> Box<dyn Error + Send + Sync>
fn with_context_str_field<C, F>( self, key: &'static str, cb: F, ) -> Box<dyn Error + Send + Sync>
Self::with_context_field but using a string-like value,
this is useful in case you need to pass a string slice which is borrowed
and thus cannot be passed as part of ’static error.§fn with_context_debug_field<C, F>(
self,
key: &'static str,
cb: F,
) -> Box<dyn Error + Send + Sync>
fn with_context_debug_field<C, F>( self, key: &'static str, cb: F, ) -> Box<dyn Error + Send + Sync>
fmt::Debug as fmt::Display.§impl<F> ErrorSink for Fwhere
F: FnMut(ParseError),
impl<F> ErrorSink for Fwhere
F: FnMut(ParseError),
fn report_error(&mut self, error: ParseError)
§impl<E, F> ErrorSink<E> for F
impl<E, F> ErrorSink<E> for F
§fn sink_error(&self, error: E)
fn sink_error(&self, error: E)
§impl<F> EventReceiver for Fwhere
F: FnMut(Event),
impl<F> EventReceiver for Fwhere
F: FnMut(Event),
fn std_table_open(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn std_table_close(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn array_table_open(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn array_table_close(&mut self, span: Span, _error: &mut dyn ErrorSink)
§fn inline_table_open(&mut self, span: Span, _error: &mut dyn ErrorSink) -> bool
fn inline_table_open(&mut self, span: Span, _error: &mut dyn ErrorSink) -> bool
fn inline_table_close(&mut self, span: Span, _error: &mut dyn ErrorSink)
§fn array_open(&mut self, span: Span, _error: &mut dyn ErrorSink) -> bool
fn array_open(&mut self, span: Span, _error: &mut dyn ErrorSink) -> bool
fn array_close(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn simple_key( &mut self, span: Span, encoding: Option<Encoding>, _error: &mut dyn ErrorSink, )
fn key_sep(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn key_val_sep(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn scalar( &mut self, span: Span, encoding: Option<Encoding>, _error: &mut dyn ErrorSink, )
fn value_sep(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn whitespace(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn comment(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn newline(&mut self, span: Span, _error: &mut dyn ErrorSink)
fn error(&mut self, span: Span, _error: &mut dyn ErrorSink)
§impl<K, V, T> Expiry<K, V> for T
impl<K, V, T> Expiry<K, V> for T
§fn expire_after_create(
&self,
key: &K,
value: &V,
created_at: Instant,
) -> Option<Duration>
fn expire_after_create( &self, key: &K, value: &V, created_at: Instant, ) -> Option<Duration>
insert and get_with but only when the key
was not present in the cache. Read more§fn expire_after_read(
&self,
key: &K,
value: &V,
read_at: Instant,
duration_until_expiry: Option<Duration>,
last_modified_at: Instant,
) -> Option<Duration>
fn expire_after_read( &self, key: &K, value: &V, read_at: Instant, duration_until_expiry: Option<Duration>, last_modified_at: Instant, ) -> Option<Duration>
get and get_with but only when the key is present in
the cache. Read more§fn expire_after_update(
&self,
key: &K,
value: &V,
updated_at: Instant,
duration_until_expiry: Option<Duration>,
) -> Option<Duration>
fn expire_after_update( &self, key: &K, value: &V, updated_at: Instant, duration_until_expiry: Option<Duration>, ) -> Option<Duration>
insert but only when the key is
already present in the cache. Read moreSource§impl<F, N> FilterEdge<N> for F
impl<F, N> FilterEdge<N> for F
Source§fn include_edge(&self, n: N) -> bool
fn include_edge(&self, n: N) -> bool
§impl<F, S> FilterExt<S> for Fwhere
F: Filter<S>,
impl<F, S> FilterExt<S> for Fwhere
F: Filter<S>,
Source§impl<F, N> FilterNode<N> for F
impl<F, N> FilterNode<N> for F
Source§fn include_node(&self, n: N) -> bool
fn include_node(&self, n: N) -> bool
§impl<E, S, T> FirstAnswer<T, E> for S
impl<E, S, T> FirstAnswer<T, E> for S
§fn first_answer(self) -> FirstAnswerFuture<Self> ⓘ
fn first_answer(self) -> FirstAnswerFuture<Self> ⓘ
§impl<F> FlushImmediatelyObserver for F
impl<F> FlushImmediatelyObserver for F
impl<T> Formattable for T
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_cancellation_token(
self,
cancellation_token: &CancellationToken,
) -> WithCancellationTokenFuture<'_, Self>where
Self: Sized,
fn with_cancellation_token(
self,
cancellation_token: &CancellationToken,
) -> WithCancellationTokenFuture<'_, Self>where
Self: Sized,
CancellationToken::run_until_cancelled],
but with the advantage that it is easier to write fluent call chains. Read more§fn with_cancellation_token_owned(
self,
cancellation_token: CancellationToken,
) -> WithCancellationTokenFutureOwned<Self>where
Self: Sized,
fn with_cancellation_token_owned(
self,
cancellation_token: CancellationToken,
) -> WithCancellationTokenFutureOwned<Self>where
Self: Sized,
CancellationToken::run_until_cancelled_owned],
but with the advantage that it is easier to write fluent call chains. Read more§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn map<U, F>(self, f: F) -> Map<Self, F> ⓘ
fn map<U, F>(self, f: F) -> Map<Self, F> ⓘ
§fn map_into<U>(self) -> MapInto<Self, U> ⓘ
fn map_into<U>(self) -> MapInto<Self, U> ⓘ
§fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F> ⓘ
fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F> ⓘ
f. Read more§fn left_future<B>(self) -> Either<Self, B> ⓘ
fn left_future<B>(self) -> Either<Self, B> ⓘ
§fn right_future<A>(self) -> Either<A, Self> ⓘ
fn right_future<A>(self) -> Either<A, Self> ⓘ
§fn into_stream(self) -> IntoStream<Self>where
Self: Sized,
fn into_stream(self) -> IntoStream<Self>where
Self: Sized,
§fn flatten(self) -> Flatten<Self> ⓘ
fn flatten(self) -> Flatten<Self> ⓘ
§fn flatten_stream(self) -> FlattenStream<Self>
fn flatten_stream(self) -> FlattenStream<Self>
§fn fuse(self) -> Fuse<Self> ⓘwhere
Self: Sized,
fn fuse(self) -> Fuse<Self> ⓘwhere
Self: Sized,
poll will never again be called once it has
completed. This method can be used to turn any Future into a
FusedFuture. Read more§fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
§fn catch_unwind(self) -> CatchUnwind<Self> ⓘwhere
Self: Sized + UnwindSafe,
fn catch_unwind(self) -> CatchUnwind<Self> ⓘwhere
Self: Sized + UnwindSafe,
std only.std, or crate features alloc and spin only.§fn remote_handle(self) -> (Remote<Self>, RemoteHandle<Self::Output>)where
Self: Sized,
fn remote_handle(self) -> (Remote<Self>, RemoteHandle<Self::Output>)where
Self: Sized,
channel and std only.() on completion and sends
its output to another future on a separate task. Read more§fn boxed<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + Send + 'a>>
fn boxed<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + Send + 'a>>
alloc only.§fn boxed_local<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + 'a>>where
Self: Sized + 'a,
fn boxed_local<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + 'a>>where
Self: Sized + 'a,
alloc only.§fn unit_error(self) -> UnitError<Self> ⓘwhere
Self: Sized,
fn unit_error(self) -> UnitError<Self> ⓘwhere
Self: Sized,
Future<Output = T> into a
TryFuture<Ok = T, Error = ()>.§fn never_error(self) -> NeverError<Self> ⓘwhere
Self: Sized,
fn never_error(self) -> NeverError<Self> ⓘwhere
Self: Sized,
Future<Output = T> into a
TryFuture<Ok = T, Error = Never>.§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
§impl<T> FutureExt for T
impl<T> FutureExt for T
§impl<T, ReqBody, ResBody> GrpcService<ReqBody> for T
impl<T, ReqBody, ResBody> GrpcService<ReqBody> for T
§type ResponseBody = ResBody
type ResponseBody = ResBody
§fn serve(
&self,
request: Request<ReqBody>,
) -> impl Future<Output = Result<Response<<T as GrpcService<ReqBody>>::ResponseBody>, <T as GrpcService<ReqBody>>::Error>> + Send
fn serve( &self, request: Request<ReqBody>, ) -> impl Future<Output = Result<Response<<T as GrpcService<ReqBody>>::ResponseBody>, <T as GrpcService<ReqBody>>::Error>> + Send
§impl<S, Body> HttpClientExt for S
impl<S, Body> HttpClientExt for S
§type ExecuteResponse = Response<Body>
type ExecuteResponse = Response<Body>
execute method.§type ExecuteError = <S as Service<Request>>::Error
type ExecuteError = <S as Service<Request>>::Error
execute method.§fn get(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn get( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
GET request to a URL. Read more§fn post(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn post( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
POST request to a URL. Read more§fn put(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn put( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
PUT request to a URL. Read more§fn patch(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn patch( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
PATCH request to a URL. Read more§fn delete(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn delete( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
DELETE request to a URL. Read more§fn head(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn head( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
HEAD request to a URL. Read more§fn connect(
&self,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn connect( &self, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
CONNECT request to a URL. Read more§fn request(
&self,
method: Method,
url: impl IntoUrl,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn request( &self, method: Method, url: impl IntoUrl, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
§fn build_from_request<RequestBody>(
&self,
request: Request<RequestBody>,
) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
fn build_from_request<RequestBody>( &self, request: Request<RequestBody>, ) -> RequestBuilder<'_, S, <S as HttpClientExt>::ExecuteResponse>
§fn execute(
&self,
request: Request,
) -> impl Future<Output = Result<<S as HttpClientExt>::ExecuteResponse, <S as HttpClientExt>::ExecuteError>>
fn execute( &self, request: Request, ) -> impl Future<Output = Result<<S as HttpClientExt>::ExecuteResponse, <S as HttpClientExt>::ExecuteError>>
Request. Read more§impl<S, Body> HttpClientWebSocketExt<Body> for S
impl<S, Body> HttpClientWebSocketExt<Body> for S
§fn websocket(
&self,
url: impl IntoUrl,
) -> WebSocketRequestBuilder<WithService<'_, S, Body>>
fn websocket( &self, url: impl IntoUrl, ) -> WebSocketRequestBuilder<WithService<'_, S, Body>>
WebSocketRequestBuilder] to be used to establish a WebSocket connection over http/1.1.§fn websocket_h2(
&self,
url: impl IntoUrl,
) -> WebSocketRequestBuilder<WithService<'_, S, Body>>
fn websocket_h2( &self, url: impl IntoUrl, ) -> WebSocketRequestBuilder<WithService<'_, S, Body>>
WebSocketRequestBuilder to be used to establish a WebSocket connection over h2.§fn websocket_with_request<RequestBody>(
&self,
req: Request<RequestBody>,
) -> WebSocketRequestBuilder<WithService<'_, S, Body>>
fn websocket_with_request<RequestBody>( &self, req: Request<RequestBody>, ) -> WebSocketRequestBuilder<WithService<'_, S, Body>>
WebSocketRequestBuilder starting from the given request. Read more§impl<Input, K, F> InputToRateKey<Input> for F
impl<Input, K, F> InputToRateKey<Input> for F
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoEndpointService<(F, T)> for F
impl<F, T> IntoEndpointService<(F, T)> for F
type Service = EndpointServiceFnWrapper<F, T, ()>
§fn into_endpoint_service(self) -> <F as IntoEndpointService<(F, T)>>::Service
fn into_endpoint_service(self) -> <F as IntoEndpointService<(F, T)>>::Service
rama_core::Service.§impl<S> IntoEndpointService<(S,)> for S
impl<S> IntoEndpointService<(S,)> for S
type Service = S
§fn into_endpoint_service(self) -> <S as IntoEndpointService<(S,)>>::Service
fn into_endpoint_service(self) -> <S as IntoEndpointService<(S,)>>::Service
rama_core::Service.§impl<O> IntoEndpointService<Response> for O
impl<O> IntoEndpointService<Response> for O
type Service = StaticOutput<O>
§fn into_endpoint_service(self) -> <O as IntoEndpointService<Response>>::Service
fn into_endpoint_service(self) -> <O as IntoEndpointService<Response>>::Service
rama_core::Service.§impl<F, T, State> IntoEndpointServiceWithState<(F, T), State> for F
impl<F, T, State> IntoEndpointServiceWithState<(F, T), State> for F
type Service = EndpointServiceFnWrapper<F, T, State>
§fn into_endpoint_service_with_state(
self,
state: State,
) -> <F as IntoEndpointServiceWithState<(F, T), State>>::Service
fn into_endpoint_service_with_state( self, state: State, ) -> <F as IntoEndpointServiceWithState<(F, T), State>>::Service
rama_core::Service with state.§impl<S, State> IntoEndpointServiceWithState<(S,), State> for S
impl<S, State> IntoEndpointServiceWithState<(S,), State> for S
type Service = S
§fn into_endpoint_service_with_state(
self,
_state: State,
) -> <S as IntoEndpointServiceWithState<(S,), State>>::Service
fn into_endpoint_service_with_state( self, _state: State, ) -> <S as IntoEndpointServiceWithState<(S,), State>>::Service
rama_core::Service with state.§impl<O, State> IntoEndpointServiceWithState<Response, State> for O
impl<O, State> IntoEndpointServiceWithState<Response, State> for O
type Service = StaticOutput<O>
§fn into_endpoint_service_with_state(
self,
_state: State,
) -> <O as IntoEndpointServiceWithState<Response, State>>::Service
fn into_endpoint_service_with_state( self, _state: State, ) -> <O as IntoEndpointServiceWithState<Response, State>>::Service
rama_core::Service with state.§impl<T, F, A1, A2, A3, R> IntoFunc<T, (A1, A2, A3), R> for F
impl<T, F, A1, A2, A3, R> IntoFunc<T, (A1, A2, A3), R> for F
§impl<T, F, A1, A2, A3, A4, R> IntoFunc<T, (A1, A2, A3, A4), R> for F
impl<T, F, A1, A2, A3, A4, R> IntoFunc<T, (A1, A2, A3, A4), R> for F
§impl<T, F, A1, A2, A3, A4, A5, R> IntoFunc<T, (A1, A2, A3, A4, A5), R> for F
impl<T, F, A1, A2, A3, A4, A5, R> IntoFunc<T, (A1, A2, A3, A4, A5), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15), R> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15), R> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16), R> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16), R> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17), R> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
A17: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, R> IntoFunc<T, (A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17), R> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
A17: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, A1, R> IntoFunc<T, (Caller<'_, T>, A1), R> for F
impl<T, F, A1, R> IntoFunc<T, (Caller<'_, T>, A1), R> for F
§impl<T, F, A1, A2, R> IntoFunc<T, (Caller<'_, T>, A1, A2), R> for F
impl<T, F, A1, A2, R> IntoFunc<T, (Caller<'_, T>, A1, A2), R> for F
§impl<T, F, A1, A2, A3, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3), R> for F
impl<T, F, A1, A2, A3, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3), R> for F
§impl<T, F, A1, A2, A3, A4, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4), R> for F
impl<T, F, A1, A2, A3, A4, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4), R> for F
§impl<T, F, A1, A2, A3, A4, A5, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5), R> for F
impl<T, F, A1, A2, A3, A4, A5, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13), R> for F
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13), R> for F
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
A17: WasmTy,
R: WasmRet,
T: 'static,
impl<T, F, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17, R> IntoFunc<T, (Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17), R> for Fwhere
F: Fn(Caller<'_, T>, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12, A13, A14, A15, A16, A17) -> R + Send + Sync + 'static,
A1: WasmTy,
A2: WasmTy,
A3: WasmTy,
A4: WasmTy,
A5: WasmTy,
A6: WasmTy,
A7: WasmTy,
A8: WasmTy,
A9: WasmTy,
A10: WasmTy,
A11: WasmTy,
A12: WasmTy,
A13: WasmTy,
A14: WasmTy,
A15: WasmTy,
A16: WasmTy,
A17: WasmTy,
R: WasmRet,
T: 'static,
§impl<T, F, R> IntoFunc<T, (Caller<'_, T>,), R> for F
impl<T, F, R> IntoFunc<T, (Caller<'_, T>,), R> for F
§impl<T, F, A1, R> IntoFunc<T, A1, R> for F
impl<T, F, A1, R> IntoFunc<T, A1, R> for F
Source§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
§impl<F> IntoHtml for F
impl<F> IntoHtml for F
§fn into_html(self) -> impl IntoHtml
fn into_html(self) -> impl IntoHtml
IntoHtml value. Used for
composition; leaf types should return self.§fn escape_and_write(self, buf: &mut String)
fn escape_and_write(self, buf: &mut String)
buf.§fn size_hint(&self) -> usize
fn size_hint(&self) -> usize
§fn into_string(self) -> Stringwhere
Self: Sized,
fn into_string(self) -> Stringwhere
Self: Sized,
String.Source§impl<I> IntoIterator for Iwhere
I: Iterator,
impl<I> IntoIterator for Iwhere
I: Iterator,
§impl<'data, I> IntoParallelRefIterator<'data> for I
impl<'data, I> IntoParallelRefIterator<'data> for I
§impl<'data, I> IntoParallelRefMutIterator<'data> for Iwhere
I: 'data + ?Sized,
&'data mut I: IntoParallelIterator,
impl<'data, I> IntoParallelRefMutIterator<'data> for Iwhere
I: 'data + ?Sized,
&'data mut I: IntoParallelIterator,
§type Iter = <&'data mut I as IntoParallelIterator>::Iter
type Iter = <&'data mut I as IntoParallelIterator>::Iter
§type Item = <&'data mut I as IntoParallelIterator>::Item
type Item = <&'data mut I as IntoParallelIterator>::Item
&'data mut T reference.§fn par_iter_mut(
&'data mut self,
) -> <I as IntoParallelRefMutIterator<'data>>::Iter
fn par_iter_mut( &'data mut self, ) -> <I as IntoParallelRefMutIterator<'data>>::Iter
self. Read more§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T in a rama_grpc::Request§impl<T> IntoStreamingRequest for T
impl<T> IntoStreamingRequest for T
impl<T> Io for Twhere
T: AsyncRead + AsyncWrite + Send + 'static,
§impl<'a, I, M, Input> IteratorMatcherExt<'a, M, Input> for I
impl<'a, I, M, Input> IteratorMatcherExt<'a, M, Input> for I
§fn matches_and(self, ext: Option<&Extensions>, input: &Input) -> bool
fn matches_and(self, ext: Option<&Extensions>, input: &Input) -> bool
§fn matches_or(self, ext: Option<&Extensions>, input: &Input) -> bool
fn matches_or(self, ext: Option<&Extensions>, input: &Input) -> bool
Matcher elements match for the given Input
within the specified Extensions.Source§impl<I> IteratorRandom for Iwhere
I: Iterator,
impl<I> IteratorRandom for Iwhere
I: Iterator,
Source§fn choose_stable<R>(self, rng: &mut R) -> Option<Self::Item>
fn choose_stable<R>(self, rng: &mut R) -> Option<Self::Item>
§impl<I> IteratorRandom for Iwhere
I: Iterator,
impl<I> IteratorRandom for Iwhere
I: Iterator,
§fn choose<R>(self, rng: &mut R) -> Option<Self::Item>where
R: Rng + ?Sized,
fn choose<R>(self, rng: &mut R) -> Option<Self::Item>where
R: Rng + ?Sized,
§fn choose_stable<R>(self, rng: &mut R) -> Option<Self::Item>where
R: Rng + ?Sized,
fn choose_stable<R>(self, rng: &mut R) -> Option<Self::Item>where
R: Rng + ?Sized,
§fn sample_fill<R>(self, rng: &mut R, buf: &mut [Self::Item]) -> usizewhere
R: Rng + ?Sized,
fn sample_fill<R>(self, rng: &mut R, buf: &mut [Self::Item]) -> usizewhere
R: Rng + ?Sized,
amount distinct elements into a buffer Read more§fn sample<R>(self, rng: &mut R, amount: usize) -> Vec<Self::Item>where
R: Rng + ?Sized,
fn sample<R>(self, rng: &mut R, amount: usize) -> Vec<Self::Item>where
R: Rng + ?Sized,
alloc only.§impl<T> Itertools for T
impl<T> Itertools for T
§fn interleave<J>(
self,
other: J,
) -> Interleave<Self, <J as IntoIterator>::IntoIter> ⓘ
fn interleave<J>( self, other: J, ) -> Interleave<Self, <J as IntoIterator>::IntoIter> ⓘ
§fn interleave_shortest<J>(
self,
other: J,
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter> ⓘ
fn interleave_shortest<J>( self, other: J, ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter> ⓘ
§fn intersperse(
self,
element: Self::Item,
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>> ⓘ
fn intersperse( self, element: Self::Item, ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>> ⓘ
§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
§fn get<R>(self, index: R) -> <R as IteratorIndex<Self>>::Outputwhere
Self: Sized,
R: IteratorIndex<Self>,
fn get<R>(self, index: R) -> <R as IteratorIndex<Self>>::Outputwhere
Self: Sized,
R: IteratorIndex<Self>,
§fn zip_longest<J>(
self,
other: J,
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
fn zip_longest<J>(
self,
other: J,
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
§fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
§fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
use_alloc only.§fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
Use .chunk_by() instead
use_alloc only..chunk_by().§fn chunks(self, size: usize) -> IntoChunks<Self>where
Self: Sized,
fn chunks(self, size: usize) -> IntoChunks<Self>where
Self: Sized,
use_alloc only.§fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
§fn tuples<T>(self) -> Tuples<Self, T> ⓘ
fn tuples<T>(self) -> Tuples<Self, T> ⓘ
§fn tee(self) -> (Tee<Self>, Tee<Self>)
fn tee(self) -> (Tee<Self>, Tee<Self>)
use_alloc only.§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
Result::Ok value. Result::Err values are
unchanged. Read more§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
Result::Ok
value with the provided closure. Result::Err values are
unchanged. Read more§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
Result::Ok value with the provided closure. Result::Err
values are unchanged. Read more§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
Result::Ok value into
a series of Result::Ok values. Result::Err values are unchanged. Read more§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
Result values instead. Read more§fn merge<J>(
self,
other: J,
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte> ⓘ
fn merge<J>( self, other: J, ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte> ⓘ
§fn merge_by<J, F>(
self,
other: J,
is_first: F,
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F> ⓘ
fn merge_by<J, F>( self, other: J, is_first: F, ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F> ⓘ
§fn merge_join_by<J, F, T>(
self,
other: J,
cmp_fn: F,
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>> ⓘ
fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F, ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>> ⓘ
§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt> ⓘ
fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt> ⓘ
use_alloc only.§fn kmerge_by<F>(
self,
first: F,
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
fn kmerge_by<F>(
self,
first: F,
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
use_alloc only.§fn cartesian_product<J>(
self,
other: J,
) -> Product<Self, <J as IntoIterator>::IntoIter> ⓘ
fn cartesian_product<J>( self, other: J, ) -> Product<Self, <J as IntoIterator>::IntoIter> ⓘ
self and J. Read more§fn multi_cartesian_product(
self,
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
fn multi_cartesian_product(
self,
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
use_alloc only.self. Read more§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, NoCount>
fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, NoCount>
§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, NoCount>
fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, NoCount>
§fn dedup_by<Cmp>(
self,
cmp: Cmp,
) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, NoCount>
fn dedup_by<Cmp>( self, cmp: Cmp, ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, NoCount>
§fn dedup_with_count(
self,
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, WithCount>where
Self: Sized,
fn dedup_with_count(
self,
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, WithCount>where
Self: Sized,
§fn dedup_by_with_count<Cmp>(
self,
cmp: Cmp,
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, WithCount>
fn dedup_by_with_count<Cmp>( self, cmp: Cmp, ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, WithCount>
§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>
fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>
use_std only.§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>
fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>
use_std only.§fn unique(self) -> Unique<Self> ⓘ
fn unique(self) -> Unique<Self> ⓘ
use_std only.§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
use_std only.§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
accept returns true. Read more§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
Clone-able iterator
to only pick off elements while the predicate accept returns true. Read more§fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
true, including the element for which the predicate
first returned false. Read more§fn while_some<A>(self) -> WhileSome<Self> ⓘ
fn while_some<A>(self) -> WhileSome<Self> ⓘ
Option<A> iterator elements
and produces A. Stops on the first None encountered. Read more§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
§fn array_combinations<const K: usize>(
self,
) -> CombinationsGeneric<Self, [usize; K]>
fn array_combinations<const K: usize>( self, ) -> CombinationsGeneric<Self, [usize; K]>
use_alloc only.§fn combinations(self, k: usize) -> CombinationsGeneric<Self, Vec<usize>>
fn combinations(self, k: usize) -> CombinationsGeneric<Self, Vec<usize>>
use_alloc only.k-length combinations of
the elements from an iterator. Read more§fn combinations_with_replacement(
self,
k: usize,
) -> CombinationsWithReplacement<Self> ⓘ
fn combinations_with_replacement( self, k: usize, ) -> CombinationsWithReplacement<Self> ⓘ
use_alloc only.k-length combinations of
the elements from an iterator, with replacement. Read more§fn permutations(self, k: usize) -> Permutations<Self> ⓘ
fn permutations(self, k: usize) -> Permutations<Self> ⓘ
use_alloc only.§fn powerset(self) -> Powerset<Self> ⓘ
fn powerset(self) -> Powerset<Self> ⓘ
use_alloc only.§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
min by filling missing elements using a closure f. Read more§fn with_position(self) -> WithPosition<Self> ⓘwhere
Self: Sized,
fn with_position(self) -> WithPosition<Self> ⓘwhere
Self: Sized,
Position to
ease special-case handling of the first or last elements. Read more§fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
§fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
§fn next_array<const N: usize>(&mut self) -> Option<[Self::Item; N]>where
Self: Sized,
fn next_array<const N: usize>(&mut self) -> Option<[Self::Item; N]>where
Self: Sized,
§fn collect_array<const N: usize>(self) -> Option<[Self::Item; N]>where
Self: Sized,
fn collect_array<const N: usize>(self) -> Option<[Self::Item; N]>where
Self: Sized,
§fn next_tuple<T>(&mut self) -> Option<T>
fn next_tuple<T>(&mut self) -> Option<T>
§fn collect_tuple<T>(self) -> Option<T>
fn collect_tuple<T>(self) -> Option<T>
§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
§fn contains<Q>(&mut self, query: &Q) -> bool
fn contains<Q>(&mut self, query: &Q) -> bool
true if the given item is present in this iterator. Read more§fn all_equal_value(
&mut self,
) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
fn all_equal_value( &mut self, ) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>
§fn all_unique(&mut self) -> bool
fn all_unique(&mut self) -> bool
use_std only.§fn dropping(self, n: usize) -> Selfwhere
Self: Sized,
fn dropping(self, n: usize) -> Selfwhere
Self: Sized,
n elements from the iterator eagerly,
and return the same iterator again. Read more§fn dropping_back(self, n: usize) -> Selfwhere
Self: Sized + DoubleEndedIterator,
fn dropping_back(self, n: usize) -> Selfwhere
Self: Sized + DoubleEndedIterator,
n elements from the iterator eagerly,
and return the same iterator again. Read more§fn collect_vec(self) -> Vec<Self::Item>where
Self: Sized,
fn collect_vec(self) -> Vec<Self::Item>where
Self: Sized,
use_alloc only..collect_vec() is simply a type specialization of Iterator::collect,
for convenience.§fn try_collect<T, U, E>(self) -> Result<U, E>
fn try_collect<T, U, E>(self) -> Result<U, E>
§fn set_from<'a, A, J>(&mut self, from: J) -> usize
fn set_from<'a, A, J>(&mut self, from: J) -> usize
self from the from iterator,
stopping at the shortest of the two iterators. Read more§fn format(self, sep: &str) -> Format<'_, Self>where
Self: Sized,
fn format(self, sep: &str) -> Format<'_, Self>where
Self: Sized,
sep. Read more§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
sep. Read more§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
Result values from an iterator. Read more§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
Option values from an iterator. Read more§fn fold1<F>(self, f: F) -> Option<Self::Item>
fn fold1<F>(self, f: F) -> Option<Self::Item>
Use Iterator::reduce instead
§fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
Use .tree_reduce() instead
.tree_reduce().§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
§fn product1<P>(self) -> Option<P>
fn product1<P>(self) -> Option<P>
§fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted(self) -> IntoIter<Self::Item> ⓘ
fn sorted(self) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_smallest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_smallest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_relaxed_by_key<F, K>(
self,
k: usize,
key: F,
) -> IntoIter<Self::Item> ⓘ
fn k_smallest_relaxed_by_key<F, K>( self, k: usize, key: F, ) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_largest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_largest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_relaxed_by_key<F, K>(
self,
k: usize,
key: F,
) -> IntoIter<Self::Item> ⓘ
fn k_largest_relaxed_by_key<F, K>( self, k: usize, key: F, ) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘwhere
Self: Sized,
fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘwhere
Self: Sized,
use_alloc only.n elements. Read more§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
Iterator::partition, each partition may
have a distinct type. Read more§fn partition_result<A, B, T, E>(self) -> (A, B)
fn partition_result<A, B, T, E>(self) -> (A, B)
Results into one list of all the Ok elements
and another list of all the Err elements. Read more§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
use_std only.HashMap of keys mapped to Vecs of values. Keys and values
are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more§fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
use_std only.HashMap of keys mapped to Vecs of values. The key is specified
in the closure. The values are taken from the input iterator. Read more§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
use_std only.GroupingMap to be used later with one of the efficient
group-and-fold operations it allows to perform. Read more§fn into_grouping_map_by<K, V, F>(
self,
key_mapper: F,
) -> GroupingMap<MapSpecialCase<Self, GroupingMapFn<F>>>
fn into_grouping_map_by<K, V, F>( self, key_mapper: F, ) -> GroupingMap<MapSpecialCase<Self, GroupingMapFn<F>>>
use_std only.GroupingMap to be used later with one of the efficient
group-and-fold operations it allows to perform. Read more§fn min_set(self) -> Vec<Self::Item>
fn min_set(self) -> Vec<Self::Item>
use_alloc only.§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
use_alloc only.§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
use_alloc only.§fn max_set(self) -> Vec<Self::Item>
fn max_set(self) -> Vec<Self::Item>
use_alloc only.§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
use_alloc only.§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
use_alloc only.§fn minmax(self) -> MinMaxResult<Self::Item>
fn minmax(self) -> MinMaxResult<Self::Item>
§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
§fn position_max(self) -> Option<usize>
fn position_max(self) -> Option<usize>
§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
§fn position_max_by<F>(self, compare: F) -> Option<usize>
fn position_max_by<F>(self, compare: F) -> Option<usize>
§fn position_min(self) -> Option<usize>
fn position_min(self) -> Option<usize>
§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
§fn position_min_by<F>(self, compare: F) -> Option<usize>
fn position_min_by<F>(self, compare: F) -> Option<usize>
§fn position_minmax(self) -> MinMaxResult<usize>
fn position_minmax(self) -> MinMaxResult<usize>
§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
Self: Sized,
fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
Self: Sized,
§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
Self: Sized,
fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
Self: Sized,
Ok(None) will be returned. If the iterator yields
exactly one element, that element will be returned, otherwise an error will be returned
containing an iterator that has the same output as the input iterator. Read more§fn multipeek(self) -> MultiPeek<Self> ⓘwhere
Self: Sized,
fn multipeek(self) -> MultiPeek<Self> ⓘwhere
Self: Sized,
use_alloc only..next()
values without advancing the base iterator. Read more§fn counts(self) -> HashMap<Self::Item, usize>
fn counts(self) -> HashMap<Self::Item, usize>
use_std only.HashMap which
contains each item that appears in the iterator and the number
of times it appears. Read more§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
use_std only.HashMap which
contains each item that appears in the iterator and the number
of times it appears,
determining identity using a keying function. Read more§fn multiunzip<FromI>(self) -> FromIwhere
Self: Sized + MultiUnzip<FromI>,
fn multiunzip<FromI>(self) -> FromIwhere
Self: Sized + MultiUnzip<FromI>,
§impl<T> Itertools for T
impl<T> Itertools for T
§fn interleave<J>(
self,
other: J,
) -> Interleave<Self, <J as IntoIterator>::IntoIter> ⓘ
fn interleave<J>( self, other: J, ) -> Interleave<Self, <J as IntoIterator>::IntoIter> ⓘ
§fn interleave_shortest<J>(
self,
other: J,
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter> ⓘ
fn interleave_shortest<J>( self, other: J, ) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter> ⓘ
§fn intersperse(
self,
element: Self::Item,
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>> ⓘ
fn intersperse( self, element: Self::Item, ) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>> ⓘ
§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F> ⓘ
§fn get<R>(self, index: R) -> <R as IteratorIndex<Self>>::Outputwhere
Self: Sized,
R: IteratorIndex<Self>,
fn get<R>(self, index: R) -> <R as IteratorIndex<Self>>::Outputwhere
Self: Sized,
R: IteratorIndex<Self>,
§fn zip_longest<J>(
self,
other: J,
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
fn zip_longest<J>(
self,
other: J,
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter> ⓘwhere
J: IntoIterator,
Self: Sized,
§fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
fn batching<B, F>(self, f: F) -> Batching<Self, F> ⓘ
§fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
fn chunk_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
use_alloc only.§fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
fn group_by<K, F>(self, key: F) -> ChunkBy<K, Self, F>
Use .chunk_by() instead
use_alloc only..chunk_by().§fn chunks(self, size: usize) -> IntoChunks<Self>where
Self: Sized,
fn chunks(self, size: usize) -> IntoChunks<Self>where
Self: Sized,
use_alloc only.§fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
fn tuple_windows<T>(self) -> TupleWindows<Self, T> ⓘ
§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T> ⓘ
§fn tuples<T>(self) -> Tuples<Self, T> ⓘ
fn tuples<T>(self) -> Tuples<Self, T> ⓘ
§fn array_windows<const N: usize>(self) -> ArrayWindows<Self, N> ⓘ
fn array_windows<const N: usize>(self) -> ArrayWindows<Self, N> ⓘ
N. Read more§fn circular_array_windows<const N: usize>(self) -> CircularArrayWindows<Self, N> ⓘ
fn circular_array_windows<const N: usize>(self) -> CircularArrayWindows<Self, N> ⓘ
N. Read more§fn tee(self) -> (Tee<Self>, Tee<Self>)
fn tee(self) -> (Tee<Self>, Tee<Self>)
use_alloc only.§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>
Result::Ok value. Result::Err values are
unchanged. Read more§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F> ⓘ
Result::Ok
value with the provided closure. Result::Err values are
unchanged. Read more§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F> ⓘ
Result::Ok value with the provided closure. Result::Err
values are unchanged. Read more§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E> ⓘ
Result::Ok value into
a series of Result::Ok values. Result::Err values are unchanged. Read more§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>
Result values instead. Read more§fn merge<J>(
self,
other: J,
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte> ⓘ
fn merge<J>( self, other: J, ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte> ⓘ
§fn merge_by<J, F>(
self,
other: J,
is_first: F,
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F> ⓘ
fn merge_by<J, F>( self, other: J, is_first: F, ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F> ⓘ
§fn merge_join_by<J, F, T>(
self,
other: J,
cmp_fn: F,
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>> ⓘ
fn merge_join_by<J, F, T>( self, other: J, cmp_fn: F, ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeFuncLR<F, <F as FuncLR<Self::Item, <<J as IntoIterator>::IntoIter as Iterator>::Item>>::T>> ⓘ
§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt> ⓘ
fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt> ⓘ
use_alloc only.§fn kmerge_by<F>(
self,
first: F,
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
fn kmerge_by<F>(
self,
first: F,
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
use_alloc only.§fn cartesian_product<J>(
self,
other: J,
) -> Product<Self, <J as IntoIterator>::IntoIter> ⓘ
fn cartesian_product<J>( self, other: J, ) -> Product<Self, <J as IntoIterator>::IntoIter> ⓘ
self and J. Read more§fn multi_cartesian_product(
self,
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
fn multi_cartesian_product(
self,
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter> ⓘwhere
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
use_alloc only.self. Read more§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, NoCount>
fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, NoCount>
§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, NoCount>
fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, NoCount>
§fn dedup_by<Cmp>(
self,
cmp: Cmp,
) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, NoCount>
fn dedup_by<Cmp>( self, cmp: Cmp, ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, NoCount>
§fn dedup_with_count(
self,
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, WithCount>where
Self: Sized,
fn dedup_with_count(
self,
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, WithCount>where
Self: Sized,
§fn dedup_by_with_count<Cmp>(
self,
cmp: Cmp,
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, WithCount>
fn dedup_by_with_count<Cmp>( self, cmp: Cmp, ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, WithCount>
§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>
fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>
use_std only.§fn duplicates_with_hasher<S>(
self,
hash_builder: S,
) -> DuplicatesBy<Self, Self::Item, ById, S>
fn duplicates_with_hasher<S>( self, hash_builder: S, ) -> DuplicatesBy<Self, Self::Item, ById, S>
use_std only.§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>
fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>
use_std only.§fn duplicates_by_with_hasher<V, F, S>(
self,
f: F,
hash_builder: S,
) -> DuplicatesBy<Self, V, ByFn<F>, S>
fn duplicates_by_with_hasher<V, F, S>( self, f: F, hash_builder: S, ) -> DuplicatesBy<Self, V, ByFn<F>, S>
use_std only.§fn unique(self) -> Unique<Self> ⓘ
fn unique(self) -> Unique<Self> ⓘ
use_std only.§fn unique_with_hasher<S>(self, hash_builder: S) -> Unique<Self, S> ⓘ
fn unique_with_hasher<S>(self, hash_builder: S) -> Unique<Self, S> ⓘ
use_std only.§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> ⓘ
use_std only.§fn unique_by_with_hasher<V, F, S>(
self,
f: F,
hash_builder: S,
) -> UniqueBy<Self, V, F, S> ⓘ
fn unique_by_with_hasher<V, F, S>( self, f: F, hash_builder: S, ) -> UniqueBy<Self, V, F, S> ⓘ
use_std only.§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F> ⓘ
accept returns true. Read more§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F> ⓘ
Clone-able iterator
to only pick off elements while the predicate accept returns true. Read more§fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
fn take_while_inclusive<F>(self, accept: F) -> TakeWhileInclusive<Self, F> ⓘ
true, including the element for which the predicate
first returned false. Read more§fn while_some<A>(self) -> WhileSome<Self> ⓘ
fn while_some<A>(self) -> WhileSome<Self> ⓘ
Option<A> iterator elements
and produces A. Stops on the first None encountered. Read more§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> ⓘ
Use .array_combinations() instead
§fn array_combinations<const K: usize>(
self,
) -> CombinationsGeneric<Self, [usize; K]>
fn array_combinations<const K: usize>( self, ) -> CombinationsGeneric<Self, [usize; K]>
use_alloc only.§fn combinations(self, k: usize) -> CombinationsGeneric<Self, Vec<usize>>
fn combinations(self, k: usize) -> CombinationsGeneric<Self, Vec<usize>>
use_alloc only.k-length combinations of
the elements from an iterator. Read more§fn combinations_with_replacement(
self,
k: usize,
) -> CombinationsWithReplacementGeneric<Self, Box<[usize]>>
fn combinations_with_replacement( self, k: usize, ) -> CombinationsWithReplacementGeneric<Self, Box<[usize]>>
use_alloc only.k-length combinations of
the elements from an iterator, with replacement. Read more§fn array_combinations_with_replacement<const K: usize>(
self,
) -> CombinationsWithReplacementGeneric<Self, [usize; K]>
fn array_combinations_with_replacement<const K: usize>( self, ) -> CombinationsWithReplacementGeneric<Self, [usize; K]>
use_alloc only.k-length combinations of
the elements from an iterator, with replacement. Read more§fn permutations(self, k: usize) -> Permutations<Self> ⓘ
fn permutations(self, k: usize) -> Permutations<Self> ⓘ
use_alloc only.§fn powerset(self) -> Powerset<Self> ⓘ
fn powerset(self) -> Powerset<Self> ⓘ
use_alloc only.§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> ⓘ
min by filling missing elements using a closure f. Read more§fn with_position(self) -> WithPosition<Self> ⓘwhere
Self: Sized,
fn with_position(self) -> WithPosition<Self> ⓘwhere
Self: Sized,
Position
to ease special-case handling of the first or last elements. Read more§fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
fn positions<P>(self, predicate: P) -> Positions<Self, P> ⓘ
§fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
fn update<F>(self, updater: F) -> Update<Self, F> ⓘ
§fn next_array<const N: usize>(&mut self) -> Option<[Self::Item; N]>where
Self: Sized,
fn next_array<const N: usize>(&mut self) -> Option<[Self::Item; N]>where
Self: Sized,
§fn collect_array<const N: usize>(self) -> Option<[Self::Item; N]>where
Self: Sized,
fn collect_array<const N: usize>(self) -> Option<[Self::Item; N]>where
Self: Sized,
§fn next_tuple<T>(&mut self) -> Option<T>
fn next_tuple<T>(&mut self) -> Option<T>
§fn collect_tuple<T>(self) -> Option<T>
fn collect_tuple<T>(self) -> Option<T>
§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>
§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>
§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>
§fn contains<Q>(&mut self, query: &Q) -> bool
fn contains<Q>(&mut self, query: &Q) -> bool
true if the given item is present in this iterator. Read more§fn all_equal_value(
&mut self,
) -> Result<Self::Item, AllEqualValueError<Self::Item>>
fn all_equal_value( &mut self, ) -> Result<Self::Item, AllEqualValueError<Self::Item>>
§fn all_unique(&mut self) -> bool
fn all_unique(&mut self) -> bool
use_std only.§fn all_unique_with_hasher<S>(&mut self, hash_builder: S) -> bool
fn all_unique_with_hasher<S>(&mut self, hash_builder: S) -> bool
use_std only.§fn dropping(self, n: usize) -> Selfwhere
Self: Sized,
fn dropping(self, n: usize) -> Selfwhere
Self: Sized,
n elements from the iterator eagerly,
and return the same iterator again. Read more§fn dropping_back(self, n: usize) -> Selfwhere
Self: Sized + DoubleEndedIterator,
fn dropping_back(self, n: usize) -> Selfwhere
Self: Sized + DoubleEndedIterator,
n elements from the iterator eagerly,
and return the same iterator again. Read more§fn collect_vec(self) -> Vec<Self::Item>where
Self: Sized,
fn collect_vec(self) -> Vec<Self::Item>where
Self: Sized,
use_alloc only..collect_vec() is simply a type specialization of Iterator::collect,
for convenience.§fn try_collect<T, U, E>(self) -> Result<U, E>
fn try_collect<T, U, E>(self) -> Result<U, E>
§fn set_from<'a, A, J>(&mut self, from: J) -> usize
fn set_from<'a, A, J>(&mut self, from: J) -> usize
self from the from iterator,
stopping at the shortest of the two iterators. Read more§fn format(self, sep: &str) -> Format<'_, Self>where
Self: Sized,
fn format(self, sep: &str) -> Format<'_, Self>where
Self: Sized,
sep. Read more§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>
sep. Read more§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>
Result values from an iterator. Read more§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>
Option values from an iterator. Read more§fn fold1<F>(self, f: F) -> Option<Self::Item>
fn fold1<F>(self, f: F) -> Option<Self::Item>
Use Iterator::reduce instead
§fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
Use .tree_reduce() instead
.tree_reduce().§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>
§fn product1<P>(self) -> Option<P>
fn product1<P>(self) -> Option<P>
§fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
fn sorted_unstable(self) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted(self) -> IntoIter<Self::Item> ⓘ
fn sorted(self) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_smallest(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_smallest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_smallest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_smallest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_smallest_relaxed_by_key<F, K>(
self,
k: usize,
key: F,
) -> IntoIter<Self::Item> ⓘ
fn k_smallest_relaxed_by_key<F, K>( self, k: usize, key: F, ) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_largest(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_largest_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
fn k_largest_by_key<F, K>(self, k: usize, key: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
fn k_largest_relaxed(self, k: usize) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
fn k_largest_relaxed_by<F>(self, k: usize, cmp: F) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn k_largest_relaxed_by_key<F, K>(
self,
k: usize,
key: F,
) -> IntoIter<Self::Item> ⓘ
fn k_largest_relaxed_by_key<F, K>( self, k: usize, key: F, ) -> IntoIter<Self::Item> ⓘ
use_alloc only.§fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘwhere
Self: Sized,
fn tail(self, n: usize) -> IntoIter<Self::Item> ⓘwhere
Self: Sized,
use_alloc only.n elements. Read more§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)
Iterator::partition, each partition may
have a distinct type. Read more§fn partition_result<A, B, T, E>(self) -> (A, B)
fn partition_result<A, B, T, E>(self) -> (A, B)
Results into one list of all the Ok elements
and another list of all the Err elements. Read more§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>
use_std only.HashMap of keys mapped to Vecs of values. Keys and values
are taken from (Key, Value) tuple pairs yielded by the input iterator. Read more§fn into_group_map_with_hasher<K, V, S>(
self,
hash_builder: S,
) -> HashMap<K, Vec<V>, S>
fn into_group_map_with_hasher<K, V, S>( self, hash_builder: S, ) -> HashMap<K, Vec<V>, S>
use_std only.HashMap of keys mapped to Vecs of values, using the hash builder for hashing.
See .into_group_map() for more information. Read more§fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>
use_std only.HashMap of keys mapped to Vecs of values. The key is specified
in the closure. The values are taken from the input iterator. Read more§fn into_group_map_by_with_hasher<K, V, F, S>(
self,
f: F,
hash_builder: S,
) -> HashMap<K, Vec<V>, S>
fn into_group_map_by_with_hasher<K, V, F, S>( self, f: F, hash_builder: S, ) -> HashMap<K, Vec<V>, S>
use_std only.HashMap of keys mapped to Vecs of values, using the hash builder for hashing.
See .into_group_map_by() for more information. Read more§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
fn into_grouping_map<K, V>(self) -> GroupingMap<Self>
use_std only.GroupingMap to be used later with one of the efficient
group-and-fold operations it allows to perform. Read more§fn into_grouping_map_with_hasher<K, V, S>(
self,
hash_builder: S,
) -> GroupingMap<Self, S>
fn into_grouping_map_with_hasher<K, V, S>( self, hash_builder: S, ) -> GroupingMap<Self, S>
use_std only.GroupingMap to be used later with one of the efficient
group-and-fold operations it allows to perform, using the specified hash builder for
hashing the elements.
See .into_grouping_map() for more information.§fn into_grouping_map_by<K, V, F>(
self,
key_mapper: F,
) -> GroupingMap<MapSpecialCase<Self, GroupingMapFn<F>>>
fn into_grouping_map_by<K, V, F>( self, key_mapper: F, ) -> GroupingMap<MapSpecialCase<Self, GroupingMapFn<F>>>
use_std only.GroupingMap to be used later with one of the efficient
group-and-fold operations it allows to perform. Read more§fn into_grouping_map_by_with_hasher<K, V, F, S>(
self,
key_mapper: F,
hash_builder: S,
) -> GroupingMap<MapSpecialCase<Self, GroupingMapFn<F>>, S>
fn into_grouping_map_by_with_hasher<K, V, F, S>( self, key_mapper: F, hash_builder: S, ) -> GroupingMap<MapSpecialCase<Self, GroupingMapFn<F>>, S>
use_std only.GroupingMap to be used later with one of the efficient
group-and-fold operations it allows to perform, using the specified hash builder for
hashing the keys.
See .into_grouping_map_by() for more information.§fn min_set(self) -> Vec<Self::Item>
fn min_set(self) -> Vec<Self::Item>
use_alloc only.§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>
use_alloc only.§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
use_alloc only.§fn max_set(self) -> Vec<Self::Item>
fn max_set(self) -> Vec<Self::Item>
use_alloc only.§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>
use_alloc only.§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>
use_alloc only.§fn minmax(self) -> MinMaxResult<Self::Item>
fn minmax(self) -> MinMaxResult<Self::Item>
§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>
§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>
§fn position_max(self) -> Option<usize>
fn position_max(self) -> Option<usize>
§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
fn position_max_by_key<K, F>(self, key: F) -> Option<usize>
§fn position_max_by<F>(self, compare: F) -> Option<usize>
fn position_max_by<F>(self, compare: F) -> Option<usize>
§fn position_min(self) -> Option<usize>
fn position_min(self) -> Option<usize>
§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
fn position_min_by_key<K, F>(self, key: F) -> Option<usize>
§fn position_min_by<F>(self, compare: F) -> Option<usize>
fn position_min_by<F>(self, compare: F) -> Option<usize>
§fn position_minmax(self) -> MinMaxResult<usize>
fn position_minmax(self) -> MinMaxResult<usize>
§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>
§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>
§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
Self: Sized,
fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
Self: Sized,
§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
Self: Sized,
fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
Self: Sized,
Ok(None) will be returned. If the iterator yields
exactly one element, that element will be returned, otherwise an error will be returned
containing an iterator that has the same output as the input iterator. Read more§fn multipeek(self) -> MultiPeek<Self> ⓘwhere
Self: Sized,
fn multipeek(self) -> MultiPeek<Self> ⓘwhere
Self: Sized,
use_alloc only..next()
values without advancing the base iterator. Read more§fn counts(self) -> HashMap<Self::Item, usize>
fn counts(self) -> HashMap<Self::Item, usize>
use_std only.HashMap which
contains each item that appears in the iterator and the number
of times it appears. Read more§fn counts_with_hasher<S>(self, hash_builder: S) -> HashMap<Self::Item, usize, S>
fn counts_with_hasher<S>(self, hash_builder: S) -> HashMap<Self::Item, usize, S>
use_std only.HashMap the same way
.counts() does, but use the specified hash builder for hashing.§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>
use_std only.HashMap which
contains each item that appears in the iterator and the number
of times it appears,
determining identity using a keying function. Read more§fn counts_by_with_hasher<K, F, S>(
self,
f: F,
hash_builder: S,
) -> HashMap<K, usize, S>
fn counts_by_with_hasher<K, F, S>( self, f: F, hash_builder: S, ) -> HashMap<K, usize, S>
use_std only.HashMap the same way
.counts_by() does, but use the specified hash builder for hashing.§fn multiunzip<FromI>(self) -> FromIwhere
Self: Sized + MultiUnzip<FromI>,
fn multiunzip<FromI>(self) -> FromIwhere
Self: Sized + MultiUnzip<FromI>,
§fn try_len(&self) -> Result<usize, (usize, Option<usize>)>
fn try_len(&self) -> Result<usize, (usize, Option<usize>)>
self.size_hint(). Read more§fn strip_prefix<Prefix>(
self,
prefix: Prefix,
) -> Result<Self, StripPrefixError<Self, <Prefix as IntoIterator>::IntoIter, Self::Item>>
fn strip_prefix<Prefix>( self, prefix: Prefix, ) -> Result<Self, StripPrefixError<Self, <Prefix as IntoIterator>::IntoIter, Self::Item>>
§fn strip_prefix_by<Prefix, F>(
self,
prefix: Prefix,
eq: F,
) -> Result<Self, StripPrefixError<Self, <Prefix as IntoIterator>::IntoIter, Self::Item>>where
Self: Sized,
Prefix: IntoIterator,
F: FnMut(&Self::Item, &<Prefix as IntoIterator>::Item) -> bool,
fn strip_prefix_by<Prefix, F>(
self,
prefix: Prefix,
eq: F,
) -> Result<Self, StripPrefixError<Self, <Prefix as IntoIterator>::IntoIter, Self::Item>>where
Self: Sized,
Prefix: IntoIterator,
F: FnMut(&Self::Item, &<Prefix as IntoIterator>::Item) -> bool,
eq to compare items. Read more§impl<F, R, M> JsFn<((), M)> for F
impl<F, R, M> JsFn<((), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2> JsFn<((A1, A2), M)> for F
impl<F, R, M, A1, A2> JsFn<((A1, A2), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3> JsFn<((A1, A2, A3), M)> for F
impl<F, R, M, A1, A2, A3> JsFn<((A1, A2, A3), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4> JsFn<((A1, A2, A3, A4), M)> for F
impl<F, R, M, A1, A2, A3, A4> JsFn<((A1, A2, A3, A4), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5> JsFn<((A1, A2, A3, A4, A5), M)> for F
impl<F, R, M, A1, A2, A3, A4, A5> JsFn<((A1, A2, A3, A4, A5), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6> JsFn<((A1, A2, A3, A4, A5, A6), M)> for F
impl<F, R, M, A1, A2, A3, A4, A5, A6> JsFn<((A1, A2, A3, A4, A5, A6), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6, A7> JsFn<((A1, A2, A3, A4, A5, A6, A7), M)> for F
impl<F, R, M, A1, A2, A3, A4, A5, A6, A7> JsFn<((A1, A2, A3, A4, A5, A6, A7), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8), M)> for F
impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9), M)> for F
impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), M)> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), M)> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), M)> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), M)> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), M)> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
A12: JsArg + 'static,
impl<F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12> JsFn<((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), M)> for Fwhere
F: Fn(A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
A12: JsArg + 'static,
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M, A1> JsFn<((A1,), M)> for F
impl<F, R, M, A1> JsFn<((A1,), M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<F, R, M> JsFn<(VariadicMarker, M)> for F
impl<F, R, M> JsFn<(VariadicMarker, M)> for F
fn into_raw_host_fn(self) -> RawHostFn
§impl<T, F, R, M> JsHostFn<T, ((), M)> for F
impl<T, F, R, M> JsHostFn<T, ((), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2> JsHostFn<T, ((A1, A2), M)> for F
impl<T, F, R, M, A1, A2> JsHostFn<T, ((A1, A2), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3> JsHostFn<T, ((A1, A2, A3), M)> for F
impl<T, F, R, M, A1, A2, A3> JsHostFn<T, ((A1, A2, A3), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4> JsHostFn<T, ((A1, A2, A3, A4), M)> for F
impl<T, F, R, M, A1, A2, A3, A4> JsHostFn<T, ((A1, A2, A3, A4), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5> JsHostFn<T, ((A1, A2, A3, A4, A5), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5> JsHostFn<T, ((A1, A2, A3, A4, A5), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6> JsHostFn<T, ((A1, A2, A3, A4, A5, A6), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5, A6> JsHostFn<T, ((A1, A2, A3, A4, A5, A6), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
A12: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12> JsHostFn<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), M)> for Fwhere
T: 'static,
F: Fn(&T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
A12: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1> JsHostFn<T, ((A1,), M)> for F
impl<T, F, R, M, A1> JsHostFn<T, ((A1,), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M> JsHostFnMut<T, ((), M)> for F
impl<T, F, R, M> JsHostFnMut<T, ((), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2> JsHostFnMut<T, ((A1, A2), M)> for F
impl<T, F, R, M, A1, A2> JsHostFnMut<T, ((A1, A2), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3> JsHostFnMut<T, ((A1, A2, A3), M)> for F
impl<T, F, R, M, A1, A2, A3> JsHostFnMut<T, ((A1, A2, A3), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4> JsHostFnMut<T, ((A1, A2, A3, A4), M)> for F
impl<T, F, R, M, A1, A2, A3, A4> JsHostFnMut<T, ((A1, A2, A3, A4), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5> JsHostFnMut<T, ((A1, A2, A3, A4, A5), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5> JsHostFnMut<T, ((A1, A2, A3, A4, A5), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5, A6> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8), M)> for F
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
A12: JsArg + 'static,
impl<T, F, R, M, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12> JsHostFnMut<T, ((A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12), M)> for Fwhere
T: 'static,
F: Fn(&mut T, A1, A2, A3, A4, A5, A6, A7, A8, A9, A10, A11, A12) -> R + Send + Sync + 'static,
R: JsFnOutput<M>,
M: 'static,
A1: JsArg + 'static,
A2: JsArg + 'static,
A3: JsArg + 'static,
A4: JsArg + 'static,
A5: JsArg + 'static,
A6: JsArg + 'static,
A7: JsArg + 'static,
A8: JsArg + 'static,
A9: JsArg + 'static,
A10: JsArg + 'static,
A11: JsArg + 'static,
A12: JsArg + 'static,
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M, A1> JsHostFnMut<T, ((A1,), M)> for F
impl<T, F, R, M, A1> JsHostFnMut<T, ((A1,), M)> for F
fn into_raw_host_method(self) -> RawHostMethod<T>
§impl<T, F, R, M> JsHostGetter<T, M> for F
impl<T, F, R, M> JsHostGetter<T, M> for F
fn into_raw_host_getter(self) -> RawHostMethod<T>
§impl<T, F, R, A, M> JsHostSetter<T, A, M> for F
impl<T, F, R, A, M> JsHostSetter<T, A, M> for F
fn into_raw_host_setter(self) -> RawHostMethod<T>
§impl<F> JsonValueHandler for F
impl<F> JsonValueHandler for F
§impl<Sp> LocalSpawnExt for Spwhere
Sp: LocalSpawn + ?Sized,
impl<Sp> LocalSpawnExt for Spwhere
Sp: LocalSpawn + ?Sized,
§fn spawn_local<Fut>(&self, future: Fut) -> Result<(), SpawnError>
fn spawn_local<Fut>(&self, future: Fut) -> Result<(), SpawnError>
alloc only.() to
completion. Read more§fn spawn_local_with_handle<Fut>(
&self,
future: Fut,
) -> Result<RemoteHandle<<Fut as Future>::Output>, SpawnError>where
Fut: Future + 'static,
fn spawn_local_with_handle<Fut>(
&self,
future: Fut,
) -> Result<RemoteHandle<<Fut as Future>::Output>, SpawnError>where
Fut: Future + 'static,
channel and std only.§impl<F, Fut, S> MakeBodyCaptureSink for Fwhere
F: Fn(CapturedHead) -> Fut + Send + Sync + 'static,
Fut: Future<Output = Option<S>> + Send + 'static,
S: BodyCaptureSink,
impl<F, Fut, S> MakeBodyCaptureSink for Fwhere
F: Fn(CapturedHead) -> Fut + Send + Sync + 'static,
Fut: Future<Output = Option<S>> + Send + 'static,
S: BodyCaptureSink,
§fn make_sink(
&self,
head: CapturedHead,
) -> impl Future<Output = Option<<F as MakeBodyCaptureSink>::Sink>> + Send
fn make_sink( &self, head: CapturedHead, ) -> impl Future<Output = Option<<F as MakeBodyCaptureSink>::Sink>> + Send
§impl<T, M> MakeExt<T> for Mwhere
M: MakeVisitor<T> + Sealed<MakeExtMarker<T>>,
impl<T, M> MakeExt<T> for Mwhere
M: MakeVisitor<T> + Sealed<MakeExtMarker<T>>,
§fn debug_alt(self) -> Alt<Self>
fn debug_alt(self) -> Alt<Self>
self so that any fmt::Debug fields are recorded using the
alternate formatter ({:#?}).§fn display_messages(self) -> Messages<Self>
fn display_messages(self) -> Messages<Self>
self so that any string fields named “message” are recorded
using fmt::Display.§impl<F, Fut, ReqBody, ResBody> MakeHeaderValueFactoryFn<ReqBody, ResBody, ((), (), ())> for F
impl<F, Fut, ReqBody, ResBody> MakeHeaderValueFactoryFn<ReqBody, ResBody, ((), (), ())> for F
§impl<F, Fut, ReqBody, ResBody> MakeHeaderValueFactoryFn<ReqBody, ResBody, ((), (), Response<ResBody>)> for F
impl<F, Fut, ReqBody, ResBody> MakeHeaderValueFactoryFn<ReqBody, ResBody, ((), (), Response<ResBody>)> for F
§impl<F, Fut, ReqBody, ResBody, M> MakeHeaderValueFactoryFn<ReqBody, ResBody, ((), Request<ReqBody>)> for F
impl<F, Fut, ReqBody, ResBody, M> MakeHeaderValueFactoryFn<ReqBody, ResBody, ((), Request<ReqBody>)> for F
§impl<F, Fut, ReqBody, ResBody, M> MakeHeaderValueFactoryFn<ReqBody, ResBody, ()> for F
impl<F, Fut, ReqBody, ResBody, M> MakeHeaderValueFactoryFn<ReqBody, ResBody, ()> for F
§impl<F, Fut, B> MakeHeaderValueFn<B, ((), B)> for F
impl<F, Fut, B> MakeHeaderValueFn<B, ((), B)> for F
§impl<F, Fut, B> MakeHeaderValueFn<B, ()> for F
impl<F, Fut, B> MakeHeaderValueFn<B, ()> for F
§impl<F, Fut, B> MakeHeaderValueFn<B, ()> for F
impl<F, Fut, B> MakeHeaderValueFn<B, ()> for F
§impl<F, Fut, B> MakeHeaderValueFn<B, Response<B>> for F
impl<F, Fut, B> MakeHeaderValueFn<B, Response<B>> for F
§impl<T, V, F> MakeVisitor<T> for F
impl<T, V, F> MakeVisitor<T> for F
§fn make_visitor(&self, target: T) -> <F as MakeVisitor<T>>::Visitor
fn make_visitor(&self, target: T) -> <F as MakeVisitor<T>>::Visitor
target.§impl<'a, F, W> MakeWriter<'a> for F
impl<'a, F, W> MakeWriter<'a> for F
§type Writer = W
type Writer = W
io::Write implementation returned by make_writer.§fn make_writer(&'a self) -> <F as MakeWriter<'a>>::Writer
fn make_writer(&'a self) -> <F as MakeWriter<'a>>::Writer
§impl<'a, M> MakeWriterExt<'a> for Mwhere
M: MakeWriter<'a>,
impl<'a, M> MakeWriterExt<'a> for Mwhere
M: MakeWriter<'a>,
§fn with_max_level(self, level: Level) -> WithMaxLevel<Self>where
Self: Sized,
fn with_max_level(self, level: Level) -> WithMaxLevel<Self>where
Self: Sized,
§fn with_min_level(self, level: Level) -> WithMinLevel<Self>where
Self: Sized,
fn with_min_level(self, level: Level) -> WithMinLevel<Self>where
Self: Sized,
§fn with_filter<F>(self, filter: F) -> WithFilter<Self, F>
fn with_filter<F>(self, filter: F) -> WithFilter<Self, F>
§fn or_else<W, B>(self, other: B) -> OrElse<Self, B>
fn or_else<W, B>(self, other: B) -> OrElse<Self, B>
self with another type implementing [MakeWriter], returning
a new [MakeWriter] that calls other’s make_writer if self’s
make_writer returns OptionalWriter::none. Read moreimpl<F, Request> MatchFn<Request, ((), ())> for F
impl<F, Request> MatchFn<Request, ((), (Request,))> for F
impl<F, Request> MatchFn<Request, ((Extensions,), ())> for F
impl<F, Request> MatchFn<Request, ((Extensions,), (Request,))> for F
impl<I, O, E, P> ModalParser<I, O, E> for Pwhere
P: Parser<I, O, ErrMode<E>>,
impl<I, O, E, P> ModalParser<I, O, E> for Pwhere
P: Parser<I, O, ErrMode<E>>,
§impl<IT> MultiUnzip<()> for IT
impl<IT> MultiUnzip<()> for IT
§fn multiunzip(self)
fn multiunzip(self)
§impl<IT> MultiUnzip<()> for IT
impl<IT> MultiUnzip<()> for IT
§fn multiunzip(self)
fn multiunzip(self)
§impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
§fn multiunzip(self) -> (FromA, FromB)
fn multiunzip(self) -> (FromA, FromB)
§impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for IT
§fn multiunzip(self) -> (FromA, FromB)
fn multiunzip(self) -> (FromA, FromB)
§impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for IT
impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC)
fn multiunzip(self) -> (FromA, FromB, FromC)
§impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for IT
impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC)
fn multiunzip(self) -> (FromA, FromB, FromC)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for IT
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for IT
§fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
FromL: Default + Extend<L>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
FromL: Default + Extend<L>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)
§impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
FromL: Default + Extend<L>,
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for ITwhere
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
FromL: Default + Extend<L>,
§fn multiunzip(
self,
) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)
fn multiunzip( self, ) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)
§impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
§fn multiunzip(self) -> (FromA,)
fn multiunzip(self) -> (FromA,)
§impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
impl<IT, A, FromA> MultiUnzip<(FromA,)> for IT
§fn multiunzip(self) -> (FromA,)
fn multiunzip(self) -> (FromA,)
impl<T> NumBytes for T
§impl<B, F> OnBodyChunk<B> for F
impl<B, F> OnBodyChunk<B> for F
§impl<F, FailureClass> OnFailure<FailureClass> for F
impl<F, FailureClass> OnFailure<FailureClass> for F
§fn on_failure(
&self,
failure_classification: FailureClass,
latency: Duration,
span: &Span,
)
fn on_failure( &self, failure_classification: FailureClass, latency: Duration, span: &Span, )
§impl<B, F> OnRequest<B> for F
impl<B, F> OnRequest<B> for F
§fn on_request(&self, request: &Request<B>, span: &Span)
fn on_request(&self, request: &Request<B>, span: &Span)
§impl<B, F> OnResponse<B> for F
impl<B, F> OnResponse<B> for F
impl<T> Parsable for T
Source§impl<F, T> Parser for F
impl<F, T> Parser for F
type Output = T
Source§fn parse2(self, tokens: TokenStream) -> Result<T, Error>
fn parse2(self, tokens: TokenStream) -> Result<T, Error>
fn __parse_scoped( self, scope: Span, tokens: TokenStream, ) -> Result<<F as Parser>::Output, Error>
Source§impl<F, T> Parser for F
impl<F, T> Parser for F
type Output = T
Source§fn parse2(self, tokens: TokenStream) -> Result<T, Error>
fn parse2(self, tokens: TokenStream) -> Result<T, Error>
fn __parse_scoped( self, scope: Span, tokens: TokenStream, ) -> Result<<F as Parser>::Output, Error>
§impl<I, O, E, F> Parser<I, O, E> for F
impl<I, O, E, F> Parser<I, O, E> for F
§fn parse_next(&mut self, i: &mut I) -> Result<O, E>
fn parse_next(&mut self, i: &mut I) -> Result<O, E>
Stream], turning it into the output Read more§fn parse(
&mut self,
input: I,
) -> Result<O, ParseError<I, <E as ParserError<I>>::Inner>>where
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
fn parse(
&mut self,
input: I,
) -> Result<O, ParseError<I, <E as ParserError<I>>::Inner>>where
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
§fn parse_iter(&mut self, input: I) -> ParseIter<'_, Self, I, O, E> ⓘwhere
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
fn parse_iter(&mut self, input: I) -> ParseIter<'_, Self, I, O, E> ⓘwhere
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
§fn parse_peek(&mut self, input: I) -> Result<(I, O), E>
fn parse_peek(&mut self, input: I) -> Result<(I, O), E>
Stream], turning it into the output Read more§fn by_ref(&mut self) -> ByRef<'_, Self, I, O, E>where
Self: Sized,
fn by_ref(&mut self) -> ByRef<'_, Self, I, O, E>where
Self: Sized,
&mut Self as a parser Read more§fn default_value<O2>(self) -> DefaultValue<Self, I, O, O2, E>
fn default_value<O2>(self) -> DefaultValue<Self, I, O, O2, E>
§fn output_into<O2>(self) -> OutputInto<Self, I, O, O2, E>
fn output_into<O2>(self) -> OutputInto<Self, I, O, O2, E>
std::convert::From Read more§fn take(self) -> Take<Self, I, O, E>where
Self: Sized,
I: Stream,
fn take(self) -> Take<Self, I, O, E>where
Self: Sized,
I: Stream,
§fn with_taken(self) -> WithTaken<Self, I, O, E>where
Self: Sized,
I: Stream,
fn with_taken(self) -> WithTaken<Self, I, O, E>where
Self: Sized,
I: Stream,
§fn span(self) -> Span<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
fn span(self) -> Span<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
§fn with_span(self) -> WithSpan<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
fn with_span(self) -> WithSpan<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
§fn map<G, O2>(self, map: G) -> Map<Self, G, I, O, O2, E>
fn map<G, O2>(self, map: G) -> Map<Self, G, I, O, O2, E>
§fn try_map<G, O2, E2>(self, map: G) -> TryMap<Self, G, I, O, O2, E, E2>
fn try_map<G, O2, E2>(self, map: G) -> TryMap<Self, G, I, O, O2, E, E2>
Result over the output of a parser. Read more§fn verify_map<G, O2>(self, map: G) -> VerifyMap<Self, G, I, O, O2, E>
fn verify_map<G, O2>(self, map: G) -> VerifyMap<Self, G, I, O, O2, E>
§fn flat_map<G, H, O2>(self, map: G) -> FlatMap<Self, G, H, I, O, O2, E>
fn flat_map<G, H, O2>(self, map: G) -> FlatMap<Self, G, H, I, O, O2, E>
§fn and_then<G, O2>(self, inner: G) -> AndThen<Self, G, I, O, O2, E>where
Self: Sized,
G: Parser<O, O2, E>,
O: StreamIsPartial,
I: Stream,
fn and_then<G, O2>(self, inner: G) -> AndThen<Self, G, I, O, O2, E>where
Self: Sized,
G: Parser<O, O2, E>,
O: StreamIsPartial,
I: Stream,
§fn parse_to<O2>(self) -> ParseTo<Self, I, O, O2, E>where
Self: Sized,
I: Stream,
O: ParseSlice<O2>,
E: ParserError<I>,
fn parse_to<O2>(self) -> ParseTo<Self, I, O, O2, E>where
Self: Sized,
I: Stream,
O: ParseSlice<O2>,
E: ParserError<I>,
std::str::FromStr to the output of the parser Read more§fn verify<G, O2>(self, filter: G) -> Verify<Self, G, I, O, O2, E>
fn verify<G, O2>(self, filter: G) -> Verify<Self, G, I, O, O2, E>
§fn context<C>(self, context: C) -> Context<Self, I, O, E, C>
fn context<C>(self, context: C) -> Context<Self, I, O, E, C>
§fn context_with<F, C, FI>(
self,
context: F,
) -> ContextWith<Self, I, O, E, F, C, FI>
fn context_with<F, C, FI>( self, context: F, ) -> ContextWith<Self, I, O, E, F, C, FI>
§fn map_err<G, E2>(self, map: G) -> MapErr<Self, G, I, O, E, E2>
fn map_err<G, E2>(self, map: G) -> MapErr<Self, G, I, O, E, E2>
§fn complete_err(self) -> CompleteErr<Self, I, O, E>where
Self: Sized,
fn complete_err(self) -> CompleteErr<Self, I, O, E>where
Self: Sized,
Incomplete][crate::error::ErrMode::Incomplete] into [Backtrack][crate::error::ErrMode::Backtrack] Read more§fn err_into<E2>(self) -> ErrInto<Self, I, O, E, E2>
fn err_into<E2>(self) -> ErrInto<Self, I, O, E, E2>
std::convert::From§impl<I, O, E, F> Parser<I, O, E> for F
impl<I, O, E, F> Parser<I, O, E> for F
§fn parse_next(&mut self, i: &mut I) -> Result<O, E>
fn parse_next(&mut self, i: &mut I) -> Result<O, E>
Stream], turning it into the output Read more§fn parse(
&mut self,
input: I,
) -> Result<O, ParseError<I, <E as ParserError<I>>::Inner>>where
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
fn parse(
&mut self,
input: I,
) -> Result<O, ParseError<I, <E as ParserError<I>>::Inner>>where
Self: Sized,
I: Stream + StreamIsPartial,
E: ParserError<I>,
<E as ParserError<I>>::Inner: ParserError<I>,
§fn parse_peek(&mut self, input: I) -> Result<(I, O), E>
fn parse_peek(&mut self, input: I) -> Result<(I, O), E>
Stream], turning it into the output Read more§fn by_ref(&mut self) -> ByRef<'_, Self, I, O, E>where
Self: Sized,
fn by_ref(&mut self) -> ByRef<'_, Self, I, O, E>where
Self: Sized,
&mut Self as a parser Read more§fn default_value<O2>(self) -> DefaultValue<Self, I, O, O2, E>
fn default_value<O2>(self) -> DefaultValue<Self, I, O, O2, E>
§fn output_into<O2>(self) -> OutputInto<Self, I, O, O2, E>
fn output_into<O2>(self) -> OutputInto<Self, I, O, O2, E>
std::convert::From] Read more§fn take(self) -> Take<Self, I, O, E>where
Self: Sized,
I: Stream,
fn take(self) -> Take<Self, I, O, E>where
Self: Sized,
I: Stream,
§fn with_taken(self) -> WithTaken<Self, I, O, E>where
Self: Sized,
I: Stream,
fn with_taken(self) -> WithTaken<Self, I, O, E>where
Self: Sized,
I: Stream,
§fn span(self) -> Span<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
fn span(self) -> Span<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
§fn with_span(self) -> WithSpan<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
fn with_span(self) -> WithSpan<Self, I, O, E>where
Self: Sized,
I: Stream + Location,
§fn map<G, O2>(self, map: G) -> Map<Self, G, I, O, O2, E>
fn map<G, O2>(self, map: G) -> Map<Self, G, I, O, O2, E>
§fn try_map<G, O2, E2>(self, map: G) -> TryMap<Self, G, I, O, O2, E, E2>
fn try_map<G, O2, E2>(self, map: G) -> TryMap<Self, G, I, O, O2, E, E2>
Result over the output of a parser. Read more§fn verify_map<G, O2>(self, map: G) -> VerifyMap<Self, G, I, O, O2, E>
fn verify_map<G, O2>(self, map: G) -> VerifyMap<Self, G, I, O, O2, E>
§fn flat_map<G, H, O2>(self, map: G) -> FlatMap<Self, G, H, I, O, O2, E>
fn flat_map<G, H, O2>(self, map: G) -> FlatMap<Self, G, H, I, O, O2, E>
§fn and_then<G, O2>(self, inner: G) -> AndThen<Self, G, I, O, O2, E>where
Self: Sized,
G: Parser<O, O2, E>,
O: StreamIsPartial,
I: Stream,
fn and_then<G, O2>(self, inner: G) -> AndThen<Self, G, I, O, O2, E>where
Self: Sized,
G: Parser<O, O2, E>,
O: StreamIsPartial,
I: Stream,
§fn parse_to<O2>(self) -> ParseTo<Self, I, O, O2, E>where
Self: Sized,
I: Stream,
O: ParseSlice<O2>,
E: ParserError<I>,
fn parse_to<O2>(self) -> ParseTo<Self, I, O, O2, E>where
Self: Sized,
I: Stream,
O: ParseSlice<O2>,
E: ParserError<I>,
std::str::FromStr] to the output of the parser Read more§fn verify<G, O2>(self, filter: G) -> Verify<Self, G, I, O, O2, E>
fn verify<G, O2>(self, filter: G) -> Verify<Self, G, I, O, O2, E>
§fn context<C>(self, context: C) -> Context<Self, I, O, E, C>
fn context<C>(self, context: C) -> Context<Self, I, O, E, C>
§fn context_with<F, C, FI>(
self,
context: F,
) -> ContextWith<Self, I, O, E, F, C, FI>
fn context_with<F, C, FI>( self, context: F, ) -> ContextWith<Self, I, O, E, F, C, FI>
§fn map_err<G, E2>(self, map: G) -> MapErr<Self, G, I, O, E, E2>
fn map_err<G, E2>(self, map: G) -> MapErr<Self, G, I, O, E, E2>
§fn complete_err(self) -> CompleteErr<Self, I, O, E>where
Self: Sized,
fn complete_err(self) -> CompleteErr<Self, I, O, E>where
Self: Sized,
Incomplete][crate::error::ErrMode::Incomplete] into [Backtrack][crate::error::ErrMode::Backtrack] Read more§impl<'a, I, O, E, F> Parser<I, O, E> for F
impl<'a, I, O, E, F> Parser<I, O, E> for F
§fn parse(&mut self, i: I) -> Result<(I, O), Err<E>>
fn parse(&mut self, i: I) -> Result<(I, O), Err<E>>
Result containing
either the remaining input and the output value, or an error§fn flat_map<G, H, O2>(self, g: G) -> FlatMap<Self, G, O>
fn flat_map<G, H, O2>(self, g: G) -> FlatMap<Self, G, O>
§fn and_then<G, O2>(self, g: G) -> AndThen<Self, G, O>
fn and_then<G, O2>(self, g: G) -> AndThen<Self, G, O>
§fn and<G, O2>(self, g: G) -> And<Self, G>
fn and<G, O2>(self, g: G) -> And<Self, G>
§impl<I, O, E, F> Parser<I> for F
impl<I, O, E, F> Parser<I> for F
§fn process<OM>(
&mut self,
i: I,
) -> Result<(I, <<OM as OutputMode>::Output as Mode>::Output<<F as Parser<I>>::Output>), Err<<F as Parser<I>>::Error, <<OM as OutputMode>::Error as Mode>::Output<<F as Parser<I>>::Error>>>where
OM: OutputMode,
fn process<OM>(
&mut self,
i: I,
) -> Result<(I, <<OM as OutputMode>::Output as Mode>::Output<<F as Parser<I>>::Output>), Err<<F as Parser<I>>::Error, <<OM as OutputMode>::Error as Mode>::Output<<F as Parser<I>>::Error>>>where
OM: OutputMode,
Result containing
either the remaining input and the output value, or an error§fn parse(
&mut self,
input: Input,
) -> Result<(Input, Self::Output), Err<Self::Error>>
fn parse( &mut self, input: Input, ) -> Result<(Input, Self::Output), Err<Self::Error>>
Result containing
either the remaining input and the output value, or an error§fn parse_complete(
&mut self,
input: Input,
) -> Result<(Input, Self::Output), Err<Self::Error>>
fn parse_complete( &mut self, input: Input, ) -> Result<(Input, Self::Output), Err<Self::Error>>
Result containing
either the remaining input and the output value, or an error§fn map_res<G, O2, E2>(self, g: G) -> MapRes<Self, G>
fn map_res<G, O2, E2>(self, g: G) -> MapRes<Self, G>
Result over the result of a parser.§fn map_opt<G, O2>(self, g: G) -> MapOpt<Self, G>
fn map_opt<G, O2>(self, g: G) -> MapOpt<Self, G>
Option over the result of a parser.§fn flat_map<G, H>(self, g: G) -> FlatMap<Self, G>
fn flat_map<G, H>(self, g: G) -> FlatMap<Self, G>
§fn and_then<G>(self, g: G) -> AndThen<Self, G>where
G: Parser<Self::Output, Error = Self::Error>,
Self: Sized,
fn and_then<G>(self, g: G) -> AndThen<Self, G>where
G: Parser<Self::Output, Error = Self::Error>,
Self: Sized,
§fn and<G, O2>(self, g: G) -> And<Self, G>where
G: Parser<Input, Output = O2, Error = Self::Error>,
Self: Sized,
fn and<G, O2>(self, g: G) -> And<Self, G>where
G: Parser<Input, Output = O2, Error = Self::Error>,
Self: Sized,
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)§impl<T> PeekIoProvider for Twhere
T: Io,
impl<T> PeekIoProvider for Twhere
T: Io,
§type Mapped<PeekedIo: Io> = PeekedIo
type Mapped<PeekedIo: Io> = PeekedIo
Self type produced as a result of
mapping the PeekIo type.§fn peek_io_mut(&mut self) -> &mut <T as PeekIoProvider>::PeekIo
fn peek_io_mut(&mut self) -> &mut <T as PeekIoProvider>::PeekIo
§fn map_peek_io<PeekedIo, F>(
self,
map: F,
) -> <T as PeekIoProvider>::Mapped<PeekedIo>
fn map_peek_io<PeekedIo, F>( self, map: F, ) -> <T as PeekIoProvider>::Mapped<PeekedIo>
self
by mapping the Peeked Io type and produce a new type,
usually with the peeked data in-memory as prefix.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§fn and<P, B, E>(self, other: P) -> And<T, P>
fn and<P, B, E>(self, other: P) -> And<T, P>
Policy that returns Action::Follow only if self and other return
Action::Follow. Read more§impl<F> ProxyQueryPredicate for F
impl<F> ProxyQueryPredicate for F
§impl<T, U> RamaTryFrom<T> for Uwhere
U: TryFrom<T>,
impl<T, U> RamaTryFrom<T> for Uwhere
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
fn rama_try_from(value: T) -> Result<U, <U as RamaTryFrom<T>>::Error>
§impl<T, U, CrateMarker> RamaTryInto<U, CrateMarker> for Twhere
U: RamaTryFrom<T, CrateMarker>,
impl<T, U, CrateMarker> RamaTryInto<U, CrateMarker> for Twhere
U: RamaTryFrom<T, CrateMarker>,
type Error = <U as RamaTryFrom<T, CrateMarker>>::Error
fn rama_try_into(self) -> Result<U, <U as RamaTryFrom<T, CrateMarker>>::Error>
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§impl<R> ReadBytesExt for R
impl<R> ReadBytesExt for R
§fn read_u8(&mut self) -> Result<u8, Error>
fn read_u8(&mut self) -> Result<u8, Error>
§fn read_i8(&mut self) -> Result<i8, Error>
fn read_i8(&mut self) -> Result<i8, Error>
§fn read_u16<T>(&mut self) -> Result<u16, Error>where
T: ByteOrder,
fn read_u16<T>(&mut self) -> Result<u16, Error>where
T: ByteOrder,
§fn read_i16<T>(&mut self) -> Result<i16, Error>where
T: ByteOrder,
fn read_i16<T>(&mut self) -> Result<i16, Error>where
T: ByteOrder,
§fn read_u24<T>(&mut self) -> Result<u32, Error>where
T: ByteOrder,
fn read_u24<T>(&mut self) -> Result<u32, Error>where
T: ByteOrder,
§fn read_i24<T>(&mut self) -> Result<i32, Error>where
T: ByteOrder,
fn read_i24<T>(&mut self) -> Result<i32, Error>where
T: ByteOrder,
§fn read_u32<T>(&mut self) -> Result<u32, Error>where
T: ByteOrder,
fn read_u32<T>(&mut self) -> Result<u32, Error>where
T: ByteOrder,
§fn read_i32<T>(&mut self) -> Result<i32, Error>where
T: ByteOrder,
fn read_i32<T>(&mut self) -> Result<i32, Error>where
T: ByteOrder,
§fn read_u48<T>(&mut self) -> Result<u64, Error>where
T: ByteOrder,
fn read_u48<T>(&mut self) -> Result<u64, Error>where
T: ByteOrder,
§fn read_i48<T>(&mut self) -> Result<i64, Error>where
T: ByteOrder,
fn read_i48<T>(&mut self) -> Result<i64, Error>where
T: ByteOrder,
§fn read_u64<T>(&mut self) -> Result<u64, Error>where
T: ByteOrder,
fn read_u64<T>(&mut self) -> Result<u64, Error>where
T: ByteOrder,
§fn read_i64<T>(&mut self) -> Result<i64, Error>where
T: ByteOrder,
fn read_i64<T>(&mut self) -> Result<i64, Error>where
T: ByteOrder,
§fn read_u128<T>(&mut self) -> Result<u128, Error>where
T: ByteOrder,
fn read_u128<T>(&mut self) -> Result<u128, Error>where
T: ByteOrder,
§fn read_i128<T>(&mut self) -> Result<i128, Error>where
T: ByteOrder,
fn read_i128<T>(&mut self) -> Result<i128, Error>where
T: ByteOrder,
§fn read_uint<T>(&mut self, nbytes: usize) -> Result<u64, Error>where
T: ByteOrder,
fn read_uint<T>(&mut self, nbytes: usize) -> Result<u64, Error>where
T: ByteOrder,
§fn read_int<T>(&mut self, nbytes: usize) -> Result<i64, Error>where
T: ByteOrder,
fn read_int<T>(&mut self, nbytes: usize) -> Result<i64, Error>where
T: ByteOrder,
§fn read_uint128<T>(&mut self, nbytes: usize) -> Result<u128, Error>where
T: ByteOrder,
fn read_uint128<T>(&mut self, nbytes: usize) -> Result<u128, Error>where
T: ByteOrder,
§fn read_int128<T>(&mut self, nbytes: usize) -> Result<i128, Error>where
T: ByteOrder,
fn read_int128<T>(&mut self, nbytes: usize) -> Result<i128, Error>where
T: ByteOrder,
§fn read_f32<T>(&mut self) -> Result<f32, Error>where
T: ByteOrder,
fn read_f32<T>(&mut self) -> Result<f32, Error>where
T: ByteOrder,
§fn read_f64<T>(&mut self) -> Result<f64, Error>where
T: ByteOrder,
fn read_f64<T>(&mut self) -> Result<f64, Error>where
T: ByteOrder,
§fn read_u16_into<T>(&mut self, dst: &mut [u16]) -> Result<(), Error>where
T: ByteOrder,
fn read_u16_into<T>(&mut self, dst: &mut [u16]) -> Result<(), Error>where
T: ByteOrder,
§fn read_u32_into<T>(&mut self, dst: &mut [u32]) -> Result<(), Error>where
T: ByteOrder,
fn read_u32_into<T>(&mut self, dst: &mut [u32]) -> Result<(), Error>where
T: ByteOrder,
§fn read_u64_into<T>(&mut self, dst: &mut [u64]) -> Result<(), Error>where
T: ByteOrder,
fn read_u64_into<T>(&mut self, dst: &mut [u64]) -> Result<(), Error>where
T: ByteOrder,
§fn read_u128_into<T>(&mut self, dst: &mut [u128]) -> Result<(), Error>where
T: ByteOrder,
fn read_u128_into<T>(&mut self, dst: &mut [u128]) -> Result<(), Error>where
T: ByteOrder,
§fn read_i8_into(&mut self, dst: &mut [i8]) -> Result<(), Error>
fn read_i8_into(&mut self, dst: &mut [i8]) -> Result<(), Error>
§fn read_i16_into<T>(&mut self, dst: &mut [i16]) -> Result<(), Error>where
T: ByteOrder,
fn read_i16_into<T>(&mut self, dst: &mut [i16]) -> Result<(), Error>where
T: ByteOrder,
§fn read_i32_into<T>(&mut self, dst: &mut [i32]) -> Result<(), Error>where
T: ByteOrder,
fn read_i32_into<T>(&mut self, dst: &mut [i32]) -> Result<(), Error>where
T: ByteOrder,
§fn read_i64_into<T>(&mut self, dst: &mut [i64]) -> Result<(), Error>where
T: ByteOrder,
fn read_i64_into<T>(&mut self, dst: &mut [i64]) -> Result<(), Error>where
T: ByteOrder,
§fn read_i128_into<T>(&mut self, dst: &mut [i128]) -> Result<(), Error>where
T: ByteOrder,
fn read_i128_into<T>(&mut self, dst: &mut [i128]) -> Result<(), Error>where
T: ByteOrder,
§fn read_f32_into<T>(&mut self, dst: &mut [f32]) -> Result<(), Error>where
T: ByteOrder,
fn read_f32_into<T>(&mut self, dst: &mut [f32]) -> Result<(), Error>where
T: ByteOrder,
§fn read_f32_into_unchecked<T>(&mut self, dst: &mut [f32]) -> Result<(), Error>where
T: ByteOrder,
fn read_f32_into_unchecked<T>(&mut self, dst: &mut [f32]) -> Result<(), Error>where
T: ByteOrder,
please use read_f32_into instead
§impl<F, T> Replacer for F
impl<F, T> Replacer for F
§fn replace_append(&mut self, caps: &Captures<'_>, dst: &mut Vec<u8>)
fn replace_append(&mut self, caps: &Captures<'_>, dst: &mut Vec<u8>)
dst to replace the current match. Read more§fn no_expansion<'r>(&'r mut self) -> Option<Cow<'r, [u8]>>
fn no_expansion<'r>(&'r mut self) -> Option<Cow<'r, [u8]>>
§fn by_ref<'r>(&'r mut self) -> ReplacerRef<'r, Self>
fn by_ref<'r>(&'r mut self) -> ReplacerRef<'r, Self>
§impl<F, T> Replacer for F
impl<F, T> Replacer for F
§fn replace_append(&mut self, caps: &Captures<'_>, dst: &mut String)
fn replace_append(&mut self, caps: &Captures<'_>, dst: &mut String)
dst to replace the current match. Read more§fn no_expansion<'r>(&'r mut self) -> Option<Cow<'r, str>>
fn no_expansion<'r>(&'r mut self) -> Option<Cow<'r, str>>
§fn by_ref<'r>(&'r mut self) -> ReplacerRef<'r, Self>
fn by_ref<'r>(&'r mut self) -> ReplacerRef<'r, Self>
§impl<Input, ID, F> ReqToConnID<Input> for F
impl<Input, ID, F> ReqToConnID<Input> for F
§impl<F, Fut> RequestWriter for F
impl<F, Fut> RequestWriter for F
§async fn write_request(&self, req: Request)
async fn write_request(&self, req: Request)
§impl<F> ResponseForPanic for F
impl<F> ResponseForPanic for F
§impl<F, B> ResponseForProtectionError<B> for F
impl<F, B> ResponseForProtectionError<B> for F
§fn response_for_protection_error(&self, error: ProtectionError) -> Response<B>
fn response_for_protection_error(&self, error: ProtectionError) -> Response<B>
§impl<F, Fut> ResponseWriter for F
impl<F, Fut> ResponseWriter for F
§async fn write_response(&self, res: Response)
async fn write_response(&self, res: Response)
Source§impl<R> Rng for R
impl<R> Rng for R
Source§fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
StandardUniform distribution. Read moreSource§fn random_iter<T>(self) -> Iter<StandardUniform, Self, T> ⓘ
fn random_iter<T>(self) -> Iter<StandardUniform, Self, T> ⓘ
Source§fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
Source§fn random_bool(&mut self, p: f64) -> bool
fn random_bool(&mut self, p: f64) -> bool
p of being true. Read moreSource§fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
numerator/denominator of being
true. Read moreSource§fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
Source§fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T> ⓘwhere
D: Distribution<T>,
Self: Sized,
fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T> ⓘwhere
D: Distribution<T>,
Self: Sized,
Source§fn gen<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn gen<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
Renamed to random to avoid conflict with the new gen keyword in Rust 2024.
Rng::random.Source§fn gen_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn gen_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
Renamed to random_range
Rng::random_range.§impl<R> Rng for Rwhere
R: TryRng<Error = Infallible> + ?Sized,
impl<R> Rng for Rwhere
R: TryRng<Error = Infallible> + ?Sized,
impl<R> RngCore for Rwhere
R: Rng,
§impl<R> RngExt for Rwhere
R: Rng + ?Sized,
impl<R> RngExt for Rwhere
R: Rng + ?Sized,
§fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
StandardUniform distribution. Read more§fn random_iter<T>(self) -> Iter<StandardUniform, Self, T> ⓘwhere
Self: Sized,
StandardUniform: Distribution<T>,
fn random_iter<T>(self) -> Iter<StandardUniform, Self, T> ⓘwhere
Self: Sized,
StandardUniform: Distribution<T>,
§fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
§fn random_bool(&mut self, p: f64) -> bool
fn random_bool(&mut self, p: f64) -> bool
p of being true. Read more§fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
numerator/denominator of being
true. Read more§fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
§fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T> ⓘwhere
D: Distribution<T>,
Self: Sized,
fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T> ⓘwhere
D: Distribution<T>,
Self: Sized,
§impl<F> SelectionHandler for F
impl<F> SelectionHandler for F
§impl<T, S, M1, M2> ServerStreamingService<M1> for T
impl<T, S, M1, M2> ServerStreamingService<M1> for T
§type ResponseStream = S
type ResponseStream = S
§fn serve(
&self,
request: Request<M1>,
) -> impl Future<Output = Result<Response<<T as ServerStreamingService<M1>>::ResponseStream>, Status>>
fn serve( &self, request: Request<M1>, ) -> impl Future<Output = Result<Response<<T as ServerStreamingService<M1>>::ResponseStream>, Status>>
§impl<T, Item> SinkExt<Item> for T
impl<T, Item> SinkExt<Item> for T
§fn with<U, Fut, F, E>(self, f: F) -> With<Self, Item, U, Fut, F>
fn with<U, Fut, F, E>(self, f: F) -> With<Self, Item, U, Fut, F>
§fn with_flat_map<U, St, F>(self, f: F) -> WithFlatMap<Self, Item, U, St, F>
fn with_flat_map<U, St, F>(self, f: F) -> WithFlatMap<Self, Item, U, St, F>
§fn sink_map_err<E, F>(self, f: F) -> SinkMapErr<Self, F>
fn sink_map_err<E, F>(self, f: F) -> SinkMapErr<Self, F>
§fn sink_err_into<E>(self) -> SinkErrInto<Self, Item, E>
fn sink_err_into<E>(self) -> SinkErrInto<Self, Item, E>
Into trait. Read more§fn buffer(self, capacity: usize) -> Buffer<Self, Item>where
Self: Sized,
fn buffer(self, capacity: usize) -> Buffer<Self, Item>where
Self: Sized,
alloc only.§fn flush(&mut self) -> Flush<'_, Self, Item> ⓘwhere
Self: Unpin,
fn flush(&mut self) -> Flush<'_, Self, Item> ⓘwhere
Self: Unpin,
§fn send(&mut self, item: Item) -> Send<'_, Self, Item> ⓘwhere
Self: Unpin,
fn send(&mut self, item: Item) -> Send<'_, Self, Item> ⓘwhere
Self: Unpin,
§fn feed(&mut self, item: Item) -> Feed<'_, Self, Item> ⓘwhere
Self: Unpin,
fn feed(&mut self, item: Item) -> Feed<'_, Self, Item> ⓘwhere
Self: Unpin,
§fn send_all<'a, St>(&'a mut self, stream: &'a mut St) -> SendAll<'a, Self, St> ⓘ
fn send_all<'a, St>(&'a mut self, stream: &'a mut St) -> SendAll<'a, Self, St> ⓘ
§fn right_sink<Si1>(self) -> Either<Si1, Self> ⓘ
fn right_sink<Si1>(self) -> Either<Si1, Self> ⓘ
§fn poll_ready_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Self::Error>>where
Self: Unpin,
fn poll_ready_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Self::Error>>where
Self: Unpin,
Sink::poll_ready on Unpin
sink types.§fn start_send_unpin(&mut self, item: Item) -> Result<(), Self::Error>where
Self: Unpin,
fn start_send_unpin(&mut self, item: Item) -> Result<(), Self::Error>where
Self: Unpin,
Sink::start_send on Unpin
sink types.§fn poll_flush_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Self::Error>>where
Self: Unpin,
fn poll_flush_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Self::Error>>where
Self: Unpin,
Sink::poll_flush on Unpin
sink types.§fn poll_close_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Self::Error>>where
Self: Unpin,
fn poll_close_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<(), Self::Error>>where
Self: Unpin,
Sink::poll_close on Unpin
sink types.§impl<S, Socket> SocketService for S
impl<S, Socket> SocketService for S
§type Socket = Socket
type Socket = Socket
SocketService§type Error = <S as Service<SocketAddress>>::Error
type Error = <S as Service<SocketAddress>>::Error
§fn bind_socket_with_address(
&self,
addr: impl Into<SocketAddress>,
) -> impl Future<Output = Result<<S as SocketService>::Socket, <S as SocketService>::Error>> + Send
fn bind_socket_with_address( &self, addr: impl Into<SocketAddress>, ) -> impl Future<Output = Result<<S as SocketService>::Socket, <S as SocketService>::Error>> + Send
Source§impl<T> Spanned for Twhere
T: Spanned + ?Sized,
impl<T> Spanned for Twhere
T: Spanned + ?Sized,
Source§fn span(&self) -> Span
fn span(&self) -> Span
Span covering the complete contents of this syntax tree
node, or Span::call_site() if this node is empty.Source§impl<T> Spanned for Twhere
T: Spanned + ?Sized,
impl<T> Spanned for Twhere
T: Spanned + ?Sized,
Source§fn span(&self) -> Span
fn span(&self) -> Span
Span covering the complete contents of this syntax tree
node, or Span::call_site() if this node is empty.§impl<Sp> SpawnExt for Sp
impl<Sp> SpawnExt for Sp
§fn spawn<Fut>(&self, future: Fut) -> Result<(), SpawnError>
fn spawn<Fut>(&self, future: Fut) -> Result<(), SpawnError>
alloc only.() to
completion. Read more§fn spawn_with_handle<Fut>(
&self,
future: Fut,
) -> Result<RemoteHandle<<Fut as Future>::Output>, SpawnError>
fn spawn_with_handle<Fut>( &self, future: Fut, ) -> Result<RemoteHandle<<Fut as Future>::Output>, SpawnError>
channel and std only.§impl<T> StreamExt for T
impl<T> StreamExt for T
§fn next(&mut self) -> Next<'_, Self> ⓘwhere
Self: Unpin,
fn next(&mut self) -> Next<'_, Self> ⓘwhere
Self: Unpin,
§fn into_future(self) -> StreamFuture<Self> ⓘ
fn into_future(self) -> StreamFuture<Self> ⓘ
§fn map<T, F>(self, f: F) -> Map<Self, F>
fn map<T, F>(self, f: F) -> Map<Self, F>
§fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
fn enumerate(self) -> Enumerate<Self>where
Self: Sized,
§fn filter<Fut, F>(self, f: F) -> Filter<Self, Fut, F>
fn filter<Fut, F>(self, f: F) -> Filter<Self, Fut, F>
§fn filter_map<Fut, T, F>(self, f: F) -> FilterMap<Self, Fut, F>
fn filter_map<Fut, T, F>(self, f: F) -> FilterMap<Self, Fut, F>
§fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F>
fn then<Fut, F>(self, f: F) -> Then<Self, Fut, F>
§fn collect<C>(self) -> Collect<Self, C> ⓘ
fn collect<C>(self) -> Collect<Self, C> ⓘ
§fn unzip<A, B, FromA, FromB>(self) -> Unzip<Self, FromA, FromB> ⓘ
fn unzip<A, B, FromA, FromB>(self) -> Unzip<Self, FromA, FromB> ⓘ
§fn concat(self) -> Concat<Self> ⓘ
fn concat(self) -> Concat<Self> ⓘ
§fn count(self) -> Count<Self> ⓘwhere
Self: Sized,
fn count(self) -> Count<Self> ⓘwhere
Self: Sized,
§fn fold<T, Fut, F>(self, init: T, f: F) -> Fold<Self, Fut, T, F> ⓘ
fn fold<T, Fut, F>(self, init: T, f: F) -> Fold<Self, Fut, T, F> ⓘ
§fn any<Fut, F>(self, f: F) -> Any<Self, Fut, F> ⓘ
fn any<Fut, F>(self, f: F) -> Any<Self, Fut, F> ⓘ
true if any element in stream satisfied a predicate. Read more§fn all<Fut, F>(self, f: F) -> All<Self, Fut, F> ⓘ
fn all<Fut, F>(self, f: F) -> All<Self, Fut, F> ⓘ
true if all element in stream satisfied a predicate. Read more§fn flatten(self) -> Flatten<Self>
fn flatten(self) -> Flatten<Self>
§fn flatten_unordered(
self,
limit: impl Into<Option<usize>>,
) -> FlattenUnorderedWithFlowController<Self, ()>
fn flatten_unordered( self, limit: impl Into<Option<usize>>, ) -> FlattenUnorderedWithFlowController<Self, ()>
target_has_atomic=ptr and crate feature alloc only.§fn flat_map_unordered<U, F>(
self,
limit: impl Into<Option<usize>>,
f: F,
) -> FlatMapUnordered<Self, U, F>
fn flat_map_unordered<U, F>( self, limit: impl Into<Option<usize>>, f: F, ) -> FlatMapUnordered<Self, U, F>
target_has_atomic=ptr and crate feature alloc only.StreamExt::map but flattens nested Streams
and polls them concurrently, yielding items in any order, as they made
available. Read more§fn scan<S, B, Fut, F>(self, initial_state: S, f: F) -> Scan<Self, S, Fut, F>
fn scan<S, B, Fut, F>(self, initial_state: S, f: F) -> Scan<Self, S, Fut, F>
StreamExt::fold that holds internal state
and produces a new stream. Read more§fn skip_while<Fut, F>(self, f: F) -> SkipWhile<Self, Fut, F>
fn skip_while<Fut, F>(self, f: F) -> SkipWhile<Self, Fut, F>
true. Read more§fn take_while<Fut, F>(self, f: F) -> TakeWhile<Self, Fut, F>
fn take_while<Fut, F>(self, f: F) -> TakeWhile<Self, Fut, F>
true. Read more§fn take_until<Fut>(self, fut: Fut) -> TakeUntil<Self, Fut>
fn take_until<Fut>(self, fut: Fut) -> TakeUntil<Self, Fut>
§fn for_each<Fut, F>(self, f: F) -> ForEach<Self, Fut, F> ⓘ
fn for_each<Fut, F>(self, f: F) -> ForEach<Self, Fut, F> ⓘ
§fn for_each_concurrent<Fut, F>(
self,
limit: impl Into<Option<usize>>,
f: F,
) -> ForEachConcurrent<Self, Fut, F> ⓘ
fn for_each_concurrent<Fut, F>( self, limit: impl Into<Option<usize>>, f: F, ) -> ForEachConcurrent<Self, Fut, F> ⓘ
target_has_atomic=ptr and crate feature alloc only.§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
n items of the underlying stream. Read more§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
n items of the underlying stream. Read more§fn catch_unwind(self) -> CatchUnwind<Self>where
Self: Sized + UnwindSafe,
fn catch_unwind(self) -> CatchUnwind<Self>where
Self: Sized + UnwindSafe,
std only.§fn boxed<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + Send + 'a>>
fn boxed<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + Send + 'a>>
alloc only.§fn boxed_local<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + 'a>>where
Self: Sized + 'a,
fn boxed_local<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + 'a>>where
Self: Sized + 'a,
alloc only.§fn buffered(self, n: usize) -> Buffered<Self>
fn buffered(self, n: usize) -> Buffered<Self>
target_has_atomic=ptr and crate feature alloc only.§fn buffer_unordered(self, n: usize) -> BufferUnordered<Self>
fn buffer_unordered(self, n: usize) -> BufferUnordered<Self>
target_has_atomic=ptr and crate feature alloc only.§fn peekable(self) -> Peekable<Self>where
Self: Sized,
fn peekable(self) -> Peekable<Self>where
Self: Sized,
peek method. Read more§fn chunks(self, capacity: usize) -> Chunks<Self>where
Self: Sized,
fn chunks(self, capacity: usize) -> Chunks<Self>where
Self: Sized,
alloc only.§fn ready_chunks(self, capacity: usize) -> ReadyChunks<Self>where
Self: Sized,
fn ready_chunks(self, capacity: usize) -> ReadyChunks<Self>where
Self: Sized,
alloc only.§fn forward<S>(self, sink: S) -> Forward<Self, S> ⓘ
fn forward<S>(self, sink: S) -> Forward<Self, S> ⓘ
sink only.§fn split<Item>(self) -> (SplitSink<Self, Item>, SplitStream<Self>)
fn split<Item>(self) -> (SplitSink<Self, Item>, SplitStream<Self>)
target_has_atomic=ptr and crate feature alloc and crate feature sink only.§fn inspect<F>(self, f: F) -> Inspect<Self, F>
fn inspect<F>(self, f: F) -> Inspect<Self, F>
§fn left_stream<B>(self) -> Either<Self, B> ⓘ
fn left_stream<B>(self) -> Either<Self, B> ⓘ
§fn right_stream<B>(self) -> Either<B, Self> ⓘ
fn right_stream<B>(self) -> Either<B, Self> ⓘ
§fn poll_next_unpin(&mut self, cx: &mut Context<'_>) -> Poll<Option<Self::Item>>where
Self: Unpin,
fn poll_next_unpin(&mut self, cx: &mut Context<'_>) -> Poll<Option<Self::Item>>where
Self: Unpin,
Stream::poll_next on Unpin
stream types.§fn select_next_some(&mut self) -> SelectNextSome<'_, Self> ⓘwhere
Self: Unpin + FusedStream,
fn select_next_some(&mut self) -> SelectNextSome<'_, Self> ⓘwhere
Self: Unpin + FusedStream,
§impl<St> StreamExt for St
impl<St> StreamExt for St
§fn next(&mut self) -> Next<'_, Self>where
Self: Unpin,
fn next(&mut self) -> Next<'_, Self>where
Self: Unpin,
None if the
stream is finished. Read more§fn try_next<T, E>(&mut self) -> TryNext<'_, Self>
fn try_next<T, E>(&mut self) -> TryNext<'_, Self>
§fn map<T, F>(self, f: F) -> Map<Self, F>
fn map<T, F>(self, f: F) -> Map<Self, F>
§fn map_while<T, F>(self, f: F) -> MapWhile<Self, F>
fn map_while<T, F>(self, f: F) -> MapWhile<Self, F>
None. Read more§fn then<F, Fut>(self, f: F) -> Then<Self, Fut, F>
fn then<F, Fut>(self, f: F) -> Then<Self, Fut, F>
§fn merge<U>(self, other: U) -> Merge<Self, U>
fn merge<U>(self, other: U) -> Merge<Self, U>
§fn filter<F>(self, f: F) -> Filter<Self, F>
fn filter<F>(self, f: F) -> Filter<Self, F>
§fn filter_map<T, F>(self, f: F) -> FilterMap<Self, F>
fn filter_map<T, F>(self, f: F) -> FilterMap<Self, F>
§fn fuse(self) -> Fuse<Self>where
Self: Sized,
fn fuse(self) -> Fuse<Self>where
Self: Sized,
None. Read more§fn take(self, n: usize) -> Take<Self>where
Self: Sized,
fn take(self, n: usize) -> Take<Self>where
Self: Sized,
n items of the underlying stream. Read more§fn take_while<F>(self, f: F) -> TakeWhile<Self, F>
fn take_while<F>(self, f: F) -> TakeWhile<Self, F>
true. Read more§fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
fn skip(self, n: usize) -> Skip<Self>where
Self: Sized,
n first items of the
underlying stream. Read more§fn skip_while<F>(self, f: F) -> SkipWhile<Self, F>
fn skip_while<F>(self, f: F) -> SkipWhile<Self, F>
true. Read more§fn all<F>(&mut self, f: F) -> AllFuture<'_, Self, F>
fn all<F>(&mut self, f: F) -> AllFuture<'_, Self, F>
§fn any<F>(&mut self, f: F) -> AnyFuture<'_, Self, F>
fn any<F>(&mut self, f: F) -> AnyFuture<'_, Self, F>
§fn chain<U>(self, other: U) -> Chain<Self, U>
fn chain<U>(self, other: U) -> Chain<Self, U>
§fn fold<B, F>(self, init: B, f: F) -> FoldFuture<Self, B, F>
fn fold<B, F>(self, init: B, f: F) -> FoldFuture<Self, B, F>
§fn collect<T>(
self,
) -> Collect<Self, T, <T as FromStreamPriv<Self::Item>>::InternalCollection>
fn collect<T>( self, ) -> Collect<Self, T, <T as FromStreamPriv<Self::Item>>::InternalCollection>
§fn timeout(self, duration: Duration) -> Timeout<Self>where
Self: Sized,
fn timeout(self, duration: Duration) -> Timeout<Self>where
Self: Sized,
time only.§fn timeout_repeating(self, interval: Interval) -> TimeoutRepeating<Self>where
Self: Sized,
fn timeout_repeating(self, interval: Interval) -> TimeoutRepeating<Self>where
Self: Sized,
time only.§fn throttle(self, duration: Duration) -> Throttle<Self>where
Self: Sized,
fn throttle(self, duration: Duration) -> Throttle<Self>where
Self: Sized,
time only.§fn chunks_timeout(
self,
max_size: usize,
duration: Duration,
) -> ChunksTimeout<Self>where
Self: Sized,
fn chunks_timeout(
self,
max_size: usize,
duration: Duration,
) -> ChunksTimeout<Self>where
Self: Sized,
time only.§impl<T, S, M1, M2> StreamingService<M1> for T
impl<T, S, M1, M2> StreamingService<M1> for T
§type ResponseStream = S
type ResponseStream = S
§fn serve(
&self,
request: Request<Streaming<M1>>,
) -> impl Future<Output = Result<Response<<T as StreamingService<M1>>::ResponseStream>, Status>>
fn serve( &self, request: Request<Streaming<M1>>, ) -> impl Future<Output = Result<Response<<T as StreamingService<M1>>::ResponseStream>, Status>>
§impl<S> SubscriberExt for Swhere
S: Subscriber,
impl<S> SubscriberExt for Swhere
S: Subscriber,
§impl<T> SubscriberInitExt for T
impl<T> SubscriberInitExt for T
§fn set_default(self) -> DefaultGuard
fn set_default(self) -> DefaultGuard
std only.self as the default subscriber in the current scope, returning a
guard that will unset it when dropped. Read more§fn try_init(self) -> Result<(), TryInitError>
fn try_init(self) -> Result<(), TryInitError>
self as the global default subscriber in the current
scope, returning an error if one is already set. Read more§fn init(self)
fn init(self)
self as the global default subscriber in the current
scope, panicking if this fails. Read more§impl<ConnectFn, ConnectFnFut, ConnectFnErr> TcpStreamConnector for ConnectFn
impl<ConnectFn, ConnectFnFut, ConnectFnErr> TcpStreamConnector for ConnectFn
§fn connect(
&self,
addr: SocketAddr,
) -> impl Future<Output = Result<TcpStream, <ConnectFn as TcpStreamConnector>::Error>> + Send
fn connect( &self, addr: SocketAddr, ) -> impl Future<Output = Result<TcpStream, <ConnectFn as TcpStreamConnector>::Error>> + Send
SocketAddress to establish a TcpStream.Source§impl<T> ToHex for T
impl<T> ToHex for T
Source§fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex<U>(&self) -> Uwhere
U: FromIterator<char>,
self into the result. Lower case
letters are used (e.g. f9b4ca)Source§fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
fn encode_hex_upper<U>(&self) -> Uwhere
U: FromIterator<char>,
self into the result. Upper case
letters are used (e.g. F9B4CA)impl<F> ToK8sService for F
§impl<T> ToStringFallible for Twhere
T: Display,
impl<T> ToStringFallible for Twhere
T: Display,
§fn try_to_string(&self) -> Result<String, TryReserveError>
fn try_to_string(&self) -> Result<String, TryReserveError>
ToString::to_string, but without panic on OOM.
impl<R> TryCryptoRng for R
impl<R> TryCryptoRng for R
§impl<Fut> TryFutureExt for Fut
impl<Fut> TryFutureExt for Fut
§fn flatten_sink<Item>(self) -> FlattenSink<Self, Self::Ok>
fn flatten_sink<Item>(self) -> FlattenSink<Self, Self::Ok>
sink only.§fn map_ok<T, F>(self, f: F) -> MapOk<Self, F> ⓘ
fn map_ok<T, F>(self, f: F) -> MapOk<Self, F> ⓘ
§fn map_ok_or_else<T, E, F>(self, e: E, f: F) -> MapOkOrElse<Self, F, E> ⓘ
fn map_ok_or_else<T, E, F>(self, e: E, f: F) -> MapOkOrElse<Self, F, E> ⓘ
§fn map_err<E, F>(self, f: F) -> MapErr<Self, F> ⓘ
fn map_err<E, F>(self, f: F) -> MapErr<Self, F> ⓘ
§fn and_then<Fut, F>(self, f: F) -> AndThen<Self, Fut, F> ⓘ
fn and_then<Fut, F>(self, f: F) -> AndThen<Self, Fut, F> ⓘ
§fn or_else<Fut, F>(self, f: F) -> OrElse<Self, Fut, F> ⓘ
fn or_else<Fut, F>(self, f: F) -> OrElse<Self, Fut, F> ⓘ
§fn inspect_ok<F>(self, f: F) -> InspectOk<Self, F> ⓘ
fn inspect_ok<F>(self, f: F) -> InspectOk<Self, F> ⓘ
§fn inspect_err<F>(self, f: F) -> InspectErr<Self, F> ⓘ
fn inspect_err<F>(self, f: F) -> InspectErr<Self, F> ⓘ
§fn try_flatten(self) -> TryFlatten<Self, Self::Ok> ⓘ
fn try_flatten(self) -> TryFlatten<Self, Self::Ok> ⓘ
§fn try_flatten_stream(self) -> TryFlattenStream<Self>
fn try_flatten_stream(self) -> TryFlattenStream<Self>
§fn unwrap_or_else<F>(self, f: F) -> UnwrapOrElse<Self, F> ⓘ
fn unwrap_or_else<F>(self, f: F) -> UnwrapOrElse<Self, F> ⓘ
§fn into_future(self) -> IntoFuture<Self> ⓘwhere
Self: Sized,
fn into_future(self) -> IntoFuture<Self> ⓘwhere
Self: Sized,
§fn try_poll_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<Self::Ok, Self::Error>>where
Self: Unpin,
fn try_poll_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Result<Self::Ok, Self::Error>>where
Self: Unpin,
TryFuture::try_poll on Unpin
future types.§impl<R> TryRng for R
impl<R> TryRng for R
§type Error = <<R as Deref>::Target as TryRng>::Error
type Error = <<R as Deref>::Target as TryRng>::Error
§fn try_next_u32(&mut self) -> Result<u32, <R as TryRng>::Error>
fn try_next_u32(&mut self) -> Result<u32, <R as TryRng>::Error>
u32.§fn try_next_u64(&mut self) -> Result<u64, <R as TryRng>::Error>
fn try_next_u64(&mut self) -> Result<u64, <R as TryRng>::Error>
u64.§fn try_fill_bytes(&mut self, dst: &mut [u8]) -> Result<(), <R as TryRng>::Error>
fn try_fill_bytes(&mut self, dst: &mut [u8]) -> Result<(), <R as TryRng>::Error>
dst entirely with random data.Source§impl<R> TryRngCore for R
impl<R> TryRngCore for R
Source§type Error = Infallible
type Error = Infallible
Source§fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>
fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>
u32.Source§fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>
fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>
u64.Source§fn try_fill_bytes(
&mut self,
dst: &mut [u8],
) -> Result<(), <R as TryRngCore>::Error>
fn try_fill_bytes( &mut self, dst: &mut [u8], ) -> Result<(), <R as TryRngCore>::Error>
dest entirely with random data.Source§fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>
fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>
UnwrapMut wrapper.Source§fn read_adapter(&mut self) -> RngReadAdapter<'_, Self> ⓘwhere
Self: Sized,
fn read_adapter(&mut self) -> RngReadAdapter<'_, Self> ⓘwhere
Self: Sized,
std only.RngCore to a RngReadAdapter.§impl<R> TryRngCore for Rwhere
R: TryRng,
impl<R> TryRngCore for Rwhere
R: TryRng,
§impl<S> TryStreamExt for S
impl<S> TryStreamExt for S
§fn err_into<E>(self) -> ErrInto<Self, E>
fn err_into<E>(self) -> ErrInto<Self, E>
§fn map_ok<T, F>(self, f: F) -> MapOk<Self, F>
fn map_ok<T, F>(self, f: F) -> MapOk<Self, F>
§fn map_err<E, F>(self, f: F) -> MapErr<Self, F>
fn map_err<E, F>(self, f: F) -> MapErr<Self, F>
§fn and_then<Fut, F>(self, f: F) -> AndThen<Self, Fut, F>
fn and_then<Fut, F>(self, f: F) -> AndThen<Self, Fut, F>
f. Read more§fn or_else<Fut, F>(self, f: F) -> OrElse<Self, Fut, F>
fn or_else<Fut, F>(self, f: F) -> OrElse<Self, Fut, F>
f. Read more§fn inspect_ok<F>(self, f: F) -> InspectOk<Self, F>
fn inspect_ok<F>(self, f: F) -> InspectOk<Self, F>
§fn inspect_err<F>(self, f: F) -> InspectErr<Self, F>
fn inspect_err<F>(self, f: F) -> InspectErr<Self, F>
§fn into_stream(self) -> IntoStream<Self>where
Self: Sized,
fn into_stream(self) -> IntoStream<Self>where
Self: Sized,
§fn try_next(&mut self) -> TryNext<'_, Self> ⓘwhere
Self: Unpin,
fn try_next(&mut self) -> TryNext<'_, Self> ⓘwhere
Self: Unpin,
§fn try_for_each<Fut, F>(self, f: F) -> TryForEach<Self, Fut, F> ⓘ
fn try_for_each<Fut, F>(self, f: F) -> TryForEach<Self, Fut, F> ⓘ
§fn try_skip_while<Fut, F>(self, f: F) -> TrySkipWhile<Self, Fut, F>
fn try_skip_while<Fut, F>(self, f: F) -> TrySkipWhile<Self, Fut, F>
true. Read more§fn try_take_while<Fut, F>(self, f: F) -> TryTakeWhile<Self, Fut, F>
fn try_take_while<Fut, F>(self, f: F) -> TryTakeWhile<Self, Fut, F>
true. Read more§fn try_for_each_concurrent<Fut, F>(
self,
limit: impl Into<Option<usize>>,
f: F,
) -> TryForEachConcurrent<Self, Fut, F> ⓘ
fn try_for_each_concurrent<Fut, F>( self, limit: impl Into<Option<usize>>, f: F, ) -> TryForEachConcurrent<Self, Fut, F> ⓘ
target_has_atomic=ptr and crate feature alloc only.§fn try_collect<C>(self) -> TryCollect<Self, C> ⓘ
fn try_collect<C>(self) -> TryCollect<Self, C> ⓘ
§fn try_chunks(self, capacity: usize) -> TryChunks<Self>where
Self: Sized,
fn try_chunks(self, capacity: usize) -> TryChunks<Self>where
Self: Sized,
alloc only.§fn try_ready_chunks(self, capacity: usize) -> TryReadyChunks<Self>where
Self: Sized,
fn try_ready_chunks(self, capacity: usize) -> TryReadyChunks<Self>where
Self: Sized,
alloc only.§fn try_filter<Fut, F>(self, f: F) -> TryFilter<Self, Fut, F>
fn try_filter<Fut, F>(self, f: F) -> TryFilter<Self, Fut, F>
§fn try_filter_map<Fut, F, T>(self, f: F) -> TryFilterMap<Self, Fut, F>
fn try_filter_map<Fut, F, T>(self, f: F) -> TryFilterMap<Self, Fut, F>
§fn try_flatten_unordered(
self,
limit: impl Into<Option<usize>>,
) -> TryFlattenUnordered<Self>
fn try_flatten_unordered( self, limit: impl Into<Option<usize>>, ) -> TryFlattenUnordered<Self>
target_has_atomic=ptr and crate feature alloc only.§fn try_flatten(self) -> TryFlatten<Self>
fn try_flatten(self) -> TryFlatten<Self>
§fn try_fold<T, Fut, F>(self, init: T, f: F) -> TryFold<Self, Fut, T, F> ⓘ
fn try_fold<T, Fut, F>(self, init: T, f: F) -> TryFold<Self, Fut, T, F> ⓘ
§fn try_concat(self) -> TryConcat<Self> ⓘ
fn try_concat(self) -> TryConcat<Self> ⓘ
§fn try_buffer_unordered(self, n: usize) -> TryBufferUnordered<Self>
fn try_buffer_unordered(self, n: usize) -> TryBufferUnordered<Self>
target_has_atomic=ptr and crate feature alloc only.§fn try_buffered(self, n: usize) -> TryBuffered<Self>
fn try_buffered(self, n: usize) -> TryBuffered<Self>
target_has_atomic=ptr and crate feature alloc only.§fn try_poll_next_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Option<Result<Self::Ok, Self::Error>>>where
Self: Unpin,
fn try_poll_next_unpin(
&mut self,
cx: &mut Context<'_>,
) -> Poll<Option<Result<Self::Ok, Self::Error>>>where
Self: Unpin,
TryStream::try_poll_next on Unpin
stream types.§fn into_async_read(self) -> IntoAsyncRead<Self>
fn into_async_read(self) -> IntoAsyncRead<Self>
io and std only.AsyncBufRead. Read more§fn try_all<Fut, F>(self, f: F) -> TryAll<Self, Fut, F> ⓘ
fn try_all<Fut, F>(self, f: F) -> TryAll<Self, Fut, F> ⓘ
Err is encountered or if an Ok item is found
that does not satisfy the predicate. Read more§impl<T> TryToOwned for Twhere
T: TryClone,
impl<T> TryToOwned for Twhere
T: TryClone,
§fn try_to_owned(&self) -> Result<<T as TryToOwned>::Owned, OutOfMemory>
fn try_to_owned(&self) -> Result<<T as TryToOwned>::Owned, OutOfMemory>
self.§impl<F, E> UdpInspector for Fwhere
F: Fn(RelayDirection, SocketAddress, &[u8]) -> Result<UdpInspectAction, E> + Send + Sync + 'static,
E: Into<Box<dyn Error + Send + Sync>> + Send + 'static,
impl<F, E> UdpInspector for Fwhere
F: Fn(RelayDirection, SocketAddress, &[u8]) -> Result<UdpInspectAction, E> + Send + Sync + 'static,
E: Into<Box<dyn Error + Send + Sync>> + Send + 'static,
type Error = E
§fn inspect_packet(
&self,
direction: RelayDirection,
server_address: SocketAddress,
payload: &[u8],
) -> Result<UdpInspectAction, <F as UdpInspector>::Error>
fn inspect_packet( &self, direction: RelayDirection, server_address: SocketAddress, payload: &[u8], ) -> Result<UdpInspectAction, <F as UdpInspector>::Error>
UdpInspectAction.§impl<T, M1, M2> UnaryService<M1> for T
impl<T, M1, M2> UnaryService<M1> for T
§impl<I> UnicodeNormalization<I> for I
impl<I> UnicodeNormalization<I> for I
§fn nfd(self) -> Decompositions<I> ⓘ
fn nfd(self) -> Decompositions<I> ⓘ
§fn nfkd(self) -> Decompositions<I> ⓘ
fn nfkd(self) -> Decompositions<I> ⓘ
§fn nfc(self) -> Recompositions<I> ⓘ
fn nfc(self) -> Recompositions<I> ⓘ
§fn nfkc(self) -> Recompositions<I> ⓘ
fn nfkc(self) -> Recompositions<I> ⓘ
§fn cjk_compat_variants(self) -> Replacements<I> ⓘ
fn cjk_compat_variants(self) -> Replacements<I> ⓘ
§fn stream_safe(self) -> StreamSafe<I> ⓘ
fn stream_safe(self) -> StreamSafe<I> ⓘ
§impl<F> UsernameFormatter for F
impl<F> UsernameFormatter for F
§fn fmt_username(
&self,
proxy: &Proxy,
filter: &ProxyFilter,
username: &str,
_extensions: &Extensions,
) -> Option<String>
fn fmt_username( &self, proxy: &Proxy, filter: &ProxyFilter, username: &str, _extensions: &Extensions, ) -> Option<String>
§impl<B, F, Fut, ResBody> ValidateRequestFn<B, ((), Request<B>)> for F
impl<B, F, Fut, ResBody> ValidateRequestFn<B, ((), Request<B>)> for F
§type ResponseBody = ResBody
type ResponseBody = ResBody
§impl<B, F, Fut, ResBody> ValidateRequestFn<B, ()> for F
impl<B, F, Fut, ResBody> ValidateRequestFn<B, ()> for F
§type ResponseBody = ResBody
type ResponseBody = ResBody
§async fn call(
&self,
req: Request<B>,
) -> Result<Request<B>, Response<<F as ValidateRequestFn<B, ()>>::ResponseBody>>
async fn call( &self, req: Request<B>, ) -> Result<Request<B>, Response<<F as ValidateRequestFn<B, ()>>::ResponseBody>>
§impl<F> Visit for F
impl<F> Visit for F
§fn record_debug(&mut self, field: &Field, value: &dyn Debug)
fn record_debug(&mut self, field: &Field, value: &dyn Debug)
fmt::Debug.§fn record_f64(&mut self, field: &Field, value: f64)
fn record_f64(&mut self, field: &Field, value: f64)
§fn record_i64(&mut self, field: &Field, value: i64)
fn record_i64(&mut self, field: &Field, value: i64)
§fn record_u64(&mut self, field: &Field, value: u64)
fn record_u64(&mut self, field: &Field, value: u64)
§fn record_i128(&mut self, field: &Field, value: i128)
fn record_i128(&mut self, field: &Field, value: i128)
§fn record_u128(&mut self, field: &Field, value: u128)
fn record_u128(&mut self, field: &Field, value: u128)
§fn record_bool(&mut self, field: &Field, value: bool)
fn record_bool(&mut self, field: &Field, value: bool)
§fn record_str(&mut self, field: &Field, value: &str)
fn record_str(&mut self, field: &Field, value: &str)
§fn record_bytes(&mut self, field: &Field, value: &[u8])
fn record_bytes(&mut self, field: &Field, value: &[u8])
§fn record_error(&mut self, field: &Field, value: &(dyn Error + 'static))
fn record_error(&mut self, field: &Field, value: &(dyn Error + 'static))
std only.Error. Read more