Type Alias bevy :: render :: view :: window :: screenshot :: ScreenshotFn Copy item path

impl<T> Box<T>

1.0.0 · source

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

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

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

§Examples

let five = Box::new(5);

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

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

Constructs a new box with uninitialized contents.

§Examples

#![feature(new_uninit)]

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

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

    five.assume_init()
};

assert_eq!(*five, 5)

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

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

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

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

§Examples

#![feature(new_uninit)]

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

assert_eq!(*zero, 0)

1.33.0 · source

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

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

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

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

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

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

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

§Examples

#![feature(allocator_api)]

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

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

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

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

§Examples

#![feature(allocator_api, new_uninit)]

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

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

    five.assume_init()
};

assert_eq!(*five, 5);

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

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

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

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

§Examples

#![feature(allocator_api, new_uninit)]

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

assert_eq!(*zero, 0);

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

1.4.0 · source

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

Constructs a box from a raw pointer.

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

§Safety

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

The safety conditions are described in the memory layout section.

§Examples

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

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

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

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

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

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

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

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

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

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

§Examples

#![feature(allocator_api)]

use std::alloc::System;

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

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

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

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

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

§Examples

#![feature(allocator_api)]

use std::alloc::System;

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

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

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

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

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

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

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

    five.assume_init()
};

assert_eq!(*five, 5)

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

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

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

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

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

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

    five.assume_init()
};

assert_eq!(*five, 5);

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

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

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

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

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

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

assert_eq!(*zero, 0)

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

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

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

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

§Examples

#![feature(allocator_api, new_uninit)]

use std::alloc::System;

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

assert_eq!(*zero, 0);

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

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

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

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

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

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

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

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

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

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

Consumes the Box, returning the wrapped value.

§Examples

#![feature(box_into_inner)]

let c = Box::new(5);

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

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

const: unstable · source

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

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

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

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

§Safety

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

§Examples

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

#![feature(allocator_api)]

use std::alloc::System;

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

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

#![feature(allocator_api, slice_ptr_get)]

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

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

1.4.0 · source

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

Consumes the Box, returning a wrapped raw pointer.

The pointer will be properly aligned and non-null.

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

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

§Examples

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

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

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

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

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

Note: This is equivalent to the following:

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

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

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

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

The pointer will be properly aligned and non-null.

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

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

§Examples

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

#![feature(allocator_api)]

use std::alloc::System;

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

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

#![feature(allocator_api)]

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

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

const: unstable · source

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

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

Returns a reference to the underlying allocator.

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

1.26.0 · source

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

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

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

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

§Examples

Simple usage:

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

Unsized data:

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

1.63.0 (const: unstable) · source

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

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

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

This is also available via From.

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

§Notes

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

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

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

Trait Implementations

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

fn new_events(&mut self, event_loop: &ActiveEventLoop, cause: StartCause)

Emitted when new events arrive from the OS to be processed. Read more

fn resumed(&mut self, event_loop: &ActiveEventLoop)

Emitted when the application has been resumed. Read more

fn user_event(&mut self, event_loop: &ActiveEventLoop, event: T)

Emitted when an event is sent from EventLoopProxy::send_event.

fn window_event( &mut self, event_loop: &ActiveEventLoop, window_id: WindowId, event: WindowEvent )

Emitted when the OS sends an event to a winit window.

fn device_event( &mut self, event_loop: &ActiveEventLoop, device_id: DeviceId, event: DeviceEvent )

Emitted when the OS sends an event to a device.

fn about_to_wait(&mut self, event_loop: &ActiveEventLoop)

Emitted when the event loop is about to block and wait for new events. Read more

fn suspended(&mut self, event_loop: &ActiveEventLoop)

Emitted when the application has been suspended. Read more

fn exiting(&mut self, event_loop: &ActiveEventLoop)

Emitted when the event loop is being shut down. Read more

