Box in std::boxed - Rust (original) (raw)
Struct std::boxed::Box
Expand description
Allocates memory on the heap and then places x
into it.
This doesn’t actually allocate if T
is zero-sized.
let five = Box::new(5);
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
Constructs a new box with uninitialized contents.
#![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)
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
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.
#![feature(new_uninit)]
let zero = Box::<u32>::new_zeroed();
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0)
Constructs a new Pin<Box<T>>
. If T
does not implement Unpin
, thenx
will be pinned in memory and unable to be moved.
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![feature(allocator_api)]
let five = Box::try_new(5)?;
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Constructs a new box with uninitialized contents on the heap, returning an error if the allocation fails
#![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);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![feature(allocator_api, new_uninit)]
let zero = Box::<u32>::try_new_zeroed()?;
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Allocates memory in the given allocator then places x
into it.
This doesn’t actually allocate if T
is zero-sized.
#![feature(allocator_api)]
use std::alloc::System;
let five = Box::new_in(5, System);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![feature(allocator_api)]
use std::alloc::System;
let five = Box::try_new_in(5, System)?;
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Constructs a new box with uninitialized contents in the provided allocator.
#![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)
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Constructs a new box with uninitialized contents in the provided allocator, returning an error if the allocation fails
#![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);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![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)
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![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);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Constructs a new Pin<Box<T, A>>
. If T
does not implement Unpin
, thenx
will be pinned in memory and unable to be moved.
🔬 This is a nightly-only experimental API. (box_into_boxed_slice
#71582)
Converts a Box<T>
into a Box<[T]>
This conversion does not allocate on the heap and happens in place.
🔬 This is a nightly-only experimental API. (box_into_inner
#80437)
Consumes the Box
, returning the wrapped value.
#![feature(box_into_inner)]
let c = Box::new(5);
assert_eq!(Box::into_inner(c), 5);
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
Constructs a new boxed slice with uninitialized contents.
#![feature(new_uninit)]
let mut values = Box::<[u32]>::new_uninit_slice(3);
let values = unsafe {
// Deferred initialization:
values[0].as_mut_ptr().write(1);
values[1].as_mut_ptr().write(2);
values[2].as_mut_ptr().write(3);
values.assume_init()
};
assert_eq!(*values, [1, 2, 3])
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
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.
#![feature(new_uninit)]
let values = Box::<[u32]>::new_zeroed_slice(3);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [0, 0, 0])
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Constructs a new boxed slice with uninitialized contents. Returns an error if the allocation fails
#![feature(allocator_api, new_uninit)]
let mut values = Box::<[u32]>::try_new_uninit_slice(3)?;
let values = unsafe {
// Deferred initialization:
values[0].as_mut_ptr().write(1);
values[1].as_mut_ptr().write(2);
values[2].as_mut_ptr().write(3);
values.assume_init()
};
assert_eq!(*values, [1, 2, 3]);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![feature(allocator_api, new_uninit)]
let values = Box::<[u32]>::try_new_zeroed_slice(3)?;
let values = unsafe { values.assume_init() };
assert_eq!(*values, [0, 0, 0]);
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
Constructs a new boxed slice with uninitialized contents in the provided allocator.
#![feature(allocator_api, new_uninit)]
use std::alloc::System;
let mut values = Box::<[u32], _>::new_uninit_slice_in(3, System);
let values = unsafe {
// Deferred initialization:
values[0].as_mut_ptr().write(1);
values[1].as_mut_ptr().write(2);
values[2].as_mut_ptr().write(3);
values.assume_init()
};
assert_eq!(*values, [1, 2, 3])
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
#![feature(allocator_api, new_uninit)]
use std::alloc::System;
let values = Box::<[u32], _>::new_zeroed_slice_in(3, System);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [0, 0, 0])
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
Converts to Box<T, A>
.
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.
#![feature(new_uninit)]
let mut five = Box::<u32>::new_uninit();
let five: Box<u32> = unsafe {
// Deferred initialization:
five.as_mut_ptr().write(5);
five.assume_init()
};
assert_eq!(*five, 5)
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
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.
#![feature(new_uninit)]
let big_box = Box::<[usize; 1024]>::new_uninit();
let mut array = [0; 1024];
for (i, place) in array.iter_mut().enumerate() {
*place = i;
}
// The optimizer may be able to elide this copy, so previous code writes
// to heap directly.
let big_box = Box::write(big_box, array);
for (i, x) in big_box.iter().enumerate() {
assert_eq!(*x, i);
}
🔬 This is a nightly-only experimental API. (new_uninit
#63291)
Converts to Box<[T], A>
.
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.
#![feature(new_uninit)]
let mut values = Box::<[u32]>::new_uninit_slice(3);
let values = unsafe {
// Deferred initialization:
values[0].as_mut_ptr().write(1);
values[1].as_mut_ptr().write(2);
values[2].as_mut_ptr().write(3);
values.assume_init()
};
assert_eq!(*values, [1, 2, 3])
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
.
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.
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:🆕:<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);
}
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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
.
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.
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:🆕:<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);
}
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 theBox::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.
Converting the raw pointer back into a Box
with Box::from_rawfor 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 p = Box::into_raw(x);
unsafe {
ptr::drop_in_place(p);
dealloc(p as *mut u8, Layout:🆕:<String>());
}
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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 theBox::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.
Converting the raw pointer back into a Box
with Box::from_raw_infor 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:🆕:<String>());
}
🔬 This is a nightly-only experimental API. (allocator_api
#32838)
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.
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.
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]);
🔬 This is a nightly-only experimental API. (box_into_pin
#62370)
Converts a Box<T>
into a Pin<Box<T>>
This conversion does not allocate on the heap and happens in place.
This is also available via From.
Attempt to downcast the box to a concrete type.
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));
🔬 This is a nightly-only experimental API. (downcast_unchecked
#90850)
Downcasts the box to a concrete type.
For a safe alternative see downcast.
#![feature(downcast_unchecked)]
use std::any::Any;
let x: Box<dyn Any> = Box::new(1_usize);
unsafe {
assert_eq!(*x.downcast_unchecked::<usize>(), 1);
}
The contained value must be of type T
. Calling this method with the incorrect type is undefined behavior.
Attempt to downcast the box to a concrete type.
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));
🔬 This is a nightly-only experimental API. (downcast_unchecked
#90850)
Downcasts the box to a concrete type.
For a safe alternative see downcast.
#![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);
}
The contained value must be of type T
. Calling this method with the incorrect type is undefined behavior.
Attempt to downcast the box to a concrete type.
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));
🔬 This is a nightly-only experimental API. (downcast_unchecked
#90850)
Downcasts the box to a concrete type.
For a safe alternative see downcast.
#![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);
}
The contained value must be of type T
. Calling this method with the incorrect type is undefined behavior.
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
Returns the contents of the internal buffer, filling it with more data from the inner reader if it is empty. Read more
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
Read all bytes into buf
until the delimiter byte
or EOF is reached. Read more
Read all bytes until a newline (the 0xA
byte) is reached, and append them to the provided buffer. Read more
🔬 This is a nightly-only experimental API. (buf_read_has_data_left
#86423)
Check if the underlying Read
has any data left to be read. Read more
Returns an iterator over the contents of this reader split on the bytebyte
. Read more
Returns an iterator over the lines of this reader. Read more
Returns a new box with a clone()
of this box’s contents.
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);
Copies source
’s contents into self
without creating a new allocation.
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);
Formats the value using the given formatter. Read more
Returns the “default value” for a type. Read more
Returns the “default value” for a type. Read more
Creates a Box<T>
, with the Default
value for T.
Returns the “default value” for a type. Read more
Returns the “default value” for a type. Read more
The resulting type after dereferencing.
Dereferences the value.
Mutably dereferences the value.
Formats the value using the given formatter. Read more
Removes and returns an element from the end of the iterator. Read more
Returns the n
th element from the end of the iterator. Read more
🔬 This is a nightly-only experimental API. (iter_advance_by
#77404)
Advances the iterator from the back by n
elements. Read more
This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator. Read more
An iterator method that reduces the iterator’s elements to a single, final value, starting from the back. Read more
Searches for an element of an iterator from the back that satisfies a predicate. Read more
Executes the destructor for this type. Read more
👎 Deprecated since 1.42.0:
use the Display impl or to_string()
👎 Deprecated since 1.33.0:
replaced by Error::source, which can support downcasting
The lower-level source of this error, if any. Read more
🔬 This is a nightly-only experimental API. (backtrace
#53487)
Returns a stack backtrace, if available, of where this error occurred. Read more
Returns the exact length of the iterator. Read more
🔬 This is a nightly-only experimental API. (exact_size_is_empty
#35428)
Returns true
if the iterator is empty. Read more
Extends a collection with the contents of an iterator. Read more
🔬 This is a nightly-only experimental API. (extend_one
#72631)
Extends a collection with exactly one element.
🔬 This is a nightly-only experimental API. (extend_one
#72631)
Reserves capacity in a collection for the given number of additional elements. Read more
🔬 This is a nightly-only experimental API. (fn_traits
#29625)
Performs the call operation.
🔬 This is a nightly-only experimental API. (fn_traits
#29625)
Performs the call operation.
The returned type after the call operator is used.
🔬 This is a nightly-only experimental API. (fn_traits
#29625)
Performs the call operation.
Converts a &[T]
into a Box<[T]>
This conversion allocates on the heap and performs a copy of slice
.
// 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);
Creates a boxed Path from a reference.
This will allocate and clone path
to it.
Converts a &str
into a Box<str>
This conversion allocates on the heap and performs a copy of s
.
let boxed: Box<str> = Box::from("hello");
println!("{}", boxed);
Converts a str into a box of dyn Error + Send + Sync.
use std::error::Error;
use std::mem;
let a_str_error = "a str error";
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_str_error);
assert!(
mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
Converts a str into a box of dyn Error.
use std::error::Error;
use std::mem;
let a_str_error = "a str error";
let a_boxed_error = Box::<dyn Error>::from(a_str_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
Converts a [T; N]
into a Box<[T]>
This conversion moves the array to newly heap-allocated memory.
let boxed: Box<[u8]> = Box::from([4, 2]);
println!("{:?}", boxed);
Convert a boxed slice into a vector by transferring ownership of the existing heap allocation.
let b: Box<[i32]> = vec![1, 2, 3].into_boxed_slice();
assert_eq!(Vec::from(b), vec![1, 2, 3]);
Converts a Box<Path>
into a PathBuf
This conversion does not allocate or copy memory.
Converts a Box<T>
into a Pin<Box<T>>
This conversion does not allocate on the heap and happens in place.
Move a boxed object to a new, reference-counted allocation.
let unique: Box<str> = Box::from("eggplant");
let shared: Arc<str> = Arc::from(unique);
assert_eq!("eggplant", &shared[..]);
Move a boxed object to a new, reference counted, allocation.
let original: Box<i32> = Box::new(1);
let shared: Rc<i32> = Rc::from(original);
assert_eq!(1, *shared);
Converts a Box<str>
into a Box<[u8]>
This conversion does not allocate on the heap and happens in place.
// 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);
Converts the given boxed str
slice to a String. It is notable that the str
slice is owned.
Basic usage:
let s1: String = String::from("hello world");
let s2: Box<str> = s1.into_boxed_str();
let s3: String = String::from(s2);
assert_eq!("hello world", s3)
Converts a Cow<'_, [T]>
into a Box<[T]>
When cow
is the Cow::Borrowed
variant, this conversion allocates on the heap and copies the underlying slice. Otherwise, it will try to reuse the ownedVec
’s allocation.
Creates a boxed Path from a clone-on-write pointer.
Converting from a Cow::Owned
does not clone or allocate.
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 ownedString
’s allocation.
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);
Converts a Cow into a box of dyn Error.
use std::error::Error;
use std::mem;
use std::borrow::Cow;
let a_cow_str_error = Cow::from("a str error");
let a_boxed_error = Box::<dyn Error>::from(a_cow_str_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
Converts a Cow into a box of dyn Error + Send + Sync.
use std::error::Error;
use std::mem;
use std::borrow::Cow;
let a_cow_str_error = Cow::from("a str error");
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_cow_str_error);
assert!(
mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
Converts a type of Error into a box of dyn Error.
use std::error::Error;
use std::fmt;
use std::mem;
#[derive(Debug)]
struct AnError;
impl fmt::Display for AnError {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "An error")
}
}
impl Error for AnError {}
let an_error = AnError;
assert!(0 == mem::size_of_val(&an_error));
let a_boxed_error = Box::<dyn Error>::from(an_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
Converts a type of Error + Send + Sync into a box of dyn Error + Send + Sync.
use std::error::Error;
use std::fmt;
use std::mem;
#[derive(Debug)]
struct AnError;
impl fmt::Display for AnError {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "An error")
}
}
impl Error for AnError {}
unsafe impl Send for AnError {}
unsafe impl Sync for AnError {}
let an_error = AnError;
assert!(0 == mem::size_of_val(&an_error));
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(an_error);
assert!(
mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
Converts a PathBuf
into a Box<Path>
This conversion currently should not allocate memory, but this behavior is not guaranteed on all platforms or in all future versions.
Converts the given String to a boxed str
slice that is owned.
Basic usage:
let s1: String = String::from("hello world");
let s2: Box<str> = Box::from(s1);
let s3: String = String::from(s2);
assert_eq!("hello world", s3)
Converts a String into a box of dyn Error + Send + Sync.
use std::error::Error;
use std::mem;
let a_string_error = "a string error".to_string();
let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_string_error);
assert!(
mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))
Converts a String into a box of dyn Error.
use std::error::Error;
use std::mem;
let a_string_error = "a string error".to_string();
let a_boxed_error = Box::<dyn Error>::from(a_string_error);
assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))
Converts a T
into a Box<T>
The conversion allocates on the heap and moves t
from the stack into it.
let x = 5;
let boxed = Box::new(5);
assert_eq!(Box::from(x), boxed);
Convert a vector into a boxed slice.
If v
has excess capacity, its items will be moved into a newly-allocated buffer with exactly the right capacity.
assert_eq!(Box::from(vec![1, 2, 3]), vec![1, 2, 3].into_boxed_slice());
The type of value produced on completion.
Attempt to resolve the future to a final value, registering the current task for wakeup if the value is not yet available. Read more
🔬 This is a nightly-only experimental API. (generator_trait
#43122)
The type of value this generator yields. Read more
🔬 This is a nightly-only experimental API. (generator_trait
#43122)
The type of value this generator returns. Read more
🔬 This is a nightly-only experimental API. (generator_trait
#43122)
Resumes the execution of this generator. Read more
Returns the hash value for the values written so far. Read more
Writes some data into this Hasher
. Read more
Writes a single u8
into this hasher.
Writes a single u16
into this hasher.
Writes a single u32
into this hasher.
Writes a single u64
into this hasher.
Writes a single u128
into this hasher.
Writes a single usize
into this hasher.
Writes a single i8
into this hasher.
Writes a single i16
into this hasher.
Writes a single i32
into this hasher.
Writes a single i64
into this hasher.
Writes a single i128
into this hasher.
Writes a single isize
into this hasher.
The type of the elements being iterated over.
Advances the iterator and returns the next value. Read more
Returns the bounds on the remaining length of the iterator. Read more
Returns the n
th element of the iterator. Read more
Consumes the iterator, returning the last element. Read more
Consumes the iterator, counting the number of iterations and returning it. Read more
🔬 This is a nightly-only experimental API. (iter_advance_by
#77404)
Advances the iterator by n
elements. Read more
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
Takes two iterators and creates a new iterator over both in sequence. Read more
‘Zips up’ two iterators into a single iterator of pairs. Read more
🔬 This is a nightly-only experimental API. (iter_intersperse
#79524)
Creates a new iterator which places a copy of separator
between adjacent items of the original iterator. Read more
🔬 This is a nightly-only experimental API. (iter_intersperse
#79524)
Creates a new iterator which places an item generated by separator
between adjacent items of the original iterator. Read more
Takes a closure and creates an iterator which calls that closure on each element. Read more
Calls a closure on each element of an iterator. Read more
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
Creates an iterator that both filters and maps. Read more
Creates an iterator which gives the current iteration count as well as the next value. Read more
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
Creates an iterator that skips elements based on a predicate. Read more
Creates an iterator that yields elements based on a predicate. Read more
Creates an iterator that both yields elements based on a predicate and maps. Read more
Creates an iterator that skips the first n
elements. Read more
Creates an iterator that yields the first n
elements, or fewer if the underlying iterator ends sooner. Read more
An iterator adapter similar to fold that holds internal state and produces a new iterator. Read more
Creates an iterator that works like map, but flattens nested structure. Read more
Creates an iterator that flattens nested structure. Read more
Creates an iterator which ends after the first None. Read more
Does something with each element of an iterator, passing the value on. Read more
Borrows an iterator, rather than consuming it. Read more
Transforms an iterator into a collection. Read more
Consumes an iterator, creating two collections from it. Read more
🔬 This is a nightly-only experimental API. (iter_partition_in_place
#62543)
Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true
precede all those that return false
. Returns the number of true
elements found. Read more
🔬 This is a nightly-only experimental API. (iter_is_partitioned
#62544)
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
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
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
Folds every element into an accumulator by applying an operation, returning the final result. Read more
Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more
🔬 This is a nightly-only experimental API. (iterator_try_reduce
#87053)
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
Tests if every element of the iterator matches a predicate. Read more
Tests if any element of the iterator matches a predicate. Read more
Searches for an element of an iterator that satisfies a predicate. Read more
Applies function to the elements of iterator and returns the first non-none result. Read more
🔬 This is a nightly-only experimental API. (try_find
#63178)
Applies function to the elements of iterator and returns the first true result or the first error. Read more
Searches for an element in an iterator, returning its index. Read more
Searches for an element in an iterator from the right, returning its index. Read more
Returns the maximum element of an iterator. Read more
Returns the minimum element of an iterator. Read more
Returns the element that gives the maximum value from the specified function. Read more
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
Returns the element that gives the minimum value from the specified function. Read more
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
Reverses an iterator’s direction. Read more
Converts an iterator of pairs into a pair of containers. Read more
Creates an iterator which copies all of its elements. Read more
Creates an iterator which clones all of its elements. Read more
Repeats an iterator endlessly. Read more
Sums the elements of an iterator. Read more
Iterates over the entire iterator, multiplying all the elements Read more
🔬 This is a nightly-only experimental API. (iter_order_by
#64295)
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more
🔬 This is a nightly-only experimental API. (iter_order_by
#64295)
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more
Determines if the elements of this Iterator are equal to those of another. Read more
🔬 This is a nightly-only experimental API. (iter_order_by
#64295)
Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function. Read more
Determines if the elements of this Iterator are unequal to those of another. Read more
🔬 This is a nightly-only experimental API. (is_sorted
#53485)
Checks if the elements of this iterator are sorted. Read more
🔬 This is a nightly-only experimental API. (is_sorted
#53485)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
🔬 This is a nightly-only experimental API. (is_sorted
#53485)
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
Compares and returns the maximum of two values. Read more
Compares and returns the minimum of two values. Read more
Restrict a value to a certain interval. Read more
This method tests for self
and other
values to be equal, and is used by ==
. Read more
This method tests for !=
.
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
Formats the value using the given formatter.
Pull some bytes from this source into the specified buffer, returning how many bytes were read. Read more
🔬 This is a nightly-only experimental API. (read_buf
#78485)
Pull some bytes from this source into the specified buffer. Read more
Like read
, except that it reads into a slice of buffers. Read more
🔬 This is a nightly-only experimental API. (can_vector
#69941)
Determines if this Read
er has an efficient read_vectored
implementation. Read more
Read all bytes until EOF in this source, placing them into buf
. Read more
Read all bytes until EOF in this source, appending them to buf
. Read more
Read the exact number of bytes required to fill buf
. Read more
🔬 This is a nightly-only experimental API. (read_buf
#78485)
Read the exact number of bytes required to fill buf
. Read more
Creates a “by reference” adaptor for this instance of Read
. Read more
Transforms this Read
instance to an Iterator over its bytes. Read more
Creates an adapter which will chain this stream with another. Read more
Creates an adapter which will read at most limit
bytes from it. Read more
Seek to an offset, in bytes, in a stream. Read more
Returns the current seek position from the start of the stream. Read more
Rewind to the beginning of a stream. Read more
🔬 This is a nightly-only experimental API. (seek_stream_len
#59359)
Returns the length of this stream (in bytes). Read more
🔬 This is a nightly-only experimental API. (async_stream
#79024)
The type of items yielded by the stream.
🔬 This is a nightly-only experimental API. (async_stream
#79024)
Attempt to pull out the next value of this stream, registering the current task for wakeup if the value is not yet available, and returningNone
if the stream is exhausted. Read more
🔬 This is a nightly-only experimental API. (async_stream
#79024)
Returns the bounds on the remaining length of the stream. Read more
Attempts to convert a Box<[T]>
into a Box<[T; N]>
.
The conversion occurs in-place and does not require a new memory allocation.
Returns the old Box<[T]>
in the Err
variant ifboxed_slice.len()
does not equal N
.
The type returned in the event of a conversion error.
Write a buffer into this writer, returning how many bytes were written. Read more
Like write, except that it writes from a slice of buffers. Read more
🔬 This is a nightly-only experimental API. (can_vector
#69941)
Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more
Attempts to write an entire buffer into this writer. Read more
Writes a formatted string into this writer, returning any error encountered. Read more
🔬 This is a nightly-only experimental API. (write_all_vectored
#70436)
Attempts to write multiple buffers into this writer. Read more
Creates a “by reference” adapter for this instance of Write
. Read more
impl Any for T where
T: 'static + ?Sized,
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
impl From for T
impl<T, U> Into for T where
U: From,
🔬 This is a nightly-only experimental API. (into_future
#67644)
The output that the future will produce on completion.
🔬 This is a nightly-only experimental API. (into_future
#67644)
Which kind of future are we turning this into?
🔬 This is a nightly-only experimental API. (into_future
#67644)
Creates a future from a value.
The type of the elements being iterated over.
Which kind of iterator are we turning this into?
Creates an iterator from a value. Read more
🔬 This is a nightly-only experimental API. (pattern
#27721)
Associated searcher for this pattern
🔬 This is a nightly-only experimental API. (pattern
#27721)
Constructs the associated searcher fromself
and the haystack
to search in. Read more
🔬 This is a nightly-only experimental API. (pattern
#27721)
Checks whether the pattern matches anywhere in the haystack
🔬 This is a nightly-only experimental API. (pattern
#27721)
Checks whether the pattern matches at the front of the haystack
🔬 This is a nightly-only experimental API. (pattern
#27721)
Removes the pattern from the front of haystack, if it matches.
🔬 This is a nightly-only experimental API. (pattern
#27721)
Checks whether the pattern matches at the back of the haystack
🔬 This is a nightly-only experimental API. (pattern
#27721)
Removes the pattern from the back of haystack, if it matches.
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
🔬 This is a nightly-only experimental API. (toowned_clone_into
#41263)
Uses borrowed data to replace owned data, usually by cloning. Read more
Converts the given value to a String
. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.