Struct stabby::Dyn

source ·
#[repr(C)]
pub struct Dyn<'a, P, Vt>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,
{ /* private fields */ }
Expand description

A stable trait object (or a stable &mut dyn)

Implementations§

source§

impl<'a, Vt, Alloc> Dyn<'a, Weak<(), Alloc>, Vt>
where Vt: HasDropVt + IStable, Alloc: IAlloc,

source

pub fn upgrade(self) -> Option<Dyn<'a, Arc<(), Alloc>, Vt>>

Attempts to upgrade a weak trait object to a strong one.

source§

impl<'a, P, Vt> Dyn<'a, P, Vt>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source

pub const fn has_optimal_layout() -> bool

Returns true if the layout for Dyn is smaller or equal to that Rust would have generated for it.

source§

impl<'a, P, Vt> Dyn<'a, P, Vt>
where P: IPtrOwned + IPtr, Vt: HasDropVt + 'a,

source

pub fn ptr(&self) -> &P

Access the data pointer immutably.

source

pub fn ptr_mut(&mut self) -> &mut P

Access the data pointer mutably.

source

pub const fn vtable(&self) -> &'a Vt

Access the vtable.

source

pub fn as_ref(&self) -> DynRef<'_, Vt>

Borrow into an ABI-stable &dyn Traits

source

pub fn as_mut(&mut self) -> Dyn<'_, &mut (), Vt>
where P: IPtrMut,

Borrow into an ABI-stable &mut dyn Traits

source

pub fn try_as_mut(&mut self) -> Option<Dyn<'_, &mut (), Vt>>
where P: IPtrTryAsMut,

Attempt to borrow into an ABI-stable &mut dyn Traits

source

pub fn into_super<Super>(self) -> Super
where Dyn<'a, P, Vt>: IntoSuperTrait<Super>,

Allows casting a dyn A + B into dyn A.

Note that you can only remove the outermost (rightmost in dyn syntax) trait at a time, except Send and Sync that may both be kept, or both be removed.

source

pub unsafe fn downcast_ref<T>(&self) -> Option<&T>
where Vt: PartialEq + Copy + IConstConstructor<'a, T>,

Downcasts the reference based on vtable equality.

This implies that this downcast will always yield None when attempting to downcast values constructed accross an FFI.

Note that the compiler may chose to have multiple copies of the vtable, notably in optimized builds. This means that even within a same compile unit, this function may fail to downcast a value even if the type should have matched.

In general, you should prefer Self::stable_downcast_ref

§Safety

This may have false positives if all of the following applies:

  • self was built from &U, within the same FFI-boundary,
  • T and U have identical implementations for all methods of the vtable,
  • the compiler chose to merge these implementations, making T and U share their function pointers.

While all of these factors aligning is unlikely, you should be aware of this if you plan on using methods of T that wouldn’t be valid for U.

source

pub fn stable_downcast_ref<T, Path>(&self) -> Option<&T>

Downcasts the reference based on its reflection report.

source

pub unsafe fn downcast_mut<T>(&mut self) -> Option<&mut T>
where Vt: PartialEq + Copy + IConstConstructor<'a, T>, P: IPtrMut,

Downcasts the mutable reference based on vtable equality.

This implies that this downcast will always yield None when attempting to downcast values constructed accross an FFI.

Note that the compiler may chose to have multiple copies of the vtable, notably in optimized builds. This means that even within a same compile unit, this function may fail to downcast a value even if the type should have matched.

In general, you should prefer Self::stable_downcast_mut

§Safety

This may have false positives if all of the following applies:

  • self was built from &U, within the same FFI-boundary,
  • T and U have identical implementations for all methods of the vtable,
  • the compiler chose to merge these implementations, making T and U share their function pointers.

While all of these factors aligning is unlikely, you should be aware of this if you plan on using methods of T that wouldn’t be valid for U.

source

pub fn stable_downcast_mut<T, Path>(&mut self) -> Option<&mut T>

