1.0.0[−][src]Struct std::boxed::Box
A pointer type for heap allocation.
See the module-level documentation for more.
Methods
impl<T> Box<T>[src]
pub fn new(x: T) -> Box<T>[src]
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);Run
pub fn new_uninit() -> Box<MaybeUninit<T>>[src]
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)Run
pub fn new_zeroed() -> Box<MaybeUninit<T>>[src]
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)Run
pub fn pin(x: T) -> Pin<Box<T>>1.33.0[src]
Constructs a new Pin<Box<T>>. If T does not implement Unpin, then
x will be pinned in memory and unable to be moved.
impl<T> Box<[T]>[src]
pub fn new_uninit_slice(len: usize) -> Box<[MaybeUninit<T>]>[src]
Constructs a new boxed slice with uninitialized contents.
Examples
#![feature(new_uninit)] let mut values = Box::<[u32]>::new_uninit_slice(3); let values = unsafe { // Deferred initialization: values[0].as_mut_ptr().write(1); values[1].as_mut_ptr().write(2); values[2].as_mut_ptr().write(3); values.assume_init() }; assert_eq!(*values, [1, 2, 3])Run
impl<T> Box<MaybeUninit<T>>[src]
pub unsafe fn assume_init(self) -> Box<T>[src]
Converts to Box<T>.
Safety
As with MaybeUninit::assume_init,
it is up to the caller to guarantee that the value
really is in an initialized state.
Calling this when the content is not yet fully initialized
causes immediate undefined behavior.
Examples
#![feature(new_uninit)] let mut five = Box::<u32>::new_uninit(); let five: Box<u32> = unsafe { // Deferred initialization: five.as_mut_ptr().write(5); five.assume_init() }; assert_eq!(*five, 5)Run
impl<T> Box<[MaybeUninit<T>]>[src]
pub unsafe fn assume_init(self) -> Box<[T]>[src]
Converts to Box<[T]>.
Safety
As with MaybeUninit::assume_init,
it is up to the caller to guarantee that the values
really are in an initialized state.
Calling this when the content is not yet fully initialized
causes immediate undefined behavior.
Examples
#![feature(new_uninit)] let mut values = Box::<[u32]>::new_uninit_slice(3); let values = unsafe { // Deferred initialization: values[0].as_mut_ptr().write(1); values[1].as_mut_ptr().write(2); values[2].as_mut_ptr().write(3); values.assume_init() }; assert_eq!(*values, [1, 2, 3])Run
impl<T> Box<T> where
T: ?Sized, [src]
T: ?Sized,
pub unsafe fn from_raw(raw: *mut T) -> Box<T>1.4.0[src]
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.
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) };Run
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; *ptr = 5; let x = Box::from_raw(ptr); }Run
pub fn into_raw(b: Box<T>) -> *mut T1.4.0[src]
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) };Run
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::new::<String>()); }Run
pub fn into_raw_non_null(b: Box<T>) -> NonNull<T>[src]
Consumes the Box, returning the wrapped pointer as NonNull<T>.
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. The
easiest way to do so is to convert the NonNull<T> pointer
into a raw pointer and back into a Box with the Box::from_raw
function.
Note: this is an associated function, which means that you have
to call it as Box::into_raw_non_null(b)
instead of b.into_raw_non_null(). This
is so that there is no conflict with a method on the inner type.
Examples
#![feature(box_into_raw_non_null)] let x = Box::new(5); let ptr = Box::into_raw_non_null(x); // Clean up the memory by converting the NonNull pointer back // into a Box and letting the Box be dropped. let x = unsafe { Box::from_raw(ptr.as_ptr()) };Run
pub fn leak<'a>(b: Box<T>) -> &'a mut T where
T: 'a, 1.26.0[src]
T: '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);Run
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]);Run
pub fn into_pin(boxed: Box<T>) -> Pin<Box<T>>[src]
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.
impl Box<dyn Any + 'static>[src]
pub fn downcast<T>(self) -> Result<Box<T>, Box<dyn Any + 'static>> where
T: Any, [src]
T: Any,
Attempt to downcast the box to a concrete type.
Examples
use std::any::Any; fn print_if_string(value: Box<dyn Any>) { if let Ok(string) = value.downcast::<String>() { println!("String ({}): {}", string.len(), string); } } let my_string = "Hello World".to_string(); print_if_string(Box::new(my_string)); print_if_string(Box::new(0i8));Run
impl Box<dyn Any + 'static + Send>[src]
pub fn downcast<T>(self) -> Result<Box<T>, Box<dyn Any + 'static + Send>> where
T: Any, [src]
T: Any,
Attempt to downcast the box to a concrete type.
Examples
use std::any::Any; fn print_if_string(value: Box<dyn Any + Send>) { if let Ok(string) = value.downcast::<String>() { println!("String ({}): {}", string.len(), string); } } let my_string = "Hello World".to_string(); print_if_string(Box::new(my_string)); print_if_string(Box::new(0i8));Run
Trait Implementations
impl<T> AsMut<T> for Box<T> where
T: ?Sized, 1.5.0[src]
T: ?Sized,
impl<T> AsRef<T> for Box<T> where
T: ?Sized, 1.5.0[src]
T: ?Sized,
impl<T> Borrow<T> for Box<T> where
T: ?Sized, 1.1.0[src]
T: ?Sized,
impl<T> BorrowMut<T> for Box<T> where
T: ?Sized, 1.1.0[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<B: BufRead + ?Sized> BufRead for Box<B>[src]
fn fill_buf(&mut self) -> Result<&[u8]>[src]
fn consume(&mut self, amt: usize)[src]
fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize>[src]
fn read_line(&mut self, buf: &mut String) -> Result<usize>[src]
fn split(self, byte: u8) -> Split<Self> where
Self: Sized, [src]
Self: Sized,
fn lines(self) -> Lines<Self> where
Self: Sized, [src]
Self: Sized,
impl Clone for Box<str>1.3.0[src]
impl<T> Clone for Box<T> where
T: Clone, [src]
T: Clone,
fn clone(&self) -> Box<T>[src]
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);Run
fn clone_from(&mut self, source: &Box<T>)[src]
impl<T> Clone for Box<[T]> where
T: Clone, 1.3.0[src]
T: Clone,
impl Clone for Box<CStr>1.29.0[src]
fn clone(&self) -> Self[src]
fn clone_from(&mut self, source: &Self)[src]
impl Clone for Box<OsStr>1.29.0[src]
fn clone(&self) -> Self[src]
fn clone_from(&mut self, source: &Self)[src]
impl Clone for Box<Path>1.29.0[src]
fn clone(&self) -> Self[src]
fn clone_from(&mut self, source: &Self)[src]
impl<T, U> CoerceUnsized<Box<U>> for Box<T> where
T: Unsize<U> + ?Sized,
U: ?Sized, [src]
T: Unsize<U> + ?Sized,
U: ?Sized,
impl<T> Debug for Box<T> where
T: Debug + ?Sized, [src]
T: Debug + ?Sized,
impl<T> Default for Box<[T]>[src]
impl Default for Box<str>1.17.0[src]
impl<T> Default for Box<T> where
T: Default, [src]
T: Default,
impl Default for Box<CStr>1.17.0[src]
impl Default for Box<OsStr>1.17.0[src]
impl<T> Deref for Box<T> where
T: ?Sized, [src]
T: ?Sized,
impl<T> DerefMut for Box<T> where
T: ?Sized, [src]
T: ?Sized,
impl<T, U> DispatchFromDyn<Box<U>> for Box<T> where
T: Unsize<U> + ?Sized,
U: ?Sized, [src]
T: Unsize<U> + ?Sized,
U: ?Sized,
impl<T> Display for Box<T> where
T: Display + ?Sized, [src]
T: Display + ?Sized,
impl<I> DoubleEndedIterator for Box<I> where
I: DoubleEndedIterator + ?Sized, [src]
I: DoubleEndedIterator + ?Sized,
fn next_back(&mut self) -> Option<<I as Iterator>::Item>[src]
fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>[src]
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>, 1.27.0[src]
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
fn rfold<B, F>(self, accum: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B, 1.27.0[src]
F: FnMut(B, Self::Item) -> B,
fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool, 1.27.0[src]
P: FnMut(&Self::Item) -> bool,
impl<T> Drop for Box<T> where
T: ?Sized, [src]
T: ?Sized,
impl<T> Eq for Box<T> where
T: Eq + ?Sized, [src]
T: Eq + ?Sized,
impl<T: Error> Error for Box<T>1.8.0[src]
fn description(&self) -> &str[src]
fn cause(&self) -> Option<&dyn Error>[src]
fn source(&self) -> Option<&(dyn Error + 'static)>[src]
fn backtrace(&self) -> Option<&Backtrace>[src]
impl<I> ExactSizeIterator for Box<I> where
I: ExactSizeIterator + ?Sized, [src]
I: ExactSizeIterator + ?Sized,
impl<A, F> Fn<A> for Box<F> where
F: Fn<A> + ?Sized, 1.35.0[src]
F: Fn<A> + ?Sized,
impl<A, F> FnMut<A> for Box<F> where
F: FnMut<A> + ?Sized, 1.35.0[src]
F: FnMut<A> + ?Sized,
impl<A, F> FnOnce<A> for Box<F> where
F: FnOnce<A> + ?Sized, 1.35.0[src]
F: FnOnce<A> + ?Sized,
type Output = <F as FnOnce<A>>::Output
The returned type after the call operator is used.
extern "rust-call" fn call_once(self, args: A) -> <Box<F> as FnOnce<A>>::Output[src]
impl<'_, T> From<&'_ [T]> for Box<[T]> where
T: Copy, 1.17.0[src]
T: Copy,
impl<'_> From<&'_ CStr> for Box<CStr>1.17.0[src]
impl<'_> From<&'_ OsStr> for Box<OsStr>1.17.0[src]
impl<'_> From<&'_ Path> for Box<Path>1.17.0[src]
impl<'_> From<&'_ str> for Box<str>1.17.0[src]
impl<'a, '_> From<&'_ str> for Box<dyn Error + Send + Sync + 'a>[src]
impl<'_> From<&'_ str> for Box<dyn Error>1.6.0[src]
impl<T> From<Box<[T]>> for Vec<T>1.18.0[src]
impl From<Box<CStr>> for CString1.18.0[src]
impl From<Box<OsStr>> for OsString1.18.0[src]
impl From<Box<Path>> for PathBuf1.18.0[src]
fn from(boxed: Box<Path>) -> PathBuf[src]
Converts a Box<Path> into a PathBuf
This conversion does not allocate or copy memory.
impl<T> From<Box<T>> for Rc<T> where
T: ?Sized, 1.21.0[src]
T: ?Sized,
impl<T> From<Box<T>> for Arc<T> where
T: ?Sized, 1.21.0[src]
T: ?Sized,
impl<T> From<Box<T>> for Pin<Box<T>> where
T: ?Sized, 1.33.0[src]
T: ?Sized,
fn from(boxed: Box<T>) -> Pin<Box<T>>[src]
Converts a Box<T> into a Pin<Box<T>>
This conversion does not allocate on the heap and happens in place.
impl From<Box<str>> for String1.18.0[src]
impl From<Box<str>> for Box<[u8]>1.19.0[src]
fn from(s: Box<str>) -> Box<[u8]>[src]
Converts a Box<str>> into a Box<[u8]>
This conversion does not allocate on the heap and happens in place.
Examples
// create a Box<str> which will be used to create a Box<[u8]> let boxed: Box<str> = Box::from("hello"); let boxed_str: Box<[u8]> = Box::from(boxed); // create a &[u8] which will be used to create a Box<[u8]> let slice: &[u8] = &[104, 101, 108, 108, 111]; let boxed_slice = Box::from(slice); assert_eq!(boxed_slice, boxed_str);Run
impl From<CString> for Box<CStr>1.20.0[src]
impl<'a> From<Cow<'a, str>> for Box<dyn Error>1.22.0[src]
impl<'a, 'b> From<Cow<'b, str>> for Box<dyn Error + Send + Sync + 'a>1.22.0[src]
fn from(err: Cow<'b, str>) -> Box<dyn Error + Send + Sync + 'a>[src]
Converts a Cow into a box of dyn Error + Send + Sync.
Examples
use std::error::Error; use std::mem; use std::borrow::Cow; let a_cow_str_error = Cow::from("a str error"); let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_cow_str_error); assert!( mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))Run
impl<'a, E: Error + 'a> From<E> for Box<dyn Error + 'a>[src]
fn from(err: E) -> Box<dyn Error + 'a>[src]
Converts a type of Error into a box of dyn Error.
Examples
use std::error::Error; use std::fmt; use std::mem; #[derive(Debug)] struct AnError; impl fmt::Display for AnError { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f , "An error") } } impl Error for AnError {} let an_error = AnError; assert!(0 == mem::size_of_val(&an_error)); let a_boxed_error = Box::<dyn Error>::from(an_error); assert!(mem::size_of::<Box<dyn Error>>() == mem::size_of_val(&a_boxed_error))Run
impl<'a, E: Error + Send + Sync + 'a> From<E> for Box<dyn Error + Send + Sync + 'a>[src]
fn from(err: E) -> Box<dyn Error + Send + Sync + 'a>[src]
Converts a type of Error + Send + Sync into a box of
dyn Error + Send + Sync.
Examples
use std::error::Error; use std::fmt; use std::mem; #[derive(Debug)] struct AnError; impl fmt::Display for AnError { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f , "An error") } } impl Error for AnError {} unsafe impl Send for AnError {} unsafe impl Sync for AnError {} let an_error = AnError; assert!(0 == mem::size_of_val(&an_error)); let a_boxed_error = Box::<dyn Error + Send + Sync>::from(an_error); assert!( mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))Run
impl From<OsString> for Box<OsStr>1.20.0[src]
impl From<PathBuf> for Box<Path>1.20.0[src]
fn from(p: PathBuf) -> Box<Path>[src]
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.
impl From<String> for Box<str>1.20.0[src]
impl From<String> for Box<dyn Error + Send + Sync>[src]
fn from(err: String) -> Box<dyn Error + Send + Sync>[src]
Converts a String into a box of dyn Error + Send + Sync.
Examples
use std::error::Error; use std::mem; let a_string_error = "a string error".to_string(); let a_boxed_error = Box::<dyn Error + Send + Sync>::from(a_string_error); assert!( mem::size_of::<Box<dyn Error + Send + Sync>>() == mem::size_of_val(&a_boxed_error))Run
impl From<String> for Box<dyn Error>1.6.0[src]
impl<T> From<T> for Box<T>1.6.0[src]
impl<T> From<Vec<T>> for Box<[T]>1.20.0[src]
impl<A> FromIterator<A> for Box<[A]>1.32.0[src]
impl<I> FusedIterator for Box<I> where
I: FusedIterator + ?Sized, 1.26.0[src]
I: FusedIterator + ?Sized,
impl<F> Future for Box<F> where
F: Unpin + Future + ?Sized, 1.36.0[src]
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output
The type of value produced on completion.
fn poll(
self: Pin<&mut Box<F>>,
cx: &mut Context
) -> Poll<<Box<F> as Future>::Output>[src]
self: Pin<&mut Box<F>>,
cx: &mut Context
) -> Poll<<Box<F> as Future>::Output>
impl<G, R> Generator<R> for Box<G> where
G: Unpin + Generator<R> + ?Sized, [src]
G: Unpin + Generator<R> + ?Sized,
type Yield = <G as Generator<R>>::Yield
The type of value this generator yields. Read more
type Return = <G as Generator<R>>::Return
The type of value this generator returns. Read more
fn resume(
self: Pin<&mut Box<G>>,
arg: R
) -> GeneratorState<<Box<G> as Generator<R>>::Yield, <Box<G> as Generator<R>>::Return>[src]
self: Pin<&mut Box<G>>,
arg: R
) -> GeneratorState<<Box<G> as Generator<R>>::Yield, <Box<G> as Generator<R>>::Return>
impl<T> Hash for Box<T> where
T: Hash + ?Sized, [src]
T: Hash + ?Sized,
fn hash<H>(&self, state: &mut H) where
H: Hasher, [src]
H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher, 1.3.0[src]
H: Hasher,
impl<T> Hasher for Box<T> where
T: Hasher + ?Sized, 1.22.0[src]
T: Hasher + ?Sized,
fn finish(&self) -> u64[src]
fn write(&mut self, bytes: &[u8])[src]
fn write_u8(&mut self, i: u8)[src]
fn write_u16(&mut self, i: u16)[src]
fn write_u32(&mut self, i: u32)[src]
fn write_u64(&mut self, i: u64)[src]
fn write_u128(&mut self, i: u128)[src]
fn write_usize(&mut self, i: usize)[src]
fn write_i8(&mut self, i: i8)[src]
fn write_i16(&mut self, i: i16)[src]
fn write_i32(&mut self, i: i32)[src]
fn write_i64(&mut self, i: i64)[src]
fn write_i128(&mut self, i: i128)[src]
fn write_isize(&mut self, i: isize)[src]
impl<I> Iterator for Box<I> where
I: Iterator + ?Sized, [src]
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
fn next(&mut self) -> Option<<I as Iterator>::Item>[src]
fn size_hint(&self) -> (usize, Option<usize>)[src]
fn nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>[src]
fn last(self) -> Option<<I as Iterator>::Item>[src]
fn count(self) -> usize[src]
fn step_by(self, step: usize) -> StepBy<Self>1.28.0[src]
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>, [src]
U: IntoIterator<Item = Self::Item>,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator, [src]
U: IntoIterator,
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B, [src]
F: FnMut(Self::Item) -> B,
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item), 1.21.0[src]
F: FnMut(Self::Item),
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool, [src]
P: FnMut(&Self::Item) -> bool,
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>, [src]
F: FnMut(Self::Item) -> Option<B>,
fn enumerate(self) -> Enumerate<Self>[src]
fn peekable(self) -> Peekable<Self>[src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool, [src]
P: FnMut(&Self::Item) -> bool,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool, [src]
P: FnMut(&Self::Item) -> bool,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>, [src]
P: FnMut(Self::Item) -> Option<B>,
fn skip(self, n: usize) -> Skip<Self>[src]
fn take(self, n: usize) -> Take<Self>[src]
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>, [src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator, [src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator, 1.29.0[src]
Self::Item: IntoIterator,
fn fuse(self) -> Fuse<Self>[src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item), [src]
F: FnMut(&Self::Item),
fn by_ref(&mut self) -> &mut Self[src]
#[must_use =
"if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B>(self) -> B where
B: FromIterator<Self::Item>, [src]
B: FromIterator<Self::Item>,
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool, [src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a, [src]
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool, [src]
P: FnMut(Self::Item) -> bool,
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>, 1.27.0[src]
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>, 1.27.0[src]
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B, [src]
F: FnMut(B, Self::Item) -> B,
fn fold_first<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item, [src]
F: FnMut(Self::Item, Self::Item) -> Self::Item,
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool, [src]
F: FnMut(Self::Item) -> bool,
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool, [src]
F: FnMut(Self::Item) -> bool,
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool, [src]
P: FnMut(&Self::Item) -> bool,
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>, 1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
fn try_find<F, E, R>(&mut self, f: F) -> Result<Option<Self::Item>, E> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool, Error = E>, [src]
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool, Error = E>,
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool, [src]
P: FnMut(Self::Item) -> bool,
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator, [src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
fn max(self) -> Option<Self::Item> where
Self::Item: Ord, [src]
Self::Item: Ord,
fn min(self) -> Option<Self::Item> where
Self::Item: Ord, [src]
Self::Item: Ord,
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B, 1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering, 1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B, 1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering, 1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator, [src]
Self: DoubleEndedIterator,
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>, [src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy, 1.36.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone, [src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
fn cycle(self) -> Cycle<Self> where
Self: Clone, [src]
Self: Clone,
fn sum<S>(self) -> S where
S: Sum<Self::Item>, 1.11.0[src]
S: Sum<Self::Item>,
fn product<P>(self) -> P where
P: Product<Self::Item>, 1.11.0[src]
P: Product<Self::Item>,
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord, 1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator, [src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator, [src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator, [src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>, 1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>, [src]
Self::Item: PartialOrd<Self::Item>,
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>, [src]
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>, [src]
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
impl<T> Ord for Box<T> where
T: Ord + ?Sized, [src]
T: Ord + ?Sized,
fn cmp(&self, other: &Box<T>) -> Ordering[src]
#[must_use]fn max(self, other: Self) -> Self1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self[src]
impl<T> PartialEq<Box<T>> for Box<T> where
T: PartialEq<T> + ?Sized, [src]
T: PartialEq<T> + ?Sized,
impl<T> PartialOrd<Box<T>> for Box<T> where
T: PartialOrd<T> + ?Sized, [src]
T: PartialOrd<T> + ?Sized,
fn partial_cmp(&self, other: &Box<T>) -> Option<Ordering>[src]
fn lt(&self, other: &Box<T>) -> bool[src]
fn le(&self, other: &Box<T>) -> bool[src]
fn ge(&self, other: &Box<T>) -> bool[src]
fn gt(&self, other: &Box<T>) -> bool[src]
impl<T> Pointer for Box<T> where
T: ?Sized, [src]
T: ?Sized,
impl<R: Read + ?Sized> Read for Box<R>[src]
fn read(&mut self, buf: &mut [u8]) -> Result<usize>[src]
fn read_vectored(&mut self, bufs: &mut [IoSliceMut]) -> Result<usize>[src]
unsafe fn initializer(&self) -> Initializer[src]
fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize>[src]
fn read_to_string(&mut self, buf: &mut String) -> Result<usize>[src]
fn read_exact(&mut self, buf: &mut [u8]) -> Result<()>[src]
fn by_ref(&mut self) -> &mut Self where
Self: Sized, [src]
Self: Sized,
fn bytes(self) -> Bytes<Self> where
Self: Sized, [src]
Self: Sized,
fn chain<R: Read>(self, next: R) -> Chain<Self, R> where
Self: Sized, [src]
Self: Sized,
fn take(self, limit: u64) -> Take<Self> where
Self: Sized, [src]
Self: Sized,
impl<S: Seek + ?Sized> Seek for Box<S>[src]
fn seek(&mut self, pos: SeekFrom) -> Result<u64>[src]
fn stream_len(&mut self) -> Result<u64>[src]
fn stream_position(&mut self) -> Result<u64>[src]
impl<const N: usize, T> TryFrom<Box<[T]>> for Box<[T; N]> where
[T; N]: LengthAtMost32, 1.43.0[src]
[T; N]: LengthAtMost32,
type Error = Box<[T]>
The type returned in the event of a conversion error.
fn try_from(
boxed_slice: Box<[T]>
) -> Result<Box<[T; N]>, <Box<[T; N]> as TryFrom<Box<[T]>>>::Error>[src]
boxed_slice: Box<[T]>
) -> Result<Box<[T; N]>, <Box<[T; N]> as TryFrom<Box<[T]>>>::Error>
impl<T> Unpin for Box<T> where
T: ?Sized, 1.33.0[src]
T: ?Sized,
impl<W: Write + ?Sized> Write for Box<W>[src]
fn write(&mut self, buf: &[u8]) -> Result<usize>[src]
fn write_vectored(&mut self, bufs: &[IoSlice]) -> Result<usize>[src]
fn flush(&mut self) -> Result<()>[src]
fn write_all(&mut self, buf: &[u8]) -> Result<()>[src]
fn write_fmt(&mut self, fmt: Arguments) -> Result<()>[src]
fn write_all_vectored(&mut self, bufs: &mut [IoSlice]) -> Result<()>[src]
fn by_ref(&mut self) -> &mut Self where
Self: Sized, [src]
Self: Sized,
Auto Trait Implementations
impl<T: ?Sized> RefUnwindSafe for Box<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T: ?Sized> Send for Box<T> where
T: Send,
T: Send,
impl<T: ?Sized> Sync for Box<T> where
T: Sync,
T: Sync,
impl<T: ?Sized> UnwindSafe for Box<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<!> for T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator, [src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I[src]
impl<'a, F> Pattern<'a> for F where
F: FnMut(char) -> bool, [src]
F: FnMut(char) -> bool,
type Searcher = CharPredicateSearcher<'a, F>
🔬 This is a nightly-only experimental API. (pattern #27721)
API not fully fleshed out and ready to be stabilized
Associated searcher for this pattern
fn into_searcher(self, haystack: &'a str) -> CharPredicateSearcher<'a, F>[src]
fn is_contained_in(self, haystack: &'a str) -> bool[src]
fn is_prefix_of(self, haystack: &'a str) -> bool[src]
fn strip_prefix_of(self, haystack: &'a str) -> Option<&'a str>[src]
fn is_suffix_of(self, haystack: &'a str) -> bool where
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>, [src]
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>,
fn strip_suffix_of(self, haystack: &'a str) -> Option<&'a str> where
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>, [src]
CharPredicateSearcher<'a, F>: ReverseSearcher<'a>,
impl<T> ToOwned for T where
T: Clone, [src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T[src]
fn clone_into(&self, target: &mut T)[src]
impl<T> ToString for T where
T: Display + ?Sized, [src]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,