Struct VTable

#[repr(C)]
pub struct VTable<Head, Tail = VtDrop> {
    pub tail: Tail,
    pub head: Head,
}

A recursive type to define sets of v-tables. You should always use stabby::vtable!(Trait1 + Trait2 + ...) to generate this type, as this macro will ensure that traits are ordered consistently in the vtable.

Fields

tail: Tail

The rest of the vtable.

It comes first to allow upcasting vtables.

head: Head

The head of the vtable (the last trait listed in the macros)

Implementations

impl<Head, Tail> VTable<Head, Tail>

where Struct<FieldPair<Tail, Head>>: IStable, Head: IStable, Tail: IStable,

pub const fn has_optimal_layout() -> bool

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

Trait Implementations

impl<Head: Clone, Tail: Clone> Clone for VTable<Head, Tail>

fn clone(&self) -> VTable<Head, Tail>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Head: Debug, Tail: Debug> Debug for VTable<Head, Tail>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Head, Tail> From<VtSend<VTable<Head, Tail>>> for VTable<Head, Tail>

fn from(value: VtSend<VTable<Head, Tail>>) -> Self

Converts to this type from the input type.

impl<Head, Tail> From<VtSync<VTable<Head, Tail>>> for VTable<Head, Tail>

fn from(value: VtSync<VTable<Head, Tail>>) -> Self

Converts to this type from the input type.

impl<Head, Tail> From<VtSync<VtSend<VTable<Head, Tail>>>> for VTable<Head, Tail>

fn from(value: VtSync<VtSend<VTable<Head, Tail>>>) -> Self

Converts to this type from the input type.

impl<Head, Tail: HasDropVt> HasDropVt for VTable<Head, Tail>

fn drop_vt(&self) -> &VtDrop

Access the VtDrop section of a vtable.

impl<Head: Hash, Tail: Hash> Hash for VTable<Head, Tail>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T, Head, Tail> IConstConstructor<'a, T> for VTable<Head, Tail>

where Head: IConstConstructor<'a, T> + Copy + 'a, Tail: IConstConstructor<'a, T> + Copy + 'a,

const VTABLE: VTable<Head, Tail>

The vtable.

const VTABLE_REF: &'a Self = _

A reference to the vtable

fn vtable() -> &'a Self

Returns the reference to the vtable

impl<Head, Tail> IStable for VTable<Head, Tail>

where Struct<FieldPair<Tail, Head>>: IStable, Head: IStable, Tail: IStable,

const REPORT: &'static TypeReport

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

const ID: u64

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

type ForbiddenValues = <Struct<FieldPair<Tail, Head>> as IStable>::ForbiddenValues

The values that the annotated type cannot occupy.

type UnusedBits = <Struct<FieldPair<Tail, Head>> as IStable>::UnusedBits

The padding bits in the annotated types

type Size = <Struct<FieldPair<Tail, Head>> as IStable>::Size

The size of the annotated type in bytes.

type Align = <Struct<FieldPair<Tail, Head>> as IStable>::Align

The alignment of the annotated type in bytes.

type HasExactlyOneNiche = <Struct<FieldPair<Tail, Head>> as IStable>::HasExactlyOneNiche

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

type ContainsIndirections = <Struct<FieldPair<Tail, Head>> as IStable>::ContainsIndirections

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

fn size() -> usize

Returns the size of the type.

fn align() -> usize

Returns the alignment of the type.

unsafe fn is_invalid(ptr: *const u8) -> bool

Returns true if ptr points to memory that cannot be a valid value of Self.

impl<Head: PartialEq, Tail: PartialEq> PartialEq for VTable<Head, Tail>

fn eq(&self, other: &VTable<Head, Tail>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Head, Tail> TransitiveDeref<Head, H> for VTable<Head, Tail>

fn tderef(&self) -> &Head

Deref transitiverly.

impl<Head, Tail: TransitiveDeref<Vt, N>, Vt, N> TransitiveDeref<Vt, T<N>> for VTable<Head, Tail>

fn tderef(&self) -> &Vt

Deref transitiverly.

impl<Head: Copy, Tail: Copy> Copy for VTable<Head, Tail>

impl<Head: Eq, Tail: Eq> Eq for VTable<Head, Tail>

impl<Head, Tail: HasSyncVt> HasSendVt for VTable<Head, Tail>

impl<Head, Tail: HasSyncVt> HasSyncVt for VTable<Head, Tail>

impl<Head, Tail> StructuralPartialEq for VTable<Head, Tail>