[−][src]Struct bumpalo::boxed::Box
An owned pointer to a bump-allocated T
value, that runs Drop
implementations.
See the module-level documentation for more details.
Implementations
impl<'a, T> Box<'a, T>
[src]
pub fn new_in(x: T, a: &'a Bump) -> Box<'a, T>ⓘ
[src]
Allocates memory on the heap and then places x
into it.
This doesn't actually allocate if T
is zero-sized.
Examples
use bumpalo::{Bump, boxed::Box}; let b = Bump::new(); let five = Box::new_in(5, &b);
pub fn pin_in(x: T, a: &'a Bump) -> Pin<Box<'a, T>>
[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<'a, T: ?Sized> Box<'a, T>
[src]
pub unsafe fn from_raw(raw: *mut T) -> Self
[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
:
use bumpalo::{Bump, boxed::Box}; let b = Bump::new(); let x = Box::new_in(5, &b); let ptr = Box::into_raw(x); let x = unsafe { Box::from_raw(ptr) }; // Note that new `x`'s lifetime is unbound. It must be bound to the `b` immutable borrow before `b` is reset.
Manually create a Box
from scratch by using the bump allocator:
use std::alloc::{alloc, Layout}; use bumpalo::{Bump, boxed::Box}; let b = Bump::new(); unsafe { let ptr = b.alloc_layout(Layout::new::<i32>()).as_ptr() as *mut i32; *ptr = 5; let x = Box::from_raw(ptr); // Note that `x`'s lifetime is unbound. It must be bound to the `b` immutable borrow before `b` is reset. }
pub fn into_raw(b: Box<'a, T>) -> *mut T
[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
value previously managed by the Box
. In particular, the
caller should properly destroy T
. 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:
use bumpalo::{Bump, boxed::Box}; let b = Bump::new(); let x = Box::new_in(String::from("Hello"), &b); let ptr = Box::into_raw(x); let x = unsafe { Box::from_raw(ptr) }; // Note that new `x`'s lifetime is unbound. It must be bound to the `b` immutable borrow before `b` is reset.
Manual cleanup by explicitly running the destructor:
use std::ptr; use bumpalo::{Bump, boxed::Box}; let b = Bump::new(); let mut x = Box::new_in(String::from("Hello"), &b); let p = Box::into_raw(x); unsafe { ptr::drop_in_place(p); }
pub fn leak(b: Box<'a, T>) -> &'a mut T
[src]
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:
use bumpalo::{Bump, boxed::Box}; let b = Bump::new(); let x = Box::new_in(41, &b); let reference: &mut usize = Box::leak(x); *reference += 1; assert_eq!(*reference, 42);
use bumpalo::{Bump, boxed::Box, vec}; let b = Bump::new(); let x = vec![in &b; 1, 2, 3].into_boxed_slice(); let reference = Box::leak(x); reference[0] = 4; assert_eq!(*reference, [4, 2, 3]);
impl<'a> Box<'a, dyn Any>
[src]
pub fn downcast<T: Any>(self) -> Result<Box<'a, T>, Box<'a, dyn Any>>
[src]
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));
impl<'a> Box<'a, dyn Any + Send>
[src]
pub fn downcast<T: Any>(self) -> Result<Box<'a, T>, Box<'a, dyn Any + Send>>
[src]
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));
impl<'a, A> Box<'a, [A]>
[src]
pub fn from_iter_in<T: IntoIterator<Item = A>>(iter: T, a: &'a Bump) -> Self
[src]
Creates a value from an iterator.
This method is adapted version of FromIterator::from_iter
.
It cannot be made as that trait implementation given different signature.
Examples
Basic usage:
use bumpalo::{Bump, boxed::Box, vec}; let b = Bump::new(); let five_fives = std::iter::repeat(5).take(5); let slice = Box::from_iter_in(five_fives, &b); assert_eq!(vec![in &b; 5, 5, 5, 5, 5], &*slice);
Trait Implementations
impl<'a, T: ?Sized> AsMut<T> for Box<'a, T>
[src]
impl<'a, T: ?Sized> AsRef<T> for Box<'a, T>
[src]
impl<'a, T: ?Sized> Borrow<T> for Box<'a, T>
[src]
impl<'a, T: ?Sized> BorrowMut<T> for Box<'a, T>
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<'a, T: Debug + ?Sized> Debug for Box<'a, T>
[src]
impl<'a, T> Default for Box<'a, [T]>
[src]
impl<'a> Default for Box<'a, str>
[src]
impl<'a, T: ?Sized> Deref for Box<'a, T>
[src]
impl<'a, T: ?Sized> DerefMut for Box<'a, T>
[src]
impl<'a, T: Display + ?Sized> Display for Box<'a, T>
[src]
impl<'a, I: DoubleEndedIterator + ?Sized> DoubleEndedIterator for Box<'a, I>
[src]
pub fn next_back(&mut self) -> Option<I::Item>
[src]
pub fn nth_back(&mut self, n: usize) -> Option<I::Item>
[src]
pub fn advance_back_by(&mut self, n: usize) -> Result<(), usize>
[src]
pub 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>,
pub fn rfold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.27.0[src]
F: FnMut(B, Self::Item) -> B,
pub 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<'a, T: ?Sized> Drop for Box<'a, T>
[src]
impl<'a, T: ?Sized + Eq> Eq for Box<'a, T>
[src]
impl<'a, I: ExactSizeIterator + ?Sized> ExactSizeIterator for Box<'a, I>
[src]
impl<'a, T> From<Box<'a, [T; 0]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 1]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 10]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 11]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 12]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 13]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 14]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 15]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 16]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 17]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 18]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 19]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 2]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 20]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 21]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 22]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 23]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 24]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 25]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 26]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 27]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 28]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 29]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 3]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 30]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 31]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 32]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 4]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 5]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 6]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 7]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 8]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'a, T> From<Box<'a, [T; 9]>> for Box<'a, [T]>
[src]
This impl replaces unsize coersion.
impl<'bump, T: 'bump> From<Vec<'bump, T>> for Box<'bump, [T]>
[src]
impl<'a, I: FusedIterator + ?Sized> FusedIterator for Box<'a, I>
[src]
impl<'a, F: ?Sized + Future + Unpin> Future for Box<'a, F>
[src]
type Output = F::Output
The type of value produced on completion.
pub fn poll(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>
) -> Poll<Self::Output>
[src]
mut self: Pin<&mut Self>,
cx: &mut Context<'_>
) -> Poll<Self::Output>
impl<'a, T: ?Sized + Hash> Hash for Box<'a, T>
[src]
pub fn hash<H: Hasher>(&self, state: &mut H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<'a, T: ?Sized + Hasher> Hasher for Box<'a, T>
[src]
pub fn finish(&self) -> u64
[src]
pub fn write(&mut self, bytes: &[u8])
[src]
pub fn write_u8(&mut self, i: u8)
[src]
pub fn write_u16(&mut self, i: u16)
[src]
pub fn write_u32(&mut self, i: u32)
[src]
pub fn write_u64(&mut self, i: u64)
[src]
pub fn write_u128(&mut self, i: u128)
[src]
pub fn write_usize(&mut self, i: usize)
[src]
pub fn write_i8(&mut self, i: i8)
[src]
pub fn write_i16(&mut self, i: i16)
[src]
pub fn write_i32(&mut self, i: i32)
[src]
pub fn write_i64(&mut self, i: i64)
[src]
pub fn write_i128(&mut self, i: i128)
[src]
pub fn write_isize(&mut self, i: isize)
[src]
impl<'a, I: Iterator + ?Sized> Iterator for Box<'a, I>
[src]
type Item = I::Item
The type of the elements being iterated over.
pub fn next(&mut self) -> Option<I::Item>
[src]
pub fn size_hint(&self) -> (usize, Option<usize>)
[src]
pub fn nth(&mut self, n: usize) -> Option<I::Item>
[src]
pub fn last(self) -> Option<I::Item>
[src]
pub fn count(self) -> usize
1.0.0[src]
pub fn advance_by(&mut self, n: usize) -> Result<(), usize>
[src]
pub fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
pub fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
pub fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
pub fn intersperse(self, separator: Self::Item) -> Intersperse<Self> where
Self::Item: Clone,
[src]
Self::Item: Clone,
pub fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> where
G: FnMut() -> Self::Item,
[src]
G: FnMut() -> Self::Item,
pub fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
pub fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
pub fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
pub fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
pub fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
pub fn peekable(self) -> Peekable<Self>
1.0.0[src]
pub fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
pub fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
pub 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>,
pub fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
pub fn take(self, n: usize) -> Take<Self>
1.0.0[src]
pub fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
pub fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
pub fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
pub fn fuse(self) -> Fuse<Self>
1.0.0[src]
pub fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
pub fn by_ref(&mut self) -> &mut Self
1.0.0[src]
#[must_use =
"if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]pub fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
B: FromIterator<Self::Item>,
pub fn partition<B, F>(self, f: F) -> (B, B) where
F: FnMut(&Self::Item) -> bool,
B: Default + Extend<Self::Item>,
1.0.0[src]
F: FnMut(&Self::Item) -> bool,
B: Default + Extend<Self::Item>,
pub fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
P: FnMut(&T) -> bool,
[src]
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
P: FnMut(&T) -> bool,
pub fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
[src]
P: FnMut(Self::Item) -> bool,
pub 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>,
pub 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 = ()>,
pub fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
pub 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,
pub fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
pub fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
pub fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
pub 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>,
pub fn try_find<F, R>(
&mut self,
f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool>,
[src]
&mut self,
f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool>,
pub fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
pub fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
Self: ExactSizeIterator + DoubleEndedIterator,
P: FnMut(Self::Item) -> bool,
1.0.0[src]
Self: ExactSizeIterator + DoubleEndedIterator,
P: FnMut(Self::Item) -> bool,
pub fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
pub fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
pub fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
F: FnMut(&Self::Item) -> B,
B: Ord,
1.6.0[src]
F: FnMut(&Self::Item) -> B,
B: Ord,
pub 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,
pub fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
F: FnMut(&Self::Item) -> B,
B: Ord,
1.6.0[src]
F: FnMut(&Self::Item) -> B,
B: Ord,
pub 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,
pub fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
pub fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
Self: Iterator<Item = (A, B)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
1.0.0[src]
Self: Iterator<Item = (A, B)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
pub 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,
pub fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
pub fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
pub fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
pub fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
pub 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,
pub 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,
pub 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>,
pub 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,
pub 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>,
pub 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,
pub 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>,
pub 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>,
pub 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>,
pub 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>,
pub 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>,
pub fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
pub 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>,
pub 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<'a, T: ?Sized + Ord> Ord for Box<'a, T>
[src]
pub fn cmp(&self, other: &Box<'a, T>) -> Ordering
[src]
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl<'a, 'b, T: ?Sized + PartialEq> PartialEq<Box<'b, T>> for Box<'a, T>
[src]
impl<'a, 'b, T: ?Sized + PartialOrd> PartialOrd<Box<'b, T>> for Box<'a, T>
[src]
pub fn partial_cmp(&self, other: &Box<'b, T>) -> Option<Ordering>
[src]
pub fn lt(&self, other: &Box<'b, T>) -> bool
[src]
pub fn le(&self, other: &Box<'b, T>) -> bool
[src]
pub fn ge(&self, other: &Box<'b, T>) -> bool
[src]
pub fn gt(&self, other: &Box<'b, T>) -> bool
[src]
impl<'a, T: ?Sized> Pointer for Box<'a, T>
[src]
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 0]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 0]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 0]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 1]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 1]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 1]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 10]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 10]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 10]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 11]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 11]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 11]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 12]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 12]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 12]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 13]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 13]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 13]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 14]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 14]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 14]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 15]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 15]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 15]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 16]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 16]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 16]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 17]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 17]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 17]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 18]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 18]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 18]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 19]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 19]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 19]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 2]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 2]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 2]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 20]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 20]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 20]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 21]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 21]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 21]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 22]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 22]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 22]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 23]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 23]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 23]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 24]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 24]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 24]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 25]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 25]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 25]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 26]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 26]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 26]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 27]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 27]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 27]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 28]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 28]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 28]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 29]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 29]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 29]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 3]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 3]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 3]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 30]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 30]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 30]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 31]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 31]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 31]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 32]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 32]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 32]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 4]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 4]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 4]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 5]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 5]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 5]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 6]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 6]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 6]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 7]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 7]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 7]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 8]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 8]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 8]>, Box<'a, [T]>>
impl<'a, T> TryFrom<Box<'a, [T]>> for Box<'a, [T; 9]>
[src]
This impl replaces unsize coersion.
type Error = Box<'a, [T]>
The type returned in the event of a conversion error.
pub fn try_from(
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 9]>, Box<'a, [T]>>
[src]
mut slice: Box<'a, [T]>
) -> Result<Box<'a, [T; 9]>, Box<'a, [T]>>
impl<'a, T: ?Sized> Unpin for Box<'a, T>
[src]
Auto Trait Implementations
impl<'a, T: ?Sized> Send for Box<'a, T> where
T: Send,
[src]
T: Send,
impl<'a, T: ?Sized> Sync for Box<'a, T> where
T: Sync,
[src]
T: Sync,
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,
pub fn borrow_mut(&mut self) -> &mut 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<F> IntoFuture for F where
F: Future,
[src]
F: Future,
type Output = <F as Future>::Output
into_future
)The output that the future will produce on completion.
type Future = F
into_future
)Which kind of future are we turning this into?
pub fn into_future(self) -> <F as IntoFuture>::Future
[src]
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?
pub fn into_iter(self) -> I
[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.
pub 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>,