Downcasts the mutable reference based on its reflection report.

Trait Implementations§

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN> AnyDyn<StabbyTransitiveDerefN> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableAny, StabbyTransitiveDerefN>,

source§

extern "C" fn report(&self) -> &'static TypeReport

An stabby-generated item for Any

source§

extern "C" fn id(&self) -> u64

An stabby-generated item for Any

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O> Call0Dyn<StabbyTransitiveDerefN, O> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall0<O>, StabbyTransitiveDerefN>,

source§

extern "C" fn call(&self) -> O

An stabby-generated item for Call0

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0> Call1Dyn<StabbyTransitiveDerefN, O, I0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall1<O, I0>, StabbyTransitiveDerefN>,

source§

extern "C" fn call(&self, _0: I0) -> O

An stabby-generated item for Call1

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1> Call2Dyn<StabbyTransitiveDerefN, O, I0, I1> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall2<O, I0, I1>, StabbyTransitiveDerefN>,

source§

extern "C" fn call(&self, _0: I0, _1: I1) -> O

An stabby-generated item for Call2

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2> Call3Dyn<StabbyTransitiveDerefN, O, I0, I1, I2> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall3<O, I0, I1, I2>, StabbyTransitiveDerefN>,

source§

extern "C" fn call(&self, _0: I0, _1: I1, _2: I2) -> O

An stabby-generated item for Call3

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3> Call4Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall4<O, I0, I1, I2, I3>, StabbyTransitiveDerefN>,

source§

extern "C" fn call(&self, _0: I0, _1: I1, _2: I2, _3: I3) -> O

An stabby-generated item for Call4

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> Call5Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall5<O, I0, I1, I2, I3, I4>, StabbyTransitiveDerefN>,

source§

extern "C" fn call(&self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4) -> O

An stabby-generated item for Call5

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> Call6Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall6<O, I0, I1, I2, I3, I4, I5>, StabbyTransitiveDerefN>,

source§

extern "C" fn call( &self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5 ) -> O

An stabby-generated item for Call6

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> Call7Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall7<O, I0, I1, I2, I3, I4, I5, I6>, StabbyTransitiveDerefN>,

source§

extern "C" fn call( &self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5, _6: I6 ) -> O

An stabby-generated item for Call7

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> Call8Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall8<O, I0, I1, I2, I3, I4, I5, I6, I7>, StabbyTransitiveDerefN>,

source§

extern "C" fn call( &self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5, _6: I6, _7: I7 ) -> O

An stabby-generated item for Call8

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> Call9Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall9<O, I0, I1, I2, I3, I4, I5, I6, I7, I8>, StabbyTransitiveDerefN>,

source§

extern "C" fn call( &self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5, _6: I6, _7: I7, _8: I8 ) -> O

An stabby-generated item for Call9

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O> CallMut0DynMut<StabbyTransitiveDerefN, O> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut0<O>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut(&mut self) -> O

An stabby-generated item for CallMut0

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0> CallMut1DynMut<StabbyTransitiveDerefN, O, I0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut1<O, I0>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut(&mut self, _0: I0) -> O

An stabby-generated item for CallMut1

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1> CallMut2DynMut<StabbyTransitiveDerefN, O, I0, I1> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut2<O, I0, I1>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut(&mut self, _0: I0, _1: I1) -> O

An stabby-generated item for CallMut2

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2> CallMut3DynMut<StabbyTransitiveDerefN, O, I0, I1, I2> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut3<O, I0, I1, I2>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut(&mut self, _0: I0, _1: I1, _2: I2) -> O

An stabby-generated item for CallMut3

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3> CallMut4DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut4<O, I0, I1, I2, I3>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut(&mut self, _0: I0, _1: I1, _2: I2, _3: I3) -> O

An stabby-generated item for CallMut4

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> CallMut5DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut5<O, I0, I1, I2, I3, I4>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut( &mut self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4 ) -> O

