Struct otter_api_tests::IndexVec [−]
Expand description
A Vec that only accepts indices of a specific type.
This is a thin wrapper around Vec
, to the point where the backing vec is a
public property (called raw
). This is in part because I know this API is
not a complete mirror of Vec’s (patches welcome). In the worst case, you can
always do what you need to the Vec itself.
Note that this implements Deref/DerefMut to IndexSlice
, and so all the
methods on IndexSlice are available as well. See it’s documentation for some
further information.
The following extensions to the Vec APIs are added (in addition to the ones mentioned in IndexSlice’s documentation):
IndexVec::next_idx
,IndexSlice::last_idx
give the next and most recent index returned bypush
.IndexVec::push
returns the index the item was inserted at.
Fields
raw: Vec<T, Global>
Our wrapped Vec.
Implementations
Construct a IndexVec
from a Vec<T>
.
Panics if it’s length is too large for our index type.
pub fn with_capacity(capacity: usize) -> IndexVec<I, T>
pub fn with_capacity(capacity: usize) -> IndexVec<I, T>
Construct an IndexVec that can hold at least capacity
items before
reallocating. See Vec::with_capacity
.
Similar to self.into_iter().enumerate()
but with indices of I
and
not usize
.
pub fn splice<R, It>(
&mut self,
range: R,
replace_with: It
) -> Splice<'_, <It as IntoIterator>::IntoIter, Global>ⓘ where
R: IdxRangeBounds<I>,
It: IntoIterator<Item = T>,
pub fn splice<R, It>(
&mut self,
range: R,
replace_with: It
) -> Splice<'_, <It as IntoIterator>::IntoIter, Global>ⓘ where
R: IdxRangeBounds<I>,
It: IntoIterator<Item = T>,
Creates a splicing iterator that replaces the specified range in the
vector with the given replace_with
iterator and yields the removed
items. See Vec::splice
Similar to self.drain(r).enumerate()
but with indices of I
and not
usize
.
pub fn next_idx(&self) -> I
pub fn next_idx(&self) -> I
Gives the next index that will be assigned when push
is
called.
Get a the storage as a &[T]
Get a the storage as a &mut [T]
Equivalent to accessing our raw
field, but as a function.
Equivalent to accessing our raw
field mutably, but as a function, if
that’s what you’d prefer.
pub fn push(&mut self, d: T) -> I
pub fn push(&mut self, d: T) -> I
Push a new item onto the vector, and return it’s index.
pub fn into_boxed_slice(self) -> Box<IndexSlice<I, [T]>, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;
pub fn into_boxed_slice(self) -> Box<IndexSlice<I, [T]>, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;
Converts the vector into an owned IdxSlice, dropping excess capacity.
Return an iterator that removes the items from the requested range. See
Vec::drain
.
See also IndexVec::drain_enumerated
, which gives you indices (of the
correct type) as you iterate.
pub fn shrink_to_fit(&mut self)
pub fn shrink_to_fit(&mut self)
Shrinks the capacity of the vector as much as possible.
Shortens the vector, keeping the first len
elements and dropping
the rest. See Vec::truncate
pub fn clear(&mut self)
pub fn clear(&mut self)
Clear our vector. See Vec::clear
.
Reserve capacity for c
more elements. See Vec::reserve
pub fn get<J>(&self, index: J) -> Option<&<J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
pub fn get<J>(&self, index: J) -> Option<&<J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
Get a ref to the item at the provided index, or None for out of bounds.
pub fn get_mut<J>(
&mut self,
index: J
) -> Option<&mut <J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
pub fn get_mut<J>(
&mut self,
index: J
) -> Option<&mut <J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
Get a mut ref to the item at the provided index, or None for out of bounds
Resize ourselves in-place to new_len
. See Vec::resize
.
pub fn resize_with<F>(&mut self, new_len: usize, f: F) where
F: FnMut() -> T,
pub fn resize_with<F>(&mut self, new_len: usize, f: F) where
F: FnMut() -> T,
Resize ourselves in-place to new_len
. See Vec::resize_with
.
Moves all the elements of other
into Self
, leaving other
empty.
See Vec::append
.
Splits the collection into two at the given index. See
Vec::split_off
.
pub fn remove(&mut self, index: I) -> T
pub fn remove(&mut self, index: I) -> T
Remove the item at index
. See Vec::remove
.
pub fn swap_remove(&mut self, index: I) -> T
pub fn swap_remove(&mut self, index: I) -> T
Remove the item at index
without maintaining order. See
Vec::swap_remove
.
pub fn insert(&mut self, index: I, element: T)
pub fn insert(&mut self, index: I, element: T)
Insert an item at index
. See Vec::insert
.
pub fn extend_from_slice(&mut self, other: &IndexSlice<I, [T]>) where
T: Clone,
pub fn extend_from_slice(&mut self, other: &IndexSlice<I, [T]>) where
T: Clone,
Append all items in the slice to the end of our vector.
Forwards to the Vec::retain
implementation.
pub fn dedup_by_key<F, K>(&mut self, key: F) where
K: PartialEq<K>,
F: FnMut(&mut T) -> K,
pub fn dedup_by_key<F, K>(&mut self, key: F) where
K: PartialEq<K>,
F: FnMut(&mut T) -> K,
Forwards to the Vec::dedup_by_key
implementation.
Forwards to the Vec::dedup_by
implementation.
pub fn as_slice(&self) -> &IndexSlice<I, [T]>
pub fn as_slice(&self) -> &IndexSlice<I, [T]>
Get a IndexSlice over this vector. See as_raw_slice
for converting to
a &[T]
(or access self.raw
).
pub fn as_mut_slice(&mut self) -> &mut IndexSlice<I, [T]>
pub fn as_mut_slice(&mut self) -> &mut IndexSlice<I, [T]>
Get a mutable IndexSlice over this vector. See as_raw_slice_mut
for
converting to a &mut [T]
(or access self.raw
).
Methods from Deref<Target = IndexSlice<I, [A]>>
Returns the underlying slice.
Returns the underlying slice.
pub fn as_mut_ptr(&mut self) -> *mut T
pub fn as_mut_ptr(&mut self) -> *mut T
Returns an unsafe mutable pointer to the slice’s buffer.
pub fn last_idx(&self) -> I
pub fn last_idx(&self) -> I
Return the index of the last element, or panic.
pub fn len_idx(&self) -> I
pub fn len_idx(&self) -> I
Returns the length of our slice as an I
.
Get a iterator over reverences to our values.
See also IndexSlice::iter_enumerated
, which gives you indices (of the
correct type) as you iterate.
Get a iterator over mut reverences to our values.
See also IndexSlice::iter_mut_enumerated
, which gives you indices (of
the correct type) as you iterate.
Similar to self.iter().enumerate()
but with indices of I
and not
usize
.
Get an interator over all our indices.
Similar to self.iter_mut().enumerate()
but with indices of I
and not
usize
.
Forwards to the slice’s sort_by
implementation.
pub fn sort_by_key<F, K>(&mut self, f: F) where
K: Ord,
F: FnMut(&T) -> K,
pub fn sort_by_key<F, K>(&mut self, f: F) where
K: Ord,
F: FnMut(&T) -> K,
Forwards to the slice’s sort_by_key
implementation.
pub fn sort_by_cached_key<F, K>(&mut self, f: F) where
K: Ord,
F: FnMut(&T) -> K,
pub fn sort_by_cached_key<F, K>(&mut self, f: F) where
K: Ord,
F: FnMut(&T) -> K,
Forwards to the slice’s sort_by_cached_key
implementation.
pub fn sort_unstable(&mut self) where
T: Ord,
pub fn sort_unstable(&mut self) where
T: Ord,
Forwards to the slice’s sort_unstable
implementation.
pub fn sort_unstable_by<F>(&mut self, compare: F) where
F: FnMut(&T, &T) -> Ordering,
pub fn sort_unstable_by<F>(&mut self, compare: F) where
F: FnMut(&T, &T) -> Ordering,
Forwards to the slice’s sort_unstable_by
implementation.
pub fn sort_unstable_by_key<F, K>(&mut self, f: F) where
K: Ord,
F: FnMut(&T) -> K,
pub fn sort_unstable_by_key<F, K>(&mut self, f: F) where
K: Ord,
F: FnMut(&T) -> K,
Forwards to the slice’s sort_unstable_by_key
implementation.
Forwards to the slice’s ends_with
implementation.
Forwards to the slice’s starts_with
implementation.
Forwards to the slice’s contains
implementation.
pub fn reverse(&mut self)
pub fn reverse(&mut self)
Forwards to the slice’s reverse
implementation.
pub fn binary_search(&self, value: &T) -> Result<I, I> where
T: Ord,
pub fn binary_search(&self, value: &T) -> Result<I, I> where
T: Ord,
Call slice::binary_search
converting the indices it gives us back as
needed.
pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<I, I> where
F: FnMut(&'a T) -> Ordering,
pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<I, I> where
F: FnMut(&'a T) -> Ordering,
Binary searches this sorted vec with a comparator function, converting the indices it gives us back to our Idx type.
pub fn copy_from_slice(&mut self, src: &IndexSlice<I, [T]>) where
T: Copy,
pub fn copy_from_slice(&mut self, src: &IndexSlice<I, [T]>) where
T: Copy,
Copies all elements from src
into self
, using a memcpy.
pub fn clone_from_slice(&mut self, src: &IndexSlice<I, [T]>) where
T: Clone,
pub fn clone_from_slice(&mut self, src: &IndexSlice<I, [T]>) where
T: Clone,
Copies the elements from src
into self
.
pub fn swap_with_slice(&mut self, other: &mut IndexSlice<I, [T]>)
pub fn swap_with_slice(&mut self, other: &mut IndexSlice<I, [T]>)
Swaps all elements in self
with those in other
.
Binary searches this sorted vec with a key extraction function, converting the indices it gives us back to our Idx type.
Searches for an element in an iterator, returning its index. This is
equivalent to Iterator::position
, but returns I
and not usize
.
Searches for an element in an iterator from the right, returning its
index. This is equivalent to Iterator::position
, but returns I
and
not usize
.
pub fn swap(&mut self, a: I, b: I)
pub fn swap(&mut self, a: I, b: I)
Swaps two elements in our vector.
pub fn split_at(&self, a: I) -> (&IndexSlice<I, [T]>, &IndexSlice<I, [T]>)
pub fn split_at(&self, a: I) -> (&IndexSlice<I, [T]>, &IndexSlice<I, [T]>)
Divides our slice into two at an index.
pub fn split_at_mut(
&mut self,
a: I
) -> (&mut IndexSlice<I, [T]>, &mut IndexSlice<I, [T]>)
pub fn split_at_mut(
&mut self,
a: I
) -> (&mut IndexSlice<I, [T]>, &mut IndexSlice<I, [T]>)
Divides our slice into two at an index.
pub fn rotate_left(&mut self, mid: I)
pub fn rotate_left(&mut self, mid: I)
Rotates our data in-place such that the first mid
elements of the
slice move to the end while the last self.len() - mid
elements move to
the front
pub fn rotate_right(&mut self, k: I)
pub fn rotate_right(&mut self, k: I)
Rotates our data in-place such that the first self.len() - k
elements
of the slice move to the end while the last k
elements move to the
front
pub fn copy_within<R>(&mut self, src: R, dst: I) where
T: Copy,
R: IdxRangeBounds<I>,
pub fn copy_within<R>(&mut self, src: R, dst: I) where
T: Copy,
R: IdxRangeBounds<I>,
Copies elements from one part of the slice to another part of itself, using a memmove.
pub fn get<J>(&self, index: J) -> Option<&<J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
pub fn get<J>(&self, index: J) -> Option<&<J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
Get a ref to the item at the provided index, or None for out of bounds.
pub fn get_mut<J>(
&mut self,
index: J
) -> Option<&mut <J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
pub fn get_mut<J>(
&mut self,
index: J
) -> Option<&mut <J as IdxSliceIndex<I, T>>::Output> where
J: IdxSliceIndex<I, T>,
Get a mut ref to the item at the provided index, or None for out of bounds
Wraps the underlying slice’s windows
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s chunks
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s chunks_mut
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s chunks_exact
iterator with one that
yields IndexSlice
s with the correct index type.
Wraps the underlying slice’s chunks_exact_mut
iterator with one that
yields IndexSlice
s with the correct index type.
Wraps the underlying slice’s rchunks
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s rchunks_mut
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s rchunks_exact
iterator with one that
yields IndexSlice
s with the correct index type.
Wraps the underlying slice’s rchunks_exact_mut
iterator with one that
yields IndexSlice
s with the correct index type.
Wraps the underlying slice’s split
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s split_mut
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s rsplit
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s rsplit_mut
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s splitn
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s splitn_mut
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s rsplitn
iterator with one that yields
IndexSlice
s with the correct index type.
Wraps the underlying slice’s rsplitn_mut
iterator with one that yields
IndexSlice
s with the correct index type.
pub fn split_first(&self) -> Option<(&T, &IndexSlice<I, [T]>)>
pub fn split_first(&self) -> Option<(&T, &IndexSlice<I, [T]>)>
Returns the first and all the rest of the elements of the slice, or None
if it is empty.
pub fn split_first_mut(&mut self) -> Option<(&mut T, &mut IndexSlice<I, [T]>)>
pub fn split_first_mut(&mut self) -> Option<(&mut T, &mut IndexSlice<I, [T]>)>
Returns the first and all the rest of the elements of the slice, or None
if it is empty.
pub fn split_last(&self) -> Option<(&T, &IndexSlice<I, [T]>)>
pub fn split_last(&self) -> Option<(&T, &IndexSlice<I, [T]>)>
Returns the last and all the rest of the elements of the slice, or None
if it is empty.
pub fn split_last_mut(&mut self) -> Option<(&mut T, &mut IndexSlice<I, [T]>)>
pub fn split_last_mut(&mut self) -> Option<(&mut T, &mut IndexSlice<I, [T]>)>
Returns the last and all the rest of the elements of the slice, or None
if it is empty.
Trait Implementations
pub fn as_mut(&mut self) -> &mut IndexSlice<I, [A]>
pub fn as_mut(&mut self) -> &mut IndexSlice<I, [A]>
Performs the conversion.
pub fn as_ref(&self) -> &IndexSlice<I, [A]>
pub fn as_ref(&self) -> &IndexSlice<I, [A]>
Performs the conversion.
pub fn borrow(&self) -> &IndexSlice<I, [T]>
pub fn borrow(&self) -> &IndexSlice<I, [T]>
Immutably borrows from an owned value. Read more
pub fn borrow_mut(&mut self) -> &mut IndexSlice<I, [T]>
pub fn borrow_mut(&mut self) -> &mut IndexSlice<I, [T]>
Mutably borrows from an owned value. Read more
type Target = IndexSlice<I, [A]>
type Target = IndexSlice<I, [A]>
The resulting type after dereferencing.
pub fn deref(&self) -> &IndexSlice<I, [A]>
pub fn deref(&self) -> &IndexSlice<I, [A]>
Dereferences the value.
pub fn deref_mut(&mut self) -> &mut IndexSlice<I, [A]>
pub fn deref_mut(&mut self) -> &mut IndexSlice<I, [A]>
Mutably dereferences the value.
impl<'de, I, T> Deserialize<'de> for IndexVec<I, T> where
T: Deserialize<'de>,
I: Idx,
impl<'de, I, T> Deserialize<'de> for IndexVec<I, T> where
T: Deserialize<'de>,
I: Idx,
pub fn deserialize<D>(
deserializer: D
) -> Result<IndexVec<I, T>, <D as Deserializer<'de>>::Error> where
D: Deserializer<'de>,
pub fn deserialize<D>(
deserializer: D
) -> Result<IndexVec<I, T>, <D as Deserializer<'de>>::Error> where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
pub fn extend<J>(&mut self, iter: J) where
J: IntoIterator<Item = &'a T>,
pub fn extend<J>(&mut self, iter: J) where
J: IntoIterator<Item = &'a T>,
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
pub fn extend<J>(&mut self, iter: J) where
J: IntoIterator<Item = T>,
pub fn extend<J>(&mut self, iter: J) where
J: IntoIterator<Item = T>,
Extends a collection with the contents of an iterator. Read more
extend_one
)Extends a collection with exactly one element.
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
pub fn from(src: &'a IndexSlice<I, [T]>) -> IndexVec<I, T>
pub fn from(src: &'a IndexSlice<I, [T]>) -> IndexVec<I, T>
Performs the conversion.
pub fn from(src: &'a mut IndexSlice<I, [T]>) -> IndexVec<I, T>
pub fn from(src: &'a mut IndexSlice<I, [T]>) -> IndexVec<I, T>
Performs the conversion.
pub fn from(src: IndexVec<I, T>) -> Box<IndexSlice<I, [T]>, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;
pub fn from(src: IndexVec<I, T>) -> Box<IndexSlice<I, [T]>, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;
Performs the conversion.
impl<I, T> FromIterator<T> for IndexVec<I, T> where
I: Idx,
impl<I, T> FromIterator<T> for IndexVec<I, T> where
I: Idx,
pub fn from_iter<J>(iter: J) -> IndexVec<I, T> where
J: IntoIterator<Item = T>,
pub fn from_iter<J>(iter: J) -> IndexVec<I, T> where
J: IntoIterator<Item = T>,
Creates a value from an iterator. Read more
impl<'a, I, T> IntoIterator for &'a mut IndexVec<I, T> where
I: Idx,
impl<'a, I, T> IntoIterator for &'a mut IndexVec<I, T> where
I: Idx,
impl<'a, I, T> IntoIterator for &'a IndexVec<I, T> where
I: Idx,
impl<'a, I, T> IntoIterator for &'a IndexVec<I, T> where
I: Idx,
impl<I, T> IntoIterator for IndexVec<I, T> where
I: Idx,
impl<I, T> IntoIterator for IndexVec<I, T> where
I: Idx,
type Item = T
type Item = T
The type of the elements being iterated over.
impl<'a, 'b, A, B, I> PartialEq<&'b mut [B]> for IndexVec<I, A> where
A: PartialEq<B>,
I: Idx,
impl<'a, 'b, A, B, I> PartialEq<&'b mut [B]> for IndexVec<I, A> where
A: PartialEq<B>,
I: Idx,
pub fn eq(&self, other: &&'b mut [B]) -> bool
pub fn eq(&self, other: &&'b mut [B]) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
pub fn ne(&self, other: &&'b mut [B]) -> bool
pub fn ne(&self, other: &&'b mut [B]) -> bool
This method tests for !=
.
impl<I, T> PartialOrd<IndexVec<I, T>> for IndexVec<I, T> where
T: PartialOrd<T>,
I: PartialOrd<I> + Idx,
impl<I, T> PartialOrd<IndexVec<I, T>> for IndexVec<I, T> where
T: PartialOrd<T>,
I: PartialOrd<I> + Idx,
pub fn partial_cmp(&self, other: &IndexVec<I, T>) -> Option<Ordering>
pub fn partial_cmp(&self, other: &IndexVec<I, T>) -> Option<Ordering>
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 (for self
and other
) and is used by the >
operator. Read more
pub fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
S: Serializer,
pub fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<I, T> StructuralEq for IndexVec<I, T> where
I: Idx,
impl<I, T> StructuralPartialEq for IndexVec<I, T> where
I: Idx,
Auto Trait Implementations
impl<I, T> RefUnwindSafe for IndexVec<I, T> where
T: RefUnwindSafe,
impl<I, T> UnwindSafe for IndexVec<I, T> where
T: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
impl<A> DynCastExt for A
impl<A> DynCastExt for A
pub fn dyn_cast<T>(
self
) -> Result<<A as DynCastExtHelper<T>>::Target, <A as DynCastExtHelper<T>>::Source> where
T: ?Sized,
A: DynCastExtHelper<T>,
pub fn dyn_cast<T>(
self
) -> Result<<A as DynCastExtHelper<T>>::Target, <A as DynCastExtHelper<T>>::Source> where
T: ?Sized,
A: DynCastExtHelper<T>,
Use this to cast from one trait object type to another. Read more
pub fn dyn_upcast<T>(self) -> <A as DynCastExtAdvHelper<T, T>>::Target where
T: ?Sized,
A: DynCastExtAdvHelper<T, T, Source = <A as DynCastExtAdvHelper<T, T>>::Target>,
pub fn dyn_upcast<T>(self) -> <A as DynCastExtAdvHelper<T, T>>::Target where
T: ?Sized,
A: DynCastExtAdvHelper<T, T, Source = <A as DynCastExtAdvHelper<T, T>>::Target>,
Use this to upcast a trait to one of its supertraits. Read more
pub fn dyn_cast_adv<F, T>(
self
) -> Result<<A as DynCastExtAdvHelper<F, T>>::Target, <A as DynCastExtAdvHelper<F, T>>::Source> where
T: ?Sized,
A: DynCastExtAdvHelper<F, T>,
F: ?Sized,
pub fn dyn_cast_adv<F, T>(
self
) -> Result<<A as DynCastExtAdvHelper<F, T>>::Target, <A as DynCastExtAdvHelper<F, T>>::Source> where
T: ?Sized,
A: DynCastExtAdvHelper<F, T>,
F: ?Sized,
pub fn dyn_cast_with_config<C>(
self
) -> Result<<A as DynCastExtAdvHelper<<C as DynCastConfig>::Source, <C as DynCastConfig>::Target>>::Target, <A as DynCastExtAdvHelper<<C as DynCastConfig>::Source, <C as DynCastConfig>::Target>>::Source> where
C: DynCastConfig,
A: DynCastExtAdvHelper<<C as DynCastConfig>::Source, <C as DynCastConfig>::Target>,
pub fn dyn_cast_with_config<C>(
self
) -> Result<<A as DynCastExtAdvHelper<<C as DynCastConfig>::Source, <C as DynCastConfig>::Target>>::Target, <A as DynCastExtAdvHelper<<C as DynCastConfig>::Source, <C as DynCastConfig>::Target>>::Source> where
C: DynCastConfig,
A: DynCastExtAdvHelper<<C as DynCastConfig>::Source, <C as DynCastConfig>::Target>,
Use this to cast from one trait object type to another. With this method the type parameter is a config type that uniquely specifies which cast should be preformed. Read more
Compare self to key
and return true
if they are equal.
fn instrument(self, span: Span) -> Instrumented<Self>ⓘNotable traits for Instrumented<T>
impl<T> Future for Instrumented<T> where
T: Future, type Output = <T as Future>::Output;
[src]
fn instrument(self, span: Span) -> Instrumented<Self>ⓘNotable traits for Instrumented<T>
impl<T> Future for Instrumented<T> where
T: Future, type Output = <T as Future>::Output;
[src]Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
fn in_current_span(self) -> Instrumented<Self>ⓘNotable traits for Instrumented<T>
impl<T> Future for Instrumented<T> where
T: Future, type Output = <T as Future>::Output;
[src]
fn in_current_span(self) -> Instrumented<Self>ⓘNotable traits for Instrumented<T>
impl<T> Future for Instrumented<T> where
T: Future, type Output = <T as Future>::Output;
[src]pub fn vzip(self) -> V