fn memory_warning(&mut self, event_loop: &ActiveEventLoop)

Emitted when the application has received a memory warning. Read more

1.64.0 · source§

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

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

Borrows the file descriptor. Read more

1.5.0 · source§

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

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

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

1.63.0 · source§

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

fn as_raw_fd(&self) -> i32

Extracts the raw file descriptor. Read more

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

fn as_raw_xcb_connection(&self) -> *mut xcb_connection_t

Get a raw xcb connection pointer from this object.

1.5.0 · source§

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

fn as_ref(&self) -> &T

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

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

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

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

fn consume(self: Pin<&mut Box<T>>, amt: usize)

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

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

extern "rust-call" fn async_call( &self, args: Args ) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>

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

Call the AsyncFn, returning a future which may borrow from the called closure.

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

type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a> where Box<F, A>: 'a

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

Future returned by AsyncFnMut::async_call_mut and AsyncFn::async_call.

extern "rust-call" fn async_call_mut( &mut self, args: Args ) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>

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

Call the AsyncFnMut, returning a future which may borrow from the called closure.

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

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

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

Output type of the called closure’s future.

type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture

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

Future returned by AsyncFnOnce::async_call_once.

extern "rust-call" fn async_call_once( self, args: Args ) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture

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

Call the AsyncFnOnce, returning a future which may move out of the called closure.

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

type Item = <S as AsyncIterator>::Item

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

The type of items yielded by the async iterator.

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

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

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

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

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

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

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

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

Attempt to read from the AsyncRead into buf. Read more