An stabby-generated item for CallMut5

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> CallMut6DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut6<O, I0, I1, I2, I3, I4, I5>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut( &mut self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5 ) -> O

An stabby-generated item for CallMut6

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> CallMut7DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut7<O, I0, I1, I2, I3, I4, I5, I6>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut( &mut self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5, _6: I6 ) -> O

An stabby-generated item for CallMut7

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> CallMut8DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut8<O, I0, I1, I2, I3, I4, I5, I6, I7>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut( &mut self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5, _6: I6, _7: I7 ) -> O

An stabby-generated item for CallMut8

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> CallMut9DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut9<O, I0, I1, I2, I3, I4, I5, I6, I7, I8>, StabbyTransitiveDerefN>,

source§

extern "C" fn call_mut( &mut self, _0: I0, _1: I1, _2: I2, _3: I3, _4: I4, _5: I5, _6: I6, _7: I7, _8: I8 ) -> O

An stabby-generated item for CallMut9

source§

impl<'a, P, Vt> Clone for Dyn<'a, P, Vt>
where P: IPtrOwned + IPtrClone, Vt: HasDropVt + 'a,

source§

fn clone(&self) -> Dyn<'a, P, Vt>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<'a, P, Vt> Drop for Dyn<'a, P, Vt>
where P: IPtrOwned, Vt: HasDropVt,

source§

fn drop(&mut self)

Executes the destructor for this type. Read more
source§

impl<'a, Vt, Alloc> From<&'a Dyn<'a, Arc<(), Alloc>, Vt>> for Dyn<'a, Weak<(), Alloc>, Vt>
where Vt: HasDropVt, Alloc: IAlloc,

source§

fn from(value: &'a Dyn<'a, Arc<(), Alloc>, Vt>) -> Dyn<'a, Weak<(), Alloc>, Vt>

Converts to this type from the input type.
source§

impl<'a, Vt, P> From<P> for Dyn<'a, <P as IntoDyn>::Anonymized, Vt>
where Vt: HasDropVt + Copy + IConstConstructor<'static, <P as IntoDyn>::Target> + 'static, P: IntoDyn + 'a, <P as IntoDyn>::Anonymized: IPtrOwned,

source§

fn from(value: P) -> Dyn<'a, <P as IntoDyn>::Anonymized, Vt>

Converts to this type from the input type.
source§

impl<'a, Vt, P, Output> Future for Dyn<'a, P, VTable<StabbyVtableFuture<Output>, Vt>>

§

type Output = Output

The type of value produced on completion.
source§

fn poll( self: Pin<&mut Dyn<'a, P, VTable<StabbyVtableFuture<Output>, Vt>>>, cx: &mut Context<'_> ) -> Poll<<Dyn<'a, P, VTable<StabbyVtableFuture<Output>, Vt>> as Future>::Output>

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

impl<'a, Vt, P, Output> Future for Dyn<'a, P, VtSend<VTable<StabbyVtableFuture<Output>, Vt>>>

§

type Output = Output

The type of value produced on completion.
source§

fn poll( self: Pin<&mut Dyn<'a, P, VtSend<VTable<StabbyVtableFuture<Output>, Vt>>>>, cx: &mut Context<'_> ) -> Poll<<Dyn<'a, P, VtSend<VTable<StabbyVtableFuture<Output>, Vt>>> as Future>::Output>

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

impl<'a, Vt, P, Output> Future for Dyn<'a, P, VtSend<VtSync<VTable<StabbyVtableFuture<Output>, Vt>>>>

§

type Output = Output

The type of value produced on completion.
source§

fn poll( self: Pin<&mut Dyn<'a, P, VtSend<VtSync<VTable<StabbyVtableFuture<Output>, Vt>>>>>, cx: &mut Context<'_> ) -> Poll<<Dyn<'a, P, VtSend<VtSync<VTable<StabbyVtableFuture<Output>, Vt>>>> as Future>::Output>

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

impl<'a, Vt, P, Output> Future for Dyn<'a, P, VtSync<VTable<StabbyVtableFuture<Output>, Vt>>>

§

type Output = Output

The type of value produced on completion.
source§

fn poll( self: Pin<&mut Dyn<'a, P, VtSync<VTable<StabbyVtableFuture<Output>, Vt>>>>, cx: &mut Context<'_> ) -> Poll<<Dyn<'a, P, VtSync<VTable<StabbyVtableFuture<Output>, Vt>>> as Future>::Output>

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

impl<'a, Vt, P, Output> Future for Dyn<'a, P, VtSync<VtSend<VTable<StabbyVtableFuture<Output>, Vt>>>>

§

type Output = Output

The type of value produced on completion.
source§

fn poll( self: Pin<&mut Dyn<'a, P, VtSync<VtSend<VTable<StabbyVtableFuture<Output>, Vt>>>>>, cx: &mut Context<'_> ) -> Poll<<Dyn<'a, P, VtSync<VtSend<VTable<StabbyVtableFuture<Output>, Vt>>>> as Future>::Output>

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

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, _stabby_unselfed_0> FutureDyn<StabbyTransitiveDerefN, _stabby_unselfed_0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableFuture<_stabby_unselfed_0>, StabbyTransitiveDerefN>, _stabby_unselfed_0: IDeterminantProvider<()>,

§

type Output = _stabby_unselfed_0

An stabby-generated item for Future

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, _stabby_unselfed_0> FutureDynMut<StabbyTransitiveDerefN, _stabby_unselfed_0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableFuture<_stabby_unselfed_0>, StabbyTransitiveDerefN>, _stabby_unselfed_0: IDeterminantProvider<()>,

source§

extern "C" fn poll<'a>( &'a mut self, _0: StableWaker<'a> ) -> Option<<Dyn<'_, StabbyPtrProvider, StabbyVtProvider> as FutureDyn<StabbyTransitiveDerefN, _stabby_unselfed_0>>::Output>

An stabby-generated item for Future

source§

impl<'a, P, Vt> IStable for Dyn<'a, P, Vt>

§

type ForbiddenValues = <Struct<FieldPair<FieldPair<ManuallyDrop<P>, &'static Vt>, PhantomData<&'a P>>> as IStable>::ForbiddenValues

The values that the annotated type cannot occupy.
§

type UnusedBits = <Struct<FieldPair<FieldPair<ManuallyDrop<P>, &'static Vt>, PhantomData<&'a P>>> as IStable>::UnusedBits

The padding bits in the annotated types
§

type Size = <Struct<FieldPair<FieldPair<ManuallyDrop<P>, &'static Vt>, PhantomData<&'a P>>> as IStable>::Size

The size of the annotated type in bytes.
§

type Align = <Struct<FieldPair<FieldPair<ManuallyDrop<P>, &'static Vt>, PhantomData<&'a P>>> as IStable>::Align

The alignment of the annotated type in bytes.
§

type HasExactlyOneNiche = <Struct<FieldPair<FieldPair<ManuallyDrop<P>, &'static Vt>, PhantomData<&'a P>>> as IStable>::HasExactlyOneNiche

Allows the detection of whether or not core::option::Options are stable: Read more
§

type ContainsIndirections = <Struct<FieldPair<FieldPair<ManuallyDrop<P>, &'static Vt>, PhantomData<&'a P>>> as IStable>::ContainsIndirections

Whether or not the type contains indirections (pointers, indices in independent data-structures…)
source§

const REPORT: &'static TypeReport = _

A compile-time generated report of the fields of the type, allowing for compatibility inspection.
source§

const ID: u64 = _

A stable (and ideally unique) identifier for the type. Often generated using crate::report::gen_id, but can be manually set.
source§

fn size() -> usize

Returns the size of the type.
source§

fn align() -> usize