fn poll_read_vectored( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, bufs: &mut [IoSliceMut<'_>] ) -> Poll<Result<usize, Error>>

Attempt to read from the AsyncRead into bufs using vectored IO operations. Read more

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

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

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

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

fn poll_write( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, buf: &[u8] ) -> Poll<Result<usize, Error>>

Attempt to write bytes from buf into the object. Read more

fn poll_write_vectored( self: Pin<&mut Box<T>>, cx: &mut Context<'_>, bufs: &[IoSlice<'_>] ) -> Poll<Result<usize, Error>>

Attempt to write bytes from bufs into the object using vectored IO operations. Read more

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

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

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

Attempt to close the object. Read more

1.1.0 · source§

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

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

1.1.0 · source§

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

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

Mutably borrows from an owned value. Read more

1.0.0 · source§

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

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

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

fn consume(&mut self, amt: usize)

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

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

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

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

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

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

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

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

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

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

fn calculate_size_for(nr_of_el: u64) -> NonZero<u64>

Returns the size of Self assuming the (contained) runtime-sized array has nr_of_el elements

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

fn clear(&mut self)

Clear all data in self, retaining the allocated capacithy.

1.0.0 · source§

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

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

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

§Examples

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

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

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

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

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

§Examples

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

y.clone_from(&x);

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

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

impl<C> Connection for Box<C>
where C: Connection + ?Sized,

fn wait_for_event(&self) -> Result<Event, ConnectionError>

Wait for a new event from the X11 server.

fn wait_for_raw_event( &self ) -> Result<<Box<C> as RequestConnection>::Buf, ConnectionError>

Wait for a new raw/unparsed event from the X11 server.

fn wait_for_event_with_sequence(&self) -> Result<(Event, u64), ConnectionError>

Wait for a new event from the X11 server.

fn wait_for_raw_event_with_sequence( &self ) -> Result<(<Box<C> as RequestConnection>::Buf, u64), ConnectionError>

Wait for a new raw/unparsed event from the X11 server.

fn poll_for_event(&self) -> Result<Option<Event>, ConnectionError>

Poll for a new event from the X11 server.

fn poll_for_raw_event( &self ) -> Result<Option<<Box<C> as RequestConnection>::Buf>, ConnectionError>

Poll for a new raw/unparsed event from the X11 server.

fn poll_for_event_with_sequence( &self ) -> Result<Option<(Event, u64)>, ConnectionError>

Poll for a new event from the X11 server.

fn poll_for_raw_event_with_sequence( &self ) -> Result<Option<(<Box<C> as RequestConnection>::Buf, u64)>, ConnectionError>

Poll for a new unparsed/raw event from the X11 server.

fn flush(&self) -> Result<(), ConnectionError>

Send all pending requests to the server. Read more

fn setup(&self) -> &Setup

Get the setup information sent by the X11 server. Read more

fn generate_id(&self) -> Result<u32, ReplyOrIdError>

Generate a new X11 identifier. Read more

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

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

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

The type of value this coroutine yields. Read more

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

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

The type of value this coroutine returns. Read more

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

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

Resumes the execution of this coroutine. Read more

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

fn create_from(reader: &mut Reader) -> Box<T>
where B: BufferRef,

1.0.0 · source§

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

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

Formats the value using the given formatter. Read more

1.0.0 · source§

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

fn default() -> Box<T>

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

1.0.0 · source§

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

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

1.0.0 · source§

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

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

Mutably dereferences the value.

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

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

Deserialize this value from the given Serde deserializer. Read more

impl<'de, T> Deserializer<'de> for Box<T>
where T: Deserializer<'de> + ?Sized,

fn erased_deserialize_any( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_bool( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_i8( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_i16( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_i32( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_i64( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_i128( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_u8( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_u16( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_u32( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_u64( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_u128( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_f32( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_f64( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_char( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_str( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_string( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_bytes( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_byte_buf( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_option( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_unit( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_unit_struct( &mut self, name: &'static str, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_newtype_struct( &mut self, name: &'static str, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_seq( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_tuple( &mut self, len: usize, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_tuple_struct( &mut self, name: &'static str, len: usize, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_map( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_struct( &mut self, name: &'static str, fields: &'static [&'static str], visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_identifier( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_enum( &mut self, name: &'static str, variants: &'static [&'static str], visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_deserialize_ignored_any( &mut self, visitor: &mut dyn Visitor<'de> ) -> Result<Out, Error>

fn erased_is_human_readable(&self) -> bool

1.0.0 · source§

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

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

Formats the value using the given formatter. Read more

1.0.0 · source§

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

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

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

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

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

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

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

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

1.27.0 · source§

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

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

1.27.0 · source§

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

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

1.27.0 · source§

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

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

1.0.0 · source§

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

fn drop(&mut self)

Executes the destructor for this type. Read more

1.8.0 · source§

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

fn description(&self) -> &str

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

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

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

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

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

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

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

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

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

Blanket implementation for boxed event sources. EventSource is not an object safe trait, so this does not include trait objects.

type Event = <T as EventSource>::Event

The type of events generated by your source.

type Metadata = <T as EventSource>::Metadata

Some metadata of your event source Read more

type Ret = <T as EventSource>::Ret

The return type of the user callback Read more

type Error = <T as EventSource>::Error

The error type returned from process_events() (not the user callback!).

fn process_events<F>( &mut self, readiness: Readiness, token: Token, callback: F ) -> Result<PostAction, <Box<T> as EventSource>::Error>
where F: FnMut(<Box<T> as EventSource>::Event, &mut <Box<T> as EventSource>::Metadata) -> <Box<T> as EventSource>::Ret,

Process any relevant events Read more

fn register( &mut self, poll: &mut Poll, token_factory: &mut TokenFactory ) -> Result<(), Error>

Register yourself to this poll instance Read more

fn reregister( &mut self, poll: &mut Poll, token_factory: &mut TokenFactory ) -> Result<(), Error>

Re-register your file descriptors Read more

fn unregister(&mut self, poll: &mut Poll) -> Result<(), Error>

Unregister your file descriptors Read more

const NEEDS_EXTRA_LIFECYCLE_EVENTS: bool = T::NEEDS_EXTRA_LIFECYCLE_EVENTS

Whether this source needs to be sent the EventSource::before_sleep and EventSource::before_handle_events notifications. These are opt-in because they require more expensive checks, and almost all sources will not need these notifications

fn before_sleep(&mut self) -> Result<Option<(Readiness, Token)>, Error>

Notification that a single poll is about to begin Read more

fn before_handle_events(&mut self, events: EventIterator<'_>)

Notification that polling is complete, and EventSource::process_events will be called with the given events for this source. The iterator may be empty, which indicates that no events were generated for this source Read more

1.0.0 · source§

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

fn len(&self) -> usize

Returns the exact remaining length of the iterator. Read more

fn is_empty(&self) -> bool

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

Returns true if the iterator is empty. Read more

1.35.0 · source§

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

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

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

Performs the call operation.

1.35.0 · source§

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

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

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

Performs the call operation.

1.35.0 · source§

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

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

The returned type after the call operator is used.

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

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

Performs the call operation.

1.6.0 · source§

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

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

Converts a T into a Box<T>

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

§Examples

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

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

impl<F> FusedFuture for Box<F>
where F: FusedFuture + Unpin + ?Sized,

fn is_terminated(&self) -> bool

Returns true if the underlying future should no longer be polled.

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

fn is_terminated(&self) -> bool

Returns true if the stream should no longer be polled.

1.36.0 · source§

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

type Output = <F as Future>::Output

The type of value produced on completion.

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

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

impl<H> HasDisplayHandle for Box<H>
where H: HasDisplayHandle + ?Sized,

fn display_handle(&self) -> Result<DisplayHandle<'_>, HandleError>

Get a handle to the display controller of the windowing system.

impl<H> HasWindowHandle for Box<H>
where H: HasWindowHandle + ?Sized,

fn window_handle(&self) -> Result<WindowHandle<'_>, HandleError>

Get a handle to the window.

1.0.0 · source§

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

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

Feeds this value into the given Hasher. Read more

1.3.0 · source§

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

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

1.22.0 · source§

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

fn finish(&self) -> u64

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

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

Writes some data into this Hasher. Read more

fn write_u8(&mut self, i: u8)

Writes a single u8 into this hasher.

fn write_u16(&mut self, i: u16)

Writes a single u16 into this hasher.

fn write_u32(&mut self, i: u32)

Writes a single u32 into this hasher.

fn write_u64(&mut self, i: u64)

Writes a single u64 into this hasher.

fn write_u128(&mut self, i: u128)

Writes a single u128 into this hasher.

fn write_usize(&mut self, i: usize)

Writes a single usize into this hasher.

fn write_i8(&mut self, i: i8)

Writes a single i8 into this hasher.

fn write_i16(&mut self, i: i16)

Writes a single i16 into this hasher.

fn write_i32(&mut self, i: i32)

Writes a single i32 into this hasher.

fn write_i64(&mut self, i: i64)

Writes a single i64 into this hasher.

fn write_i128(&mut self, i: i128)

Writes a single i128 into this hasher.

fn write_isize(&mut self, i: isize)

Writes a single isize into this hasher.

fn write_length_prefix(&mut self, len: usize)

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

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

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

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

Writes a single str into this hasher. Read more

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

fn dimensions(&self) -> (u32, u32)

Returns a tuple containing the width and height of the image

fn color_type(&self) -> ColorType

Returns the color type of the image data produced by this decoder

fn original_color_type(&self) -> ExtendedColorType

Returns the color type of the image file before decoding

fn icc_profile(&mut self) -> Result<Option<Vec<u8>>, ImageError>

Returns the ICC color profile embedded in the image, or Ok(None) if the image does not have one. Read more

fn total_bytes(&self) -> u64

Returns the total number of bytes in the decoded image. Read more

fn read_image(self, buf: &mut [u8]) -> Result<(), ImageError>
where Box<T>: Sized,

Returns all the bytes in the image. Read more

fn read_image_boxed(self: Box<Box<T>>, buf: &mut [u8]) -> Result<(), ImageError>

Use read_image instead; this method is an implementation detail needed so the trait can be object safe. Read more

fn set_limits(&mut self, limits: Limits) -> Result<(), ImageError>

Set the decoder to have the specified limits. See Limits for the different kinds of limits that is possible to set. Read more

1.0.0 · source§

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

type Item = ::Item

The type of the elements being iterated over.

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

Advances the iterator and returns the next value. Read more

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

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

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

Returns the nth element of the iterator. Read more

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

Consumes the iterator, returning the last element. Read more

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

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

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

1.0.0 · source§

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

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

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

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

Advances the iterator by n elements. Read more

1.28.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

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

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

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

1.0.0 · source§

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

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

1.21.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

Creates an iterator that both filters and maps. Read more

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.57.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

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

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

Borrows an iterator, rather than consuming it. Read more

1.0.0 · source§

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

Transforms an iterator into a collection. Read more

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

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

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

1.0.0 · source§

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

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

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

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

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

1.27.0 · source§

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

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

1.27.0 · source§

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

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

1.0.0 · source§

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

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

1.51.0 · source§

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

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

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

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.30.0 · source§

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

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

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

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

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

1.0.0 · source§

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

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

1.6.0 · source§

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

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

1.15.0 · source§

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

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

1.6.0 · source§

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

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

1.15.0 · source§

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

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

1.0.0 · source§

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

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

1.36.0 · source§

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

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

1.0.0 · source§

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

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

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

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

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

1.11.0 · source§

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

Sums the elements of an iterator. Read more

1.11.0 · source§

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

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

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

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

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

1.5.0 · source§

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

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

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

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

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

1.5.0 · source§

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

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

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

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

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

1.5.0 · source§

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

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

1.5.0 · source§

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

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

1.5.0 · source§

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

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

1.5.0 · source§

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

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

1.5.0 · source§

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

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

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

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

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

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

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

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

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

fn on_register_dispatch(&self, subscriber: &Dispatch)

Performs late initialization when installing this layer as a Subscriber. Read more

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

Performs late initialization when attaching a Layer to a Subscriber. Read more

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

Notifies this layer that a new span was constructed with the given Attributes and Id.

fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest

Registers a new callsite with this layer, returning whether or not the layer is interested in being notified about the callsite, similarly to Subscriber::register_callsite. Read more

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

Returns true if this layer is interested in a span or event with the given metadata in the current Context, similarly to Subscriber::enabled. Read more

fn on_record(&self, span: &Id, values: &Record<'_>, ctx: Context<'_, S>)

Notifies this layer that a span with the given Id recorded the given values.

fn on_follows_from(&self, span: &Id, follows: &Id, ctx: Context<'_, S>)

Notifies this layer that a span with the ID span recorded that it follows from the span with the ID follows.

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

Called before on_event, to determine if on_event should be called.

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

Notifies this layer that an event has occurred.

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

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

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

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

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

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

fn on_id_change(&self, old: &Id, new: &Id, ctx: Context<'_, S>)

Notifies this layer that a span ID has been cloned, and that the subscriber returned a different ID.

fn and_then<L>(self, layer: L) -> Layered<L, Self, S>
where L: Layer<S>, Self: Sized,

Composes this layer around the given Layer, returning a Layered struct implementing Layer. Read more

fn with_subscriber(self, inner: S) -> Layered<Self, S>
where Self: Sized,

Composes this Layer with the given Subscriber, returning a Layered struct that implements Subscriber. Read more

fn with_filter<F>(self, filter: F) -> Filtered<Self, F, S>
where Self: Sized, F: Filter<S>,

Combines self with a Filter, returning a Filtered layer. Read more

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

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

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

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

Logs the Record. Read more

fn flush(&self)

Flushes any buffered records. Read more

1.0.0 · source§

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

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

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

1.21.0 · source§

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

Compares and returns the maximum of two values. Read more

1.21.0 · source§

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

Compares and returns the minimum of two values. Read more

1.50.0 · source§

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

Restrict a value to a certain interval. Read more

1.0.0 · source§

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

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

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

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

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

1.0.0 · source§

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

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

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

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

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

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

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

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

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

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

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

1.0.0 · source§

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

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

Formats the value using the given formatter.

1.0.0 · source§

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

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

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

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

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

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

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

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

fn is_read_vectored(&self) -> bool

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

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

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

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

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

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

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

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

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

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

1.0.0 · source§

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

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

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

fn read_from(&mut self, reader: &mut Reader)
where B: BufferRef,

impl<C> RequestConnection for Box<C>
where C: RequestConnection + ?Sized,

type Buf = <C as RequestConnection>::Buf

Type used as buffer to store raw replies or events before they are parsed.

fn send_request_with_reply<R>( &self, bufs: &[IoSlice<'_>], fds: Vec<OwnedFd> ) -> Result<Cookie<'_, Box<C>, R>, ConnectionError>
where R: TryParse,

Send a request with a reply to the server. Read more

fn send_trait_request_with_reply<R>( &self, request: R ) -> Result<Cookie<'_, Box<C>, <R as ReplyRequest>::Reply>, ConnectionError>
where R: ReplyRequest,

Send a request with a reply to the server. Read more

fn send_request_with_reply_with_fds<R>( &self, bufs: &[IoSlice<'_>], fds: Vec<OwnedFd> ) -> Result<CookieWithFds<'_, Box<C>, R>, ConnectionError>
where R: TryParseFd,

Send a request with a reply containing file descriptors to the server. Read more

fn send_trait_request_with_reply_with_fds<R>( &self, request: R ) -> Result<CookieWithFds<'_, Box<C>, <R as ReplyFDsRequest>::Reply>, ConnectionError>
where R: ReplyFDsRequest,

Send a request with a reply containing file descriptors to the server. Read more

fn send_request_without_reply( &self, bufs: &[IoSlice<'_>], fds: Vec<OwnedFd> ) -> Result<VoidCookie<'_, Box<C>>, ConnectionError>

Send a request without a reply to the server. Read more

fn send_trait_request_without_reply<R>( &self, request: R ) -> Result<VoidCookie<'_, Box<C>>, ConnectionError>
where R: VoidRequest,

Send a request without a reply to the server. Read more

fn discard_reply(&self, sequence: u64, kind: RequestKind, mode: DiscardMode)

A reply to an error should be discarded. Read more

fn prefetch_extension_information( &self, extension_name: &'static str ) -> Result<(), ConnectionError>

Prefetches information about an extension. Read more

fn extension_information( &self, extension_name: &'static str ) -> Result<Option<ExtensionInformation>, ConnectionError>

Get information about an extension. Read more

fn wait_for_reply_or_error( &self, sequence: u64 ) -> Result<<Box<C> as RequestConnection>::Buf, ReplyError>

Wait for the reply to a request. Read more

fn wait_for_reply_or_raw_error( &self, sequence: u64 ) -> Result<ReplyOrError<<Box<C> as RequestConnection>::Buf>, ConnectionError>

Wait for the reply to a request. Read more

fn wait_for_reply( &self, sequence: u64 ) -> Result<Option<<Box<C> as RequestConnection>::Buf>, ConnectionError>

Wait for the reply to a request. Read more

fn wait_for_reply_with_fds( &self, sequence: u64 ) -> Result<(<Box<C> as RequestConnection>::Buf, Vec<OwnedFd>), ReplyError>

Wait for the reply to a request that has FDs. Read more

fn wait_for_reply_with_fds_raw( &self, sequence: u64 ) -> Result<ReplyOrError<(<Box<C> as RequestConnection>::Buf, Vec<OwnedFd>), <Box<C> as RequestConnection>::Buf>, ConnectionError>

Wait for the reply to a request that has FDs. Read more

fn check_for_error(&self, sequence: u64) -> Result<(), ReplyError>

Check whether a request that does not have a reply caused an X11 error. Read more

fn check_for_raw_error( &self, sequence: u64 ) -> Result<Option<<Box<C> as RequestConnection>::Buf>, ConnectionError>

Check whether a request that does not have a reply caused an X11 error. Read more

fn prefetch_maximum_request_bytes(&self)

Prefetches the maximum request length. Read more

fn maximum_request_bytes(&self) -> usize

The maximum number of bytes that the X11 server accepts in a request.

fn parse_error(&self, error: &[u8]) -> Result<X11Error, ParseError>

Parse a generic error.

fn parse_event(&self, event: &[u8]) -> Result<Event, ParseError>

Parse a generic event.

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

fn next_u32(&mut self) -> u32

Return the next random u32. Read more

fn next_u64(&mut self) -> u64

Return the next random u64. Read more

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

Fill dest with random data. Read more

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

Fill dest entirely with random data. Read more

1.0.0 · source§

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

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

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

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

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

1.55.0 · source§

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

Rewind to the beginning of a stream. Read more

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

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

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

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

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

Seeks relative to the current position. Read more

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

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

Serialize this value into the given Serde serializer. Read more

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

fn erased_serialize_bool(&mut self, v: bool)

fn erased_serialize_i8(&mut self, v: i8)

fn erased_serialize_i16(&mut self, v: i16)

fn erased_serialize_i32(&mut self, v: i32)

fn erased_serialize_i64(&mut self, v: i64)

fn erased_serialize_i128(&mut self, v: i128)

fn erased_serialize_u8(&mut self, v: u8)

fn erased_serialize_u16(&mut self, v: u16)

fn erased_serialize_u32(&mut self, v: u32)

fn erased_serialize_u64(&mut self, v: u64)

fn erased_serialize_u128(&mut self, v: u128)

fn erased_serialize_f32(&mut self, v: f32)

fn erased_serialize_f64(&mut self, v: f64)

fn erased_serialize_char(&mut self, v: char)

fn erased_serialize_str(&mut self, v: &str)

fn erased_serialize_bytes(&mut self, v: &[u8])

fn erased_serialize_none(&mut self)

fn erased_serialize_some(&mut self, value: &dyn Serialize)

fn erased_serialize_unit(&mut self)

fn erased_serialize_unit_struct(&mut self, name: &'static str)

fn erased_serialize_unit_variant( &mut self, name: &'static str, variant_index: u32, variant: &'static str )

fn erased_serialize_newtype_struct( &mut self, name: &'static str, value: &dyn Serialize )

fn erased_serialize_newtype_variant( &mut self, name: &'static str, variant_index: u32, variant: &'static str, value: &dyn Serialize )

fn erased_serialize_seq( &mut self, len: Option<usize> ) -> Result<&mut dyn SerializeSeq, ErrorImpl>

fn erased_serialize_tuple( &mut self, len: usize ) -> Result<&mut dyn SerializeTuple, ErrorImpl>

fn erased_serialize_tuple_struct( &mut self, name: &'static str, len: usize ) -> Result<&mut dyn SerializeTupleStruct, ErrorImpl>

fn erased_serialize_tuple_variant( &mut self, name: &'static str, variant_index: u32, variant: &'static str, len: usize ) -> Result<&mut dyn SerializeTupleVariant, ErrorImpl>

fn erased_serialize_map( &mut self, len: Option<usize> ) -> Result<&mut dyn SerializeMap, ErrorImpl>

fn erased_serialize_struct( &mut self, name: &'static str, len: usize ) -> Result<&mut dyn SerializeStruct, ErrorImpl>

fn erased_serialize_struct_variant( &mut self, name: &'static str, variant_index: u32, variant: &'static str, len: usize ) -> Result<&mut dyn SerializeStructVariant, ErrorImpl>

fn erased_is_human_readable(&self) -> bool

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

const SHADER_SIZE: NonZero<u64> = T::SHADER_SIZE

Represents WGSL Size (equivalent to ShaderType::min_size)

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

fn size(&self) -> NonZero<u64>

Returns the size of Self at runtime Read more

fn min_size() -> NonZero<u64>

Represents the minimum size of Self (equivalent to GPUBufferBindingLayout.minBindingSize) Read more

fn assert_uniform_compat()

Asserts that Self meets the requirements of the uniform address space restrictions on stored values and the uniform address space layout constraints Read more

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

type Item = <S as Stream>::Item

Values yielded by the stream.

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

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

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

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

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

fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest

Registers a new callsite with this subscriber, returning whether or not the subscriber is interested in being notified about the callsite. Read more

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

Returns true if a span or event with the specified metadata would be recorded. Read more

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

Returns the highest verbosity level that this Subscriber will enable, or None, if the subscriber does not implement level-based filtering or chooses not to implement this method. Read more

fn new_span(&self, span: &Attributes<'_>) -> Id

Visit the construction of a new span, returning a new span ID for the span being constructed. Read more

fn record(&self, span: &Id, values: &Record<'_>)

Record a set of values on a span. Read more

fn record_follows_from(&self, span: &Id, follows: &Id)

Adds an indication that span follows from the span with the id follows. Read more

fn event_enabled(&self, event: &Event<'_>) -> bool

Determine if an Event should be recorded. Read more

fn event(&self, event: &Event<'_>)

Records that an Event has occurred. Read more

fn enter(&self, span: &Id)

Records that a span has been entered. Read more

fn exit(&self, span: &Id)

Records that a span has been exited. Read more

fn clone_span(&self, id: &Id) -> Id

Notifies the subscriber that a span ID has been cloned. Read more

fn try_close(&self, id: Id) -> bool

Notifies the subscriber that a span ID has been dropped, and returns true if there are now 0 IDs that refer to that span. Read more

fn drop_span(&self, id: Id)

👎Deprecated since 0.1.2: use Subscriber::try_close instead

This method is deprecated. Read more

fn current_span(&self) -> Current

Returns a type representing this subscriber’s view of the current span. Read more

unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>

If self is the same type as the provided TypeId, returns an untyped *const pointer to that type. Otherwise, returns None. Read more

fn on_register_dispatch(&self, subscriber: &Dispatch)

Invoked when this subscriber becomes a Dispatch. Read more

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

fn record(&self, key: &Field, visitor: &mut dyn Visit)

Visits this value with the given Visitor.

1.0.0 · source§

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

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

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

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

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

fn is_write_vectored(&self) -> bool

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

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

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

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

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

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

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

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

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

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

Attempts to write multiple buffers into this writer. Read more

1.0.0 · source§

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

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

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

fn supports_color(&self) -> bool

Returns true if and only if the underlying writer supports colors.

fn supports_hyperlinks(&self) -> bool

Returns true if and only if the underlying writer supports hyperlinks. Read more

fn set_color(&mut self, spec: &ColorSpec) -> Result<(), Error>

Set the color settings of the writer. Read more

fn set_hyperlink(&mut self, link: &HyperlinkSpec<'_>) -> Result<(), Error>

Set the current hyperlink of the writer. Read more

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

Reset the current color settings to their original settings. Read more

fn is_synchronous(&self) -> bool

Returns true if and only if the underlying writer must synchronously interact with an end user’s device in order to control colors. By default, this always returns false. Read more

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

fn write_into(&self, writer: &mut Writer)
where B: BufferMut,

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

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

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

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

1.0.0 · source§

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

1.26.0 · source§

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

1.33.0 · source§

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