Returns the alignment of the type.
source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN> IStableAllocDynMut<StabbyTransitiveDerefN> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableIStableAlloc, StabbyTransitiveDerefN>,

source§

extern "C" fn alloc(&mut self, _0: Layout) -> *mut ()

An stabby-generated item for IStableAlloc

source§

extern "C" fn free(&mut self, _0: *mut ())

An stabby-generated item for IStableAlloc

source§

extern "C" fn realloc(&mut self, _0: *mut (), _1: Layout) -> *mut ()

An stabby-generated item for IStableAlloc

source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, Tail>> for Dyn<'a, P, VTable<Head, Tail>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VTable<Head, Tail>>) -> Dyn<'a, P, Tail>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, Tail>> for Dyn<'a, P, VtSend<VTable<Head, Tail>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSend<VTable<Head, Tail>>>) -> Dyn<'a, P, Tail>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, Tail>> for Dyn<'a, P, VtSend<VtSync<VTable<Head, Tail>>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super( this: Dyn<'a, P, VtSend<VtSync<VTable<Head, Tail>>>> ) -> Dyn<'a, P, Tail>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, Tail>> for Dyn<'a, P, VtSync<VTable<Head, Tail>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSync<VTable<Head, Tail>>>) -> Dyn<'a, P, Tail>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, Tail>> for Dyn<'a, P, VtSync<VtSend<VTable<Head, Tail>>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super( this: Dyn<'a, P, VtSync<VtSend<VTable<Head, Tail>>>> ) -> Dyn<'a, P, Tail>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Vt> IntoSuperTrait<Dyn<'a, P, Vt>> for Dyn<'a, P, VtSend<Vt>>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSend<Vt>>) -> Dyn<'a, P, Vt>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Vt> IntoSuperTrait<Dyn<'a, P, Vt>> for Dyn<'a, P, VtSend<VtSync<Vt>>>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSend<VtSync<Vt>>>) -> Dyn<'a, P, Vt>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Vt> IntoSuperTrait<Dyn<'a, P, Vt>> for Dyn<'a, P, VtSync<Vt>>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSync<Vt>>) -> Dyn<'a, P, Vt>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Vt> IntoSuperTrait<Dyn<'a, P, Vt>> for Dyn<'a, P, VtSync<VtSend<Vt>>>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSync<VtSend<Vt>>>) -> Dyn<'a, P, Vt>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, VtSend<Tail>>> for Dyn<'a, P, VtSend<VTable<Head, Tail>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super( this: Dyn<'a, P, VtSend<VTable<Head, Tail>>> ) -> Dyn<'a, P, VtSend<Tail>>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Vt> IntoSuperTrait<Dyn<'a, P, VtSend<Vt>>> for Dyn<'a, P, VtSend<VtSync<Vt>>>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSend<VtSync<Vt>>>) -> Dyn<'a, P, VtSend<Vt>>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, VtSend<VtSync<Tail>>>> for Dyn<'a, P, VtSend<VtSync<VTable<Head, Tail>>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super( this: Dyn<'a, P, VtSend<VtSync<VTable<Head, Tail>>>> ) -> Dyn<'a, P, VtSend<VtSync<Tail>>>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, VtSync<Tail>>> for Dyn<'a, P, VtSync<VTable<Head, Tail>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super( this: Dyn<'a, P, VtSync<VTable<Head, Tail>>> ) -> Dyn<'a, P, VtSync<Tail>>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Vt> IntoSuperTrait<Dyn<'a, P, VtSync<Vt>>> for Dyn<'a, P, VtSync<VtSend<Vt>>>
where P: IPtrOwned + 'a, Vt: HasDropVt + 'static,

source§

fn into_super(this: Dyn<'a, P, VtSync<VtSend<Vt>>>) -> Dyn<'a, P, VtSync<Vt>>

Cast dyn A + B into dyn A.
source§

impl<'a, P, Head, Tail> IntoSuperTrait<Dyn<'a, P, VtSync<VtSend<Tail>>>> for Dyn<'a, P, VtSync<VtSend<VTable<Head, Tail>>>>
where P: IPtrOwned + 'a, Tail: HasDropVt + 'static,

source§

fn into_super( this: Dyn<'a, P, VtSync<VtSend<VTable<Head, Tail>>>> ) -> Dyn<'a, P, VtSync<VtSend<Tail>>>

Cast dyn A + B into dyn A.
source§

impl<'a, Vt, P, Output> Iterator for Dyn<'a, P, VTable<StabbyVtableIterator<Output>, Vt>>

§

type Item = Output

The type of the elements being iterated over.
source§

fn next( &mut self ) -> Option<<Dyn<'a, P, VTable<StabbyVtableIterator<Output>, Vt>> as Iterator>::Item>

Advances the iterator and returns the next value. Read more
source§

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

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

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

🔬This is a nightly-only experimental API. (iter_next_chunk)
Advances the iterator and returns an array containing the next N values. Read more
1.0.0 · source§

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

Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 · source§

fn last(self) -> Option<Self::Item>
where Self: Sized,

Consumes the iterator, returning the last element. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_advance_by)
Advances the iterator by n elements. Read more
1.0.0 · source§

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

Returns the nth element of the iterator. Read more
1.28.0 · source§

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

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

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

Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (iter_intersperse)
Creates a new iterator which places an item generated by separator between adjacent items of the original iterator. Read more
1.0.0 · source§

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

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

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

Calls a closure on each element of an iterator. Read more
1.0.0 · source§

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

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

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

Creates an iterator that both filters and maps. Read more
1.0.0 · source§

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

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

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

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

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

Creates an iterator that skips elements based on a predicate. Read more
1.0.0 · source§

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

Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · source§

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

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

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

Creates an iterator that skips the first n elements. Read more
1.0.0 · source§

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

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

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

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

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

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

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

🔬This is a nightly-only experimental API. (iter_map_windows)
Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well. Read more
1.0.0 · source§

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

Creates an iterator which ends after the first None. Read more
1.0.0 · source§

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

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

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

Borrows an iterator, rather than consuming it. Read more
1.0.0 · source§

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

Transforms an iterator into a collection. Read more
source§

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

🔬This is a nightly-only experimental API. (iter_collect_into)
Collects all the items from an iterator into a collection. Read more
1.0.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (iter_is_partitioned)
Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false. Read more
1.27.0 · source§

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

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

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

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

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

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

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

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

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

🔬This is a nightly-only experimental API. (iterator_try_reduce)
Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately. Read more
1.0.0 · source§

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

Tests if every element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Tests if any element of the iterator matches a predicate. Read more
1.0.0 · source§

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

Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (try_find)
Applies function to the elements of iterator and returns the first true result or the first error. Read more
1.0.0 · source§

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

Searches for an element in an iterator, returning its index. Read more
1.6.0 · source§

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

Returns the element that gives the maximum value from the specified function. Read more
1.15.0 · source§

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

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

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

Returns the element that gives the minimum value from the specified function. Read more
1.15.0 · source§

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

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

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

Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · source§

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

Creates an iterator which copies all of its elements. Read more
1.0.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (iter_array_chunks)
Returns an iterator over N elements of the iterator at a time. Read more
1.11.0 · source§

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

Sums the elements of an iterator. Read more
1.11.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more
1.5.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (iter_order_by)
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function. Read more
1.5.0 · source§

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

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

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

🔬This is a nightly-only experimental API. (iter_order_by)
Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function. Read more
1.5.0 · source§

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

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

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

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

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

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

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

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

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

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

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

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given comparator function. Read more
source§

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

🔬This is a nightly-only experimental API. (is_sorted)
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, _stabby_unselfed_0> IteratorDyn<StabbyTransitiveDerefN, _stabby_unselfed_0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableIterator<_stabby_unselfed_0>, StabbyTransitiveDerefN>, _stabby_unselfed_0: IDeterminantProvider<()>,

§

type Item = _stabby_unselfed_0

An stabby-generated item for Iterator

source§

extern "C" fn size_hint(&self) -> Tuple<usize, Option<usize>>

An stabby-generated item for Iterator

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, _stabby_unselfed_0> IteratorDynMut<StabbyTransitiveDerefN, _stabby_unselfed_0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableIterator<_stabby_unselfed_0>, StabbyTransitiveDerefN>, _stabby_unselfed_0: IDeterminantProvider<()>,

source§

extern "C" fn next( &mut self ) -> Option<<Dyn<'_, StabbyPtrProvider, StabbyVtProvider> as IteratorDyn<StabbyTransitiveDerefN, _stabby_unselfed_0>>::Item>

An stabby-generated item for Iterator

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN> AnyDynMut<StabbyTransitiveDerefN> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableAny, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O> Call0DynMut<StabbyTransitiveDerefN, O> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall0<O>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0> Call1DynMut<StabbyTransitiveDerefN, O, I0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall1<O, I0>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1> Call2DynMut<StabbyTransitiveDerefN, O, I0, I1> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall2<O, I0, I1>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2> Call3DynMut<StabbyTransitiveDerefN, O, I0, I1, I2> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall3<O, I0, I1, I2>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3> Call4DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall4<O, I0, I1, I2, I3>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> Call5DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall5<O, I0, I1, I2, I3, I4>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> Call6DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall6<O, I0, I1, I2, I3, I4, I5>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> Call7DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall7<O, I0, I1, I2, I3, I4, I5, I6>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> Call8DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall8<O, I0, I1, I2, I3, I4, I5, I6, I7>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> Call9DynMut<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtrMut, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCall9<O, I0, I1, I2, I3, I4, I5, I6, I7, I8>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O> CallMut0Dyn<StabbyTransitiveDerefN, O> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut0<O>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0> CallMut1Dyn<StabbyTransitiveDerefN, O, I0> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut1<O, I0>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1> CallMut2Dyn<StabbyTransitiveDerefN, O, I0, I1> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut2<O, I0, I1>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2> CallMut3Dyn<StabbyTransitiveDerefN, O, I0, I1, I2> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut3<O, I0, I1, I2>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3> CallMut4Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut4<O, I0, I1, I2, I3>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> CallMut5Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut5<O, I0, I1, I2, I3, I4>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> CallMut6Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut6<O, I0, I1, I2, I3, I4, I5>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> CallMut7Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut7<O, I0, I1, I2, I3, I4, I5, I6>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> CallMut8Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut8<O, I0, I1, I2, I3, I4, I5, I6, I7>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> CallMut9Dyn<StabbyTransitiveDerefN, O, I0, I1, I2, I3, I4, I5, I6, I7, I8> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableCallMut9<O, I0, I1, I2, I3, I4, I5, I6, I7, I8>, StabbyTransitiveDerefN>,

source§

impl<StabbyPtrProvider, StabbyVtProvider, StabbyTransitiveDerefN> IStableAllocDyn<StabbyTransitiveDerefN> for Dyn<'_, StabbyPtrProvider, StabbyVtProvider>
where StabbyPtrProvider: IPtrOwned + IPtr, StabbyVtProvider: HasDropVt + Copy + TransitiveDeref<StabbyVtableIStableAlloc, StabbyTransitiveDerefN>,

source§

impl<'a, P, Vt> Send for Dyn<'a, P, Vt>
where P: IPtrOwned + Send, Vt: HasSendVt + HasDropVt,

source§

impl<'a, P, Vt> Sync for Dyn<'a, P, Vt>
where P: IPtrOwned + Sync, Vt: HasSyncVt + HasDropVt,

Auto Trait Implementations§

§

impl<'a, P, Vt> Freeze for Dyn<'a, P, Vt>
where P: Freeze,

§

impl<'a, P, Vt> RefUnwindSafe for Dyn<'a, P, Vt>

§

impl<'a, P, Vt> Unpin for Dyn<'a, P, Vt>
where P: Unpin,

§

impl<'a, P, Vt> UnwindSafe for Dyn<'a, P, Vt>

Blanket Implementations§

source§

impl<Source> AccessAs for Source

source§

fn ref_as<T>(&self) -> <Source as IGuardRef<T>>::Guard<'_>
where Source: IGuardRef<T>, T: ?Sized,

Provides immutable access to a type as if it were its ABI-unstable equivalent.
source§

fn mut_as<T>(&mut self) -> <Source as IGuardMut<T>>::GuardMut<'_>
where Source: IGuardMut<T>, T: ?Sized,

Provides mutable access to a type as if it were its ABI-unstable equivalent.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Any for T
where T: IStable,

source§

extern "C" fn report(&self) -> &'static TypeReport

The report of the type.
source§

extern "C" fn id(&self) -> u64

The id of the type.
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Future for T

§

type Output = <T as Future>::Output

The output type of the future.
source§

extern "C" fn poll( &mut self, waker: StableWaker<'_> ) -> Option<<T as Future>::Output>

source§

impl<T> IAlloc for T

source§

fn alloc(&mut self, layout: Layout) -> *mut ()

Allocates at least as much memory as requested by layout, ensuring the requested alignment is respected. Read more
source§

unsafe fn free(&mut self, ptr: *mut ())

Frees the allocation Read more
source§

unsafe fn realloc(&mut self, ptr: *mut (), new_layout: Layout) -> *mut ()

Reallocates ptr, ensuring that it has enough memory for the newly requested layout. Read more
source§

impl<T, As> IGuardMut<As> for T
where T: Into<As>, As: Into<T>,

§

type GuardMut<'a> = MutAs<'a, T, As> where T: 'a

The type of the guard which will clean up the temporary after applying its changes to the original.
source§

fn guard_mut_inner(&mut self) -> <T as IGuardMut<As>>::GuardMut<'_>

Construct the temporary and guard it through a mutable reference.
source§

impl<T, As> IGuardRef<As> for T
where T: Into<As>, As: Into<T>,

§

type Guard<'a> = RefAs<'a, T, As> where T: 'a

The type of the guard which will clean up the temporary.
source§

fn guard_ref_inner(&self) -> <T as IGuardRef<As>>::Guard<'_>

Construct the temporary and guard it through an immutable reference.
source§

impl<T> IStableAlloc for T
where T: IAlloc,

source§

extern "C" fn alloc(&mut self, layout: Layout) -> *mut ()

Allocates at least as much memory as requested by layout, ensuring the requested alignment is respected. Read more
source§

extern "C" fn free(&mut self, ptr: *mut ())

Frees the allocation Read more
source§

extern "C" fn realloc( &mut self, ptr: *mut (), layout: Layout ) -> *mut ()

Reallocates ptr, ensuring that it has enough memory for the newly requested layout. Read more
source§

impl<T> Includes<End> for T

§

type Output = End

The result
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<F> IntoFuture for F
where F: Future,

§

type Output = <F as Future>::Output

The output that the future will produce on completion.
§

type IntoFuture = F

Which kind of future are we turning this into?
source§

fn into_future(self) -> <F as IntoFuture>::IntoFuture

Creates a future from a value. Read more
source§

impl<I> IntoIterator for I
where 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?
const: unstable · source§

fn into_iter(self) -> I

Creates an iterator from a value. Read more
source§

impl<T> Iterator for T

§

type Item = <T as Iterator>::Item

The type of the elements of the iterator.
source§

extern "C" fn next(&mut self) -> Option<<T as Iterator>::Item>

Returns the next element in the iterator if it exists.
source§

extern "C" fn size_hint(&self) -> Tuple<usize, Option<usize>>

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.